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.
Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices
Definition
Let be a finite set, let be a Coxeter matrix on , let be the presented Coxeter group with its universal property (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), let be the real vector space with its basis , let be the Coxeter form and let be the canonical reflection homomorphism with its reflections and root system (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, The canonical reflection homomorphism, roots, reflections, and the positive cone). No definiteness or nondegeneracy of is assumed.
A scaling of this geometry is a family of positive real numbers; with define
Since and is a basis, the form a basis of and (The real Coxeter form, its radical, reflections, and form-preserving maps, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis); hence each is defined, and . The reflection of The real Coxeter form, its radical, reflections, and form-preserving maps is the generator reflection of the geometry, because the reflection formula depends only on the line spanned by the normal: for and substitution gives , so , and with . The number is the Cartan number of the ordered pair , and .
The scaling is crystallographic when for all , equivalently when for all . In that case define the root lattice, coroot lattice and weight lattice of the scaling by the scaled root set , and the scaled Cartan matrix of .
Well-definedness, lattice provisos, and the interface with the published lattices
and are nonzero scalar multiples of the basis vectors , so both and are bases of . Thus and are free abelian subgroups of rank . The set is an additive subgroup, since each condition is preserved by addition and negation. If and with , then in the crystallographic case, so .
Here a lattice in means a discrete subgroup whose real span is ; this convention includes the rank-zero lattice when . The map is linear. Because is a basis and is symmetric, : vanishing against each is equivalent by linearity to vanishing against every vector of . Hence is injective exactly when is nondegenerate; both its domain and codomain have dimension , so the rank-nullity theorem (Rank-nullity: ) makes this equivalent to being an isomorphism. If is an isomorphism then is the -span of the real basis characterized by , so it is a lattice. If is degenerate then , so contains a nonzero linear subspace and is not discrete. For instance for , , one has and , a union of parallel lines. In particular is a lattice in the positive definite setting of (2) of Cartan-number products, allowed edge labels, tree scalings and reflection stability and of Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗; in the degenerate range the term "weight lattice" names without a discreteness claim.
When is positive definite and has been proved to be a reduced crystallographic Euclidean root system with base (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗ (2)), the sets , and are exactly the root lattice, coroot lattice and weight lattice of that root system in the sense of Root, coroot, weight, and coweight lattices, and the elements are its simple coroots in the sense of Coroot and dual root system. The definition is deliberately stated before that identification is available: it is a property declaration for the pair (geometry, scaling), and the paragraphs above justify only its own well-definedness.
This item asserts no existence of a crystallographic scaling, and in particular makes no claim about the non-crystallographic finite types , , or with . It also does not assert that is a root system, that , or that any pairing of non-simple elements of is an integer: for a crystallographic scaling these facts are proved in Cartan-number products, allowed edge labels, tree scalings and reflection stability and Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗. No choice principle is used: is finite and every object above is defined from the given finite data.
Depends on
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Coroot and dual root system
- Root, coroot, weight, and coweight lattices
- Reduced crystallographic Euclidean root system
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
Used by
- I₂(5) admits no crystallographic scaling and no reduced crystallographic root system with that base pairing Counterexample
- B-tilde versus C-tilde: the n=2 coincidence and the duality behind the difference Example
- G2 from I2(6): the scaled realization and its twelve roots Example
- The A₂ root and weight lattices: P/Q has order three Example
- The two realizations of I₂(4): B₂ and C₂ with their lattices and duality Example
- Cartan-number products, allowed edge labels, tree scalings and reflection stability Lemma
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G Lemma
- Crystallographic finite type: the Weyl types, reduced realizations and lattice stability Theorem
Dependency tree · two levels
69 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)