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 A2 = S3 case: Steinberg inclusion-exclusion, degree product, and reciprocity
Example
Let in its type Coxeter presentation with (The finite symmetric group , one-line notation, and cycle notation, Inversions, inversion number, the sign , and even and odd permutations). The library defines on ; the order-preserving relabelling identifies it with permutations of and preserves inversion number, so we write the adjacent generators as and . This is the smallest-rank finite Coxeter system whose diagram is not a product of copies of . The example checks the finite 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 (length ), (length ), (length ) and (length ); hence , with (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 , , , , , , so and, with the interval convention of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (2), the nine interval series are The parabolic series are and . The Steinberg identity (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (4)) reads which is a polynomial identity after clearing denominators, and equivalently .
(3) Degree product. The basic degrees of are and (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 , (The cardinality of a finite set) and .
(4) Reciprocity. : the coefficient sequence 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 in the type presentation with simple generators , its length function , the Axiom of Choice for the basic-degree comparison, the descent sets and the series , of Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial.
Under the order-preserving relabelling , the library's is identified with permutations of and its adjacent generators are and (The finite symmetric group , one-line notation, and cycle notation). Direct composition gives the distinct one-line forms , , , , , for , respectively. These are all one-line arrangements of three entries. In the type- presentation, canceling 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 (Inversions, inversion number, the sign , and even and odd permutations); their lengths have these same values, since the length-two words are distinct from the identity and generators, while is distinct from all words of length at most two.
The element has length and is longest by [L1]; the finite longest-element result gives and for all (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii),(iii)). Thus .
uses the inclusive interval convention (Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial (2)).
The factorization theorem gives unique length-additive parabolic factorizations; for , and (Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth (2)).
Under the Axiom of Choice (The Axiom of Choice), the independently determined basic-degree table gives for (A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types (2)).
The longest-element bijection and the length complementation in [L2] give for finite , by summing over ; 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.
and , so the classical product gives (Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models (3)).
The cardinality of the six-element set is (The cardinality of a finite set).
Verification
Length and parabolic factorization. By [L1], the six elements exhaust and have lengths ; hence and by [L2]. For , [L5] gives and , so the length-additive factorization gives , agreeing with the direct enumeration.
Descent intervals. Reading right descents from the length table gives , , , , and . Thus the exact-descent series for are respectively . Summing these four classes over each inclusive interval gives , , , , and for , exactly the nine cases in the statement.
Inclusion-exclusion. Apply [L6] to the nine pairs . The needed quotients are , (the elements whose right descents omit ), and . The six symmetry classes of pairs yield, respectively, , for , , , , and . This verifies every interval value in the statement directly from the formula.
Steinberg identity. Substituting , and into the finite identity of [L7] gives . Clearing the denominator yields ; both sides equal . The reciprocity of [L9] gives , so this is also the rational-function identity displayed in the statement.
Degree product and reciprocity. By [L8], the basic degrees of are and , and by [L10] the classical product is ; this agrees with step 1.1. At , by [L11]. Also by step 1.1, and , so the coefficient sequence is palindromic as in [L9].
Depends on
- Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial
- The cardinality $\lvert A\rvert$ of a finite set
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Inversions, inversion number, the sign $\operatorname{sgn}(\sigma)=(-1)^{\operatorname{inv}(\sigma)}$, and even and odd permutations
- Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity
- Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth
- The Axiom of Choice
- A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
90 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)