How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Properties of finite-type Cartan matrices
Statement
Let be the Cartan matrix of a reduced crystallographic root system relative to a base (Cartan matrix of a based root system). Then:
- for all , and is a nonpositive integer for ;
- if and only if ;
- for ;
- there is a diagonal matrix with positive diagonal entries such that is symmetric and positive definite.
Facts & Assumptions
Given: A reduced crystallographic root system with base , base entries , and the inner product on .
and is an integer (Cartan matrix of a based root system, Reduced crystallographic Euclidean root system).
For distinct simple roots, (Distinct simple roots have nonpositive inner product).
For nonproportional roots the product of Cartan integers is and the angle is , , or (Rank-two root-system classification).
The simple roots form a basis of , so their Gram matrix is symmetric and positive definite, and any symmetric matrix representing the inner product in a basis is positive definite (Simple roots form a signed integral basis).
Proof
and ; for one has because by [L2] and .
if and only if : both entries are nonzero exactly when , since the denominators are positive.
For , the simple roots are nonproportional, so by [L3], giving the third assertion.
Let ; then has entries , which is symmetric in because the inner product is symmetric.
The matrix in step 1.4 is positive definite: it is twice the Gram matrix of the normalized simple roots, and those vectors are a basis of , so their Gram matrix is positive definite by [L4]. Discarding the factor preserves positive definiteness.
Depends on
Used by
- A cycle graph is not finite type Counterexample
- Dynkin diagram with edge multiplicity and arrow convention Definition
- Serre Lie algebra of a finite-type Cartan matrix Definition
- Every connected finite graph is Dynkin False statement
- Shape restrictions on Dynkin diagrams Lemma
- Serre presentation theorem Theorem
- The Cartan matrix determines a based root system Theorem
Dependency tree · two levels
12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter II (standard reference, not scraped)