Cartan matrix¶

A (symmetrizable) generalized Cartan matrix is a square matrix A = (a_{ij}) with integer entries such that.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8349
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Lie Theory → Mathematics

Core Idea¶

Cartan matrix is treated here as the recurring mathematics, logic, and statistics identity summarized by this source-grounded definition: A (symmetrizable) generalized Cartan matrix is a square matrix A = (a{ij}) with integer entries such that. In mathematics, the term Cartan matrix has three meanings. All of these are named after the French mathematician Élie Cartan. Amusingly, the Cartan matrices in the context of Lie algebras were first investigated by Wilhelm Killing, whereas the Killing form is due to Cartan.

How would you explain it like I'm…

No faithful explanation at this level. Two of three generators judged it N/A: without Lie algebras or root systems, a five-year-old version reduces to 'a grid of numbers' or 'a picture of symmetry', which either says nothing about the concept or wrongly suggests every Cartan matrix is a symmetry picture.

The Symmetry Code Table

A Cartan matrix is a square grid of whole numbers used in the math of symmetry. Certain very important symmetry systems, called Lie algebras, are built from a few basic pieces, and the Cartan matrix records how each piece relates to each other piece. Although it is named after the French mathematician Élie Cartan, another mathematician, Wilhelm Killing, studied these grids first. Mathematicians sort Cartan matrices into kinds (finite, affine and indefinite) by checking some special numbers computed from the grid.

Generalized Cartan Matrix

In mathematics, 'Cartan matrix' can mean three different things, all named after Élie Cartan; the main one comes from Lie algebras, which describe continuous symmetries. The Cartan matrix of a simple Lie algebra records the scalar products between its basic building blocks, the simple roots, in a square matrix of integers. A generalized Cartan matrix is an integer square matrix satisfying rules modeled on that case, and it is called symmetrizable if it can be turned into a symmetric matrix by scaling its rows by positive numbers. Such a matrix is of finite type if all of its principal minors (determinants of square pieces along the diagonal) are positive, affine type if all proper principal minors are positive and its determinant is 0, and indefinite type otherwise. Oddly, Wilhelm Killing studied these matrices first, while the 'Killing form' was actually introduced by Cartan.

The term Cartan matrix has three meanings in mathematics, all named after Élie Cartan; the central one arises in Lie theory. The Cartan matrix of a simple Lie algebra is the integer matrix whose entries are built from scalar products of simple roots, encoding how those roots are arranged. Abstracting from this, a generalized Cartan matrix is a square integer matrix A = (a_ij) satisfying the standard axioms: diagonal entries equal 2, off-diagonal entries are nonpositive, and a_ij = 0 exactly when a_ji = 0. It is symmetrizable when DA is symmetric for some diagonal matrix D with positive entries. Generalized Cartan matrices are classified by their principal minors: finite type if all principal minors are positive, affine type if all proper principal minors are positive and det A = 0, and indefinite type otherwise. Historically, Wilhelm Killing first investigated these matrices, whereas the Killing form is due to Cartan. The concept is identified by these integer-matrix conditions, not merely by appearing in a Lie-theory context.

Scope of Application¶

Lie algebras. A (symmetrizable) generalized Cartan matrix is a square matrix A = (a{ij}) with integer entries such that.
Lie algebras. A can be written as DS , where D is a diagonal matrix, and S is a symmetric matrix.
Lie algebras. For example, the Cartan matrix for G 2 can be decomposed as such.
1 & 2. The third condition is not independent but is really a consequence of the first and fourth conditions.
1 & 2. In that case, if S in the above decomposition is positive definite, then A is said to be a Cartan matrix.

Clarity¶

A clear use of Cartan matrix names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is A (symmetrizable) generalized Cartan matrix is a square matrix A = (a{ij}) with integer entries such that.

Manages Complexity¶

Cartan matrix compresses multiple mathematics, logic, and statistics details into a stable diagnostic relation. The source shows both the central mechanism—then one gets type IIA string theory as a limit of M-theory, with 2-branes wrapping a two-cycles now described by an open string stretched between D-branes.—and the practical consequence—thus the Lie algebra depends entirely on these intersection numbers.

Abstract Reasoning¶

Type the carrier. Identify the mathematics, logic, and statistics entities to which the claim applies.
State the relation. Use the source-grounded identity: A (symmetrizable) generalized Cartan matrix is a square matrix A = (a{ij}) with integer entries such that.
Check operation and conditions. Now, an open string stretched between two D-branes represents a Lie algebra generator, and the commutator of two such generator is a third one, represented by an open string which one gets by gluing together the edges of two open strings. 4.

Knowledge Transfer¶

Within the home domain. Knowledge about Cartan matrix transfers literally when a new case preserves the same carrier type, relation, and recognition test. A (symmetrizable) generalized Cartan matrix is a square matrix A = (a{ij}) with integer entries such that. A can be written as DS , where D is a diagonal matrix, and S is a symmetric matrix. Beyond the home domain. No canonical parent is asserted for Cartan matrix. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Relationships to Other Abstractions¶

Current abstraction Cartan matrix Domain-specific

Parents (1) — more general patterns this builds on

Cartan matrix is a kind of Matrix Domain-specific

A generalized Cartan matrix is a square integer matrix satisfying additional sign and diagonal constraints.

Hierarchy paths (5) — routes to 5 parentless roots

Cartan matrix → Matrix → Tensor → Transformation → Function (Mapping)

Show alternative paths (4)

Neighborhood in Abstraction Space¶

Cartan matrix sits in a sparse region of the domain-specific corpus (65^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Algebraic Structures, Groups & Operators (42 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08