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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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