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.

Root normals inside the moved space, factorizations into reflections, and independent normals

Statement

Let (W,S) be a Coxeter system of finite type with S finite, with V=RS, positive definite Coxeter form B, canonical reflection representation ρ, root system Φ and reflection set T (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), with the chamber system wC, the open faces wCI and the root hyperplanes Hα={x∈V:B(x,α)=0} of the transferred dual action (The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset), and let ℓT, M, F and ≤O be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator; for u∈W write M(u)=M(ρ(u)) and F(u)=F(ρ(u)). Then:

(1) Root normals in the moved space. Let w∈W with w≠1. Then dim⁡M(w)>0 and there is a root α∈Φ with F(w)⊆Hα. For every such root one has α∈M(w), and the reflection tα∈T with ρ(tα)=rα (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1), Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) satisfies

ρ(tα)≤Oρ(w),dim⁡M(w)=1+dim⁡M(tαw).

(2) Factorizations and Carter's formula. Every w∈W is a product w=t1t2⋯tk of k=dim⁡M(w) reflections ti∈T, and no product of fewer elements of T represents w; equivalently

ℓT(w)=dim⁡M(w).

(3) Independent normals. Let t1,…,tm∈T and choose roots αi∈Φ with ρ(ti)=rαi. Then dim⁡M(t1⋯tm)≤m; and if dim⁡M(t1⋯tm)=m — in particular if t1⋯tm is a shortest reflection factorization of its product — then the m vectors

α1, ρ(t1)α2, ρ(t1t2)α3, …, ρ(t1t2⋯tm−1)αm

are linearly independent (Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent) and span M(t1⋯tm).

Facts & Assumptions

Given: The finite-type Coxeter datum V=RS, B, ρ, Φ, T, W and the elements w,t1,…,tm above; M(u)=M(ρ(u)), F(u)=F(ρ(u)) and ℓT are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.

[F1]

For I⊆S the open face is CI={v∈C:B(v,es)=0 for s∈I, B(v,es)>0 for s∉I}, the root hyperplane is Hα={v∈V:B(v,α)=0}, and wCI⊆wHes for s∈I; moreover V∖{0} is the disjoint union of the sets wCI over the left cosets wWI with I⊊S, and Stab⁡W(x)=wWIw−1 for every x∈wCI. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere

[F2]

No finite family of proper subspaces of a finite-dimensional vector space over an infinite field covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces

[F3]

Every root α∈Φ satisfies B(α,α)=1, and there is a unique tα∈T with ρ(tα)=rα. The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange

[F5]

For a∈V with B(a,a)≠0 the map ra is linear, preserves B, fixes every v with B(v,a)=0, and satisfies ra(a)=−a; consequently ra(v)−v∈Ra for every v, so M(ra)=Ra. Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order Descent of the reflection representation, unit root norms, and conjugation of reflections

[F6]

On the positive definite space (V,B) the Wall form lemma holds: (1) dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y) for X,Y∈O(V) and M(A)=F(A)⊥ for A∈O(V); (3) for every subspace U⊆M(A) the operator AU of the lemma satisfies M(AU)=U, and every line L⊆V is the moved space of exactly one reflection of O(V), namely id−2ΠL; (4) AU≤OA and dim⁡M(A)=dim⁡U+dim⁡M(AU−1A) for every U⊆M(A). The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F7]

ρ is a group homomorphism, so ρ(uv)=ρ(u)ρ(v) and ρ(1)=idV (The canonical reflection homomorphism, roots, reflections, and the positive cone). ℓT(w) is the least k over products of k elements of T; M(u)=M(ρ(u)), F(u)=F(ρ(u)); and T={wsw−1:w∈W, s∈S} with (W,S) presented as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

[F8]

For a subspace U of a finite-dimensional space Z, dim⁡U≤dim⁡Z, with equality exactly when U=Z. A finite-dimensional space has a basis, obtained as the extension of any linearly independent subset; a basis is an independent spanning set and its cardinality is the dimension of the space. If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis

[F10]

A list of vectors is linearly dependent exactly when some nontrivial linear relation holds, and dependence of w1,…,wm lets one of the vectors be solved for as a combination of the others; the span of a set is the set of its finite linear combinations. Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S

Proof

technique · direct
1.1F1F2F4F5F6given

Let w≠1. First dim⁡M(w)>0: otherwise M(ρ(w))=0, so ρ(w)−id=0 and ρ(w)=id, whence w=1 by [F4], a contradiction. Next, a root α with F(w)⊆Hα exists. If F(w)=0 then F6 gives M(w)=F(w)⊥=V≠0, so S≠∅ and α:=es for any s∈S is a root with F(w)=0⊆Hα. Suppose now that F(w)≠0; let Φ′⊆Φ be the finite set of roots with F(w)⊈Hα, so that each Hα∩F(w) with α∈Φ′ is a proper subspace of the finite-dimensional real space F(w); the finite family consisting of those subspaces and {0} consists of proper subspaces of F(w), since F(w)≠0; by [F2] its union does not cover F(w), so there is 0≠x∈F(w) with x∉Hα for every α∈Φ′, including when Φ′=∅; for every root β the implication x∈Hβ⇒F(w)⊆Hβ holds, and x is fixed by w, so w∈Stab⁡W(x). By [F1] there are w0∈W and I⊊S with x∈w0CI and Stab⁡W(x)=w0WIw0−1; since w≠1 lies in this stabiliser, I≠∅, so for s∈I one has x∈w0CI⊆w0Hes=Hρ(w0)es by [F1], the equality following from the B-invariance of ρ(w0) [F5]; the implication above with β:=ρ(w0)es gives F(w)⊆Hρ(w0)es for the root ρ(w0)es∈Φ, so in this case a root with the required property exists as well. Finally, if F(w)⊆Hα, then B(f,α)=0 for all f∈F(w), so α∈F(w)⊥=M(w) by F6.

1.2F3F5

Let t∈T and let α∈Φ satisfy ρ(t)=rα, as supplied by [F3]. Then rα(v)−v=−2B(v,α)α for every v by [F5], so M(t)=M(rα)=Rα and dim⁡M(t)=1; also ρ(t)−1=ρ(t)=ρ(t−1) because t2=1.

1.3F6

For X,Y∈O(V) one has dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y) by F6.

1.4F7algebragiven

For t1,…,tm∈T, the telescoping identity is ρ(t1⋯tm)−id=∑i=1mρ(t1⋯ti−1)(ρ(ti)−id): each summand is ρ(t1⋯ti)−ρ(t1⋯ti−1), by the homomorphism property of ρ. Thus M(t1⋯tm)⊆∑i=1mρ(t1⋯ti−1)M(ti).

1.5F8F9F10

Linear-algebra tool. Let Z be a finite-dimensional vector space spanned by vectors w1,…,wm. Then dim⁡Z≤m: by [F8] Z has a basis B with ∣B∣=dim⁡Z, and B is linearly independent while Z is spanned by w1,…,wm, so [F9] gives dim⁡Z≤m. If moreover dim⁡Z=m, then w1,…,wm are linearly independent: otherwise a nontrivial relation expresses some wj as a combination of the remaining m−1 vectors by [F10], those remaining vectors still span Z by [F10], and [F9] would give dim⁡Z≤m−1, a contradiction.

2.1step 1.2step 1.3

A product of k elements of T has moved dimension at most k: by step 1.2 each factor has moved dimension 1, and step 1.3 applied k times bounds the moved dimension of the product by the sum k.

2.2step 1.1step 1.2F3F6

Let α∈Φ satisfy F(w)⊆Hα and α∈M(w), as produced by step 1.1. Then Rα is a line contained in M(ρ(w)), and by F6 and [F3] the unique reflection of O(V) with moved space Rα is id−2ΠRα=rα=ρ(tα); hence ρ(tα)=(ρ(w))Rα in the notation of [F6]. Applying F6 with A=ρ(w) and U=Rα gives ρ(tα)≤Oρ(w) and dim⁡M(w)=dim⁡Rα+dim⁡M(ρ(tα)−1ρ(w))=1+dim⁡M(tαw), the last equality because ρ(tα)−1ρ(w)=ρ(tα−1w)=ρ(tαw) by steps 1.1 and 1.2.

2.3step 1.2step 1.4step 1.5F8

Let t1,…,tm∈T and put vi:=ρ(t1⋯ti−1)αi and Z:=span⁡{v1,…,vm}. Steps 1.2 and 1.4 give M(t1⋯tm)⊆Z. Since Z is spanned by these m vectors, step 1.5 gives dim⁡Z≤m; [F8] applied to the subspace M(t1⋯tm) of Z yields dim⁡M(t1⋯tm)≤dim⁡Z≤m.

3.1step 2.1step 2.2F7

Carter's formula and factorization: every w∈W satisfies ℓT(w)=dim⁡M(w), and w is a product of exactly dim⁡M(w) elements of T. If w=1, then dim⁡M(w)=0 and the empty product represents 1, giving both assertions. If w≠1 with dim⁡M(w)=k≥1, step 2.2 supplies t:=tα∈T with dim⁡M(tw)=k−1; by induction on k (applied to tw, whose moved dimension is k−1) there are t2,…,tk∈T with tw=t2⋯tk, so w=t⋅(tw)=tt2⋯tk is a product of k elements of T. For the reverse inequality let w=s1⋯sj with s1,…,sj∈T; then k=dim⁡M(w)=dim⁡M(ρ(s1)⋯ρ(sj))≤j by step 2.1, so no shorter product of elements of T represents w and ℓT(w)=k by [F7].

4.1step 1.5step 2.3step 3.1F8given∎

Suppose dim⁡M(t1⋯tm)=m and put vi:=ρ(t1⋯ti−1)αi as in step 2.3. Step 2.3 gives M(t1⋯tm)⊆Z with m=dim⁡M(t1⋯tm)≤dim⁡Z≤m, so dim⁡Z=m and M(t1⋯tm)=Z by [F8]. Thus the vi span M(t1⋯tm), and by step 1.5 the vectors v1,…,vm are linearly independent and hence form a basis of M(t1⋯tm): this is the independence and spanning assertion of (3). Finally, if t1⋯tm is a shortest reflection factorization of its product u:=t1⋯tm, then m=ℓT(u)=dim⁡M(u) by step 3.1, so the hypothesis dim⁡M(t1⋯tm)=m holds and the same conclusion applies. This proves (1), (2) and (3).

Depends on

Used by

Dependency tree · two levels

155 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