Alphabeta Math
LemmaStatement: AI-adaptedProof: 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 orbit of a dual fundamental functional: stabilizer, minimal coset length, Schreier distance, and the quotient formula

Statement

Let (W,S) be a Coxeter system with S finite, V=RS with Coxeter form B and canonical reflection homomorphism ρ:W→GL(V) (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections (1), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with the dual (contragredient) left action on V∗ (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling (1)), the closed chamber C={f∈V∗:f(es)≥0 for all s∈S} and the Tits cone U=⋃w∈WwC (The dual action, chambers, faces, and root hyperplanes, The Tits cone, its interior, and the negative-root set of a functional). Fix s0∈S, put T:=S∖{s0}, and let f0∈V∗ be the dual fundamental functional f0(es)=δs,s0 (The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc, The dual family of a finite basis is a basis of the dual space, with the same dimension); then f0∈C⊆U. Then:

(1) Stabilizer and orbit. With S(f):={s∈S:f(es)=0} one has S(f0)=T and Stab⁡W(f0)=WT (Chamber collisions, point stabilizers, and the intersection rule (4)). Hence the orbit map Φ:W/WT⟶W⋅f0,Φ(wWT)=w⋅f0, is a well-defined W-equivariant bijection (Left group actions, transitive actions, and faithful actions, Left and right cosets gH and Hg of a subgroup, The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups). If W/WT is finite, this bijection gives ∣W⋅f0∣=[W:WT] (The coset set G/H and the index [G:H] of a subgroup); no finite-cardinality notation is used for an infinite orbit.

(2) Distance equals minimal coset length. For v∈W⋅f0 put d(v):=min⁡{ℓ(x):x∈W, x⋅f0=v}, the minimum being attained because {ℓ(x):x⋅f0=v} is a nonempty subset of N (The well-ordering principle). For every w with w⋅f0=v one has {x∈W:x⋅f0=v}=wWT, and d(v)=ℓ(dw), where dw is the unique minimal-length element of the left coset wWT, characterized by ℓ(dws)>ℓ(dw) for all s∈T and satisfying ℓ(dwu)=ℓ(dw)+ℓ(u) for all u∈WT (Left and right cosets gH and Hg of a subgroup, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3) with Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)).

(3) Schreier graph and unit step bound. Let Γ be the graph with vertex set W⋅f0 and an undirected edge between v and s⋅v for every s∈S and every v (self-loops omitted). Then d(v) is the graph distance in Γ from f0 to v; in particular d(f0)=0 and ∣d(s⋅v)−d(v)∣≤1for all s∈S, v∈W⋅f0.

(4) Parabolic quotient formula. PW(t)=PWT(t)⋅∑v∈W⋅f0td(v) in Z⟦t⟧ (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial).

(5) Conventions. The statement requires s0∈S, so T=S does not occur here; the parabolic WT need not be finite. Nothing is asserted about primitive vectors, minuscule weights or the general classification of orbits. No choice principle is used.

Facts & Assumptions

Given: A Coxeter system (W,S) with S finite and length function ℓ; the reflection representation ρ on V=RS with Coxeter form B; the dual action on V∗, the closed chamber C, its open part and the Tits cone U; a fixed s0∈S, T=S∖{s0}, and the dual fundamental functional f0=es0∗ with f0(es)=δs,s0.

[F1]

The canonical map ρ:W→GL(V) is a group homomorphism with ρ(s)=rs (Descent of the reflection representation, unit root norms, and conjugation of reflections (1)); consequently the formula (w⋅f)(v)=f(ρ(w)−1v) defines a left action by linear maps (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling (1), Left group actions, transitive actions, and faithful actions). The closed chamber is C={f∈V∗:f(es)≥0 for all s} and the Tits cone is U=⋃w∈WwC (The dual action, chambers, faces, and root hyperplanes, The Tits cone, its interior, and the negative-root set of a functional).

[F2]

WT=⟨s:s∈T⟩ is the standard parabolic, DR(w)={s∈S:ℓ(ws)<ℓ(w)}, and the set wWT, a left coset by Left and right cosets gH and Hg of a subgroup, has a unique element d of minimal length, characterized by ℓ(ds)>ℓ(d) for all s∈T and satisfying ℓ(du)=ℓ(d)+ℓ(u) for all u∈WT (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3), The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F3]

For every f∈C the point stabilizer is Stab⁡W(f)=WS(f), where S(f)={s∈S:f(es)=0} (Chamber collisions, point stabilizers, and the intersection rule (4)).

[F4]

For all w∈W and s∈S one has ℓ(sw)=ℓ(w)±1 and ℓ(ws)=ℓ(w)±1 (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (1)).

[F5]

Every nonempty subset of N has a least element (The well-ordering principle).

[F6]

f0 is the coordinate functional es0∗ of the basis element es0, so f0(es)=δs,s0; and for every A⊆W the series PA=∑w∈Atℓ(w) is a well-defined element of Z⟦t⟧ with finite length fibers (The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc, The dual family of a finite basis is a basis of the dual space, with the same dimension, Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (1)).

[F7]

[W:WT]=∣W/WT∣ when W/WT is finite; otherwise [W:WT]=∞ is a symbol, not a cardinality (The coset set G/H and the index [G:H] of a subgroup).

Proof

technique · direct
1.1F3F6given

The functional f0 vanishes exactly on T: {s∈S:f0(es)=0}=S∖{s0}=T, and all values f0(es)=δs,s0 are ≥0, so f0∈C. By [F3] the point stabilizer is Stab⁡W(f0)=WS(f0)=WT.

2.1step 1.1F1F7given

For u∈WT one has u⋅f0=f0 by step 1.1, so w′∈wWT (that is, w′=wu with u∈WT) implies w′⋅f0=w⋅(u⋅f0)=w⋅f0: the orbit map Φ is well defined. If w⋅f0=w′⋅f0, then applying w−1 gives w−1w′⋅f0=f0, so w−1w′∈Stab⁡W(f0)=WT and wWT=w′WT: Φ is injective. It is surjective onto W⋅f0 by definition, and Φ(w′′wWT)=w′′⋅Φ(wWT) for all w′′, so it is W-equivariant. Hence Φ is a bijection. If W/WT is finite, [F7] and this bijection give ∣W⋅f0∣=[W:WT]; in the infinite case the equality of sets remains the assertion, without finite-cardinality notation.

2.2step 1.1F1algebra

Fix v∈W⋅f0 and any w with w⋅f0=v. For x∈W one has x⋅f0=w⋅f0 if and only if w−1⋅(x⋅f0)=f0, i.e. (w−1x)⋅f0=f0, i.e. w−1x∈Stab⁡W(f0)=WT, i.e. x∈wWT. Thus {x∈W:x⋅f0=v}=wWT.

3.1step 2.2F2F5

The set {ℓ(x):x∈wWT} is a nonempty subset of N, so it has a least element by [F5]; by step 2.2 that least element is d(v). By [F2] the left coset wWT has a unique element dw of minimal length, characterized by ℓ(dws)>ℓ(dw) for all s∈T, and then ℓ(dwu)=ℓ(dw)+ℓ(u) for all u∈WT. Hence d(v)=ℓ(dw).

4.1givenF1F8step 3.1

Let f0=v0,v1,…,vm=v be a walk in Γ; an undirected edge may be traversed in reverse; the same generator still sends the preceding vertex to the next because its square is the identity by [F8], so there are s1,…,sm∈S with vi=si⋅vi−1, so v=sm⋯s1⋅f0 and x:=sm⋯s1 satisfies x⋅f0=v and ℓ(x)≤m. Therefore d(v)≤ℓ(x)≤m; taking the least such m gives d(v)≤dist⁡Γ(f0,v).

4.2step 3.1F1F4F8algebra

Let v∈W⋅f0 and s∈S, and choose x with x⋅f0=v and ℓ(x)=d(v) by step 3.1. Then (sx)⋅f0=s⋅v, so d(s⋅v)≤ℓ(sx)≤ℓ(x)+1=d(v)+1 by [F4]. Applying the same estimate to s⋅v in place of v and using s⋅(s⋅v)=(s2)⋅v=v gives d(v)≤d(s⋅v)+1. Hence ∣d(s⋅v)−d(v)∣≤1 for all s,v.

5.1step 3.1step 4.1F1algebra

Conversely let x=s1⋯sm be a reduced expression with x⋅f0=v and m=d(v), which exists by step 3.1. The sequence f0, sm⋅f0, sm−1sm⋅f0, …, s1⋯sm⋅f0=v is obtained by successively prepending letters. No consecutive vertices agree: if si fixed the current suffix image si+1⋯sm⋅f0, deleting si would still send f0 to v and give a representative of length at most m−1, contrary to m=d(v). Thus every consecutive pair is an edge (self-loops are omitted), and dist⁡Γ(f0,v)≤m=d(v). With step 4.1 this gives dist⁡Γ(f0,v)=d(v); in particular d(f0)=0 because 1⋅f0=f0 and ℓ(1)=0.

6.1step 2.1step 2.2step 3.1F2F6algebra∎

By [F2] every w∈W has a unique factorization w=dwu with u∈WT and dw the minimal element of the left coset wWT, and ℓ(w)=ℓ(dw)+ℓ(u). By steps 2.1, 2.2 and 3.1 the assignment w↦dw⋅f0 is a map of W onto W⋅f0 whose fibers are exactly the cosets wWT, and d(dw⋅f0)=ℓ(dw). Summing tℓ(w)=td(dw⋅f0)tℓ(u) over the unique pairs (dw,u) therefore gives PW(t)=∑v∈W⋅f0∑u∈WTtd(v)+ℓ(u)=(∑v∈W⋅f0td(v))PWT(t) in Z⟦t⟧. Both factors are well-defined series by [F6]: for each n the set {v:d(v)=n} is contained in the image of the finite fiber {x:ℓ(x)=n} under x↦x⋅f0, hence finite.

Depends on

Used by

Dependency tree · two levels

98 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