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 versus coroot translation lattices: A2, B2 and two conventions
Example
Let and , both with the standard dot product . With standard basis vectors , use
(1) Standard affine convention. For walls and affine reflection group , the translation subgroup is (Affine reflections: translation form, involutivity, local finiteness, and ). In type , for every root, so . In type , A half-open fundamental parallelogram for the -translations tiles , and its covolume is twice that of a fundamental parallelogram for . Here covolume means the Euclidean area of a basis parallelogram.
(2) Dual-normal convention. If instead the walls are , the translations are by the root lattice of . Thus the convention determines which of the two lattices acts.
(3) Coxeter-diagram limitation. The dual root system is the standard root system. The root and coroot lattices exchange: The simple-reflection pairs for and both have product of order , so their unoriented Coxeter diagram (one edge labelled ) does not determine the translation lattice; root-length information is needed.
Verification
Given: The two displayed coordinate sets and the affine-wall convention above.
[F1] A reduced crystallographic root system is finite, spans its ambient space, is preserved by each root reflection, has integral Cartan integers, and has only on each root line (Reduced crystallographic Euclidean root system).
[F2] The affine reflection group for the walls has translation subgroup (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and ).
[F3] , the dual root system is , and (Coroot and dual root system).
[F4] and (Root, coroot, weight, and coweight lattices).
[F5] For a full-rank integer sublattice with , the quotient is finite of order (The index of a full-rank subgroup of is the absolute determinant of a generating matrix).
[F6] The subgroup index is when the quotient is finite (The coset set and the index of a subgroup).
[F7] For vectors , the Euclidean area of their parallelogram is ; this is the covolume convention used here.
[F8] Every real number has a unique integer part satisfying (Integer part: for every real there is exactly one integer with ).
[F9] The coroot set is itself reduced crystallographic and has reflections (Affine reflections: translation form, involutivity, local finiteness, and ).
The set is finite, nonzero, and spans the sum-zero plane because and are independent. Each root reflection swaps two coordinates, so it preserves the set. Every root has squared length , and the dot product of any two listed roots is an integer; hence . No root line contains any listed multiple other than the two signs. Thus is a reduced crystallographic root system.
The set is finite, nonzero, and spans . Reflection in a short root changes the sign of one coordinate; reflection in a long root swaps or swaps-and-negates the two coordinates. These maps preserve the displayed set. Short roots have squared length and long roots squared length ; all dot products of listed roots are integers, so is integral for either possible denominator. Each root line contains only the two signs. Thus is a reduced crystallographic root system.
By [F2], the standard walls give translation lattice . The dual-normal walls are exactly the standard affine walls of the reduced crystallographic root system from [F9], so [F2] applied to gives translation lattice by [F3, F4].
Every root has squared length , so and the root and coroot lattices agree.
In , the roots have coroots , while the roots have the same coroots. Since and , all these coroots lie in ; conversely both displayed generators are coroots. The roots include , and every other root is their integer combination. Therefore and .
Relative to the basis of , the two displayed generators of are the columns of , so . By [F5], has order , and by [F6] this says .
Relative to , the basis matrices of and are and . By [F7], their basis-parallelogram areas are and . For any , write its unique coordinates in the latter basis as and let by [F8], so . Then . The first term lies in and the second in the half-open parallelogram . Uniqueness of the integer parts makes this decomposition unique; hence the translates of by partition the plane. Its covolume is twice that of .
In , take the generating root-reflection pair with normals and ; their reflections swap coordinates and change one coordinate sign, so they generate the signed permutation reflection group of . Their dual roots are and , so is , and [F3, F4] give the stated lattice exchange. The normal pairs satisfy . Thus both pairs of reflecting hyperplanes meet at acute angle ; the product of the two reflections is a rotation through and has order . This proves the diagram statement. All coordinate lists are finite and explicit, and the only interval representatives use the unique integer part; no axiom of choice is used.
Depends on
- Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group
- Affine reflections: translation form, involutivity, local finiteness, and $W_a=Q^\vee\rtimes W$
- Reduced crystallographic Euclidean root system
- Coroot and dual root system
- Root, coroot, weight, and coweight lattices
- The index of a full-rank subgroup of $\mathbb Z^n$ is the absolute determinant of a generating matrix
- The coset set $G/H$ and the index $[G:H]$ of a subgroup
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
65 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. Morgan, Lie Groups Fall 2025, Lecture XII: The Affine Weyl Group (Columbia course notes) (standard reference, not scraped)
- P. Magyar, Schubert classes of a loop group (arXiv:0705.3826) (standard reference, not scraped)
- A. W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., digital edition (standard reference, not scraped)