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 longest element as the opposition of the chamber, and longest elements of finite parabolics

Statement

Let (W,S) be a Coxeter system with S finite, length function ℓ, canonical reflection representation ρ on V, form B, root system Φ=Φ+⊔Φ− and reflections T (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots), with inversion sets N(w)={α∈Φ+:ρ(w)α∈Φ−} (The geometric inversion set N(w) of an element of a Coxeter group), and let C and C∘ be the chamber and its interior in V∗ (The dual action, chambers, faces, and root hyperplanes).

(1) The opposition and the longest element of a finite Coxeter system. Suppose W is finite. Then:

(i) there is a unique w0∈W with w0⋅C=−C; equivalently w0 is the unique element of W with N(w0)=Φ+ (equivalently with N(w0−1)=Φ+);

(ii) ℓ(w0)=∣N(w0)∣=∣Φ+∣=∣T∣, and ρ(w0)Φ+=Φ−;

(iii) ℓ(w0w)=ℓ(w0)−ℓ(w) and ℓ(ww0)=ℓ(w0)−ℓ(w) for every w∈W; consequently ℓ(w0)=max⁡{ℓ(w):w∈W} and w0 is the unique element of that length (the element of longest length);

(iv) w02=1;

(v) w0Sw0−1=S, and there is a permutation σ of S with ρ(w0)es=−eσ(s), equivalently w0sw0=σ(s), for every s∈S.

(2) Longest elements of finite parabolics. Let I⊆S with WI=⟨s:s∈I⟩ finite (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups); this holds automatically for every I⊆S when W is finite. Then WI has a unique longest element w0(I): it is the unique u∈WI with ℓ(uw)=ℓ(u)−ℓ(w) for every w∈WI, and it satisfies w0(I)2=1, ℓ(w0(I))=max⁡{ℓ(w):w∈WI}, ℓ(w0(I)w)=ℓ(w0(I))−ℓ(w) and ℓ(ww0(I))=ℓ(w0(I))−ℓ(w) for every w∈WI, and w0(I)Iw0(I)−1=I. With the parabolic subsystem VI:=span{es:s∈I}, VI+:={∑s∈Iλses:λs≥0} and ΦI:={ρ(u)es:u∈WI, s∈I}, one has ℓ(w0(I))=∣ΦI∩VI+∣.

Facts & Assumptions

Given: A Coxeter system (W,S) with S finite, the space V=RS with Coxeter form B, the canonical reflection homomorphism ρ, root system Φ=Φ+⊔Φ−, reflections T, length ℓ, inversion sets N(w), chamber C and its interior C∘ in V∗. For part (1), W is finite, so the identification V≅V∗ of The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset is available; for part (2) only the subsystem is identified with its dual after its finiteness is assumed.

[F1]

Structure and elementary length facts: B is symmetric bilinear with B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) (or −1 for m(s,t)=∞), every ρ(w) preserves B, the reflection formula is ra(v)=v−2B(v,a)B(a,a)a for B(a,a)≠0 (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, clauses (1)-(2), Descent of the reflection representation, unit root norms, and conjugation of reflections); the length is the least word length, so ℓ(x)=0 if and only if x=1, reversing a word gives ℓ(w−1)=ℓ(w), and ℓ(x)=1 means x∈S (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); and every root satisfies B(α,α)=1 (Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (3)).

[F2]

Tiling of the finite chamber system: V∖⋃α∈ΦHα has the sets wC∘ (w∈W) as its connected components, the map w↦wC∘ is a bijection from W onto the set of chambers and wC∘‾=wC (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere, clause (1)).

[F3]

Root signs: Φ=Φ+⊔Φ−, Φ−=−Φ+ and es∈Φ+ for every s; moreover for α∈Φ one has α∈Φ+ if and only if f(α)>0 for every f∈C∘, and α∈Φ− if and only if f(α)<0 for every f∈C∘ (Root sign coherence and the action of simple reflections on positive roots, clauses (2)-(3)).

[F4]

Inversions and the root-reflection dictionary: ∣N(w)∣=ℓ(w) for every w, the map Φ+→T, α↦tα, is a bijection, and for α,β∈Φ one has tα=tβ if and only if α=±β (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange, clauses (1)-(2)).

[F5]

Conjugation: for w∈W, s∈S and α∈Φ one has ρ(wsw−1)=rρ(w)es and ρ(tα)=rα (Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (4), The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange, clause (1)(ii)).

[F6]

Standard parabolics: for I⊆S the pair (WI,I) is a Coxeter system, its intrinsic length function agrees on WI with the restriction of ℓ, and WI∩S=I (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification, clauses (1)-(2)).

[F7]

Universal property of the presented group: any assignment of generators satisfying the Coxeter relations extends uniquely to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

Proof

technique · direct; (1) is proved for a general finite Coxeter system from the tiling, the root signs and the inversion dictionary, and (2) instantiates it to the parabolic subsystem
1.1F2F3algebra

Since Φ−=−Φ+ [F3], the arrangement ⋃α∈ΦHα is invariant under the antipodal map v↦−v (as H−α=Hα), and that map is a homeomorphism permuting the connected components of the complement; hence −C∘ is a connected component of V∖⋃αHα, and by the tiling [F2] there is a unique w0∈W with −C∘=w0C∘; taking closures with [F2] gives −C=w0C.

1.2F1algebra

By [F1] the length is the least word length, so ℓ(x)=0 if and only if x=1; reversing a word gives ℓ(w−1)=ℓ(w) for every w; and ℓ(x)=1 means that x is represented by a one-letter word, that is, x∈S.

2.1step 1.1F3algebra

For α∈Φ one has α∈Φ+ exactly when f(α)>0 for every f∈C∘, and α∈Φ− exactly when f(α)<0 for every f∈C∘ [F3]; as f runs over C∘ the points w0⋅f run over −C∘, and (−g)(α)=−g(α), so α∈Φ+ is equivalent to f(ρ(w0)−1α)<0 for every f∈C∘, that is, to ρ(w0)−1α∈Φ−; hence ρ(w0)−1Φ+=Φ−, equivalently ρ(w0)Φ+=Φ−, which is the equality N(w0)=Φ+, and ρ(w0)−1Φ+=Φ− is N(w0−1)=Φ+.

3.1step 1.1step 2.1F2F3algebra

If w′∈W satisfies w′C=−C, then w′C∘=int⁡(w′C)=int⁡(−C)=−C∘=w0C∘, so w′=w0 by the injectivity of w↦wC∘ in [F2]; together with step 1.1 this proves uniqueness of the opposite chamber. If v∈W satisfies N(v)=Φ+ or N(v−1)=Φ+, then ρ(v)−1Φ+=Φ−: in the first case ρ(v)Φ+⊆Φ− is equality because Φ is finite and the two sign sets have equal cardinality, and negation gives ρ(v)Φ−=Φ+; in the second case this is the inversion-set definition. For f∈C∘ and s∈S, [F3] now gives (v⋅f)(es)=f(ρ(v)−1es)<0, so vC∘⊆−C∘. Both sets are connected components by [F2] and step 1.1, so they are equal and v=w0 by [F2]. Conversely step 2.1 gives both full inversion sets for w0, proving all equivalences in (i).

3.2step 1.2step 2.1F4algebra

By [F4] one has ℓ(w0)=∣N(w0)∣=∣Φ+∣=∣T∣, using step 2.1 and the bijection Φ+→T; and for every w∈W the set N(w0w)={α∈Φ+:ρ(w0)ρ(w)α∈Φ−} equals {α∈Φ+:ρ(w)α∈Φ+}=Φ+∖N(w), because ρ(w0)β∈Φ− if and only if β∈ρ(w0)−1Φ−=Φ+ by step 2.1; hence ℓ(w0w)=∣N(w0w)∣=∣Φ+∣−∣N(w)∣=ℓ(w0)−ℓ(w) by [F4]. This proves (ii) and the first identity of (iii).

4.1step 1.2step 3.2F1algebra

Taking w=w0 in step 3.2 gives ℓ(w02)=ℓ(w0)−ℓ(w0)=0, so w02=1 by step 1.2; this is (iv).

4.2step 1.2step 3.2F1algebra

By step 3.2, 0≤ℓ(w0w)=ℓ(w0)−ℓ(w) for every w, so ℓ(w)≤ℓ(w0) and w0 has maximal length; if ℓ(v)=ℓ(w0) then ℓ(w0v−1)=ℓ(w0)−ℓ(v−1)=ℓ(w0)−ℓ(v)=0 by steps 3.2 and 1.2, so w0v−1=1 by step 1.2 and v=w0; hence ℓ(w0)=max⁡{ℓ(w):w∈W} and w0 is the unique element of that length.

5.1step 1.2step 3.2step 4.1F1algebra

For every w∈W the identity of step 3.2 applied to w−1 gives ℓ(w0w−1)=ℓ(w0)−ℓ(w−1), and inversion invariance together with w0−1=w0 from step 4.1 gives ℓ(ww0)=ℓ(w0)−ℓ(w) by step 1.2; this is the second identity of (iii).

6.1step 1.2step 3.2step 5.1step 4.1F1algebra

For s∈S, step 5.1 with w=sw0 gives ℓ(sw0w0)=ℓ(w0)−ℓ(sw0), that is, ℓ(s)=ℓ(w0)−ℓ(sw0) by step 4.1, so ℓ(sw0)=ℓ(w0)−1; then step 3.2 with w=sw0 gives ℓ(w0sw0)=ℓ(w0)−ℓ(sw0)=1, so w0sw0=:s′∈S by step 1.2. Conjugation by w0 therefore maps S into S, and since w02=1 and S is finite it maps S bijectively onto S, that is, w0Sw0=w0Sw0−1=S.

7.1step 2.1step 6.1F3F4F5algebra

For s∈S let σ(s):=s′, so that w0sw0=σ(s) by step 6.1; applying the homomorphism ρ and the conjugation formula [F5] gives rρ(w0)es=ρ(w0)ρ(s)ρ(w0)−1=ρ(σ(s))=reσ(s), that is, tρ(w0)es=teσ(s) in the dictionary [F4]; since tα=tβ for α,β∈Φ only when α=±β, one has ρ(w0)es=±eσ(s), and the sign is negative because ρ(w0)es∈Φ− by step 2.1 while eσ(s)∈Φ+ [F3]; hence ρ(w0)es=−eσ(s) for every s∈S, and σ is a permutation of S. This completes (v).

8.1step 7.1F1F2F3F4F5F6F7algebra

Let I⊆S with WI finite. By [F6] the pair (WI,I) is a Coxeter system, its intrinsic length function is the restriction of ℓ, and WI∩S=I; moreover I is finite. The canonical reflection representation of (WI,I) (on VI=RI with the restricted Coxeter form BI=B∣VI×VI) is the restriction of ρ to VI: each s∈I has ρ(s)et=et−2B(et,es)es∈VI for t∈I and ρ(s)v=v for v∈VI⊥, so ρ preserves VI and acts there by the reflection of BI with normal es, and both maps are homomorphisms on the presented group (WI,I) agreeing on generators, hence equal by the universal property [F7]. Therefore the argument of steps 1.1-7.1, which used only the tiling [F2], the root signs [F3], the inversion dictionary [F4], the conjugation formula [F5] and the length facts [F1] - all available verbatim for the Coxeter system (WI,I) with its intrinsic length - applies to (WI,I): there is a unique w0(I)∈WI with NI(w0(I))=(ΦI)+, it satisfies w0(I)2=1, it has maximal length in WI and is the unique element with ℓ(w0(I)w)=ℓ(w0(I))−ℓ(w) and ℓ(ww0(I))=ℓ(w0(I))−ℓ(w) for all w∈WI, and w0(I)Iw0(I)−1=I. To verify the asserted uniqueness for the length-complement characterization, if u∈WI satisfies ℓ(uw)=ℓ(u)−ℓ(w) for every w∈WI, put w=w0(I) and L:=ℓ(w0(I)). Then 0≤ℓ(uw0(I))=ℓ(u)−L, while maximality gives ℓ(u)≤L, so ℓ(u)=L and uniqueness of the maximal-length element gives u=w0(I).

9.1step 8.1F3F6algebra∎

By the instance (ii) of the argument in step 8.1 one has ℓ(w0(I))=∣(ΦI)+∣, where (ΦI)+ is the positive root system of the subsystem; by the intrinsic form of [F3] applied to (WI,I) (whose dual chamber is {g∈VI∗:g(es)≥0 for s∈I}) a root α∈ΦI⊆VI is positive exactly when it lies in the subsystem's positive cone VI∩V+, which is VI+={∑s∈Iλses:λs≥0}; hence (ΦI)+=ΦI∩VI+ and ℓ(w0(I))=∣ΦI∩VI+∣, as asserted in (2).

Depends on

Used by

Dependency tree · two levels

125 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