Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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.

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].

Depends on

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