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 Root Lattices and Weyl Group Interfaces
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Fundamental Trigonometric Identities
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Crystallographic structure adds arithmetic data to a finite reflection system. A positive scaling of the simple normals determines coroots and Cartan integers; requiring those integers to be integral constrains the root lengths and the finite rank-two labels. This page develops the root and weight lattices, constructs compatible scalings on trees, and connects the resulting root systems with their Weyl groups.
The three items are ordered so that the scaling conventions precede the integrality lemma, which in turn supplies the finite-type theorem.
Development
Scaling and lattices. def-cg-crystallographic-scaling-coroot-and-lattice defines the scaled roots and coroots, Cartan entries, crystallographic condition, and root, coroot and weight lattices. The definition does not assume positive definiteness or promise a scaling for every dihedral label.
Integer pairings and labels. lem-cg-integer-pairings-and-allowed-dihedral-labels computes the Cartan products, restricts finite positive-definite crystallographic labels to 2, 3, 4 and 6, gives tree scalings, and proves lattice and root-coroot pairing stability.
Finite type and lattice stability. thm-cg-crystallographic-finite-type-and-lattice-stability relates the finite Coxeter types to crystallographic realizations, proves the root-system and Weyl-group claims, and records how the length choices at a 4- or 6-edge transpose the Cartan matrix.
Prerequisites
The finite Coxeter classification and the published root-system classification are earlier prerequisites. The companion crystallographic-root-lattices-and-weyl-group-interfaces-examples gives explicit A2, B2/C2 and G2 realizations and the I2(5) obstruction.
3 · Logical flowchart
4 · Definitions, theorems and proofs
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.
Cartan-number products, allowed edge labels, tree scalings and reflection stability
Statement
Let be a finite set, a Coxeter matrix, the presented group, , the Coxeter form, the canonical reflection homomorphism and the diagram (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, Coxeter diagrams: edges, labels, components and finite type), and let be a scaling with scaled simple roots , coroots and Cartan numbers (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
(1) Products. for every ; for distinct with , and for one has and . Moreover if and only if .
(2) Allowed labels and length ratios. Assume that is positive definite and that is crystallographic. Then for all distinct and , according to . If is connected and has an edge of label (respectively ), then that is its only edge of label , and (respectively ) for all ; if has no edge of label , then for all in the same connected component.
(3) Realizations on trees. Let be a forest (disjoint union of trees) all of whose edge labels lie in . Choose a root vertex in each component, set at each root, and for every edge with on the root side and the other endpoint set . Then is positive and crystallographic: on every edge with the root-side endpoint, while for non-adjacent and .
(4) Lattices, integrality and stability. Assume that is crystallographic. Then for all hence and . Consequently and are -stable lattices of rank , , , , and . Here, for , write ; this is defined because preserves and , and . Moreover every element of is an integral linear combination of the whose nonzero coefficients all have the same sign, and for all .
Facts & Assumptions
Given: A finite set , a Coxeter matrix on , the presented group , the space with its Coxeter form , the canonical reflection homomorphism , the diagram , and a scaling with scaled simple roots , coroots and Cartan numbers . In (2) and in the ratio clause below, is assumed positive definite and crystallographic; in (3) is assumed to be a forest with all edge labels in ; in (4) is assumed crystallographic.
is finite and , while for (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Every element of is a product of elements of , by the definition of the length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
is the unique symmetric bilinear form on with , for finite and for (The real Coxeter form, its radical, reflections, and form-preserving maps).
For , the reflection with normal is (The real Coxeter form, its radical, reflections, and form-preserving maps).
Such a reflection is linear, satisfies , and for all (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
is the positive cone (The canonical reflection homomorphism, roots, reflections, and the positive cone).
preserves : for all and (Descent of the reflection representation, unit root norms, and conjugation of reflections).
Every root of lies in or in (Root sign coherence and the action of simple reflections on positive roots).
The scaling data: , , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
The scaling is crystallographic when all are integers (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
A basis of is linearly independent and spans (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
The functions () form a basis of (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
In a real inner product space, , with equality if and only if are linearly dependent (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
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).
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).
The Coxeter diagram has vertex set , with an edge between exactly when , labelled ; connectivity and components are those of the underlying graph (Coxeter diagrams: edges, labels, components and finite type).
A connected positive definite diagram has at most one edge of label (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).
A forest is a graph containing no cycle, and a tree is a connected forest (Trees, forests, leaves and isolated vertices).
Every two vertices of a finite nonempty tree are joined by a unique path (Equivalent characterisations of a nonempty tree by unique paths, edge count, minimal connectivity and maximal acyclicity).
and are the power series functions, so (Sine and cosine defined by their real power series).
Cosine is strictly decreasing on (Signs, monotonicity intervals, and ranges of sine and cosine).
for all real (Double-angle and quadratic power-reduction identities).
A connected positive definite diagram contains no cycle (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (2)).
Proof
For all one has ; in particular and .
For distinct with one has and ; for one has and ; and exactly when . Indeed gives , where and only at because is strictly decreasing on with .
The values , , and hold, and for . For the first, ; putting , the supplementary identity at gives while the double-angle identity gives , so and (as and decreases from ) force ; the double-angle identity at gives , and at it gives .
If is positive definite then is a real inner product space, and for linearly independent one has ; moreover for distinct the vectors and are linearly independent.
Let be a forest whose edge labels lie in , with a root chosen in each component. Then each component is a tree, every vertex other than its root has a unique neighbour on its path to that root, and the prescription , determines a unique positive value for every vertex.
Writing for , the reflection formula gives, for all , and .
Assume positive definite and crystallographic. Then for distinct one has , so ; and , with for respectively. The bound uses strict Cauchy-Schwarz in the basis-independent pair ; the four values use step 1.3; and no other occurs because gives (from by decrease of ), so , while gives , so , and gives the product .
Let be a forest with edge labels in and let be the tree scaling of step 1.5. Then is crystallographic: on every edge with the root-side endpoint, and ; for non-adjacent distinct one has ; and .
Assume crystallographic. In the formulas of step 1.6, the coefficients and are integers by [F11], so each generator matrix has integer entries in both bases and . Every is a finite product of elements of [F2], and is a homomorphism with [F6]; therefore the matrices of in both bases have integer entries. In particular, for every and , is an integral linear combination of the . The -basis coefficients of all have one sign because has, in the -basis, coefficients of one sign by [F9] and [F7], and re-expressing in the -basis multiplies the -th coefficient by the positive factor .
Assume crystallographic. Step 1.6 and [F11] give and for all , hence and ; since by [F5], applying gives the reverse inclusions, so both are equalities. Since is generated by and [F2, F6], every preserves and . Because and are bases of , their -spans and are free abelian groups of rank and are -stable.
Assume positive definite and crystallographic, and let be an edge of with label ; put . Then and are negative integers with product , so and ; in particular every edge of label has .
Assume crystallographic. By step 2.3, , hence , and since each also , so . Likewise, for the identity (using preservation of ) shows that each element of lies in by step 2.4, so , while with gives the reverse inclusion; hence . Finally , since for by bilinearity and integrality of the , so each lies in and is an additive subgroup.
Assume crystallographic. For and in one has and , where has integer coefficients by step 2.3.
Assume positive definite, crystallographic and connected. Then has at most one edge of label , every other edge has label and hence squared length ratio ; for any two vertices the squared ratio is the product of the edge ratios along a path, and by [F28] contains no cycle, so such a path meets the unique multi-edge at most once and the product equals when the path avoids the multi-edge and or when it crosses a label- or label- edge. Consequently for all when an edge of label exists, when an edge of label exists, and for all when no edge of label exists.
This completes all four clauses: (1) is steps 1.1 and 1.2; (2) is step 2.1 together with the ratio alternatives of steps 3.1 and their global form 4.1; (3) is steps 1.5 and 2.2; and (4) is steps 1.6, 2.3, 2.4, 3.2 and 3.3.
Remarks
No Axiom of Choice is used. The forest in step 1.5 is finite, so its components form a finite family; choosing one vertex from each nonempty component is finite choice, provable by induction on the number of components. Every path and sum used in the proof is finite, and no arbitrary-index selection is made.
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.
5 · Examples, counterexamples and false statements
None yet.
Sources
- J. S. Milne, Lie Algebras, Algebraic Groups, and Lie Groups (course notes, version 2.00)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (author-hosted digital edition)
- Jean Michel, Lectures on Coxeter groups (Beijing lecture notes, April-May 2014)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press; author's full institutional PDF)