Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Murphy cells are the same-shape contragredient Specht duals

Statement

Let R be a commutative ring, q∈R× and λ⊢n, and let CM(λ) with its basis {mt}, P(λ)=zλH, the permutation form β on M(λ) and the DJ form on P(λ) be as in Hecke row permutation modules and ordinary Dipper-James polytabloids, The Murphy cellular basis, the cell law and the Murphy form and Integral polytabloid straightening for the comparison. Then:

  1. Setting Bλ(ms,p):=β(xλTdλ(s),p) for s∈Std⁡(λ) and p∈P(λ) defines an explicit R-bilinear pairing Bλ ⁣:CM(λ)×P(λ)→R that is H-balanced, Bλ(mh,p)=Bλ(m,ph∗), and whose adjoint c↦Bλ(c,−) is an isomorphism of right H-modules CM(λ)→P(λ)∘ onto the star-contragredient module of The Hecke sign automorphism, pullback and contragredient dual. No nondegeneracy of the DJ form βP(λ) is required.

  2. Equivalently, the kernel of the quotient map M(λ)→CM(λ) is the orthogonal complement P(λ)⊥={a∈M(λ):β(a,p)=0 for all p∈P(λ)}, namely M(λ)∩I⊳λ; the pairing matrices in the bases {ms} and {et} have entries Bλ(ms,et)=qℓ(dλ(s))adλ(s),t with et=∑dad,tbd, and determinant a unit of A=Z[v±1]. Their inverses are finite tableau formulas given by the adjugate divided by this unit.

  3. All statements are compatible with every base change A→R, v↦q; the construction uses no generic semisimplicity, no nondegeneracy of βP(λ) and no choice principle.

Facts & Assumptions

Given: A commutative ring R, q∈R×, a partition λ⊢n, the Hecke algebra H=HR,q(Sn) with its standard basis, star anti-involution, the modules M(λ)=xλH⊇P(λ)=zλH, the distinguished basis {br=xλTdλ(r)} of M(λ) and the permutation form β, the Murphy basis {mstρ}, the dominance ideal I⊳λ, the cell module CM(λ) with basis {ms} and the Murphy form Gλ.

[F1]

The trace τ ⁣:H→R, τ(Tw)=δw,1, satisfies τ(ab)=τ(ba) and τ(a∗b)=B0(a,b)=δu,vqℓ(u) for standard basis elements a=Tu, b=Tv; the bilinear form τ(a∗b) has unit diagonal in the standard basis (The Murphy cellular basis, the cell law and the Murphy form, Proof step 1.3).

[F2]

M(λ) is free on {br}, β(br,bv)=δr,vqℓ(dλ(r)), and β is H-contravariant; P(λ) is free on {et=zλTdλ′(t)} and a split direct summand of M(λ) (The row permutation module: distinguished basis and Hecke action, The permutation form is H-contravariant and restricts to the DJ form, Integral polytabloid straightening for the comparison).

[F3]

CM(λ)=M(λ)/(M(λ)∩I⊳λ), K:=M(λ)∩I⊳λ is the kernel of the quotient, I⊳λ is spanned by the Murphy elements muvν with ν⊳λ, and {ms} is an R-basis of the cell module (The Murphy cellular basis, the cell law and the Murphy form).

[F4]

xκHyρ=0 whenever ∑i≤kκi>∑i≤kρi′ for some k≥1 (Row symmetrizers and signed column symmetrizers vanish outside dominance).

[F5]

The star-contragredient N∘=Hom⁡R(N,R) of a right H-module is a right H-module via (fh)(m)=f(mh∗); for finite free N it is finite free of the same rank and (−)∘ commutes with base change (The Hecke sign automorphism, pullback and contragredient dual).

Proof

technique · direct
1.1F1F2algebra

The correctly scaled universal trace formula. Work first over A=Z[v±1], using q=v as the formal parameter. For d,e∈Dλ, length additivity gives bd=∑u∈SλTud, and [F1] gives τ(bd∗be)=0 when d≠e, while τ(bd∗bd)=∑u∈Sλqℓ(ud)=qℓ(d)Pλ(q), where Pλ(q):=∑u∈Sλqℓ(u). By bilinearity, τ(a∗b)=Pλ(q) β(a,b)(a,b∈MA(λ)). The factor Pλ is essential; it is not generally a unit and can vanish after specialization. It is nonzero in the domain A, since its constant coefficient is 1.

2.1step 1.1F2F3F4algebra

Orthogonality before specialization. Put KA=MA(λ)∩IA⊳λ and p=zλh. For a higher Murphy element muvν=Tdν(u)∗xνTdν(v) with ν⊳λ, its product with p after star is (muvν)∗p=Tdν(v)∗xν(Tdν(u)xλTwλ)yλ′h=0, because xνHyλ′=0 by [F4]. The outer factor multiplies a zero vector; no factor is silently discarded. Expand k∈KA in the higher Murphy basis using [F3]. Then k∗p=0 and step 1.1 gives Pλ(q)β(k,p)=0. Cancel this nonzero polynomial only in the universal domain A, proving β(KA,PA)=0. The quotient and its kernel in [F3] are base-change compatible: the quotient is free on the supplied standard basis, its kernel is the split kernel of that quotient, and the independent Murphy construction identifies its specialization with MR(λ)∩IR⊳λ. Thus tensoring the zero pairing identity gives β(KR,PR)=0 for every R and unit q. No cancellation is performed in R, including when Pλ(q)=0.

3.1step 2.1F2F3F5algebra

The descended pairing is perfect. Define Bλ(a+KR,p)=β(a,p); step 2.1 proves this is well defined. Contravariance gives Bλ(ch,p)=Bλ(c,ph∗), so its adjoint CM(λ)→P(λ)∘ is an H-homomorphism by [F5]. The map M(λ)→M(λ)∘, a↦β(a,−), is an isomorphism with unit diagonal qℓ(d). Compose this map itself with restriction M(λ)∘→P(λ)∘, which is onto because P(λ) is split in M(λ). The resulting surjection kills KR and therefore factors onto CM(λ)→P(λ)∘. Both are free of rank fλ. Choosing preimages of their finitely many basis vectors gives a right inverse of its square matrix; the determinant is a unit, so the adjoint is an isomorphism. This proves clause 1 without any nondegeneracy of the DJ self-form.

4.1step 3.1F1F2F3F5algebra∎

Kernel, finite formulas and every base change. The kernel of M(λ)→P(λ)∘ is P(λ)⊥ by its definition. Since the factored adjoint is an isomorphism, this is exactly KR=M(λ)∩I⊳λ. Write et=∑dad,tbd with the finite Laurent-polynomial coefficients of the integral polytabloid basis. Then Bλ(ms,et)=qℓ(dλ(s))adλ(s),t. Compute these coefficients by the finite signed-symmetrizer expansion and standard-basis multiplication; the inverse pairing matrix is det⁡(Bλ)−1adj⁡(Bλ). Over A its determinant is a Laurent unit by step 3.1, so both the pairing and its inverse specialize to every R, retaining perfectness and the kernel identity. Empty shapes have the rank-one pairing 1. No generic semisimplicity, nondegeneracy of the DJ self-form, division by a specialized Poincaré polynomial or choice principle is used.

Depends on

Used by

Dependency tree · two levels

16 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