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.

The root-length criterion and faithfulness of the canonical reflection representation

Statement

Let S be a finite set, m a Coxeter matrix, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B and canonical reflection homomorphism ρ:W→GL(V) with root system Φ (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let Φ+,Φ− be the positive and negative roots and C∘ the open chamber of the dual action (Root sign coherence and the action of simple reflections on positive roots).

(1) Root-length criterion. For all w∈W and s∈S, ℓ(ws)>ℓ(w)  ⟺  ρ(w)es∈Φ+,ℓ(ws)<ℓ(w)  ⟺  ρ(w)es∈Φ−.

(2) Disjoint chambers. If wC∘∩C∘≠∅ for some w∈W, then w=1. Equivalently, the chambers wC∘ (w∈W) are pairwise disjoint, that is, C∘ is prefundamental for the W-action on V∗ in the sense that wC∘∩C∘≠∅ forces w=1 for every w∈W.

(3) Faithfulness. The homomorphism ρ is injective, the dual action W→GL(V∗) is injective, and for every w≠1 there is s∈S with ρ(w)es∈Φ−.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the presented group W with length function ℓ, the space V=RS with Coxeter form B, the canonical reflection homomorphism ρ with root system Φ=Φ+⊔Φ−, and the dual action on V∗ with open chamber C∘ and half-spaces Bs={f∈V∗:f(es)>0}, sBs={f∈V∗:f(es)<0}.

[F1]

For every w∈W and s∈S: the chamber wC∘ satisfies wC∘⊆Bs or wC∘⊆sBs, and wC∘⊆sBs if and only if ℓ(sw)<ℓ(w); for s≠t the rank-two half-space alternative and the induction (Pn), (Qn) hold (The rank-two half-space alternative and the chamber-length induction (Pn), (Qn)).

[F2]

For every w∈W and s∈S: ρ(w)es∈Φ−  ⟺  w−1C∘⊆sBs and ρ(w)es∈Φ+  ⟺  w−1C∘⊆Bs; moreover C∘⊆Bs and Bs∩sBs=∅ for every s, and C∘≠∅ (Root sign coherence and the action of simple reflections on positive roots, The dual action, chambers, faces, and root hyperplanes).

[F3]

For all w∈W and s∈S one has ℓ(ws)=ℓ(w)±1, and ℓ is invariant under inversion: ℓ(w−1)=ℓ(w); every element w≠1 has a reduced expression w=s1⋯sn with n=ℓ(w)≥1, and then w=(s1⋯sn−1)sn has ℓ(wsn)=ℓ(w)−1 (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F4]

The dual action (w⋅f)(v)=f(ρ(w)−1v) is a left action of W on V∗ by linear bijections, with ρ(w)−1=ρ(w−1) for every w (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

Proof

technique · direct
1.1F1F2F4given

Set-up. Recall from [F2] that C∘⊆Bs and Bs∩sBs=∅ for every s∈S, and that the two sign equivalences of the root system hold; from [F4] that every w acts on V∗ as a bijection with inverse the action of w−1; and from [F1] that for every x∈W and every generator s exactly one of xC∘⊆Bs, xC∘⊆sBs holds.

1.2F1F2F3algebra

The two-sided root-length criterion. Fix w∈W and s∈S. By [F2], ρ(w)es∈Φ− if and only if w−1C∘⊆sBs; by [F1] applied to the element w−1 this holds if and only if ℓ(sw−1)<ℓ(w−1). Since (sw−1)−1=ws and ℓ is inversion invariant, [F3] gives ℓ(sw−1)=ℓ(ws) and ℓ(w−1)=ℓ(w), so ρ(w)es∈Φ−  ⟺  ℓ(ws)<ℓ(w). Finally ℓ(ws)=ℓ(w)±1 by [F3] and Φ=Φ+⊔Φ− by [F2], so this is equivalent to the statement that ℓ(ws)>ℓ(w) if and only if ρ(w)es∈Φ+; both claims of (1) follow.

1.3F1F2F3F4algebra

Disjoint chambers. Suppose wC∘∩C∘≠∅ and w≠1. Choose a reduced expression of w and let s be its first letter, so that w=sw′ with ℓ(w′)=ℓ(w)−1 by [F3]. The intersection point lies in C∘⊆Bs, so wC∘ meets Bs, whence wC∘⊈sBs because Bs∩sBs=∅; applying the bijection f↦s⋅f from [F4] and using that its square is the identity gives w′C∘⊈Bs. By [F1] applied to w′, therefore w′C∘⊆sBs and ℓ(sw′)=ℓ(w′)−1; but sw′=w, so ℓ(w)=ℓ(w′)−1=ℓ(w)−2, a contradiction. Hence w=1; and the stated equivalence holds because vC∘∩wC∘≠∅ if and only if (w−1v)C∘∩C∘≠∅ by [F4].

2.1step 1.2step 1.3F3F4∎

Faithfulness. If ρ(w)=idV, then ρ(w)−1=idV as well, so (w⋅f)(v)=f(ρ(w)−1v)=f(v) for all f∈V∗ and v∈V by [F4]; hence w⋅f=f for every f and wC∘=C∘ meets C∘, so 1.3 gives w=1. If the dual action of w is the identity, then for any f∈C∘ one has f=w⋅f∈wC∘∩C∘, which is nonempty, and 1.3 again gives w=1. Finally let w≠1 and let s be the last letter of a reduced expression of w, so that ℓ(ws)=ℓ(w)−1 by [F3]; by the criterion of 1.2, ρ(w)es∈Φ−.

Depends on

Used by

Dependency tree · two levels

82 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