Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 S be a finite set, m a Coxeter matrix, W the presented group, V=RS, B the Coxeter form, ρ the canonical reflection homomorphism and Γ the diagram, with the scaled data and Cartan numbers ast of Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices. Assume that W is finite, equivalently that B 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 {3,4,6}, if and only if every connected component of Γ is of type An (n≥1), Bn (n≥2), Dn (n≥4), E6, E7, E8, F4, or G2=I2(6). In particular the finite types H3, H4 and I2(m) with m∉{2,3,4,6} admit no crystallographic scaling.

(2) Reduced realizations and Weyl groups. If c is a crystallographic scaling with scaled root set Φc, then Φc is a reduced crystallographic Euclidean root system in the inner product space (V,B) (Reduced crystallographic Euclidean root system); its Weyl group W(Φc)=⟨sβ:β∈Φc⟩ (Weyl group) equals ρ(W), and ρ is an isomorphism W→W(Φc) carrying s to the reflection ras in as. 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 (W,S) is isomorphic to (W(Ψ),{sα:α∈Δ}) for a reduced crystallographic Euclidean root system Ψ with base Δ, then all labels of Γ lie in {2,3,4,6} and the type is one of those listed in (1).

(3) Lattice stability. For every crystallographic scaling the lattices Q=ZΦc and Q∨=ZΦc∨ are ρ(W)-stable of rank ∣S∣ and Q⊆P; every root of Φc is an integral combination of the scaled simple roots as with coefficients of one sign, and all pairings B(β,γ∨), β,γ∈Φc, are integers.

(4) Dual length choices. Suppose Γ is connected, has edge labels in {3,4,6} and has an edge of label p∈{4,6}. Then that is its only edge of label ≥4, and the two scalings that differ only by inverting the length ratio across it (with ct=2cscos⁡(π/p) at one end versus cs=2ctcos⁡(π/p), 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 A′=AT. These are the two dual length assignments of the diagram: the Bn/Cn alternative for a label-4 path, and the two F4 and G2 orientations; the companion examples page verifies the identification explicitly for B2/C2 and for G2.

Facts & Assumptions

Given: A finite set S, a Coxeter matrix m, the presented group W (assumed finite), the space V=RS with Coxeter form B (then positive definite) and canonical reflection homomorphism ρ, the diagram Γ, and the scaled data as, as∨, ast, Q, Q∨, P, Φc of a scaling c. 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.

[F1]

By convention, m(s,t) is the order of st in W (Coxeter diagrams: edges, labels, components and finite type).

[F2]

The Coxeter diagram Γ has vertex set S, and s≠t are joined by an edge exactly when m(s,t)≥3, labelled m(s,t) (Coxeter diagrams: edges, labels, components and finite type).

[F3]

The components of Γ are the connected components of its underlying graph, and their vertex sets partition S (Coxeter diagrams: edges, labels, components and finite type).

[F4]

An isomorphism of Coxeter systems carries the generators onto the generators, so the two diagrams correspond (Coxeter diagrams: edges, labels, components and finite type).

[F5]

For finite type, every connected component of Γ is isomorphic as a labelled graph to one of An (path, all labels 3), Bn (path with labels 3,…,3,4), Dn, E6,E7,E8 (stars with arms 1,1,n−3; 1,2,2; 1,2,3; 1,2,4, all labels 3), F4 (path with labels 3,4,3), H3 (path with labels 3,5), H4 (path with labels 3,3,5) or I2(m) (two vertices joined by one edge labelled m≥3) (Classification of finite Coxeter systems, including the H and dihedral families).

[F6]

As Coxeter systems A2=I2(3), B2=C2=I2(4) and G2=I2(6) (Classification of finite Coxeter systems, including the H and dihedral families).

[F7]

For a scaling, ast=0 if and only if m(s,t)=2 (Cartan-number products, allowed edge labels, tree scalings and reflection stability).

[F8]

If B is positive definite and c crystallographic then for all distinct s,t one has 0≤astats<4, so astats∈{0,1,2,3}, and m(s,t)∈{2,3,4,6} (Cartan-number products, allowed edge labels, tree scalings and reflection stability).

[F9]

If Γ is connected and has an edge of label 4 or 6, then that is its only edge of label ≥4 and cs2/ct2∈{1,2,2−1} respectively {1,3,3−1} for all s,t; if there is no edge of label ≥4 then cs=ct on each connected component (Cartan-number products, allowed edge labels, tree scalings and reflection stability).

[F10]

If Γ is a forest with all edge labels in {3,4,6} and roots are chosen, then the prescription croot:=1, ct:=2cscos⁡(π/m(s,t)) along each edge with root-side endpoint s is positive and crystallographic (Cartan-number products, allowed edge labels, tree scalings and reflection stability).

[F11]

For every crystallographic scaling: rs(at)=at−atsas, rs(at∨)=at∨−astas∨, hence rs(Q)=Q and rs(Q∨)=Q∨; Q and Q∨ are ρ(W)-stable lattices of rank ∣S∣, Φc⊆Q, Q=ZΦc, Q∨=ZΦc∨ with Φc∨={2β/B(β,β):β∈Φc}, Q⊆P; every root of Φc is an integral combination of the as with all nonzero coefficients of one sign, and B(β,γ∨)∈Z for all β,γ∈Φc (Cartan-number products, allowed edge labels, tree scalings and reflection stability).

[F12]

A connected positive definite diagram contains no cycle (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).

[F13]

A connected positive definite diagram has at most one edge of label ≥4 (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).

[F14]

as=cses and ast=B(as,at∨)=2B(as,at)/B(at,at) (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).

[F16]

The scaling is crystallographic when all ast are integers (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).

[F17]

Q=∑sZas, Q∨=∑sZas∨, P={λ:B(λ,q∨)∈Z ∀q∨∈Q∨}, Φc={ρ(w)as} (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).

[F18]

For B(a,a)≠0 the reflection with normal a is ra(v)=v−2B(v,a)B(a,a)a (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F20]

ρ(wsw−1)=ρ(w)rsρ(w)−1=rρ(w)es for all w∈W and s∈S (Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F22]

The Weyl group of a reduced crystallographic root system Φ is W(Φ)=⟨sα:α∈Φ⟩ (Weyl group).

[F23]

A reduced crystallographic Euclidean root system is a finite spanning set Φ⊆E∖{0} closed under its reflections, with integral Cartan integers 2(β,α)/(α,α) and Rα∩Φ={α,−α} (Reduced crystallographic Euclidean root system).

[F24]

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).

[F25]

For a reduced crystallographic root system with simple roots Δ, the set Δ is a basis of E, so ∣Δ∣=dim⁡E (Simple roots form a signed integral basis).

[F26]
[F27]
[F28]

The Weyl group of a reduced crystallographic root system is finite (The Weyl group is finite and faithful).

[F29]

For nonproportional roots of a reduced crystallographic system, nαβnβα=4cos⁡2θ∈{0,1,2,3} where θ is the angle (Rank-two root-system classification).

[F30]

Distinct simple roots of a reduced crystallographic system relative to a positive system satisfy (α,β)≤0 (Rank-two root-system classification).

[F31]

Coroots of a reduced crystallographic root system are α∨=2α/(α,α) (Coroot and dual root system).

[F32]

For a reduced crystallographic root system with base, Q=∑αZα, Q∨=∑αZα∨ and P={λ:(λ,α∨)∈Z for all α} (Root, coroot, weight, and coweight lattices).

[F33]

The Cartan matrix of a based root system has entries aij=(αj,αi∨)=2(αj,αi)/(αi,αi) (Cartan matrix of a based root system).

[F34]

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).

[F35]

Duality exchanges Bn and Cn and fixes An,Dn,E6,E7,E8,F4,G2, exchanging long and short roots for F4 and G2 (Duality exchanges B and C).

[F36]
[F37]

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).

[F38]

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: dim⁡FV=nullity⁡T+rank⁡T).

[F39]

For a subspace U of a finite-dimensional real inner product space E, E=U⊕U⊥ (For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥).

[F40]

U⊥={x∈E:(x,u)=0 for every u∈U} (Orthogonality and the orthogonal complement).

Proof

technique · direct
1.1F2F8F16

If some scaling of the geometry is crystallographic, then every edge label of Γ lies in {3,4,6}: by the label restriction every distinct pair satisfies m(s,t)∈{2,3,4,6}, and edges are exactly the pairs with m(s,t)≥3.

1.2F5F6

Since W is finite, classification clauses (1)–(2) in [F5] give that every connected component of Γ is one of the standard diagrams: An, Bn, Dn, E6,E7,E8,F4,H3,H4 or I2(m); the diagrams An, Bn, Dn, E6,E7,E8,F4 and I2(m) with m∈{3,4,6} are paths, stars or single edges, hence trees, and have all labels in {3,4,6}, while H3 and H4 contain a label 5 and I2(m) has label m; and the coincidences (4) in [F6] give I2(3)=A2, I2(4)=B2, I2(6)=G2, so the Weyl-type list is An,Bn,Dn,E6,E7,E8,F4,G2.

1.3F14F15F17F19F21

Φc is finite, contains the basis {as:s∈S} of V and hence spans V, omits 0 because every β=ρ(w)as has B(β,β)=B(as,as)=cs2≠0, is closed under negation because ρ(ws)as=−ρ(w)as, and is ρ(W)-invariant because ρ(w′)ρ(w)as=ρ(w′w)as.

1.4F18F20F21F22

For β=ρ(w)as∈Φc the conjugation identity gives rβ=ρ(w)rsρ(w)−1=ρ(wsw−1)∈ρ(W), so every root reflection maps Φc into itself and W(Φc)=⟨sβ:β∈Φc⟩⊆ρ(W); conversely ρ(s)=rs is the reflection sas in the root as∈Φc, so ρ(W)⊆W(Φc). Hence W(Φc)=ρ(W).

1.5F11

For all β,α∈Φc one has 2B(β,α)/B(α,α)=B(β,α∨)∈Z.

1.6F3F7F14F18F21

Let S1,…,Sk be the components of Γ and Vi=span⁡{es:s∈Si}, so V=V1⊕⋯⊕Vk; each generator ru fixes ev for v outside the component of u, because B(eu,ev)=0 there by the vanishing criterion for m=2, and maps each Vi into itself; hence every ρ(w) preserves every Vi, and as∈VS(s).

1.7F12F13F10

Suppose Γ is connected, all edge labels lie in {3,4,6}, and {s,t} is an edge of label p∈{4,6}. Then {s,t} is the only edge of label ≥4 and Γ contains no cycle; applying the tree construction with the root vertex on the s-side gives a crystallographic scaling c with ct=2cscos⁡(π/p), and applying it with the root on the t-side gives a crystallographic scaling c′ with cs′=2ct′cos⁡(π/p); these two scalings differ only by inverting the length ratio across {s,t}.

1.8F11

For every crystallographic scaling the conclusions of the last clause of the lemma hold: rs(at)=at−atsas and rs(at∨)=at∨−astas∨ with rs(Q)=Q and rs(Q∨)=Q∨; Q and Q∨ are ρ(W)-stable free abelian groups of rank ∣S∣; Φc⊆Q, Q=ZΦc, Q∨=ZΦc∨ with Φc∨={2β/B(β,β):β∈Φc} and Q⊆P; every element of Φc is an integral combination of the as whose nonzero coefficients have one sign; and all pairings B(β,γ∨) with β,γ∈Φc are integers.

1.9F14F18F21F26F36F37

Since B is symmetric bilinear and positive definite, (V,B) is a real inner product space, and for β∈Φc one has B(β,β)≠0 so that rβ(x)=x−2B(x,β)B(β,β)β is the orthogonal reflection in β, coinciding for β=as with the generator reflection ρ(s) because as=cses with cs>0.

1.10F1F4F23F26F28F29F30

Let Ψ be a reduced crystallographic Euclidean root system in the real inner product space E with base Δ, and let (W,S)≅(W(Ψ),{sα:α∈Δ}) be an isomorphism of Coxeter systems; write αs for the simple root corresponding to s∈S. Then W(Ψ) is finite, so W is finite and B is positive definite. For distinct s,t the roots αs,αt are positive, hence nonproportional: αs=λαt with λ>0 forces λ=1 and αs=αt by reducedness, while λ<0 contradicts positivity. By the rank-two classification (αs,αt)≤0 and nstnts=4cos⁡2θ∈{0,1,2,3}, where nst=2(αt,αs)/(αs,αs) and θ is the angle between αs and αt; hence u:=cos⁡θ satisfies u≤0 and u2=nstnts/4∈{0,1/4,1/2,3/4}.

2.1step 1.2F10

If every edge label of Γ lies in {3,4,6}, then by 1.2 every connected component of Γ is one of the Weyl-type diagrams An,Bn,Dn,E6,E7,E8,F4,G2, each of which is a tree; so Γ is a forest with all edge labels in {3,4,6} and the tree construction produces a crystallographic scaling of the geometry.

2.2step 1.5

Assume c crystallographic. If β=λγ with β,γ∈Φc and λ>0, then 2λ=B(β,γ∨)∈Z and 2/λ=B(γ,β∨)∈Z by 1.5; writing λ=p/q in lowest terms, q∣2 and p∣2, so λ∈{1/2,1,2}.

2.3step 1.6F9F14F19

If β=ρ(w)as and γ=ρ(v)at are nonzero and proportional, then s,t lie in one component by 1.6, and applying the ratio clause to that connected component gives λ2=B(β,β)/B(γ,γ)=cs2/ct2∈{1,2,1/2,3,1/3}, since ρ preserves B and B(as,as)=cs2.

2.4step 1.2step 1.7F9F14F33F34F35

For the two scalings of 1.7 put λuv:=cu/cv and λuv′:=cu′/cv′. Label-3 edges have equal lengths in both scalings, while the constructions invert the ratio across {s,t}, so λuv′=1/λuv for all u,v; since auv=2λuvB(eu,ev) and auv′=2λuv′B(eu,ev) one has auv′=(λuv′/λuv)auv=auv/λuv2, and also avu=2λvuB(ev,eu)=(1/λuv)⋅2B(eu,ev)=auv/λuv2; hence auv′=avu for all u,v, that is A′=AT. These are the two dual length assignments, the Bn/Cn alternative on a label-4 path and the two orientations of F4 and G2, with the arrow pointing from the longer to the shorter root.

2.5step 1.10F39F40

For a pair as in 1.10 put P=span⁡(αs,αt), e1=αs/∣αs∣, z=αt−(αt,e1)e1≠0 and e2=z/∣z∣. Then (e1,e2) is an orthonormal basis of P and αt=∣αt∣(ue1+ve2) with u=cos⁡θ, v=∣z∣/∣αt∣>0 and u2+v2=1. The reflection formula gives sαs(e1)=−e1, sαs(e2)=e2, sαt(e1)=−(2u2−1)e1−2uve2 and sαt(e2)=−2uve1+(2u2−1)e2, so R:=sαssαt acts on P by the matrix (cd−dc) with c=2u2−1, d=2uv, and fixes P⊥ pointwise. Since E=P⊕P⊥, a power of sαssαt is the identity exactly when its restriction Rk to P is the identity. Products of such matrices add the pairs (c,d) by (c,d)(c′,d′)=(cc′−dd′,cd′+dc′), so by induction Rk=(CkDk−DkCk) with (C1,D1)=(c,d) and the same recursion; from c2+d2=1 one gets C2=c2−d2, D2=2cd, C3=4c3−3c and D3=d(4c2−1). Since u≤0 and u2∈{0,1/4,1/2,3/4}, four cases occur: u2=0 gives c=−1, d=0 and R=−I, of order 2; u2=1/4 gives c=−1/2, d2=3/4, hence C3=1, D3=0, so R3=I while R≠I and R2≠I, of order 3; u2=1/2 gives c=0, d2=1 and R2=−I, of order 4; and u2=3/4 gives c=1/2, d2=3/4, hence C3=−1, D3=0, so R3=−I and R6=I while R,R2,R3,R4=−R,R5=−R2 all differ from I, of order 6.

3.1step 1.1step 1.2step 2.1

Combining 1.1, 1.2 and 2.1: there exists a crystallographic scaling if and only if every edge label of Γ lies in {3,4,6}, if and only if every connected component of Γ is one of the Weyl types An,Bn,Dn,E6,E7,E8,F4,G2=I2(6); in particular H3, H4 and I2(m) with m∉{2,3,4,6} admit none, while I2(3)=A2, I2(4)=B2 and I2(6)=G2 do.

3.2step 2.2step 2.3

If β=λγ with β,γ∈Φc and λ>0, then 2.2 gives λ∈{1/2,1,2} and 2.3 gives λ2∈{1,2,1/2,3,1/3}; hence λ=1 and β=γ.

3.3step 2.5F1F4

By 2.5 the order of sαssαt lies in {2,3,4,6} for every pair of distinct s,t; since m(s,t) is the order of st and the isomorphism carries st to sαssαt, the label m(s,t) lies in {2,3,4,6} whenever s,t are distinct; in particular every edge label of Γ lies in {3,4,6}.

4.1step 1.3step 3.2

For every γ∈Φc one has Rγ∩Φc={γ,−γ}: if β=λγ∈Φc with λ≠0, then −γ∈Φc by 1.3; if λ>0, step 3.2 gives β=γ, while if λ<0, applying step 3.2 to β=(−λ)(−γ) gives β=−γ.

4.2step 1.2step 3.1step 3.3

By 3.3 every edge label of Γ lies in {3,4,6}; since W is finite, 1.2 now shows that every connected component of Γ is one of An,Bn,Dn,E6,E7,E8,F4,G2=I2(6), so the type of (W,S) is one of the types listed in 3.1, and all labels lie in {2,3,4,6}.

5.1step 1.3step 1.4step 1.5step 1.8step 4.1F15F23F24F25F36F37F38

The as are exactly the simple roots of the positive system of Φc defined by a regular vector. By 1.8 every root is an integral combination ∑smsas whose nonzero coefficients have one sign, so (V,Φc) satisfies the axioms of a reduced crystallographic Euclidean root system by 1.3, 1.4, 1.5 and 4.1. Because B is positive definite, the map v↦(B(v,as))s is injective on V (a nonzero kernel vector would have B(v,v)=∑svsB(v,as)=0) and hence an isomorphism onto RS by [F38]; choose v mapping to (1,…,1). Then B(v,β)=∑smsB(v,as) has the sign of the nonzero coefficients of β, so v is regular and Φc+={β∈Φc:ms≥0}, with simple roots Δc by definition. Each as is simple: a decomposition as=β′+γ′ into positive roots would split the coordinate vector of as into nonnegative integer coordinate vectors, forcing one summand to be as and the other to be 0∉Φc. By the basis theorem Δc is a basis of V, so ∣Δc∣=dim⁡V=∣S∣=∣{as:s∈S}∣; since {as}⊆Δc, equality Δc={as:s∈S} follows.

6.1step 1.3step 1.4step 1.5step 3.1step 4.1step 5.1F23F27F31F32F33

Therefore Φc is a reduced crystallographic Euclidean root system in the inner product space (V,B): it is finite, spans V and omits 0 (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 W(Φc)=ρ(W) (1.4), and ρ:W→W(Φc) is an isomorphism because it is surjective by 1.4 and injective, carrying s to ras; the base is {as:s∈S} (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 Φc are the sets Q,Q∨,P of the scaling, its coroots are α∨=2α/B(α,α), and its Cartan matrix relative to the base {as} has entries (at,as∨)=ats, the transpose of A.

7.1step 1.1step 1.7step 1.8step 2.1step 2.4step 3.1step 4.2step 6.1∎

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

Used by

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