Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge 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.

Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial

Definition

Let (W,S) be a Coxeter system with S finite, presented group W, length function ℓ and standard parabolic subgroups WI=⟨s:s∈I⟩ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let DL(w)={s∈S:ℓ(sw)<ℓ(w)} and DR(w)={s∈S:ℓ(ws)<ℓ(w)} be the descent sets with the conventions fixed in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2).

(1) Length generating series. Let A⊆W. The length generating series (also Poincare series) of A is PA(t):=∑w∈Atℓ(w)∈Z⟦t⟧ (Formal power series over a commutative ring and the coefficient-extraction functional [xn]). It is well defined: for every n∈N the fiber {w∈W:ℓ(w)=n} is finite. Evaluation of the n-letter words gives a map Sn→W, and each element of the fiber is the value of one of its reduced words; Sn is finite by The product rule: ∣A×B∣=∣A∣ ∣B∣, and ∣∏i<mAi∣=∏i<m∣Ai∣. Hence [tn]PA=∣{w∈A:ℓ(w)=n}∣ is the cardinality (The cardinality ∣A∣ of a finite set) of a finite set, viewed as an integer. This includes S=∅: the length-zero fiber is {1} and every positive-length fiber is empty. If 1∈A then PA(0)=1 and PA(t) is a unit of Z⟦t⟧ with a recursively determined formal inverse (A formal power series is a unit exactly when its constant coefficient is a unit); if 1∉A then PA(0)=0 and PA(t) is not a unit. Thus PA(t) is a unit exactly when 1∈A. No convergence, radius of convergence or evaluation at a real number is asserted.

(2) Spherical subsets and descent-class series. A subset I⊆S is spherical when the standard parabolic WI is finite. For I⊆J⊆S the descent-class series is DIJ(t):=∑w∈WI⊆DR(w)⊆Jtℓ(w)∈Z⟦t⟧.

This series is well defined coefficientwise because its length-n summation set is a subset of the finite length-n fiber in (1).

(3) Multivariate descent polynomial (finite W only). For finite W define the marked multivariate descent polynomial W^(x,y,t):=∑w∈Wtℓ(w)∏s∈DR(w)xs∏s∈S∖DR(w)ys∈Z[xs,ys:s∈S][t] (Polynomial rings in finitely many commuting indeterminates by iteration). This is a polynomial because the sum is finite. Setting every ys=1 recovers the usual descent polynomial ∑w∈Wtℓ(w)∏s∈DR(w)xs. For I⊆J⊆S, substitute xs=1,ys=0 for s∈I, xs=ys=1 for s∈J∖I, and xs=0,ys=1 for s∉J. A term survives exactly when I⊆DR(w)⊆J, and then its descent/non-descent factors all equal 1; hence this evaluation is DIJ(t), also a polynomial. This includes I=∅,J=S (the full series PW) and I=J (the exact descent set I).

(4) Conventions and limits. P∅=0 and P{1}=1. For infinite S no scalar Poincare series is defined here; finite S is the standing hypothesis that ensures the finite-coefficient argument in (1). This definition makes no assertion that PA is rational, that WJ has a length-additive interpretation, that DIJ(t) has the inclusion-exclusion expansion, or that WDR(w) is finite; those are separate results, not part of the definitions above. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

47 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