Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 two-tableau pairing at a singular parameter

Example

For λ=(2,1) put x=1+T1 and b0=x, b1=xT2, b2=xT2T1 in the row permutation module. Its form is diag⁡(1,q,q2) and its generator action matrices, with coordinate row vectors, are R1=(q000010qq−1), R2=(010qq−1000q). The ordinary polytabloid basis is p0=z=xT2(1−q−1T1)=b1−q−1b2 and p1=zT2=qb0+(q−1)b1−b2. Their embedding has unit determinant on its b0,b2 coordinates, and their form is B=(q+1q2q2q3+q). In the Murphy quotient let c0=x, c1=xT2 modulo the higher shape (3). Its form and generator action matrices, with coordinate row vectors, are G=(q+1−1−1q2+1),M1=(q0−1−1),M2=(01qq−1). On the ordinary basis the matrices are P1=(−10−q2q) and P2=M2. The map Φ(p0)=c0, Φ(p1)=(q−1)c0−c1 has matrix A=(10q−1−1); it satisfies PiA=A((q−1)I−Mi) and AGAT=B. The same-shape perfect cross-pairing on the bases (c0,c1) and (p0,p1) has matrix Q=(0qqq(q−1)) with determinant −q2, a unit; its entries are the row-form coefficients before quotienting. Thus the exact self-form multiplier is 1. Both Gram determinants equal q(1+q+q2). At q=−1 over characteristic zero these forms are nonsingular with determinant −1, even though [2]q=0; at q=1 in characteristic 2 both reduce to (0110) and have radical 0. This distinguishes a singular algebra parameter from degeneracy of this particular module form. No choice principle is used.

Facts & Assumptions

Given: The Hecke algebra H=HR,q(S3) over a commutative ring R with q∈R×, the shape λ=(2,1)=λ′, the row module M(λ) with x=xλ=1+T1 and the distinguished basis {b0,b1,b2}, the polytabloid module P(λ)=zλH with zλ=xT2(1−q−1T1), the permutation form β and the Murphy cell CM(λ) with classes c0,c1 and form G, together with the comparison theorem and the perfect cross-pairing of Ordinary Specht modules are the signed conjugate Murphy cells and Murphy cells are the same-shape contragredient Specht duals.

[F1]

H has generators T1,T2 with (Ti−q)(Ti+1)=0, braid relation T1T2T1=T2T1T2 and standard basis {Tw}; xT1=q x (The generic type-A Hecke algebra, The row permutation module: distinguished basis and Hecke action).

[F2]

The distinguished basis {b0,b1,b2}={x,xTs2,xTs2s1} of M(λ) satisfies β(bi,bj)=δijqi and is the row basis of Dλ={1,s2,s2s1} (Hecke row permutation modules and ordinary Dipper-James polytabloids, The row permutation module: distinguished basis and Hecke action).

[F3]

CM(λ)=M(λ)/(M(λ)∩I⊳λ) has basis ct=xTd(t) for the standard tableaux t, and its form satisfies musmtv≡G(cs,ct)muv(modI⊳λ); the ideal I⊳λ contains x(3)=b0+b1+b2 (The Murphy cellular basis, the cell law and the Murphy form).

[F4]

Φ ⁣:P(λ)→CM(λ)θ is an isomorphism with Φ(z)=c0 and unit uλ(q)=qℓ(w0(Sλ′))−ℓ(wλ)=q1−1=1 for λ=(2,1); the pairing Bλ(ms,p)=β(xTd(s),p) is perfect with the explicit entries Bλ(cs,et)=qℓ(d(s))ad(s),t (Ordinary Specht modules are the signed conjugate Murphy cells, Murphy cells are the same-shape contragredient Specht duals).

Verification

technique · direct
1.1F1F2algebra

Row module. From [F1], b0T1=xT1=qx=q b0, b1T1=xT2T1=b2 and b2T1=xT2T12=xT2((q−1)T1+q)=(q−1)b2+q b1; also b0T2=b1, b1T2=xT22=x((q−1)T2+q)=(q−1)b1+q b0 and b2T2=xT2T1T2=xT1T2T1=q xT2T1=q b2, using the braid relation. In the basis (b0,b1,b2) with coordinate row vectors these are exactly the matrices R1 and R2 of the statement, and β(bi,bi)=qi by [F2] because ℓ(1)=0, ℓ(s2)=1, ℓ(s2s1)=2.

2.1step 1.1F2F4algebra

Polytabloids and their form. Since zλ=xT2(1−q−1T1) by [F4] and yλ′=1−q−1T1, the displayed expressions p0=b1−q−1b2 and p1=zT2=b1T2−q−1b2T2=qb0+(q−1)b1−b2 follow from step 1.1. Their coordinates on (b0,b2) give the matrix (0−q−1q−1) with determinant q⋅q−1=1, a unit over every R; hence the two polytabloids span a free rank-two split submodule. The row action gives p0T1=−p0, p1T1=−q2p0+qp1, p0T2=p1 and p1T2=qp0+(q−1)p1. Thus their span is stable, has precisely the displayed matrices P1,P2, and equals zH because it contains z=p0 and zT2=p1. Weighted inner products against the diagonal form of [F2] give B=(q+1q2q2q3+q): explicitly B00=q+q−2⋅q2=q+1, B01=q(q−1)+(−q−1)(−1)q2=q(q−1)+q=q2, and B11=q2+(q−1)2q+q2=q3+q. Its determinant is q(q2+q+1).

2.2step 1.1F3algebra

The Murphy quotient. In CM(λ) the higher vector x(3)=b0+b1+b2 vanishes by [F3], so b2=−c0−c1 and c1=xT2=b1. Then c0T1=qx=q c0 and c1T1=b2=−c0−c1, giving M1; also c0T2=c1 and c1T2=(q−1)b1+qb0=(q−1)c1+qc0, giving M2. The defining products of [F3] give x2=(q+1)x and xT2x=b1+b2=x(3)−x≡−x. Also xT22x=(q−1)xT2x+qx2≡(q2+1)x. Reading the coefficient of mt0t0=x therefore gives G(c0,c0)=q+1, G(c0,c1)=−1 and G(c1,c1)=q2+1; equivalently G=(q+1−1−1q2+1) with determinant q3+q2+q.

3.1step 2.1step 2.2F4algebra∎

Comparison, cross-pairing and specializations. The comparison theorem of [F4] gives Φ(z)=c0, hence Φ(p1)=Φ(zT2)=c0θ(T2)=(q−1)c0−c1 and A=(10q−1−1); direct matrix multiplication verifies PiA=A((q−1)I−Mi) for i=1,2 and AGAT=B, the latter being the form identity with the unit uλ=1. The cross-pairing entries Bλ(cs,pt)=β(bd(s),pt) on the standard bases give Q=(0qqq(q−1)) with det⁡Q=−q2∈A×, so the pairing is perfect as in [F4]. The two Gram determinants agree with q(1+q+q2). At q=−1 in characteristic zero, B=(011−2) and G=(0−1−12) have determinant −1, although [2]q=1+q=0; at q=1 in characteristic 2, both reduce to (0110) with determinant 1, hence with zero radical. All identities are Laurent-polynomial identities, so they specialize to every R; no choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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