Alphabeta Math
TheoremStatement: 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.

Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth

Statement

Let (W,S) be a Coxeter system with S finite and length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with WI, DL, DR as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups and the series PA, DIJ of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial. Put WJ:={w∈W:ℓ(ws)>ℓ(w) for all s∈J},JW:={w∈W:ℓ(sw)>ℓ(w) for all s∈J}. Then:

(1) Finite descent parabolics and the finite/infinite dichotomy. If J⊆DL(w) for some w∈W (equivalently, if J⊆DR(w) for some w), then WJ is finite. In particular WDL(w) and WDR(w) are finite for every w∈W. Conversely, if WJ is finite with longest element w0(J), then DL(w0(J))=DR(w0(J))=J. Consequently W is finite if and only if some x∈W satisfies DL(x)=S, if and only if some x satisfies DR(x)=S; and if W is infinite then no element has all descents. If W is finite, then DSS(t)=tℓ(w0), while if W is infinite then DSS(t)=0.

(2) Parabolic factorization. For every J⊆S the multiplication maps WJ×WJ→W and WJ×JW→W are bijections and ℓ is additive along them; consequently PW=PWJ PWJ=PJW PWJ in Z⟦t⟧. If the diagram of (W,S) is disconnected with components on the nonempty pairwise disjoint sets S1,…,Sk, then W≅WS1×⋯×WSk, ℓ(w1⋯wk)=∑iℓ(wi), and PW=∏iPWSi. When S=∅, the presentation gives W={1} and this product over no components is 1.

(3) Descent inclusion-exclusion. For all I⊆J⊆S, DIJ(t)=∑J∖I⊆K⊆J(−1)∣J∖K∣PWS∖K(t),where WS∖K={w∈W:DR(w)⊆K}.

(4) Steinberg identity. With formal inverses 1/PWK(t)∈Z⟦t⟧ (A formal power series is a unit exactly when its constant coefficient is a unit), valid because PWK(0)=1, ∑K⊆S(−1)∣K∣PWK(t)={tℓ(w0)PW(t),W finite,0,W infinite, as an identity in Z⟦t⟧. If W is finite, then PW is a polynomial and tℓ(w0)PW(t−1)=PW(t) rewrites the identity, in the rational function field Q(t), as 1PW(t−1)=∑K⊆S(−1)∣K∣PWK(t).

(5) Rationality. Every PWK (K⊆S) is a rational formal power series (Rational formal power series, proper presentations and reduced denominators), by induction on ∣S∣ using proper parabolics as the recursive inputs. For S≠∅, (4) yields the recursions 1PW(t)=(−1)∣S∣+1∑K≠S(−1)∣K∣PWK(t)  (W infinite),PW(t)=tℓ(w0)−(−1)∣S∣∑K≠S(−1)∣K∣/PWK(t)  (W finite). The denominator in the finite recursion has nonzero constant term. If S=∅, then W={1} and PW=1, so no recursion with an empty denominator is asserted. Hence PW∈Q(t): the growth series of every finite-rank Coxeter system is rational. No choice principle is used.

Facts & Assumptions

Given: A Coxeter system (W,S) with S finite and length function ℓ, its standard parabolics WJ=⟨s:s∈J⟩, the descent sets DL,DR, the quotient sets WJ,JW, and the series PA, DIJ of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial.

[F1]

DL(w)={s∈S:ℓ(sw)<ℓ(w)} and DR(w)={s∈S:ℓ(ws)<ℓ(w)} for w∈W, and ℓ(sw)−ℓ(w), ℓ(ws)−ℓ(w)∈{±1} for all s∈S (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2), Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (1)). Reversing a word for w gives a word of the same length for w−1, so ℓ(w−1)=ℓ(w) (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

For every J⊆S and every w∈W there is a unique pair u∈WJ, d∈JW with w=ud and ℓ(w)=ℓ(u)+ℓ(d), and then ℓ(u′d)=ℓ(u′)+ℓ(d) for all u′∈WJ; likewise a unique pair d∈WJ, v∈WJ with w=dv and ℓ(w)=ℓ(d)+ℓ(v), and then ℓ(dv′)=ℓ(d)+ℓ(v′) for all v′∈WJ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)).

[F3]

If x∈WJ satisfies ℓ(sx)<ℓ(x) for every s∈J, then WJ is finite and x=w0(J) is its longest element (An element with full left descent makes the Coxeter group finite and is the longest element (2)).

[F4]

If WJ is finite, its longest element w0(J) is unique and satisfies w0(J)2=1, ℓ(w0(J)w)=ℓ(w0(J))−ℓ(w) and ℓ(ww0(J))=ℓ(w0(J))−ℓ(w) for all w∈WJ, and w0(J)Jw0(J)−1=J; if W is finite then w0=w0(S) satisfies ℓ(w0w)=ℓ(w0)−ℓ(w) for all w∈W (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(iii),(2)).

[F5]

WJ={w∈W:S(w)⊆J} for the support S(w) of any reduced expression of w, WJ∩S=J, and (WJ,J) is a Coxeter system whose intrinsic length function is the restriction of ℓ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1),(2)).

[F6]

If the diagram of (W,S) is disconnected with components on the nonempty pairwise disjoint sets S1,…,Sk, then W≅WS1×⋯×WSk and ℓ(w1⋯wk)=∑iℓ(wi) for all wi∈WSi (Disconnected diagrams, direct products, and comparison of invariant forms (1)).

[F7]

For every A⊆W, each length fiber is finite and PA=∑w∈Atℓ(w) is a well-defined element of Z⟦t⟧, with PA(0)=1 if 1∈A and PA(0)=0 otherwise (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (1)).

[F8]

The coefficientwise sum and Cauchy product make Z⟦t⟧ a commutative ring (Cauchy multiplication makes R⟦x⟧ a commutative ring containing R[x] as the finitely supported subring).

[F9]

A formal series is a unit if and only if its constant coefficient is a unit; in particular every PWK is a unit because PWK(0)=1 (A formal power series is a unit exactly when its constant coefficient is a unit).

[F10]

In the additive commutative monoid of Z⟦t⟧, finite sums over finite sets are independent of enumeration, invariant under bijective reindexing and split over finite disjoint unions (A finite sum in a commutative monoid indexed by an arbitrary finite set, Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).

[F11]

Since S is finite, its power set P(S) is finite (∣P(A)∣=2∣A∣ for finite A).

[F12]

A series F∈Z⟦t⟧ is rational over Z when F=U/V for U,V∈Z[t] with V(0)∈{1,−1} (Rational formal power series, proper presentations and reduced denominators). Then F(0)=U(0)/V(0). If also F(0)∈{1,−1}, then U(0)∈{1,−1}, so the reciprocal V/U is rational over Z as well.

[F13]

If w=s1⋯sk is a reduced expression and s∈S satisfies ℓ(sw)=k−1, then sw=s1⋯si^⋯sk for some i; if instead ℓ(ws)=k−1 then ws=s1⋯si^⋯sk for some i (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (2)).

[F14]

Induction on a natural number is valid (The principle of mathematical induction).

Proof

technique · direct
1.1F1F2F3F4

Let J⊆S and w∈W with J⊆DR(w). Write w=dv with d∈WJ, v∈WJ as in [F2], so ℓ(ws)=ℓ(d)+ℓ(vs) for every s∈J; since ℓ(ws)<ℓ(w)=ℓ(d)+ℓ(v) by [F1], we get ℓ(vs)<ℓ(v) for all s∈J. Now DL(x)=DR(x−1) for every x∈W, because ℓ(x−1)=ℓ(x) and (xs)−1=sx−1 turn ℓ(xs)<ℓ(x) into ℓ(sx−1)<ℓ(x−1); hence DL(v−1)=DR(v)⊇J, and [F3] applied to v−1∈WJ gives that WJ is finite and v−1=w0(J); since w0(J)2=1 by [F4], v=w0(J). Symmetrically, if J⊆DL(w), write w=ud with u∈WJ, d∈JW as in [F2]; then sw=(su)d for s∈J, so ℓ(sw)=ℓ(su)+ℓ(d)<ℓ(u)+ℓ(d)=ℓ(w) gives ℓ(su)<ℓ(u) for all s∈J, and [F3] applied to u shows that WJ is finite. In particular WDL(w) and WDR(w) are finite for every w, and taking J=S shows that if some x has DL(x)=S or DR(x)=S then W=WS is finite.

1.2F1F4F5F13

Let WJ be finite with longest element w0(J) as in [F4]. For s∈J the element s lies in WJ, so ℓ(sw0(J))=ℓ(w0(J))−ℓ(s)=ℓ(w0(J))−1<ℓ(w0(J)) and likewise ℓ(w0(J)s)<ℓ(w0(J)): thus J⊆DL(w0(J))∩DR(w0(J)). Conversely let s∈S∖J and suppose ℓ(sw0(J))<ℓ(w0(J)). Fix a reduced expression w0(J)=s1⋯sk with all si∈J (possible by [F5], since WJ=⟨J⟩); by [F13] sw0(J)=s1⋯si^⋯sk is a product of elements of J, hence lies in WJ, so s=w0(J)⋅(sw0(J))−1∈WJ and therefore s∈WJ∩S=J by [F5], a contradiction. Since ℓ(sw0(J))−ℓ(w0(J))∈{±1} by [F1], it follows that ℓ(sw0(J))>ℓ(w0(J)), i.e. s∉DL(w0(J)). The right-handed version uses the right form of [F13] with the same computation; hence DL(w0(J))=DR(w0(J))=J. In particular, if W is finite then DL(w0)=DR(w0)=S for w0=w0(S).

1.3F2F6F7F8F15

Fix J⊆S. By [F2] the maps WJ×WJ→W, (d,v)↦dv, and WJ×JW→W, (u,d)↦ud, are bijections along which ℓ is additive. For each n∈N, the map (d,v)↦dv restricts to a bijection from the finite disjoint union ⨆i=0n{d∈WJ:ℓ(d)=i}×{v∈WJ:ℓ(v)=n−i} onto {w∈W:ℓ(w)=n}; finiteness follows from [F7, F15]. Its cardinality is exactly the Cauchy-product coefficient [tn](PWJPWJ), so coefficientwise equality gives PW=PWJPWJ. The same argument with the factorization w=ud gives PW=PJWPWJ. If S=∅, then W={1} and both series and the empty product are 1. Otherwise, in the disconnected case [F6] gives an isomorphism WS1×⋯×WSk→W carrying (w1,…,wk) to w1⋯wk with additive length. Iterating the same coefficient argument over the finite set of components gives PW=∏iPWSi.

1.4F1F7F8F10F11algebra

Fix I⊆J⊆S and for L⊆S put EL:={w∈W:DR(w)=L}, a set partition of W indexed by the finite power set P(S) by [F11], so that PWS∖K=∑L⊆KPEL for every K⊆S by [F7] and the displayed definition in statement (3), while DIJ=∑I⊆L⊆JPEL. Substituting the first display into the sum of the statement gives ∑J∖I⊆K⊆J(−1)∣J∖K∣∑L⊆KPEL=∑L⊆JPEL c(L) with c(L):=∑K: (J∖I)∪L⊆K⊆J(−1)∣J∖K∣, a finite interchange licensed by [F8, F10]. Writing K=J∖N with N⊆J, the condition K⊇(J∖I)∪L becomes N⊆M:=J∖((J∖I)∪L) and ∣J∖K∣=∣N∣, so c(L)=∑N⊆M(−1)∣N∣; when M≠∅ fix a∈M and the map N↦N△{a} is a fixed-point-free involution of the subsets of M that negates (−1)∣N∣, so c(L)=0, and when M=∅ the sum is the single term 1. Now M=∅ means (J∖I)∪L=J, and since L⊆J this holds exactly when I⊆L: each x∈I lies in J=(J∖I)∪L but not in J∖I, hence in L, while I⊆L gives (J∖I)∪L⊇(J∖I)∪I=J. Together with L⊆J this is exactly I⊆L⊆J, so the whole sum equals ∑I⊆L⊆JPEL=DIJ, which is the asserted identity.

2.1step 1.1step 1.2F4F7

By step 1.2, if W is finite then some element (namely w0) has all left descents and all right descents; by step 1.1, if some element has all descents then W is finite. Hence W is finite if and only if some x satisfies DL(x)=S, if and only if some x satisfies DR(x)=S; so if W is infinite then no element has all descents. Now DSS(t)=∑{w:DR(w)=S}tℓ(w). If W is infinite the index set is empty, so DSS=0. If W is finite and DR(w)=S, apply the factorization argument of step 1.1 with J=S: write w=dv with d∈WS and v∈WS. Since WS=W, the set wWS is all of W, so its unique minimal representative is d=1 and v=w; the argument in step 1.1 then gives v−1=w0, so w=v=w0; conversely DR(w0)=S by step 1.2. Hence DSS(t)=tℓ(w0) in the finite case.

3.1step 1.3step 1.4step 2.1F4F7F8F9F10F11algebra

Take I=J=S in step 1.4; since S∖S=∅, this gives DSS(t)=∑K⊆S(−1)∣S∖K∣PWS∖K(t)=∑K⊆S(−1)∣K∣PWK(t) after the substitution K↦S∖K. By step 1.3 PW=PWKPWK for every K⊆S, and PWK(0)=1 because WK contains the identity, so [F7, F9] gives PWK=PW/PWK in Z⟦t⟧. Substituting and dividing the resulting identity by the unit PW yields ∑K⊆S(−1)∣K∣PWK(t)=DSS(t)PW(t), and step 2.1 evaluates the right side as tℓ(w0)/PW(t) when W is finite and as 0 when W is infinite, which is the asserted two-case identity. In the finite case, w↦w0w is a bijection of W with ℓ(w0w)=ℓ(w0)−ℓ(w) by [F4], so summing over w gives PW(t)=∑wtℓ(w0)−ℓ(w)=tNPW(t−1) for N=ℓ(w0), i.e. tNPW(t−1)=PW(t) as polynomials; hence tN/PW(t)=1/PW(t−1) as rational functions and the identity rewrites as 1/PW(t−1)=∑K⊆S(−1)∣K∣/PWK(t).

4.1step 3.1F5F7F8F9F10F11F12F14choosealgebra∎

By [F14], induct on rank, proving rationality over Z in the sense of [F12]. At rank zero W={1} and PW=1/1. Suppose the assertion holds through rank n, and let ∣S∣=n+1. For every proper K⊊S, [F5] identifies PWK with the intrinsic series of (WK,K), so write PWK=UK/VK with integer polynomials and VK(0)=±1. Its constant term is 1 by [F7], hence UK(0)=VK(0)=±1 and its reciprocal is VK/UK. A finite sum of these signed reciprocals is rational over Z: put it over the common denominator ∏K≠SUK, which has constant term ±1. In the infinite case step 3.1 gives 1/PW=(−1)∣S∣+1∑K≠S(−1)∣K∣/PWK. This rational series has constant term 1, so its reciprocal PW is rational by [F12]. In the finite case the same step gives PWD=tN−(−1)∣S∣ for D=∑K≠S(−1)∣K∣/PWK. Choose s0∈S; pairing K with K△{s0} cancels the full alternating subset sum, so D(0)=∑K≠S(−1)∣K∣=−(−1)∣S∣=±1. Thus 1/D is rational over Z by [F12], and so is PW=(tN−(−1)∣S∣)/D. This proves the induction, both recursions, and in particular rationality in Q(t). The single finite-set selection and all unique factorizations use no choice principle.

Depends on

Used by

Dependency tree · two levels

114 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