Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

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.

Depends on

Used by

Dependency tree · two levels

115 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