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 row and column Specht conventions in rank three

Example

Let H=HA,q(S3), A=Z[q±1], and put p3(q)=(1+q)(1+q+q2). All four modules P((3)),P((13)),CM((3)),CM((13)) have rank 1. On P((3)) and CM((3)) both generators act by q; on P((13)) and CM((13)) both act by −1. In the canonical generators x(3), y(3), c(3), c(13) the respective self-form values are 1, q−3p3(q), p3(q), 1. Thus Φ(3)(x(3))=c(13) has exact form multiplier u(3)=1, whereas Φ(13)(y(3))=c(3) has u(13)=q3. In both targets the action is twisted by θ, so the two module identities match. At q=1 over Q the respective form values are 1,6,6,1, and θ exchanges trivial and sign. These identities specialize over every commutative ring with a unit parameter. No choice principle is used.

Facts & Assumptions

Given: The type-A Hecke algebra H of S3 over A=Z[q±1] with generators T1,T2, the shapes (3) and (13)=(3)′, their row and polytabloid modules and Murphy cells, the sign automorphism θ with θ(Ti)=(q−1)−Ti, and the comparison theorem and its corollary Ordinary Specht modules are the signed conjugate Murphy cells, Polytabloid specialization and the exact signed multiplicity dictionary.

[F1]

x(3)=∑w∈S3Tw spans P((3))=x(3)H and x(3)Ti=q x(3) for i=1,2; the distinguished basis of M((3)) is {x(3)} with β(x(3),x(3))=1; the Murphy cell CM((3)) has one basis class c(3)=x(3)+I⊳(3) and G(3)(c(3),c(3))=P(3)(q)=p3(q) (Ordinary Specht modules are the signed conjugate Murphy cells).

[F2]

x(13)=1, y(3)=∑w∈S3(−q)−ℓ(w)Tw spans P((13))=y(3)H and y(3)Ti=−y(3) for i=1,2; the distinguished basis of M((13)) is the standard basis {Tw} and β(y(3),y(3))=q−3p3(q); the Murphy cell CM((13)) has one basis class c(13)=1+I⊳(13) with G(13)(c(13),c(13))=1 and Ti acting by −1 (Ordinary Specht modules are the signed conjugate Murphy cells, Polytabloid specialization and the exact signed multiplicity dictionary).

[F3]

The comparison theorem gives base-change compatible isomorphisms Φλ ⁣:P(λ)→CM(λ′)θ with Gλ′θ(Φλx,Φλy)=uλ(q)βP(λ)(x,y) and uλ(q)=qℓ(w0(Sλ′))−ℓ(wλ), where the twisted action is m⋅h=mθ(h) (Ordinary Specht modules are the signed conjugate Murphy cells).

[F4]

At q=1 over Q the specialization is the group algebra Q[S3] and θ(Ti)=−Ti is the sign automorphism (Polytabloid specialization and the exact signed multiplicity dictionary). The H-linearity of the comparison maps is supplied by [F3]; their self-form comparison is a separate assertion.

Verification

technique · direct
1.1F1algebra

Shape (3). For the one-row shape, x(3)=∑w∈S3Tw and pairing u and usi with ℓ(usi)=ℓ(u)+1 gives (Tu+Tusi)Ti=q(Tu+Tusi), hence x(3)Ti=q x(3); since z(3)=x(3)Tw(3)y(13)=x(3) (here w(3)=1 and y(13)=1) the module P((3)) is the free rank-one module on x(3) with action q. Squaring gives x(3)2=∑v,wTvTw=∑vTvx(3)=(∑vqℓ(v))x(3)=p3(q)x(3), because the length distribution in S3 is (1,2,2,1) and 1+2q+2q2+q3=(1+q)(1+q+q2); hence the Murphy cell has form value G(3)(c(3),c(3))=p3(q) and action q, and β(x(3),x(3))=1 by [F1].

1.2F2algebra

Shape (1^3). For the one-column shape, x(13)=1 and P((13))=y(3)H with y(3)=∑w∈S3(−q)−ℓ(w)Tw. For each pair u,usi with ℓ(usi)=ℓ(u)+1, its contribution is a(Tu−q−1Tusi), where a=(−q)−ℓ(u). The quadratic relation gives (Tu−q−1Tusi)Ti=Tusi−q−1((q−1)Tusi+qTu)=−(Tu−q−1Tusi). Summing the pairs gives y(3)Ti=−y(3) for i=1,2, the sign representation of the rank-one module. The distinguished basis of M((13)) is the standard basis and β is diagonal with entries qℓ(w), so β(y(3),y(3))=∑wq−2ℓ(w)qℓ(w)=∑wq−ℓ(w)=q−3p3(q), the last equality by w↦w0w. Modulo the higher ideal I⊳(13), which contains 1+Ti because 1+T1=x(2,1) is a higher Murphy element and conjugation by the invertible braid word T1T2 sends T1 to T2, placing 1+T2 in the same two-sided ideal, the class c(13) satisfies Ti=−1 and G(13)(c(13),c(13))=P(13)(q)=1 by [F2].

2.1step 1.1step 1.2F3algebra

The comparison maps. By [F3] applied to λ=(3), where λ′=(13) and ℓ(w0(S(13)))=ℓ(w(3))=0, the isomorphism Φ(3) has unit u(3)=1 and the identity G(13)θ(Φ(3)x(3),Φ(3)x(3))=β(x(3),x(3))=1 is consistent because both sides are the value of the respective rank-one forms; explicitly Φ(3)(x(3))=c(13) by [F3]. Applying it to λ=(13), where λ′=(3) and ℓ(w0(S(3)))=3, ℓ(w(13))=0, gives u(13)=q3, and the identity G(3)(c(3),c(3))=q3 q−3p3(q)=p3(q) is consistent; explicitly Φ(13)(y(3))=c(3). In the target CM((13))θ the generator acts by the ordinary action of θ(Ti)=(q−1)−Ti, hence by (q−1)−(−1)=q for every unit parameter; at q=1 this is θ(Ti)=−Ti and scalar +1; in the target CM((3))θ it acts by the ordinary action of (q−1)−Ti on the class acting by q, hence by (q−1)−q=−1; these match the source actions q on P((3)) and −1 on P((13)) computed in steps 1.1 and 1.2.

3.1step 1.1step 1.2step 2.1F1F2F3F4∎

Specialization and conclusion. At q=1 over Q the four form values become 1, 1−3p3(1)=6, 6 and 1, and θ is the sign automorphism exchanging the trivial and sign modules, in agreement with [F4]; the module actions match as in step 2.1. Every displayed identity is an identity in A=Z[q±1] between Laurent polynomials, so all of them specialize along any ring map A→R with q↦q∈R×. Only the rank-one computations, the trace-free form evaluations and the comparison theorem were used; no choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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