Alphabeta Math
PropositionStatement: 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.

Duality exchanges B and C

Statement

Let Φ be a reduced crystallographic root system with dual root system Φ={α=2α/(α,α)} (Coroot and dual root system). Then Φ is again a reduced crystallographic root system, its Cartan matrix is the transpose of that of Φ, and its Dynkin diagram is the diagram of Φ with every arrow reversed. Consequently, up to isomorphism, duality exchanges Bn and Cn and fixes An,Dn,E6,E7,E8,F4,G2 with long and short roots exchanged for F4 and G2.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with base Δ={α1,,αr} and Cartan matrix A=(aij), aij=2(αj,αi)/(αi,αi), together with the coroots α=2α/(α,α).

[L1]

(α,β)=2(β,α)/(α,α) and (α)=α (Coroot and dual root system).

[L2]

A base Δ is the set of simple roots of a positive system defined by a regular vector, and every positive root is a nonnegative integral combination of the elements of Δ; the simple roots form a basis of the ambient space (Positive systems and simple roots, Simple roots form a signed integral basis).

[L3]

The irreducible root systems and their Dynkin diagrams are classified as An,Bn,Cn,Dn,E6,E7,E8,F4,G2, with Bn and Cn having path diagrams that differ only by the direction of the arrow on the double edge, and with the simple-laced types having symmetric Cartan matrices (Classification of irreducible root systems, Existence of each classified root system).

Proof

technique · direct
1.1

Φ is a reduced crystallographic root system: it is finite, contains no zero vector, and spans E because the αi are positive multiples of the vector-space basis Δ. If β=cα, then β is parallel to α, so reducedness of Φ gives β=±α and hence β=±α; thus the dual is reduced. Moreover 2(β,α)/(α,α)=2(α,β)/(β,β)Z, and direct substitution gives sα(β)=(sαβ), so integrality and reflection stability hold.

L1L2algebra
2.1

It remains to justify that Δ={αi} is a base, rather than merely a vector-space basis. Choose a regular vector v whose positive system has base Δ. Since every β is a positive scalar multiple of β, the same v is regular for Φ and makes β positive exactly when β is positive. Let ω1,,ωr be the inner-product dual basis to α1,,αr, and for each i put xi=jiωj. If β=jnjαj is positive, [L2] gives nj0, and (xi,β)=jinj0; equality holds only when β lies on the positive ray of αi, hence only when β=αi by reducedness. The same vanishing criterion holds for β because it is a positive multiple of β. If αi were a sum of two positive dual roots, pairing with xi would force both summands to equal αi, an impossibility. Thus every αi is simple in the dual positive system. By [L2] the complete set of dual simple roots is a basis and has r=dimE elements; it therefore equals the r-element linearly independent set Δ. Its Cartan matrix has entries aij=2(αj,αi)/(αi,αi)=aji, so it is AT. The Dynkin diagram consequently reverses every arrow and keeps each edge multiplicity, since the multiplicity is aijaji=ajiaij.

L1L2step 1.1algebra
3.1

Inspecting the classified diagrams: the simply-laced types An,Dn,E6,E7,E8 have symmetric Cartan matrices, so they are self-dual; the triple-edge diagram G2 and the double-edge path F4 are each isomorphic to their arrow-reversed diagrams (interchanging the two G2 vertices, and reversing the F4 path), so those types are self-dual up to isomorphism with long and short roots exchanged; and for n3 the transpose of the Bn matrix is the Cn matrix and conversely, while B2 and C2 have isomorphic diagrams and B1=C1=A1.

L3step 2.1algebra
4.1

Combining steps 1.1-3.1 gives the assertions: duality is an involution on reduced crystallographic root systems, transforms the Cartan matrix by transposition and the diagram by arrow reversal, and therefore exchanges Bn with Cn and fixes every other classified type up to isomorphism.

step 1.1step 2.1step 3.1algebra

Depends on

Used by

Dependency tree · two levels

15 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