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 be a Coxeter system with finite and length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with , , as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups and the series , of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial. Put Then:
(1) Finite descent parabolics and the finite/infinite dichotomy. If for some (equivalently, if for some ), then is finite. In particular and are finite for every . Conversely, if is finite with longest element , then . Consequently is finite if and only if some satisfies , if and only if some satisfies ; and if is infinite then no element has all descents. If is finite, then , while if is infinite then .
(2) Parabolic factorization. For every the multiplication maps and are bijections and is additive along them; consequently in . If the diagram of is disconnected with components on the nonempty pairwise disjoint sets , then , , and . When , the presentation gives and this product over no components is .
(3) Descent inclusion-exclusion. For all ,
(4) Steinberg identity. With formal inverses (A formal power series is a unit exactly when its constant coefficient is a unit), valid because , as an identity in . If is finite, then is a polynomial and rewrites the identity, in the rational function field , as
(5) Rationality. Every is a rational formal power series (Rational formal power series, proper presentations and reduced denominators), by induction on using proper parabolics as the recursive inputs. For , (4) yields the recursions The denominator in the finite recursion has nonzero constant term. If , then and , so no recursion with an empty denominator is asserted. Hence : the growth series of every finite-rank Coxeter system is rational. No choice principle is used.
Facts & Assumptions
Given: A Coxeter system with finite and length function , its standard parabolics , the descent sets , the quotient sets , and the series , of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial.
and for , and for all (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 gives a word of the same length for , so (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
For every and every there is a unique pair , with and , and then for all ; likewise a unique pair , with and , and then for all (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)).
If satisfies for every , then is finite and is its longest element (An element with full left descent makes the Coxeter group finite and is the longest element (2)).
If is finite, its longest element is unique and satisfies , and for all , and ; if is finite then satisfies for all (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(iii),(2)).
for the support of any reduced expression of , , and 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)).
If the diagram of is disconnected with components on the nonempty pairwise disjoint sets , then and for all (Disconnected diagrams, direct products, and comparison of invariant forms (1)).
For every , each length fiber is finite and is a well-defined element of , with if and otherwise (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (1)).
The coefficientwise sum and Cauchy product make a commutative ring (Cauchy multiplication makes a commutative ring containing as the finitely supported subring).
A formal series is a unit if and only if its constant coefficient is a unit; in particular every is a unit because (A formal power series is a unit exactly when its constant coefficient is a unit).
In the additive commutative monoid of , 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).
Since is finite, its power set is finite ( for finite ).
A series is rational over when for with (Rational formal power series, proper presentations and reduced denominators). Then . If also , then , so the reciprocal is rational over as well.
If is a reduced expression and satisfies , then for some ; if instead then for some (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (2)).
Induction on a natural number is valid (The principle of mathematical induction).
A finite product of finite sets is finite with cardinality the product of their cardinalities, and a finite disjoint union of finite sets is finite with cardinality the sum of their cardinalities (The product rule: , and , The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition).
Proof
Let and with . Write with , as in [F2], so for every ; since by [F1], we get for all . Now for every , because and turn into ; hence , and [F3] applied to gives that is finite and ; since by [F4], . Symmetrically, if , write with , as in [F2]; then for , so gives for all , and [F3] applied to shows that is finite. In particular and are finite for every , and taking shows that if some has or then is finite.
Let be finite with longest element as in [F4]. For the element lies in , so and likewise : thus . Conversely let and suppose . Fix a reduced expression with all (possible by [F5], since ); by [F13] is a product of elements of , hence lies in , so and therefore by [F5], a contradiction. Since by [F1], it follows that , i.e. . The right-handed version uses the right form of [F13] with the same computation; hence . In particular, if is finite then for .
Fix . By [F2] the maps , , and , , are bijections along which is additive. For each , the map restricts to a bijection from the finite disjoint union onto ; finiteness follows from [F7, F15]. Its cardinality is exactly the Cauchy-product coefficient , so coefficientwise equality gives . The same argument with the factorization gives . If , then and both series and the empty product are . Otherwise, in the disconnected case [F6] gives an isomorphism carrying to with additive length. Iterating the same coefficient argument over the finite set of components gives .
Fix and for put , a set partition of indexed by the finite power set by [F11], so that for every by [F7] and the displayed definition in statement (3), while . Substituting the first display into the sum of the statement gives with , a finite interchange licensed by [F8, F10]. Writing with , the condition becomes and , so ; when fix and the map is a fixed-point-free involution of the subsets of that negates , so , and when the sum is the single term . Now means , and since this holds exactly when : each lies in but not in , hence in , while gives . Together with this is exactly , so the whole sum equals , which is the asserted identity.
By step 1.2, if is finite then some element (namely ) has all left descents and all right descents; by step 1.1, if some element has all descents then is finite. Hence is finite if and only if some satisfies , if and only if some satisfies ; so if is infinite then no element has all descents. Now . If is infinite the index set is empty, so . If is finite and , apply the factorization argument of step 1.1 with : write with and . Since , the set is all of , so its unique minimal representative is and ; the argument in step 1.1 then gives , so ; conversely by step 1.2. Hence in the finite case.
Take in step 1.4; since , this gives after the substitution . By step 1.3 for every , and because contains the identity, so [F7, F9] gives in . Substituting and dividing the resulting identity by the unit yields , and step 2.1 evaluates the right side as when is finite and as when is infinite, which is the asserted two-case identity. In the finite case, is a bijection of with by [F4], so summing over gives for , i.e. as polynomials; hence as rational functions and the identity rewrites as .
By [F14], induct on rank, proving rationality over in the sense of [F12]. At rank zero and . Suppose the assertion holds through rank , and let . For every proper , [F5] identifies with the intrinsic series of , so write with integer polynomials and . Its constant term is by [F7], hence and its reciprocal is . A finite sum of these signed reciprocals is rational over : put it over the common denominator , which has constant term . In the infinite case step 3.1 gives . This rational series has constant term , so its reciprocal is rational by [F12]. In the finite case the same step gives for . Choose ; pairing with cancels the full alternating subset sum, so . Thus is rational over by [F12], and so is . This proves the induction, both recursions, and in particular rationality in . The single finite-set selection and all unique factorizations use no choice principle.
Depends on
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
- Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- Formal power series over a commutative ring and the coefficient-extraction functional $[x^n]$
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Rational formal power series, proper presentations and reduced denominators
- Disconnected diagrams, direct products, and comparison of invariant forms
- An element with full left descent makes the Coxeter group finite and is the longest element
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- Cauchy multiplication makes $R\llbracket x\rrbracket$ a commutative ring containing $R[x]$ as the finitely supported subring
- A formal power series is a unit exactly when its constant coefficient is a unit
- Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The principle of mathematical induction
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
- The sum rule: a finite disjoint union is finite with $\lvert A \cup B\rvert = \lvert A\rvert + \lvert B\rvert$ and $\lvert\bigcup_{i \in I} A_i\rvert = \sum_{i \in I}\lvert A_i\rvert$, and a sum over a finite index set splits along a partition
Used by
- Infinite dihedral growth, the infinite Steinberg identity, and the failure of polynomial reciprocity Example
- The A2 = S3 case: Steinberg inclusion-exclusion, degree product, and reciprocity Example
- Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models Lemma
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
- A. Björner and F. Brenti, Combinatorics of Coxeter Groups, GTM 231 (class-hosted complete PDF) (standard reference, not scraped)
- M. W. Davis, The Geometry and Topology of Coxeter Groups (author manuscript of the book) (standard reference, not scraped)