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.

Chamber collisions, point stabilizers, and the intersection rule

Statement

Let S, m, W, ℓ, V, B, ρ, Φ, C, C∘, the chambers wC and the Tits cone U be as in The Tits cone, its interior, and the negative-root set of a functional; for I⊆S put WI:=⟨s:s∈I⟩ (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups) and for f∈V∗ put S(f):={s∈S:f(es)=0}.

(1) Walls are root hyperplanes. For all w∈W and s∈S, wHes=Hρ(w)es; hence the walls of the chamber system are exactly the root hyperplanes Hα, α∈Φ.

(2) Side rule. For all w∈W and s∈S, wC∘⊆{f∈V∗:f(es)>0}  ⟺  ℓ(sw)>ℓ(w),wC∘⊆{f∈V∗:f(es)<0}  ⟺  ℓ(sw)<ℓ(w), and exactly one of the two alternatives holds. If ℓ(sw)<ℓ(w) then C⊆{f:f(es)≥0} and wC⊆{f:f(es)≤0}: the chambers C and wC lie on opposite sides of the wall Hes.

(3) Collision. If f,g∈C, w∈W and w⋅f=g, then f=g and w∈WS(f).

(4) Point stabilizers. For every f∈C, Stab⁡W(f)=WS(f). For f∈U and w∈W with w−1⋅f∈C one has Stab⁡W(f)=w WS(w−1⋅f) w−1.

(5) The intersection rule. For every w∈W, with C‾T:={f∈C:f(es)=0 for all s∈T}, wC∩C={f∈C:w∈WS(f)}=⋃T⊆Sw∈WTC‾T.

(6) Strict fundamental domain. Every W-orbit contained in U meets C in exactly one point. In particular the open chambers wC∘ (w∈W) are pairwise disjoint, and the chambers meeting in a face are described by (5).

Facts & Assumptions

Given: A finite set S, a Coxeter matrix m, the presented group W with length ℓ, V=RS with Coxeter form B, the canonical reflection homomorphism ρ with root system Φ, the closed chamber C, its interior C∘, the chambers wC, the Tits cone U and the root hyperplanes Hα, all as in The Tits cone, its interior, and the negative-root set of a functional and The dual action, chambers, faces, and root hyperplanes; for I⊆S let WI=⟨s:s∈I⟩, and for f∈V∗ let S(f)={s∈S:f(es)=0}.

[F1]

The chamber system and the Tits cone are wC={w⋅f:f∈C} and U=⋃w∈WwC, and w′U=U for every w′∈W. (The Tits cone, its interior, and the negative-root set of a functional (1)-(2)).

[F2]

The dual action is (w⋅f)(v)=f(ρ(w)−1v), and it is a left action: id⋅f=f and w1⋅(w2⋅f)=(w1w2)⋅f; the closed chamber is C={f:f(es)≥0 for all s}, the open chamber is C∘={f:f(es)>0 for all s}, and the root hyperplane is Hα={f:f(α)=0}. (The dual action, chambers, faces, and root hyperplanes (1)-(2), The dual action, the faces, and the rank-two chamber tiling (1)).

[F3]

Every root has a sign: Φ=Φ+⊔Φ−, every root lies in V+∖{0} or in −V+∖{0} and not in both, and every f∈C∘ satisfies f(α)>0 for α∈Φ+ and f(α)<0 for α∈Φ−. (Root sign coherence and the action of simple reflections on positive roots (2)).

[F4]

Root-length criterion: for all w∈W and s∈S, ℓ(ws)>ℓ(w) if and only if ρ(w)es∈Φ+, and ℓ(ws)<ℓ(w) if and only if ρ(w)es∈Φ−. (The root-length criterion and faithfulness of the canonical reflection representation (1)).

[F5]

The reflection with normal es is rsv=v−2B(v,es)es and B(es,es)=1. (The real Coxeter form, its radical, reflections, and form-preserving maps (2)-(3)).

[F6]

Each rs is a linear involution fixing pointwise every v with B(v,es)=0. (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)).

[F7]

One has ρ(s)=rs for every s∈S, and Φ={ρ(w)es:w∈W, s∈S}. (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)-(2)).

[F8]

Every w∈W has a reduced expression w=s1⋯sk with k=ℓ(w); reversing a reduced word for w gives a word of the same length for w−1, so ℓ(w−1)≤ℓ(w), and applying the same argument to w−1 gives ℓ(w−1)=ℓ(w). (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F9]

Parity and exchange: ℓ(sw)=ℓ(w)±1 for all w and s; and if ℓ(sw)=ℓ(w)−1 then w has a reduced expression beginning with s, so w=sw′ with ℓ(w′)=ℓ(w)−1. (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (1)-(2)).

[F10]

WI=⟨s:s∈I⟩ is the subgroup generated by I, and ⟨∅⟩={1}. (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F11]

Two linear functionals agreeing on the basis (es)s∈S of V are equal, and (es) is a basis. (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F12]

The dual space carries pointwise addition and scalar multiplication, and its elements are linear. (Linear functionals and the algebraic dual V∗=L(V,F)).

Proof

technique · direct, by the side rule and induction on word length
1.1F1F2F7algebra

Walls are root hyperplanes. For w∈W, s∈S and f∈V∗ one has f∈wHes if and only if (w−1⋅f)(es)=0, and by the dual action this is f(ρ(w)es)=0, that is f∈Hρ(w)es; hence wHes=Hρ(w)es. As Φ={ρ(w)es:w∈W, s∈S}, the walls wHes of the chambers are exactly the root hyperplanes Hα with α∈Φ. This is (1).

1.2F2F3F4F8F9algebra

The side rule. Let w∈W, s∈S, x∈C∘ and put β:=ρ(w)−1es, so that (w⋅x)(es)=x(β). By the signed root system, either β∈Φ+ and then x(β)>0, or β∈Φ− and then x(β)<0, so the sign of (w⋅x)(es) is the same for every x∈C∘. By the root-length criterion applied to w−1, β=ρ(w−1)es∈Φ+ if and only if ℓ(w−1s)>ℓ(w−1), and ℓ(w−1s)=ℓ(sw), ℓ(w−1)=ℓ(w) because lengths are inversion-invariant; hence wC∘⊆{f:f(es)>0} if and only if ℓ(sw)>ℓ(w), and wC∘⊆{f:f(es)<0} if and only if ℓ(sw)<ℓ(w). Parity ℓ(sw)=ℓ(w)±1 makes the two alternatives exclusive and exhaustive. If ℓ(sw)<ℓ(w) and x∈C, then β∈Φ−, so β=−b with b∈Φ+∖{0} and (w⋅x)(es)=x(−b)=−x(b)≤0 because x≥0 on V+ and Φ+⊆V+∖{0}; thus wC⊆{f:f(es)≤0}, while C⊆{f:f(es)≥0} by definition. This is (2).

1.3F1F10algebra

Collision, claim and base case. Claim: if f,g∈C, w∈W and w⋅f=g, then f=g and w∈WS(f). Proceed by induction on k:=ℓ(w). For k=0 one has w=1, so f=g and 1∈WS(f).

2.1F2F5F6F7F10F11F12step 1.2step 1.3algebra

Collision, induction step. Let k≥1 and suppose the claim known for all elements of length k−1. A reduced expression of w begins with some s∈S and has length k, so w=sw′ with ℓ(w′)=k−1 and ℓ(sw)=k−1<ℓ(w). By step 1.2 the chambers C and wC lie on opposite sides of the wall Hes: C⊆{f:f(es)≥0} and wC⊆{f:f(es)≤0}. Since g=w⋅f lies in both, g(es)=0. Then s⋅g=g: for t≠s the reflection formula gives rset=et−2B(et,es)es, so (s⋅g)(et)=g(rset)=g(et)−2B(et,es)g(es)=g(et) using g(es)=0; and (s⋅g)(es)=g(rses)=g(−es)=0=g(es). Two linear functionals agreeing on the basis (es)s∈S are equal, so s⋅g=g and hence g=s⋅g=s⋅(w⋅f)=(sw)⋅f=w′⋅f. The induction hypothesis applied to w′ and the pair (f,g) gives f=g and w′∈WS(f). Since g(es)=0 and f=g, also s∈S(f); therefore w=sw′∈WS(f) because WS(f) is the subgroup generated by S(f). This completes (3).

3.1F1F10step 2.1algebra

Point stabilizers. Let f∈C. If s∈S(f), the computation of step 2.1 with g=f gives s⋅f=f, so every element of the subgroup WS(f) generated by these s fixes f; hence WS(f)⊆Stab⁡W(f). Conversely, if w⋅f=f with f∈C, then (3) applied to the pair (f,f) gives w∈WS(f); hence Stab⁡W(f)=WS(f). For the second formula, Stab⁡W(w⋅g)=wStab⁡W(g)w−1 holds in any group action: an element x fixes g if and only if wxw−1 fixes w⋅g. Given f∈U and w with w−1⋅f∈C, applying the first formula to g:=w−1⋅f gives Stab⁡W(f)=w WS(w−1⋅f) w−1. This is (4).

4.1step 2.1step 3.1F10algebra

The intersection rule. Let f∈C and w∈W. If f∈wC∩C, then w−1⋅f∈C and (3) applied to the element w−1 and the pair (f, w−1⋅f) gives f=w−1⋅f and w−1∈WS(f), that is w∈WS(f); conversely, if f∈C and w∈WS(f), then w⋅f=f by step 3.1, so f∈wC∩C. This proves wC∩C={f∈C:w∈WS(f)}. For the second description, note that f∈C‾T means f∈C and f(es)=0 for all s∈T, so T⊆S(f); hence if f∈C‾T and w∈WT then w∈WS(f), and conversely for f∈C with w∈WS(f) one has f∈C‾S(f) with w∈WS(f). Therefore wC∩C={f∈C:w∈WS(f)}=⋃T⊆S, w∈WTC‾T. This is (5).

5.1F1F10step 2.1step 4.1algebra∎

The strict fundamental domain. Every f∈U lies in some chamber wC, so w−1⋅f∈C: every W-orbit contained in U meets C. If x,y∈C lie in one orbit, say y=w⋅x, then (3) gives x=y. For the disjointness of open chambers, if z∈wC∘∩vC∘ put f:=w−1⋅z and g:=v−1⋅z, so that f,g∈C∘ and g=(v−1w)⋅f; (3) applied to the element v−1w gives f=g and v−1w∈WS(f)=W∅={1}, so v−1w=1 and w=v. The chambers meeting in a face are described by step 4.1. This is (6).

Depends on

Used by

Dependency tree · two levels

93 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