Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

The Cartan matrix determines a based root system

Statement

Let ΦE and ΦE be reduced crystallographic root systems with bases Δ={α1,,αr} and Δ={α1,,αr} and Cartan matrices A=(aij) and A=(aij) (Cartan matrix of a based root system). If A=A then the linear map φ:EE with φ(αi)=αi for all i is an isomorphism of root systems; in particular φ(Φ)=Φ.

Facts & Assumptions

Given: Based reduced crystallographic root systems (Φ,Δ) and (Φ,Δ) with the same Cartan matrix A=A, and the linear map φ sending αi to αi.

[L1]

Δ and Δ are bases of E and E, and every root is a unique integral combination of its base with coefficients of one sign (Simple roots form a signed integral basis, Positive systems and simple roots).

[L2]

sαi(αj)=αjaijαi, and the same formula with primes holds in Φ because A=A (Cartan matrix of a based root system).

[L3]

The Gram matrix G=((αi,αj)) of the simple roots satisfies aij=2Gij/Gii, and G is positive definite; the numbers aij determine G up to one positive scalar on each connected component of the graph with edges aij0 (Properties of finite-type Cartan matrices).

Proof

technique · direct
1.1

Every root of Φ is Weyl-conjugate to a simple root. Indeed, let γ=iniαi be positive and not simple. Since 0<(γ,γ)=ini(γ,αi), some i satisfies (γ,αi)>0. Put m=2(γ,αi)/(αi,αi)>0. Crystallographic integrality gives mZ, and reflection invariance gives sαi(γ)=γmαiΦ. Its height is ht(γ)m<ht(γ). It cannot be negative: if it were, then all its simple-root coefficients would be nonpositive by [L1], whereas its coefficient at every ji is nj0; hence all nj for ji would vanish, making γ a positive scalar multiple of αi, and reducedness would force γ=αi, contrary to assumption. Thus successive simple reflections strictly lower positive height until a simple root is reached. Inverting those reflections proves the claim.

L1algebra
1.2

With the row index first and column index second, the matrix of sαi in the basis Δ has entries (sαi)jk=δjkaikδji by [L2]; it is therefore determined by A, and the corresponding matrix for sαi in the basis Δ is the same. Hence φsαiφ1=sαi for all i, because both sides are linear and agree on the basis Δ: φsαiφ1(αj)=φ(αjaijαi)=αjaijαi=sαi(αj).

L2algebra
2.1

Consequently φ carries the Weyl orbit of Δ onto the Weyl orbit of Δ, and by step 1.1 (applied to Φ and to Φ) it carries Φ onto Φ; in particular φ is a linear isomorphism, since it maps the basis Δ onto the basis Δ.

step 1.1step 1.2algebra
3.1

It remains to check that φ preserves Cartan integers. By [L3] the Gram matrices G and G satisfy aij=2Gij/Gii=2Gij/Gii and are positive definite; for indices i,j joined by an edge one has aij,aji<0 and aijGii=2Gij=2Gji=ajiGjj, so Gii/Gii=Gjj/Gjj; by connectivity along edges the ratios Gii/Gii are constant on each connected component of the graph on Δ with edges aij0. Define a second inner product on E by (x,y)1=(φx,φy)E. Its Gram matrix in the basis Δ is G, which differs from G by a positive scalar on each connected component; therefore for roots γ,δ of Φ the Cartan integers computed with (,) and with (,)1 agree, because scaling an inner product on a component by λ>0 multiplies both (γ,δ) and (δ,δ) by λ when γ,δ lie in that component and gives 0 otherwise. Since φ(Φ)=Φ by step 2.1, φ is an isomorphism of root systems.

step 2.1L3algebra

Depends on

Used by

Dependency tree · two levels

8 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