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.

An element with full left descent makes the Coxeter group finite and is the longest element

Statement

Let (S,m) be a finite Coxeter matrix, W the presented group with length ℓ, V=RS with Coxeter form B, the canonical reflection homomorphism ρ, the signed root system Φ=Φ+⊔Φ−, the positive cone V+={∑sλses:λs≥0} and the reflection set T (The real Coxeter form, its radical, reflections, and form-preserving maps, 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) (The geometric inversion set N(w) of an element of a Coxeter group) and descent sets DL,DR (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)).

(1) Full left descent forces finiteness. Suppose x∈W satisfies DL(x)=S, i.e. ℓ(sx)<ℓ(x) for every s∈S. Then:

(i) ρ(x−1)Φ+=Φ− and N(x−1)=Φ+;

(ii) Φ is finite, ∣Φ+∣=ℓ(x)=∣T∣, and W is finite;

(iii) x is the longest element w0 of W; equivalently x is the unique element of W with N(x−1)=Φ+; and x−1=x as well as ℓ(w0w)=ℓ(w0)−ℓ(w) for all w∈W.

(2) Parabolic form. Let J⊆S, let WJ=⟨s:s∈J⟩ be the standard parabolic subgroup, VJ=span{es:s∈J}, ΦJ=Φ∩VJ=ΦJ+⊔ΦJ− the parabolic root subsystem of Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2), and put NJ(y):={α∈ΦJ+:ρ(y)α∈ΦJ−} for y∈WJ. If w∈WJ satisfies ℓ(sw)<ℓ(w) for every s∈J, then WJ is finite, NJ(w−1)=ΦJ+, and w=w0(J) is the longest element of the Coxeter system (WJ,J). No Choice is used.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m) with presented group W, length ℓ, canonical reflection homomorphism ρ:W→GL(V) on V=RS with basis (es)s∈S, signed root system Φ=Φ+⊔Φ−, positive cone V+, reflection set T, inversion sets N(w) and descent sets DL,DR as in the cited items; w,x∈W, J⊆S and s∈S as specified in each clause.

[F1]

The real Coxeter form, its radical, reflections, and form-preserving maps: V=RS has the basis (es)s∈S, and each u∈V is the finite sum u=∑su(s)es.

[F2]

The canonical reflection homomorphism, roots, reflections, and the positive cone: ρ is a homomorphism with ρ(s)=res; Φ={ρ(u)es:u∈W, s∈S} is the root system, so ρ(v)Φ=Φ for every v∈W; T={usu−1:u∈W, s∈S}; and V+={∑sλses:λs≥0}.

[F3]

Root sign coherence and the action of simple reflections on positive roots (2): Φ=Φ+⊔Φ− with Φ+=Φ∩V+, Φ−=Φ∩(−V+) and Φ−=−Φ+; every positive root is a nonnegative combination of the es, and es∈Φ+ for every s.

[F4]

Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (5): for all y and s, s∈DL(y)  ⟺  es∈N(y−1)  ⟺  ρ(y−1)es∈Φ−.

[F5]

The geometric inversion set N(w) of an element of a Coxeter group (1): N(y)={α∈Φ+:ρ(y)α∈Φ−}.

[F6]

The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)(iv): the map Φ+→T, α↦tα, is a bijection; (2): ∣N(y)∣=ℓ(y) for every y.

[F7]

The root-length criterion and faithfulness of the canonical reflection representation (3): ρ is injective, so W embeds in Sym(Φ), and for every y≠1 there is s with ρ(y)es∈Φ−.

[F8]

Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups: WJ=⟨s:s∈J⟩ is the standard parabolic subgroup of type J.

[F9]

Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2): ρ(u)VJ=VJ for u∈WJ, ΦJ=Φ∩VJ, and ΦJ=ΦJ+⊔ΦJ− with ΦJ±=ΦJ∩Φ±.

[F10]

Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2): (WJ,J) is a Coxeter system whose intrinsic length function agrees with ℓ on WJ.

[F11]

The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(i)-(iv): if W is finite, there is a unique w0∈W with N(w0−1)=Φ+; ℓ(w0)=∣N(w0)∣=∣Φ+∣=∣T∣, ρ(w0)Φ+=Φ−, ℓ(w0w)=ℓ(w0)−ℓ(w) for every w, and w02=1.

[F12]

The real Coxeter form, its radical, reflections, and form-preserving maps (2): B(es,es)=1 for all s∈S.

[F13]

The real Coxeter form, its radical, reflections, and form-preserving maps (3): for B(a,a)≠0, ra(v)=v−2B(v,a)B(a,a)a.

[F14]

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

[A1]

Consequences of [F1] and [F2] used throughout: ρ(v) is a linear bijection with ρ(v)−1=ρ(v−1), and V+ is a cone, so a nonnegative combination of elements of −V+ lies in −V+, because every coordinate of such a combination is nonpositive; a nonzero element of Φ+ stays nonzero under the linear bijection ρ(v).

Proof

1.1F1F2F3F4A1givenalgebra

Assume DL(x)=S. Then ρ(x−1)Φ+=Φ−: for every s∈S the hypothesis and [F4] give ρ(x−1)es∈Φ−. Every α∈Φ+ has the form α=∑sλses with all λs≥0 by [F3], so by linearity of ρ(x−1) the image ρ(x−1)α=∑sλsρ(x−1)es is a nonnegative combination of elements of Φ−⊆−V+, hence lies in −V+, and it is nonzero because ρ(x−1) is injective and α≠0; thus ρ(x−1)α∈Φ∩(−V+∖{0})=Φ−, giving ρ(x−1)Φ+⊆Φ−. Replacing α by −α shows ρ(x−1)Φ−⊆Φ+, using Φ−=−Φ+ and linearity; since ρ(x−1) permutes Φ by [F2], these two inclusions force ρ(x−1)Φ+=Φ−.

2.1F5step 1.1givenalgebra

Under the hypothesis of step 1.1, N(x−1)=Φ+: by definition N(x−1)={α∈Φ+:ρ(x−1)α∈Φ−}, and step 1.1 maps all of Φ+ into Φ−.

3.1F2F3F6F7F15step 1.1step 2.1givenalgebra

Under the hypothesis of step 1.1, Φ is finite and ∣Φ+∣=ℓ(x)=∣T∣, and W is finite. By [F15], ℓ(x−1)=ℓ(x), and [F6] gives ∣N(x−1)∣=ℓ(x−1), so step 2.1 gives ∣Φ+∣=ℓ(x); as Φ=Φ+⊔Φ− with Φ−=−Φ+, the root system Φ is finite, the map Φ+→T is a bijection, and ρ embeds W into the finite symmetric group Sym(Φ), so W is finite.

4.1F11step 2.1step 3.1givenalgebra

Under the hypothesis of step 1.1, x is the longest element w0 of W, and x−1=x and ℓ(w0w)=ℓ(w0)−ℓ(w) for all w. Since W is finite by step 3.1, [F11] gives a unique w0 with N(w0−1)=Φ+; step 2.1 says N(x−1)=Φ+, so x=w0; the remaining properties are the listed clauses of [F11] (1).

5.1F1F2F3F4F6F7F8F9F10F12F13F14F15step 1.1step 3.1step 4.1givenalgebra∎

Now let J⊆S and let w∈WJ satisfy ℓ(sw)<ℓ(w) for every s∈J; then WJ is finite, NJ(w−1)=ΦJ+ and w=w0(J). For each s∈J, [F4] turns the hypothesis into ρ(w−1)es∈Φ−; since ρ(w−1) preserves VJ by [F9] and es∈VJ, this image lies in Φ∩VJ∩Φ−=ΦJ−, so ρ(w−1)es∈ΦJ− for every s∈J. Every α∈ΦJ+ is a nonnegative combination of the es by [F3]; because α∈VJ and the es form a basis by [F1], its coordinates outside J are zero, so it is a nonnegative combination ∑s∈Jλses. Thus the computation of step 1.1, carried out inside the invariant subspace VJ and using that ρ(w−1) permutes ΦJ (it sends ρ(u)es to ρ(w−1u)es with w−1u∈WJ), yields ρ(w−1)ΦJ+=ΦJ−, that is NJ(w−1)=ΦJ+. The pair (WJ,J) is a Coxeter system whose intrinsic length is the restriction of ℓ by [F10]. For s∈J and v∈VJ, [F2], [F12] and [F13] give ρ(s)v=res(v)=v−2B(v,es)es; this lies in VJ and is the simple reflection for the restricted Coxeter form. Since [F9] makes VJ invariant under every ρ(u) with u∈WJ, the restriction ρ∣WJ is a homomorphism to GL(VJ). It agrees on generators with the canonical reflection representation of (WJ,J); uniqueness from the presented-group universal property [F14] makes the two representations equal, and their root system is exactly ΦJ by the definition in the statement. Applying [F6] inside this subsystem gives ∣ΦJ+∣=∣NJ(w−1)∣=ℓJ(w−1)=ℓ(w−1)=ℓ(w), using [F10] for intrinsic length and [F15] for inversion invariance. Since ΦJ=ΦJ+⊔(−ΦJ+), the subsystem root set is finite. Its canonical representation is faithful by [F7] applied to the restricted matrix, so WJ embeds in Sym(ΦJ) and is finite. Since WJ is finite, clause (1) of this lemma, whose proof consists of steps 1.1, 2.1, 3.1 and 4.1 and applies to any finite Coxeter system, gives on the subsystem a unique element w0(J) with NJ(w0(J)−1)=ΦJ+; since w has this property, w=w0(J), the longest element of (WJ,J). No Choice was used anywhere in this proof.

Depends on

Used by

Dependency tree · two levels

71 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