Alphabeta Math
Pipeline-generated
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.

✓ 2 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Crystallographic Root Lattices and Weyl Group Interfaces

1 · Prerequisites

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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices

Definition

Let S be a finite set, let m be a Coxeter matrix on S, let W be the presented Coxeter group with its universal property (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), let V=RS be the real vector space with its basis (es)s∈S, let B be the Coxeter form and let ρ:W→GL(V) be the canonical reflection homomorphism with its reflections ra 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 B is assumed.

A scaling of this geometry is a family c=(cs)s∈S of positive real numbers; with as:=cses define as∨:=2asB(as,as)=2escs,ast:=B(as,at∨)=2B(as,at)B(at,at)(s,t∈S).

Since cs>0 and (es)s∈S is a basis, the as form a basis of V and B(as,as)=cs2B(es,es)=cs2≠0 (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 as∨ is defined, and as∨=2csescs2=2escs. The reflection ras of The real Coxeter form, its radical, reflections, and form-preserving maps is the generator reflection res of the geometry, because the reflection formula depends only on the line spanned by the normal: for λ≠0 and B(a,a)≠0 substitution gives rλa(v)=v−2B(v,λa)B(λa,λa)λa=v−2B(v,a)B(a,a)a=ra(v), so rλa=ra, and as=cses with cs>0. The number ast∈R is the Cartan number of the ordered pair (s,t), and ass=B(as,as∨)=B(as,2asB(as,as))=2.

The scaling c is crystallographic when ast∈Z for all s,t∈S, equivalently when B(at,as∨)∈Z for all s,t∈S. In that case define the root lattice, coroot lattice and weight lattice of the scaling by Q:=∑s∈SZas,Q∨:=∑s∈SZas∨,P:={λ∈V:B(λ,q∨)∈Z for all q∨∈Q∨}, the scaled root set Φc:={ρ(w)as:w∈W, s∈S}, and the scaled Cartan matrix A:=(ast)s,t∈S of c.

Well-definedness, lattice provisos, and the interface with the published lattices

as=cses and as∨=2es/cs are nonzero scalar multiples of the basis vectors es, so both (as)s∈S and (as∨)s∈S are bases of V. Thus Q and Q∨ are free abelian subgroups of rank ∣S∣. The set P is an additive subgroup, since each condition B(λ,q∨)∈Z is preserved by addition and negation. If q=∑s∈Smsas∈Q and q∨=∑t∈Sntat∨∈Q∨ with ms,nt∈Z, then B(q,q∨)=∑s,t∈SmsntB(as,at∨)=∑s,t∈Smsntast∈Z in the crystallographic case, so Q⊆P.

Here a lattice in V means a discrete subgroup whose real span is V; this convention includes the rank-zero lattice {0} when V=0. The map φ:V⟶RS,φ(λ):=(B(λ,as∨))s∈S, is linear. Because (as∨)s∈S is a basis and B is symmetric, ker⁡φ=rad⁡(B): vanishing against each as∨ is equivalent by linearity to vanishing against every vector of V. Hence φ is injective exactly when B is nondegenerate; both its domain and codomain have dimension ∣S∣, so the rank-nullity theorem (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T) makes this equivalent to φ being an isomorphism. If φ is an isomorphism then P=φ−1(ZS) is the Z-span of the real basis (ωs)s∈S characterized by B(ωs,at∨)=δst, so it is a lattice. If B is degenerate then rad⁡(B)⊆P, so P contains a nonzero linear subspace and is not discrete. For instance for S={s,t}, m(s,t)=∞, cs=ct=1 one has B(es,et)=−1 and P={λ:λs−λt∈12Z}, a union of parallel lines. In particular P 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 P without a discreteness claim.

When B is positive definite and Φc has been proved to be a reduced crystallographic Euclidean root system with base {as:s∈S} (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗ (2)), the sets Q, Q∨ and P 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 as∨=2asB(as,as) 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 H3, H4, or I2(m) with m∉{2,3,4,6}. It also does not assert that Φc is a root system, that Q=ZΦc, or that any pairing B(β,γ∨) of non-simple elements of Φc 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: S is finite and every object above is defined from the given finite data.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Cartan-number products, allowed edge labels, tree scalings and reflection 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 (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 c be a scaling with scaled simple roots as, coroots as∨ and Cartan numbers ast=B(as,at∨) (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).

(1) Products. ass=2 for every s; for distinct s,t with m(s,t)<∞, ast=−2csctcos⁡πm(s,t)≤0,astats=4cos⁡2πm(s,t), and for m(s,t)=∞ one has ast=−2cs/ct and astats=4. Moreover ast=0 if and only if m(s,t)=2.

(2) Allowed labels and length ratios. Assume that B is positive definite and that c is crystallographic. Then for all distinct s,t 0≤astats<4,soastats∈{0,1,2,3}, and m(s,t)∈{2,3,4,6}, according to astats=4cos⁡2(π/m(s,t))=0,1,2,3. If Γ is connected and has an edge of label 4 (respectively 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∈S; if Γ has no edge of label ≥4, then cs=ct for all s,t in the same connected component.

(3) Realizations on trees. Let Γ be a forest (disjoint union of trees) all of whose edge labels lie in {3,4,6}. Choose a root vertex in each component, set cs0:=1 at each root, and for every edge {s,t} with s on the root side and t the other endpoint set ct:=2cscos⁡(π/m(s,t)). Then c is positive and crystallographic: on every edge {s,t} with s the root-side endpoint, ast=−1,ats=−4cos⁡2πm(s,t)∈{−1,−2,−3}, while ast=0 for non-adjacent s,t and ass=2.

(4) Lattices, integrality and stability. Assume that c is crystallographic. Then for all s,t rs(at)=at−atsas,rs(at∨)=at∨−astas∨, hence rs(Q)=Q and rs(Q∨)=Q∨. Consequently Q and Q∨ are ρ(W)-stable lattices of rank ∣S∣, Φc⊆Q, Q=ZΦc, Q∨=ZΦc∨, and Q⊆P. Here, for β=ρ(w)as∈Φc, write β∨:=2β/B(β,β); this is defined because ρ preserves B and B(as,as)=cs2>0, and Φc∨:={β∨:β∈Φc}. Moreover every element of Φc is an integral linear combination of the as whose nonzero coefficients all have the same sign, and B(β,γ∨)∈Z for all β,γ∈Φc.

Facts & Assumptions

Given: A finite set S, a Coxeter matrix m on S, the presented group W, the space V=RS with its Coxeter form B, the canonical reflection homomorphism ρ, the diagram Γ, and a scaling c with scaled simple roots as, coroots as∨ and Cartan numbers ast. In (2) and in the ratio clause below, B is assumed positive definite and c crystallographic; in (3) Γ is assumed to be a forest with all edge labels in {3,4,6}; in (4) c is assumed crystallographic.

[F1]

S is finite and m(s,s)=1, while m(s,t)=m(t,s)∈{2,3,… }∪{∞} for s≠t (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

Every element of W is a product of elements of S, by the definition of the length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F3]

B is the unique symmetric bilinear form on V with B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞ (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F4]

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

[F5]

Such a reflection ra is linear, satisfies ra2=idV, ra(a)=−a and B(rau,raw)=B(u,w) for all u,w (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F7]

V+={∑s∈Sλses:λs≥0} is the positive cone (The canonical reflection homomorphism, roots, reflections, and the positive cone).

[F8]

ρ preserves B: B(ρ(w)u,ρ(w)w′)=B(u,w′) for all w∈W and u,w′∈V (Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F9]

Every root of Φ={ρ(w)es} lies in V+∖{0} or in −V+∖{0} (Root sign coherence and the action of simple reflections on positive roots).

[F10]

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

[F11]

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

[F12]

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

[F14]
[F15]

In a real inner product space, ∣⟨u,v⟩∣≤∥u∥ ∥v∥, with equality if and only if u,v are linearly dependent (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F16]

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

[F17]
[F18]

The Coxeter diagram has vertex set S, with an edge between s≠t exactly when m(s,t)≥3, labelled m(s,t); connectivity and components are those of the underlying graph (Coxeter diagrams: edges, labels, components and finite type).

[F19]

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

[F20]

A forest is a graph containing no cycle, and a tree is a connected forest (Trees, forests, leaves and isolated vertices).

[F21]
[F22]

sin⁡ and cos⁡ are the power series functions, so cos⁡0=1 (Sine and cosine defined by their real power series).

[F24]

cos⁡(π/2)=0 and cos⁡π=−1 (Quarter-turn values and shifts by pi/2 and pi).

[F25]

Cosine is strictly decreasing on [0,π] (Signs, monotonicity intervals, and ranges of sine and cosine).

[F26]

cos⁡(2x)=2cos⁡2x−1 for all real x (Double-angle and quadratic power-reduction identities).

[F27]
[F28]

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

Proof

technique · direct
1.1F3F10givenalgebra

For all s,t∈S one has ast=2csctB(es,et); in particular ass=2 and as∨=2escs.

1.2F1F3F10F23F24F25algebra

For distinct s,t with m(s,t)<∞ one has ast=−2csctcos⁡πm(s,t)≤0 and astats=4cos⁡2πm(s,t); for m(s,t)=∞ one has ast=−2cs/ct<0 and astats=4; and ast=0 exactly when m(s,t)=2. Indeed 2≤m(s,t)<∞ gives π/m(s,t)∈(0,π/2], where cos⁡≥0 and cos⁡=0 only at π/2 because cos⁡ is strictly decreasing on [0,π] with cos⁡(π/2)=0.

1.3F22F23F24F25F26F27algebra

The values cos⁡π2=0, cos⁡π3=12, cos⁡2π4=12 and cos⁡2π6=34 hold, and cos⁡x>0 for 0<x<π2. For the first, cos⁡(π/2)=0; putting c:=cos⁡(π/3), the supplementary identity at x=π/3 gives cos⁡(2π/3)=−c while the double-angle identity gives cos⁡(2π/3)=2c2−1, so 2c2+c−1=(2c−1)(c+1)=0 and c>0 (as 0<π/3<π/2 and cos⁡ decreases from cos⁡(π/2)=0) force c=12; the double-angle identity at x=π/4 gives 2cos⁡2(π/4)−1=cos⁡(π/2)=0, and at x=π/6 it gives 2cos⁡2(π/6)−1=cos⁡(π/3)=12.

1.4F3F10F13F14F15F16F17algebra

If B is positive definite then (V,B) is a real inner product space, and for linearly independent u,v∈V one has B(u,v)2<B(u,u)B(v,v); moreover for distinct s,t the vectors as=cses and at=ctet are linearly independent.

1.5F18F20F21F23F24F25algebra

Let Γ be a forest whose edge labels lie in {3,4,6}, with a root chosen in each component. Then each component is a tree, every vertex t other than its root has a unique neighbour s on its path to that root, and the prescription cs0:=1, ct:=2cscos⁡(π/m(s,t)) determines a unique positive value ct for every vertex.

1.6F3F4F6F10algebra

Writing rs:=ρ(s)=res for s∈S, the reflection formula gives, for all s,t, rs(at)=at−atsas and rs(at∨)=at∨−astas∨.

2.1step 1.2step 1.3step 1.4F11F25algebra

Assume B positive definite and c crystallographic. Then for distinct s,t one has 0≤astats<4, so astats∈{0,1,2,3}; and m(s,t)∈{2,3,4,6}, with 4cos⁡2(π/m(s,t))=0,1,2,3 for m=2,3,4,6 respectively. The bound < uses strict Cauchy-Schwarz in the basis-independent pair as,at; the four values use step 1.3; and no other m occurs because m=5 gives 1/2<cos⁡2(π/5)<3/4 (from π/6<π/5<π/4 by decrease of cos⁡), so 4cos⁡2(π/5)∈(2,3), while 7≤m<∞ gives 3/4<cos⁡2(π/m)<1, so 4cos⁡2(π/m)∈(3,4), and m=∞ gives the product 4.

2.2step 1.1step 1.2step 1.3step 1.5F18algebra

Let Γ be a forest with edge labels in {3,4,6} and let c be the tree scaling of step 1.5. Then c is crystallographic: on every edge {s,t} with s the root-side endpoint, ast=−1 and ats=−4cos⁡2(π/m(s,t))∈{−1,−2,−3}; for non-adjacent distinct s,t one has ast=0; and ass=2.

2.3step 1.6F2F6F7F9F10F11algebra

Assume c crystallographic. In the formulas of step 1.6, the coefficients ats and ast are integers by [F11], so each generator matrix rs has integer entries in both bases (at) and (at∨). Every w∈W is a finite product of elements of S [F2], and ρ is a homomorphism with ρ(s)=rs [F6]; therefore the matrices of ρ(w) in both bases have integer entries. In particular, for every w∈W and t∈S, ρ(w)at is an integral linear combination of the as. The a-basis coefficients of ρ(w)as all have one sign because ρ(w)as=csρ(w)es has, in the e-basis, coefficients of one sign by [F9] and [F7], and re-expressing in the a-basis multiplies the t-th coefficient by the positive factor cs/ct.

2.4step 1.6F2F5F6F10F11F12F13F14algebra

Assume c crystallographic. Step 1.6 and [F11] give rs(at)∈Q and rs(at∨)∈Q∨ for all s,t, hence rs(Q)⊆Q and rs(Q∨)⊆Q∨; since rs2=id by [F5], applying rs gives the reverse inclusions, so both are equalities. Since W is generated by S and ρ(s)=rs [F2, F6], every ρ(w) preserves Q and Q∨. Because (as) and (as∨) are bases of V, their Z-spans Q and Q∨ are free abelian groups of rank ∣S∣ and are ρ(W)-stable.

3.1step 1.1step 1.2step 1.3step 2.1algebra

Assume B positive definite and c crystallographic, and let {s,t} be an edge of Γ with label m∈{3,4,6}; put p:=4cos⁡2(π/m)∈{1,2,3}. Then ast and ats are negative integers with product p, so {∣ast∣,∣ats∣}={1,p} and cs2ct2=ast2p∈{1/p,p}; in particular every edge of label 3 has cs=ct.

3.2step 1.1step 2.3step 2.4F3F8F10F12algebra

Assume c crystallographic. By step 2.3, Φc⊆Q, hence ZΦc⊆Q, and since each as∈Φc also Q⊆ZΦc, so Q=ZΦc. Likewise, for β=ρ(w)as the identity β∨=2βB(β,β)=ρ(w)2asB(as,as)=ρ(w)as∨ (using preservation of B) shows that each element of Φc∨ lies in Q∨ by step 2.4, so ZΦc∨⊆Q∨, while as∨=2asB(as,as) with as∈Φc gives the reverse inclusion; hence Q∨=ZΦc∨. Finally Q⊆P, since B(as,q∨)=∑tntast∈Z for q∨=∑tntat∨∈Q∨ by bilinearity and integrality of the ast, so each as lies in P and P is an additive subgroup.

3.3step 2.3F3F8F10algebra

Assume c crystallographic. For β=ρ(w)as and γ=ρ(v)at in Φc one has 2γB(γ,γ)=ρ(v)at∨ and B(β,ρ(v)at∨)=B(ρ(v)−1β,at∨)=∑umuaut∈Z, where ρ(v)−1β=ρ(v−1w)as=∑umuau has integer coefficients mu by step 2.3.

4.1step 3.1F18F19F28algebra

Assume B positive definite, c crystallographic and Γ connected. Then Γ has at most one edge of label ≥4, every other edge has label 3 and hence squared length ratio 1; for any two vertices the squared ratio cs2/ct2 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 1 when the path avoids the multi-edge and 2±1 or 3±1 when it crosses a label-4 or label-6 edge. Consequently cs2/ct2∈{1,2,2−1} for all s,t when an edge of label 4 exists, cs2/ct2∈{1,3,3−1} when an edge of label 6 exists, and cs=ct for all s,t∈S when no edge of label ≥4 exists.

5.1step 1.1step 1.2step 1.5step 1.6step 2.1step 2.2step 2.3step 2.4step 3.1step 3.2step 3.3step 4.1∎

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources