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.
G2 from I2(6): the scaled realization and its twelve roots
Example
Let with , let with Coxeter form , and let and be the presented Coxeter group and canonical reflection homomorphism. Then is positive definite and has order . The scaling , has Cartan matrix and scaled root set where and . The squared -norms are on and on ; every root-coroot pairing is integral, including , and . This is the irreducible reduced crystallographic root system of type , and its Weyl group is . The other scaling , gives and satisfies , the dual orientation of the same diagram.
Facts & Assumptions
Given: , , , the Coxeter form , the presented Coxeter group , its canonical reflection homomorphism , and the scaling conventions of Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices.
The presentation has generators and relators and (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The canonical homomorphism satisfies for each (The canonical reflection homomorphism, roots, reflections, and the positive cone).
For a scaling , , , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
Cosine is strictly decreasing on , , , and (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions, Double-angle and quadratic power-reduction identities, Pi as twice the smallest positive zero of cosine).
On a one-edge tree labelled , the tree construction with root scale gives the positive crystallographic scaling , (Cartan-number products, allowed edge labels, tree scalings and reflection stability, clause (3)).
If is crystallographic, then for every , where and (Cartan-number products, allowed edge labels, tree scalings and reflection stability, clause (4)).
A reduced crystallographic Euclidean root system is finite, spans its inner-product space, is stable under reflection in every root, has integral Cartan pairings, and has only on each root line (Reduced crystallographic Euclidean root system).
Reducibility is an orthogonal decomposition of the root set into two nonempty parts; irreducibility means no such decomposition (Reducible and irreducible root systems).
For a regular vector , positive roots are those with positive inner product with , and a positive root is simple if it is not a sum of two positive roots (Positive systems and simple roots).
An irreducible reduced crystallographic root system of rank two with six positive roots is of type ; the other irreducible rank-two types have three positive roots () or four () (Rank-two root-system classification, clause (iv)).
The Weyl group is generated by the reflections in all roots of (Weyl group).
Every element of is the value of a finite word in (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Verification
Given: and .
Proof technique: direct presentation and orbit computations, followed by verification of the root-system axioms.
Since , evaluating functions at and shows that is a basis. Put . Since , [F5] gives . The supplementary and double-angle identities give , so and hence . Applying the double-angle identity at and using positivity again gives . Thus , which is positive for every nonzero , so is positive definite. Set ; then , and . Moving each to the right shows every word is or , with , so .
By [F6] and step 1.1, and give a crystallographic scaling. Hence , , , , and , so . Choosing as the tree root gives the other scaling , ; the same Cartan formula gives .
In coordinates relative to , the reflection formula [F14] gives and ; each matrix squares to the identity. These maps preserve : on the six displayed positive pairs their respective images are and , and the images of their negatives are the negatives of these. Conversely , , and . For every orbit vector , the element sends to , so all twelve pairs lie in the orbit of the simple roots. Substituting positive scalar multiples in the reflection formula gives and ; hence by [F15]. The squared norm of is , whose values on are respectively . The product has matrix , with and ; hence has exact order . The six maps are distinct, as are , and the two lists are disjoint since their determinants are and . Thus ; with step 1.1 this gives and is injective.
For every nonisotropic , expansion of [F14] gives ; applying this to shows the generators of preserve , hence so does every . If by [F15], then , and conjugating the reflection formula by the -isometry gives , so . The set is finite, nonzero and spans ; its root-coroot pairings are integral by [F7] and its reducedness follows from the six distinct root slopes. Therefore is a reduced crystallographic Euclidean root system.
Let ; the Gram matrix from [F2], [F4] and step 1.1 gives . The vectors and form a basis. Thus for each listed pair with , , and the six listed vectors are exactly the positive roots. Neither nor is a sum of two positive roots, since the only positive root with second coordinate zero is and the only one with first coordinate zero is ; the other positive roots decompose as , , and . Hence is a base. Since , these two spanning roots cannot belong to different orthogonal parts in a decomposition, while they already span ; [F9] therefore gives irreducibility. By [F11], the root system is of type .
Every root reflection is as in step 3.1, so [F12] gives ; conversely and generate , so and it has order . For the second scaling, and ; because preserves , , whence by [F7]. This construction uses only the two fixed generators and finitely many roots, so no form of the Axiom of Choice is used.
No form of the Axiom of Choice is used; all choices and computations involve the two fixed generators and finite sets.
Depends on
- Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices
- Cartan-number products, allowed edge labels, tree scalings and reflection stability
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Signs, monotonicity intervals, and ranges of sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- Double-angle and quadratic power-reduction identities
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- Pi as twice the smallest positive zero of cosine
- Reduced crystallographic Euclidean root system
- Reducible and irreducible root systems
- Positive systems and simple roots
- Rank-two root-system classification
- Weyl group
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
70 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
- J. S. Milne, Lie Algebras, Algebraic Groups, and Lie Groups (course notes, version 2.00) (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (author-hosted digital edition) (standard reference, not scraped)
- Jean Michel, Lectures on Coxeter groups (Beijing lecture notes, April-May 2014) (standard reference, not scraped)