Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Coxeter Descents, Poincaré Polynomials, and Growth — Examples

1 · Prerequisites

2 · Summary

This companion is a dependency leaf. Its examples use only the theory of coxeter-descents-poincare-polynomials-and-growth and that page's established prerequisite closure; no other theory page may depend on a supplier homed here.

Poincare products for Sn, Bn and Dn by explicit insertion re-derives the type-A products by inserting n at each one-based position: this adds exactly n−i inversions and yields PSn=[n]tPSn−1=[n]t!. In the signed-permutation model, the type-B cosets over the subgroup fixing ε1 correspond to the 2n choices ±εi, giving the factor [2n]t and PBn=∏i=1n[2i]t. For type D with n≥4, deleting the terminal node gives the Dn−1 parabolic; the even-signed Schreier graph has distances 0,…,n−2, n−1 twice, and n,…,2n−2, giving the factor [n]t(1+tn−1) and, by telescoping from D3, PDn=[n]t∏i=1n−1[2i]t. The low-rank bases and checks are PS2=[2]t, PS3=[2]t[3]t, PS4=[2]t[3]t[4]t, PB1=[2]t, PB2=[2]t[4]t, PD2=[2]t2, and PD3=[4]t!. The D4 product is [4]t[2]t[4]t[6]t=1+4t+9t2+16t3+23t4+28t5+30t6+28t7+23t8+16t9+9t10+4t11+t12, whose coefficient sum is 192=∣W(D4)∣. Evaluations at t=1 give n!, 2nn! and 2n−1n! for the symmetric, signed and even-signed permutation groups.

The A2 = S3 case: Steinberg inclusion-exclusion, degree product, and reciprocity uses the smallest-rank finite Coxeter system whose diagram is not a product of copies of A1. It relabels the library's S3 on {0,1,2} order-preservingly as permutations of {1,2,3}, lists all six elements and lengths, and computes every right-descent interval directly and through inclusion-exclusion. The finite Steinberg identity 1−2/(1+t)+1/PW=t3/PW is verified after clearing denominators; the degree product [2]t[3]t=PW, group order PW(1)=6, exponent sum ∑i(di−1)=3=N, and reciprocity t3PW(t−1)=PW(t) are checked explicitly. The finite enumeration uses no choice.

Infinite dihedral growth, the infinite Steinberg identity, and the failure of polynomial reciprocity uses the alternating normal forms to count one identity and two elements of every positive length, giving PW=(1+t)/(1−t). Its spherical subsets are ∅,{s},{t}, and the infinite Steinberg identity becomes 1−2/(1+t)+(1−t)/(1+t)=0. In Q(t), PW(t−1)=−PW(t), so a finite-N reciprocity identity would force tN=−1; this fails for every N≥0. The alternating lengths are unbounded, so the group has no longest element. Its rank-one parabolic still has PW{s}=1+t=[2]t.

Each example states its hypotheses in full and verifies the displayed calculation; the infinite-dihedral example exhibits the exact point where the finite reciprocity argument stops. Exact item dependencies and source reading limits are recorded in research/coxeter-scaffold/inventory.json and research/plan-coxeter-groups-track.md.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Poincare products for Sn, Bn and Dn by explicit insertion

Example

This example re-derives the products of Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (3) by explicit insertion in the same models, with [k]t=1+t+⋯+tk−1. For the Bn,Dn orbit labels below, write zi=2 εi∗ for the scaled dual coordinate functionals from that item; a vertex labelled ±εi denotes the corresponding orbit point ±zi.

(1) Type A: inserting a letter into a permutation. Let n≥2. Use the order-preserving identification of the library's Sn=Sym⁡({0,…,n−1}) with permutations of {1,…,n}; under it the adjacent generator is si↦(i i+1) and ℓ is the inversion number (The finite symmetric group Sn, one-line notation, and cycle notation, Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations, Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (1)(a), Proof 3.1). In this one-based notation, every σ∈Sn−1 and every position i∈{1,…,n} give a permutation σ(i) by inserting the letter n between positions i−1 and i. The map (σ,i)↦σ(i) is a bijection Sn−1×{1,…,n}→Sn, and since the new inversions are exactly the n−i pairs formed by n with the entries to its right, ℓ(σ(i))=ℓ(σ)+(n−i). Hence PSn(t)=PSn−1(t)∑i=1ntn−i=[n]tPSn−1(t), so PSn(t)=[n]t!=[2]t[3]t⋯[n]t and PAn(t)=[n+1]t!.

(2) Type B: inserting a sign. For n≥2, let W(Bn) be the signed permutation group acting on Rn as in Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (1)(b) and (2)(b), with W(Bn−1) the subgroup fixing ε1, as identified by Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (1)(b), (2)(b), and the parabolic-length fact in its Fact F16. Each w∈W(Bn) has a unique decomposition w=d u with u∈W(Bn−1) and d the minimal element of its left coset wW(Bn−1); the possible d correspond bijectively to the orbit points labelled {±ε1,…,±εn}, and the distance (minimal coset length) of the representative sending ε1 to εi is i−1, while for −εi it is 2n−i; the list 0,1,…,2n−1 is obtained by moving ε1 along the chain ε1,…,εn, applying the sign change of the last coordinate, and returning along the negative chain. By The orbit of a dual fundamental functional: stabilizer, minimal coset length, Schreier distance, and the quotient formula (2),(4), PBn(t)=[2n]t PBn−1(t),soPBn(t)=∏i=1n[2i]t.

(3) Type D: even signs. For n≥4, let W(Dn) be the even signed permutation group and let W(Dn−1) be the parabolic obtained by deleting the terminal node sn (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (1)(c),(2)(c)). The orbit of the corresponding dual fundamental functional has the Schreier graph obtained from the chains ε1−⋯−εn and (−ε1)−⋯−(−εn) by the cross edges ε1−(−ε2) and (−ε1)−ε2; its distances are 0,…,n−2, then n−1 twice, then n,…,2n−2 (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (2)(c)). Thus the quotient polynomial is [n]t(1+tn−1). The orbit quotient formula gives PDn(t)=[n]t(1+tn−1)PDn−1(t); since (1+tn−1)[n−1]t=[2n−2]t, this recurrence telescopes from PD3=[4]t! in (4) to PDn(t)=[n]t∏i=1n−1[2i]t for n≥4. The cases D2,D3 are checked separately in (4).

(4) Bases and consistency checks. PS2=1+t=[2]t, PS3=1+2t+2t2+t3=[2]t[3]t, PS4=[2]t[3]t[4]t=1+3t+5t2+6t3+5t4+3t5+t6 (a symmetric unimodal inversion-count sequence), PB1=1+t, PB2=[2]t[4]t=1+2t+2t2+2t3+t4; for D one has D2=A1×A1, D3=A3 (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (3), Proof 5.1) with PD2=(1+t)2 and PD3=[3]t(1+t2)(1+t)2=[4]t!=PA3, and D4 gives [4]t[2]t[4]t[6]t=1+4t+9t2+16t3+23t4+28t5+30t6+28t7+23t8+16t9+9t10+4t11+t12, a palindromic polynomial of degree 12 whose coefficients sum to 192=∣W(D4)∣. The evaluations at t=1 recover n!, 2nn! and 2n−1n!.

Facts & Assumptions

Given: Integers n≥2, the symmetric group Sn with its type An−1 presentation, the signed permutation groups W(Bn) and W(Dn) acting on Rn with orthonormal basis ε1,…,εn, and the series PA=∑w∈Atℓ(w).

[L1]

Under the order-preserving identification of Sn=Sym⁡({0,…,n−1}) with permutations of {1,…,n}, the type-An−1 generators map to adjacent transpositions and ℓ(σ)=inv⁡(σ) (The finite symmetric group Sn, one-line notation, and cycle notation, Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations, Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (1)(a), Proof 3.1).

[L2]

The canonical model of W(Bn) is the full signed permutation group on Rn, generated by adjacent coordinate exchanges and the sign change of coordinate n; the canonical model of W(Dn) is the even signed permutation group, with s1 the exchange of coordinates 1,2, s2:(x1,x2)↦(−x2,−x1) and si (i≥3) the exchange of coordinates i−1,i (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (1)(b),(c)). In the Bn model the subgroup generated by s2,…,sn fixes ε1 and consists of all signed permutations of the remaining coordinates; in type Dn, deleting sn gives the displayed Dn−1 parabolic.

[L3]

In the type-Bn and type-Dn models, write zi=2 εi∗ for the dual coordinate functionals; the orbit points ±zi are labelled by ±εi. Their minimal-coset distances are i−1 on εi and 2n−i on −εi in type B, and 0,…,n−2, n−1 twice, n,…,2n−2 in type D (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (2)(b),(c)).

[L4]

For the dual-functional orbit of a deleted node, d(v) is the minimal length in the left coset wWT (Left and right cosets gH and Hg of a subgroup) and PW(t)=PWT(t)∑vtd(v) (The orbit of a dual fundamental functional: stabilizer, minimal coset length, Schreier distance, and the quotient formula (2),(4)).

[L5]

As Coxeter systems, A1=B1, D2=A1×A1=I2(2) and D3=A3 (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (3), Proof 5.1); the earlier product lemma gives PB1=[2]t, PD2=[2]t2 and the type-D3 product (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (3)).

[L6]

The length series is PA(t)=∑w∈Atℓ(w) and has finite coefficients; for finite W, evaluating PW at 1 counts the elements of W (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (1), The cardinality ∣A∣ of a finite set).

[L7]

For each standard parabolic WT, the restricted matrix presents the Coxeter system (WT,T) and its intrinsic length equals the ambient length restricted to WT (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).

Verification

technique · direct
1.1L1L6algebra

Type A. Use the order-preserving relabeling of the library's Sk=Sym⁡({0,…,k−1}) as permutations of {1,…,k} from [L1]. Deleting the letter n from a permutation of {1,…,n} inverts the insertion (σ,i)↦σ(i), so the map is a bijection Sn−1×{1,…,n}→Sn. In the one-line form, inserting n at position i creates an inversion exactly with each of the n−i entries to its right and with none of the i−1 entries to its left, and the relative order of the other entries is unchanged; hence ℓ(σ(i))=ℓ(σ)+n−i by [L1]. Summing over the bijection gives PSn(t)=∑σ∑i=1ntℓ(σ)+n−i=PSn−1(t)[n]t. Since S1 is the trivial permutation group, PS1=1; telescoping gives PSn(t)=[2]t[3]t⋯[n]t=[n]t!, which is PAn(t)=[n+1]t! after the index shift.

1.2L2L3L4L5L6L7algebra

Type B. By [L2] the parabolic WT with T={s2,…,sn} is the Bn−1 model, and [L7] identifies its intrinsic length with the ambient length; [L4] gives PW(Bn)=PW(Bn−1)∑vtd(v), the sum running over the orbit of [L3]; that orbit consists of one point at each distance 0,1,…,2n−1, so the sum is [2n]t. Hence PBn(t)=[2n]tPBn−1(t), and telescoping from PB1=PA1=1+t=[2]t gives PBn(t)=[2]t[4]t⋯[2n]t=∏i=1n[2i]t.

1.3L2L3L4L5L6L7algebra

Type D. For n≥4, by [L2] the parabolic obtained by deleting the terminal node sn is the Dn−1 model, and [L7] identifies its intrinsic length with ambient length; [L4] gives PW(Dn)=PW(Dn−1)∑vtd(v); by [L3] the distances occurring are 0,…,n−2, the value n−1 twice and n,…,2n−2, so ∑vtd(v)=[n]t(1+tn−1). Hence PDn(t)=[n]t(1+tn−1)PDn−1(t); using the identity (1+tm)[m]t=1+⋯+t2m−1=[2m]t with m=n−1 in the induction step, and the base PD3=PA3=[4]t! supplied by [L5], telescoping gives PDn(t)=[n]t∏i=1n−1[2i]t.

2.1step 1.1step 1.2step 1.3L2L5L6algebra∎

Small cases and evaluations. PS2=1+t=[2]t and PS3=[2]t[3]t=1+2t+2t2+t3 follow from step 1.1; PS4=[2]t[3]t[4]t=(1+3t+5t2+6t3+5t4+3t5+t6), a symmetric unimodal inversion-count sequence, and PB2=[2]t[4]t=1+2t+2t2+2t3+t4 follow by expanding. By [L5], PD2=PA1PA1=(1+t)2 and PD3=PA3=[2]t[3]t[4]t=[3]t(1+t2)PD2=[4]t!, while the recursion of step 1.3 gives PD4=[4]t(1+t3)PD3=[4]t[2]t[4]t[6]t; expanding, [4]t[2]t[4]t[6]t=1+4t+9t2+16t3+23t4+28t5+30t6+28t7+23t8+16t9+9t10+4t11+t12, which is palindromic of degree 12 and has coefficient sum 4⋅2⋅4⋅6=192=∣W(D4)∣. Finally, evaluating the products of steps 1.1-1.3 at t=1, where [k]t(1)=k, gives PSn(1)=n!, PBn(1)=∏i=1n2i=2nn! and PDn(1)=n∏i=1n−12i=2n−1n!. The insertion bijection of step 1.1 also gives ∣Sn∣=n! by induction from ∣S1∣=1. A signed permutation is specified by a permutation and n independent signs, so ∣W(Bn)∣=2nn!; for an even signed permutation the first n−1 signs determine the last, so ∣W(Dn)∣=2n−1n!. These are the group orders by [L2]. No invariant degrees or Choice are used.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The A2 = S3 case: Steinberg inclusion-exclusion, degree product, and reciprocity

Example

Let W=S3 in its type A2 Coxeter presentation with S={s1,s2} (The finite symmetric group Sn, one-line notation, and cycle notation, Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations). The library defines S3 on {0,1,2}; the order-preserving relabelling j↦j+1 identifies it with permutations of {1,2,3} and preserves inversion number, so we write the adjacent generators as s1=(1 2) and s2=(2 3). This is the smallest-rank finite Coxeter system whose diagram is not a product of copies of A1. The example checks the finite A2 instances of parabolic factorization, descent inclusion-exclusion and the Steinberg identity of Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth, and of the degree product and reciprocity of The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity. The lengths, descents and reciprocity calculations use no choice. The basic-degree comparison assumes the Axiom of Choice (The Axiom of Choice) through the degree-table supplier cited in (3).

(1) Lengths and Poincare polynomial. The six elements are 1 (length 0), s1,s2 (length 1), s1s2,s2s1 (length 2) and w0=s1s2s1=s2s1s2 (length 3); hence PW(t)=1+2t+2t2+t3=[2]t[3]t=t3PW(t−1), with N=ℓ(w0)=3=∣Φ+∣ (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii)).

(2) Descent classes and Steinberg identity. The right descent sets are DR(1)=∅, DR(s1)={s1}, DR(s2)={s2}, DR(s1s2)={s2}, DR(s2s1)={s1}, DR(w0)={s1,s2}, so DSS(t)=t3 and, with the interval convention DIJ={w:I⊆DR(w)⊆J} of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (2), the nine interval series are D∅∅(t)=1,D∅{si}(t)=1+t+t2,D∅S(t)=PW(t)=1+2t+2t2+t3,D{si}{si}(t)=t+t2,D{si}S(t)=t+t2+t3 (i=1,2),DSS(t)=t3. The parabolic series are PW∅=1 and PW{si}=1+t. The Steinberg identity (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (4)) reads 1−21+t+11+2t+2t2+t3=t31+2t+2t2+t3, which is a polynomial identity after clearing denominators, and equivalently 1/PW(t−1)=∑K(−1)∣K∣/PWK(t).

(3) Degree product. The basic degrees of A2 are 2 and 3 (A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types (2), under the stated AC premise), so ∏i[di]t=[2]t[3]t=PW(t), ∣W∣=PW(1)=6 (The cardinality ∣A∣ of a finite set) and ∑i(di−1)=1+2=3=N.

(4) Reciprocity. t3PW(t−1)=t3(1+2t−1+2t−2+t−3)=t3+2t2+2t+1=PW(t): the coefficient sequence (1,2,2,1) is palindromic, in agreement with The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity (2).

Facts & Assumptions

Given: The symmetric group W=S3 in the type A2 presentation with simple generators s1,s2, its length function ℓ, the Axiom of Choice for the basic-degree comparison, the descent sets DL,DR and the series PA, DIJ of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial.

[L1]

Under the order-preserving relabelling j↦j+1, the library's S3=Sym⁡({0,1,2}) is identified with permutations of {1,2,3} and its adjacent generators are s1=(1 2) and s2=(2 3) (The finite symmetric group Sn, one-line notation, and cycle notation). Direct composition gives the distinct one-line forms [1,2,3], [2,1,3], [1,3,2], [2,3,1], [3,1,2], [3,2,1] for 1,s1,s2,s1s2,s2s1,w0=s1s2s1=s2s1s2, respectively. These are all one-line arrangements of three entries. In the type-A2 presentation, canceling si2 makes every word alternating, and the braid relation reduces every alternating word of length at least four to a shorter word; thus the six listed words exhaust the presentation. Their inversion numbers are 0,1,1,2,2,3 (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations); their lengths have these same values, since the length-two words are distinct from the identity and generators, while w0 is distinct from all words of length at most two.

[L2]

The element w0=s1s2s1=s2s1s2 has length 3 and is longest by [L1]; the finite longest-element result gives ℓ(w0)=∣Φ+∣ and ℓ(w0w)=ℓ(w0)−ℓ(w) for all w∈W (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii),(iii)). Thus N=ℓ(w0)=3=∣Φ+∣.

[L3]

PA(t)=∑w∈Atℓ(w) for A⊆W (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (1)).

[L4]

DIJ(t)=∑{w:I⊆DR(w)⊆J}tℓ(w) uses the inclusive interval convention (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (2)).

[L5]

The factorization theorem gives unique length-additive parabolic factorizations; for I={s2}, W{s2}={1,s1,s2s1} and W{s2}={1,s2} (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (2)).

[L6]

For all I⊆J⊆S one has DIJ(t)=∑J∖I⊆K⊆J(−1)∣J∖K∣PWS∖K(t) with WS∖K={w:DR(w)⊆K} (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (3)).

[L7]

For finite W, ∑K⊆S(−1)∣K∣/PWK(t)=tN/PW(t) (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (4)).

[L8]

Under the Axiom of Choice (The Axiom of Choice), the independently determined basic-degree table gives d1=2,d2=3 for A2 (A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types (2)).

[L9]

The longest-element bijection and the length complementation in [L2] give tNPW(t−1)=PW(t) for finite W, by summing tN−ℓ(w) over w; this is the choice-free argument of The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity (2), Proof 1.2.

[L10]

PA2(t)=[3]t! and PS3(t)=PA2(t), so the classical product gives [2]t[3]t (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (3)).

[L11]

The cardinality of the six-element set S3 is 6 (The cardinality ∣A∣ of a finite set).

Verification

technique · direct
1.1L1L2L3L5algebra

Length and parabolic factorization. By [L1], the six elements exhaust W and have lengths 0,1,1,2,2,3; hence PW(t)=1+2t+2t2+t3=(1+t)(1+t+t2)=[2]t[3]t and N=ℓ(w0)=3=∣Φ+∣ by [L2]. For I={s2}, [L5] gives W{s2}={1,s1,s2s1} and W{s2}={1,s2}, so the length-additive factorization gives PW=PW{s2}PW{s2}=(1+t+t2)(1+t), agreeing with the direct enumeration.

1.2L1L4algebra

Descent intervals. Reading right descents from the length table gives DR(1)=∅, DR(s1)={s1}, DR(s2)={s2}, DR(s1s2)={s2}, DR(s2s1)={s1} and DR(w0)=S. Thus the exact-descent series for ∅,{s1},{s2},S are respectively 1,t+t2,t+t2,t3. Summing these four classes over each inclusive interval gives D∅∅=1, D∅{si}=1+t+t2, D∅S=PW, D{si}{si}=t+t2, D{si}S=t+t2+t3 and DSS=t3 for i=1,2, exactly the nine cases in the statement.

2.1L4L6step 1.1step 1.2algebra

Inclusion-exclusion. Apply [L6] to the nine pairs I⊆J⊆S. The needed quotients are PWS=1, PW{si}=1+t+t2 (the elements whose right descents omit si), and PW∅=PW. The six symmetry classes of pairs yield, respectively, D∅∅=1, D∅{si}=PW{sj}=1+t+t2 for j≠i, D∅S=PW, D{si}{si}=−PWS+PW{sj}=−1+(1+t+t2)=t+t2, D{si}S=−PW{si}+PW=t+t2+t3, and DSS=PWS−PW{s1}−PW{s2}+PW=t3. This verifies every interval value in the statement directly from the formula.

2.2step 1.1L7L9algebra

Steinberg identity. Substituting PW∅=1, PW{s1}=PW{s2}=1+t and PW=1+2t+2t2+t3 into the finite identity of [L7] gives 1−2/(1+t)+1/PW=t3/PW. Clearing the denominator (1+t)PW yields (1+t)PW−2PW+(1+t)=t3(1+t); both sides equal t3+t4. The reciprocity of [L9] gives t3/PW=1/PW(t−1), so this is also the rational-function identity displayed in the statement.

3.1step 1.1L1L8L9L10L11algebra∎

Degree product and reciprocity. By [L8], the basic degrees of A2 are 2 and 3, and by [L10] the classical product is [2]t[3]t=PW(t); this agrees with step 1.1. At t=1, PW(1)=6=∣W∣ by [L11]. Also ∑i(di−1)=1+2=3=N by step 1.1, and t3PW(t−1)=t3(t−3+2t−2+2t−1+1)=1+2t+2t2+t3=PW(t), so the coefficient sequence (1,2,2,1) is palindromic as in [L9].

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Infinite dihedral growth, the infinite Steinberg identity, and the failure of polynomial reciprocity

Example

Let W=⟨s,t∣s2=t2=1⟩ be the infinite dihedral Coxeter group, so S={s,t} and m(s,t)=∞ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (3)(c),(4)). Then:

(1) Growth series. Every word reduces by canceling adjacent equal generators to an alternating word. For each q≥1, the two alternating words (st)q and (ts)q have length 2q; for each q≥0, (st)qs and (ts)qt have length 2q+1. These words are reduced by The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (7), with the generators interchanged for the words beginning with t; their pairwise distinctness is proved in step 1.1 below using the infinite order of st from (4). They exhaust the nonidentity elements, so W has one element of length 0 and exactly two of each length n≥1: PW(t)=1+2t+2t2+2t3+⋯=1+2t1−t=1+t1−t∈Q(t) The coefficientwise identity (1−t)PW=1+t follows from the displayed coefficients by the Cauchy product (Formal power series over a commutative ring and the coefficient-extraction functional [xn]), and 1−t has unit constant term (A formal power series is a unit exactly when its constant coefficient is a unit, Rational formal power series, proper presentations and reduced denominators).

(2) The infinite Steinberg identity. The spherical subsets are ∅,{s},{t}, with PW∅=1, PW{s}=PW{t}=1+t, and PW=(1+t)/(1−t); the infinite case of Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (4) reads 1−21+t+1−t1+t=0, i.e. 1/PW(t)=1−t1+t, as the formal inverse of (1+t)/(1−t) requires (A formal power series is a unit exactly when its constant coefficient is a unit).

(3) Failure of polynomial reciprocity. The reduced words in (1) have unbounded lengths, so W has no longest element; the infinite-case result of Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (1) also gives that no element has all descents. For comparison, the finite-case pattern tNPW(t−1)=PW(t) is the reciprocity of The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity (2). Here the rational function satisfies PW(t−1)=1+t−11−t−1=−1+t1−t=−PW(t). Thus, for every N≥0, tNPW(t−1)=−tNPW(t); equality with PW(t) would force tN=−1 in Q(t), which is impossible. The substitution is interpreted in the rational-function field, not as an element of Z⟦t⟧. More generally, an infinite Coxeter group with finite S has unbounded length (there are only finitely many words of bounded length), so its growth series is not a polynomial and the finite reciprocity theorem does not apply as a polynomial statement. This alone makes no assertion about rational-function reciprocity for other infinite Coxeter systems.

(4) Rank-one comparison. The parabolic W{s}={1,s} has PW{s}(t)=1+t=[2]t. The infinite growth series is not a finite product [m]t[2]t for any finite m, since every such product is a polynomial while PW has infinitely many nonzero coefficients. With the conventions of the companion page, this same group is denoted I2(∞).

Facts & Assumptions

Given: The presented group W=⟨s,t∣s2=t2=1⟩, the Coxeter matrix with m(s,t)=∞ on S={s,t}, its length function ℓ, and the series PA(t)=∑w∈Atℓ(w) of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial.

[L1]

For m(s,t)=∞ the rank-two product st has infinite order in W and the elements s,t∈W are distinct involutions (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (3)(c),(4)).

[L2]

Every alternating word beginning with either s or t of length q≥1 is reduced in the ambient group (apply the source also with s,t interchanged) (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (7)).

[L3]

The defining relators s2=t2=1 allow adjacent equal letters to be canceled without changing the represented element; ℓ(w) is the minimum length of a generator word representing w (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[L4]

For every A⊆W the series PA=∑w∈Atℓ(w) is well-defined (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (1)); a series is rational if QF=P for polynomials with Q(0) a unit (Rational formal power series, proper presentations and reduced denominators).

[L5]

For J⊆S, WJ={w:ℓ(ws)>ℓ(w) for all s∈J} and PW=PWJPWJ (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (2)).

[L6]

For infinite W, ∑K⊆S(−1)∣K∣/PWK(t)=0 (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (4)).

[L8]

The finite-case pattern is tNPW(t−1)=PW(t) with N=ℓ(w0) (The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity (2)); its longest-element reciprocity argument is choice-free and its basic-degree branch is not used here.

[L9]

The Cauchy product is defined coefficientwise by finite sums, and a series with unit constant term has a unique formal inverse; here 1+t and (1+t)/(1−t) have constant term 1 (Formal power series over a commutative ring and the coefficient-extraction functional [xn], A formal power series is a unit exactly when its constant coefficient is a unit).

Verification

technique · direct
1.1L1L2L3L4L9algebra

Every word in s,t can be shortened by canceling an adjacent pair ss or tt by [L3], so a shortest word is alternating. For each q≥1 the two alternating words of length 2q are (st)q,(ts)q, and for each q≥0 the two of length 2q+1 are (st)qs,(ts)qt. They are reduced by [L2], so unequal lengths give unequal elements. Put r=st, so ts=r−1 and t=r−1s. At the same even length 2q>0, equality of the two words would give rq=r−q and hence r2q=1; at the same odd length 2q+1, equality would give rqs=r−qt=r−q−1s and hence r2q+1=1. Both contradict the infinite order in [L1]. Equivalently, the presentation admits the parity homomorphism sending both generators to −1, because each defining relator has even length, so even and odd words cannot coincide. Every element has one of these forms or is the identity. Thus [t0]PW=1 and [tn]PW=2 for every n≥1. By the Cauchy-product definition, (1−t)PW=1+t: its coefficients are 1 at degree 0, 2−1=1 at degree 1, and 2−2=0 at every degree n≥2. Since 1−t has unit constant term, PW=(1+t)/(1−t) in Z⟦t⟧, and [L4] makes this a rational series.

2.1step 1.1L1L6algebra

A subset I⊆S is spherical exactly when WI is finite. The three proper parabolics W∅={1}, W{s}={1,s} and W{t}={1,t} are finite; WS=W is infinite by [L1]. Thus the spherical subsets are exactly ∅,{s},{t}, with PW∅=1 and PW{s}=PW{t}=1+t, while all four subsets occur in the Steinberg sum of [L6]. Substituting PW=(1+t)/(1−t) from step 1.1 gives 1−2/(1+t)+1/PW=1−2/(1+t)+(1−t)/(1+t)=0, the infinite case of [L6].

2.2step 1.1L1L7L8algebra

In Q(t), PW(t−1)=(1+t−1)/(1−t−1)=−PW(t). If tNPW(t−1)=PW(t) for some N≥0, then −tNPW(t)=PW(t); since PW≠0, this forces tN=−1, impossible in Q(t). Thus no such N exists. The alternating words in step 1.1 have unbounded lengths, so W has no longest element; the infinite-case statement of [L7] also says no element has all descents.

3.1step 1.1step 2.1L4L9algebra

The series PW=(1+t)/(1−t) and (1−t)/(1+t) are inverse to each other in Q⟦t⟧: their product is 1, and both have constant term 1, so by [L9] (1−t)/(1+t)=1/PW(t) as a formal inverse. This is the identity verified in step 2.1 and shows that 1/PW is rational while PW has infinitely many positive coefficients.

4.1step 1.1step 2.1L4L5algebra∎

The rank-one parabolic W{s}={1,s} has PW{s}(t)=1+t=[2]t. The reduced forms in step 1.1 with no right t-descent are the identity and the alternating words ending in s, exactly one of each length; hence PW{t}=1+t+t2+⋯. By [L5], PW=PW{t}PW{t}=(1+t)(1+t+t2+⋯ ), which is not a polynomial. No finite m has [2]t[m]t=(1+t)/(1−t), since the left side is a polynomial and the right has infinitely many nonzero coefficients. The same group is denoted I2(∞).

Sources