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 (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 and and fixes with long and short roots exchanged for and .
Facts & Assumptions
Given: A reduced crystallographic root system with base and Cartan matrix , , together with the coroots .
and (Coroot and dual root system).
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).
The irreducible root systems and their Dynkin diagrams are classified as , with and 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
is a reduced crystallographic root system: it is finite, contains no zero vector, and spans because the are positive multiples of the vector-space basis . If , then is parallel to , so reducedness of gives and hence ; thus the dual is reduced. Moreover , and direct substitution gives , so integrality and reflection stability hold.
It remains to justify that is a base, rather than merely a vector-space basis. Choose a regular vector whose positive system has base . Since every is a positive scalar multiple of , the same is regular for and makes positive exactly when is positive. Let be the inner-product dual basis to , and for each put . If is positive, [L2] gives , and ; equality holds only when lies on the positive ray of , hence only when by reducedness. The same vanishing criterion holds for because it is a positive multiple of . If were a sum of two positive dual roots, pairing with would force both summands to equal , an impossibility. Thus every is simple in the dual positive system. By [L2] the complete set of dual simple roots is a basis and has elements; it therefore equals the -element linearly independent set . Its Cartan matrix has entries , so it is . The Dynkin diagram consequently reverses every arrow and keeps each edge multiplicity, since the multiplicity is .
Inspecting the classified diagrams: the simply-laced types have symmetric Cartan matrices, so they are self-dual; the triple-edge diagram and the double-edge path are each isomorphic to their arrow-reversed diagrams (interchanging the two vertices, and reversing the path), so those types are self-dual up to isomorphism with long and short roots exchanged; and for the transpose of the matrix is the matrix and conversely, while and have isomorphic diagrams and .
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 with and fixes every other classified type up to isomorphism.
Depends on
Used by
- Dynkin duality of Bₙ and Cₙ Example
- B and C are always isomorphic False statement
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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter II (standard reference, not scraped)
- Pavel Etingof, MIT 18.745 Lie Groups and Lie Algebras I, Lectures 19-24 (standard reference, not scraped)