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 finite type: the Weyl types, reduced realizations and lattice stability
Statement
Let be a finite set, a Coxeter matrix, the presented group, , the Coxeter form, the canonical reflection homomorphism and the diagram, with the scaled data and Cartan numbers of Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices. Assume that is finite, equivalently that is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
(1) Criterion. There exists a crystallographic scaling if and only if every edge label of lies in , if and only if every connected component of is of type (), (), (), , , , , or . In particular the finite types , and with admit no crystallographic scaling.
(2) Reduced realizations and Weyl groups. If is a crystallographic scaling with scaled root set , then is a reduced crystallographic Euclidean root system in the inner product space (Reduced crystallographic Euclidean root system); its Weyl group (Weyl group) equals , and is an isomorphism carrying to the reflection in . Consequently every finite Coxeter system of one of the types listed in (1) is isomorphic to the Weyl group of a reduced crystallographic Euclidean root system, with the standard generators corresponding to the reflections in a base. No other finite Coxeter system has this property: if is isomorphic to for a reduced crystallographic Euclidean root system with base , then all labels of lie in and the type is one of those listed in (1).
(3) Lattice stability. For every crystallographic scaling the lattices and are -stable of rank and ; every root of is an integral combination of the scaled simple roots with coefficients of one sign, and all pairings , , are integers.
(4) Dual length choices. Suppose is connected, has edge labels in and has an edge of label . Then that is its only edge of label , and the two scalings that differ only by inverting the length ratio across it (with at one end versus , all other edge ratios as in Cartan-number products, allowed edge labels, tree scalings and reflection stability (3)) are both crystallographic and have mutually transposed scaled Cartan matrices . These are the two dual length assignments of the diagram: the alternative for a label- path, and the two and orientations; the companion examples page verifies the identification explicitly for and for .
Facts & Assumptions
Given: A finite set , a Coxeter matrix , the presented group (assumed finite), the space with Coxeter form (then positive definite) and canonical reflection homomorphism , the diagram , and the scaled data , , , , , , of a scaling . In (2), (3) and (4) a crystallographic scaling is considered; in the converse part of (2) a reduced crystallographic Euclidean root system with base is considered.
By convention, is the order of in (Coxeter diagrams: edges, labels, components and finite type).
The Coxeter diagram has vertex set , and are joined by an edge exactly when , labelled (Coxeter diagrams: edges, labels, components and finite type).
The components of are the connected components of its underlying graph, and their vertex sets partition (Coxeter diagrams: edges, labels, components and finite type).
An isomorphism of Coxeter systems carries the generators onto the generators, so the two diagrams correspond (Coxeter diagrams: edges, labels, components and finite type).
For finite type, every connected component of is isomorphic as a labelled graph to one of (path, all labels ), (path with labels ), , (stars with arms ; ; ; , all labels ), (path with labels ), (path with labels ), (path with labels ) or (two vertices joined by one edge labelled ) (Classification of finite Coxeter systems, including the H and dihedral families).
As Coxeter systems , and (Classification of finite Coxeter systems, including the H and dihedral families).
For a scaling, if and only if (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
If is positive definite and crystallographic then for all distinct one has , so , and (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
If is connected and has an edge of label or , then that is its only edge of label and respectively for all ; if there is no edge of label then on each connected component (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
If is a forest with all edge labels in and roots are chosen, then the prescription , along each edge with root-side endpoint is positive and crystallographic (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
For every crystallographic scaling: , , hence and ; and are -stable lattices of rank , , , with , ; every root of is an integral combination of the with all nonzero coefficients of one sign, and for all (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
A connected positive definite diagram contains no cycle (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).
A connected positive definite diagram has at most one edge of label (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).
The scaling is crystallographic when all are integers (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
For the reflection with normal is (The real Coxeter form, its radical, reflections, and form-preserving maps).
The Weyl group of a reduced crystallographic root system is (Weyl group).
A reduced crystallographic Euclidean root system is a finite spanning set closed under its reflections, with integral Cartan integers and (Reduced crystallographic Euclidean root system).
A positive root is simple when it is not a sum of two positive roots, and denotes the set of simple roots (Positive systems and simple roots).
For a reduced crystallographic root system with simple roots , the set is a basis of , so (Simple roots form a signed integral basis).
is finite if and only if is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
For finite the homomorphism is injective (The root-length criterion and faithfulness of the canonical reflection representation).
The Weyl group of a reduced crystallographic root system is finite (The Weyl group is finite and faithful).
For nonproportional roots of a reduced crystallographic system, where is the angle (Rank-two root-system classification).
Distinct simple roots of a reduced crystallographic system relative to a positive system satisfy (Rank-two root-system classification).
Coroots of a reduced crystallographic root system are (Coroot and dual root system).
For a reduced crystallographic root system with base, , and (Root, coroot, weight, and coweight lattices).
The Cartan matrix of a based root system has entries (Cartan matrix of a based root system).
In a Dynkin diagram, a double edge carries an arrow pointing from the longer root to the shorter root (Dynkin diagram with edge multiplicity and arrow convention).
Duality exchanges and and fixes , exchanging long and short roots for and (Duality exchanges B and C).
A symmetric bilinear form is positive definite when for every (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
A real inner product space is a real vector space with a positive definite inner product (Real and complex inner-product spaces and their induced length).
For a linear map with finite-dimensional domain, the dimension of the domain is the sum of the dimensions of its kernel and image; in particular, an injective linear map between finite-dimensional spaces of equal dimension is surjective (Rank-nullity: ).
For a subspace of a finite-dimensional real inner product space , (For a subspace of a finite-dimensional inner product space, ).
Proof
If some scaling of the geometry is crystallographic, then every edge label of lies in : by the label restriction every distinct pair satisfies , and edges are exactly the pairs with .
Since is finite, classification clauses (1)–(2) in [F5] give that every connected component of is one of the standard diagrams: , , , or ; the diagrams , , , and with are paths, stars or single edges, hence trees, and have all labels in , while and contain a label and has label ; and the coincidences (4) in [F6] give , , , so the Weyl-type list is .
is finite, contains the basis of and hence spans , omits because every has , is closed under negation because , and is -invariant because .
For the conjugation identity gives , so every root reflection maps into itself and ; conversely is the reflection in the root , so . Hence .
For all one has .
Let be the components of and , so ; each generator fixes for outside the component of , because there by the vanishing criterion for , and maps each into itself; hence every preserves every , and .
Suppose is connected, all edge labels lie in , and is an edge of label . Then is the only edge of label and contains no cycle; applying the tree construction with the root vertex on the -side gives a crystallographic scaling with , and applying it with the root on the -side gives a crystallographic scaling with ; these two scalings differ only by inverting the length ratio across .
For every crystallographic scaling the conclusions of the last clause of the lemma hold: and with and ; and are -stable free abelian groups of rank ; , , with and ; every element of is an integral combination of the whose nonzero coefficients have one sign; and all pairings with are integers.
Since is symmetric bilinear and positive definite, is a real inner product space, and for one has so that is the orthogonal reflection in , coinciding for with the generator reflection because with .
Let be a reduced crystallographic Euclidean root system in the real inner product space with base , and let be an isomorphism of Coxeter systems; write for the simple root corresponding to . Then is finite, so is finite and is positive definite. For distinct the roots are positive, hence nonproportional: with forces and by reducedness, while contradicts positivity. By the rank-two classification and , where and is the angle between and ; hence satisfies and .
If every edge label of lies in , then by 1.2 every connected component of is one of the Weyl-type diagrams , each of which is a tree; so is a forest with all edge labels in and the tree construction produces a crystallographic scaling of the geometry.
Assume crystallographic. If with and , then and by 1.5; writing in lowest terms, and , so .
If and are nonzero and proportional, then lie in one component by 1.6, and applying the ratio clause to that connected component gives , since preserves and .
For the two scalings of 1.7 put and . Label- edges have equal lengths in both scalings, while the constructions invert the ratio across , so for all ; since and one has , and also ; hence for all , that is . These are the two dual length assignments, the alternative on a label- path and the two orientations of and , with the arrow pointing from the longer to the shorter root.
For a pair as in 1.10 put , , and . Then is an orthonormal basis of and with , and . The reflection formula gives , , and , so acts on by the matrix with , , and fixes pointwise. Since , a power of is the identity exactly when its restriction to is the identity. Products of such matrices add the pairs by , so by induction with and the same recursion; from one gets , , and . Since and , four cases occur: gives , and , of order ; gives , , hence , , so while and , of order ; gives , and , of order ; and gives , , hence , , so and while all differ from , of order .
Combining 1.1, 1.2 and 2.1: there exists a crystallographic scaling if and only if every edge label of lies in , if and only if every connected component of is one of the Weyl types ; in particular , and with admit none, while , and do.
If with and , then 2.2 gives and 2.3 gives ; hence and .
By 2.5 the order of lies in for every pair of distinct ; since is the order of and the isomorphism carries to , the label lies in whenever are distinct; in particular every edge label of lies in .
For every one has : if with , then by 1.3; if , step 3.2 gives , while if , applying step 3.2 to gives .
By 3.3 every edge label of lies in ; since is finite, 1.2 now shows that every connected component of is one of , so the type of is one of the types listed in 3.1, and all labels lie in .
The are exactly the simple roots of the positive system of defined by a regular vector. By 1.8 every root is an integral combination whose nonzero coefficients have one sign, so satisfies the axioms of a reduced crystallographic Euclidean root system by 1.3, 1.4, 1.5 and 4.1. Because is positive definite, the map is injective on (a nonzero kernel vector would have ) and hence an isomorphism onto by [F38]; choose mapping to . Then has the sign of the nonzero coefficients of , so is regular and , with simple roots by definition. Each is simple: a decomposition into positive roots would split the coordinate vector of into nonnegative integer coordinate vectors, forcing one summand to be and the other to be . By the basis theorem is a basis of , so ; since , equality follows.
Therefore is a reduced crystallographic Euclidean root system in the inner product space : it is finite, spans and omits (1.3), is closed under its root reflections (1.4), has integral Cartan integers (1.5) and is reduced (4.1). Its Weyl group is (1.4), and is an isomorphism because it is surjective by 1.4 and injective, carrying to ; the base is (5.1), so the standard generators correspond to the reflections in a base, and by 3.1 every finite Coxeter system of the listed types is isomorphic to the Weyl group of such a system. Moreover the root, coroot and weight lattices of are the sets of the scaling, its coroots are , and its Cartan matrix relative to the base has entries , the transpose of .
All four clauses are established: (1) by 1.1, 2.1 and 3.1; (2) by 6.1 and 4.2; (3) by 1.8; and (4) by 1.7 and 2.4. No axiom of Choice is used. The construction in 2.1 selects a root vertex from each of the finitely many components of a finite forest; this finite selection follows by induction on the number of components, and no other non-unique selection is used.
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
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- The root-length criterion and faithfulness of the canonical reflection representation
- Coxeter diagrams: edges, labels, components and finite type
- Exclusions for positive definite diagrams: trees, valency, labels, chains and arms
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- Classification of finite Coxeter systems, including the H and dihedral families
- Reduced crystallographic Euclidean root system
- Coroot and dual root system
- Root, coroot, weight, and coweight lattices
- Weyl group
- The Weyl group is finite and faithful
- Positive systems and simple roots
- Simple roots form a signed integral basis
- Rank-two root-system classification
- Dynkin diagram with edge multiplicity and arrow convention
- Cartan matrix of a based root system
- Duality exchanges B and C
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- Real and complex inner-product spaces and their induced length
- Orthogonality and the orthogonal complement
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- 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
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G Lemma
Cited to discharge well-definedness by Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices.
Dependency tree · two levels
125 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)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press; author's full institutional PDF) (standard reference, not scraped)