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.
Root strings in type A_2
Example
Assume AC (The Axiom of Choice). In with the diagonal Cartan subalgebra and the roots of Diagonal Cartan subalgebra and roots of sl_n, take and , so that by The root sl_2 triple inside sl_n. The -string through consists of and , that is, it has the form with and , and indeed in agreement with The root-string property. The -string through is , so , , , and .
Facts & Assumptions
Given: AC; the algebra with the roots of Diagonal Cartan subalgebra and roots of sl_n, the roots , , the coroot from The root sl_2 triple inside sl_n and Coroot of a Lie-algebra root, and the string description of The root-string property with the root set of Root and root space.
Verification
The roots of are the six functionals , , so , , and are roots while is not, by the reducedness statement that the only scalar multiples of a root that are roots are themselves.
The Cartan integer evaluates as : the diagonal matrix has coordinate vector , so gives , matching .
For the -string through : the indices with a root or are ; indeed is a root, while and are not among the six roots and are nonzero. Hence , .
For the -string through , the terms are . They are roots or zero exactly for , giving the terms and hence , , and . Also , so the string identity holds.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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)