Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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 seminormal and orthogonal blocks for shape (2,1)

Statement

Let T=132 and T′=123 be the two standard tableaux of shape (2,1), so that s2T=T′ and r:=cT(3)−cT(2)=1−(−1)=2. In the seminormal normalization of the cited theorem the two relations are s2vT′=vT−12vT′,s2vT=12vT+34vT′, so the matrix of s2 in the ordered basis (vT,vT′) with columns the images is (1/213/4−1/2); its transpose (1/23/41−1/2) records the same images as rows rather than columns. Taking vT′ to have unit norm, the longer vector vT has norm 1−r−2=3/2, so unit normalization multiplies vT by 1/1−r−2=2/3, and the orthogonal form of s2 becomes the symmetric orthogonal block (1/23/23/2−1/2). For s1 the entries 1,2 lie in the same row of T′ and in the same column of T, so s1vT′=+vT′ and s1vT=−vT. Both matrices square to the identity and satisfy s1s2s1=s2s1s2 on the two-dimensional Specht module.

Facts & Assumptions

Given: The two standard tableaux T,T′ of shape (2,1), with T obtained from the row tableau T′=T(2,1) by the transposition s2=(2 3), and the Young basis vectors vT,vT′ of the seminormal theorem (Young's seminormal form from the Jucys-Murphy eigenlines, Tableaux and standard tableaux).

[F1]

For a standard tableau S the contents of the cells containing 2 and 3 are cS(2) and cS(3); T carries 2 in (2,1) and 3 in (1,2) so that cT(2)=−1, cT(3)=1 and r=cT(3)−cT(2)=2; the size-two prefixes are T↓[2]=12 of shape (1,1) and T′↓[2]=[1 2] of shape (2) (The content of a node and the content vector of a standard tableau, The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).

[F2]

The seminormal formulas: if S′=siS is standard with i,i+1 in different rows and columns and S′ the longer tableau, then sivS=vS′+rS−1vS and sivS′=(1−rS−2)vS−rS−1vS′, where rS=cS(i+1)−cS(i); in the reverse ordering the pair is governed by the same formulas with S,S′ interchanged and rS replaced by −rS; entries i,i+1 in the same row or column give sivS=±vS (Young's seminormal form from the Jucys-Murphy eigenlines).

[F3]

Rescaling the seminormal basis to unit vectors for the invariant form gives the symmetric orthogonal block (r−11−r−21−r−2−r−1) on (vS,vS′), the positive square root being taken (Young's orthogonal form from the seminormal rescaling).

Proof

technique · direct
1.1F1F2algebra

Apply [F2] with S=T′ (the row tableau, of length 0) and S′=s2S=T (of length 1, the longer one): here rT′=cT′(3)−cT′(2)=(−1)−1=−2, so s2vT′=vT+(−2)−1vT′=vT−12vT′ and s2vT=(1−(−2)−2)vT′−(−2)−1vT=34vT′+12vT.

1.2F1F2givenalgebra

The action of s1=(1 2): in T the entries 1,2 occupy (1,1) and (2,1), the same column, so s1vT=−vT; in T′ they occupy (1,1) and (1,2), the same row, so s1vT′=+vT′. Hence s1 acts by diag⁡(−1,1) in the ordered basis.

2.1step 1.1algebra

Matrix. In the ordered basis (vT,vT′) whose columns are the images, step 1.1 gives M=(1/213/4−1/2). The transpose MT is the array obtained when the images are written as rows. The matrix acting on coordinate columns is M.

3.1step 2.1step 1.2algebra

Involution. Squaring the matrix of step 2.1 gives (1/4+3/41/2−1/23/8−3/83/4+1/4)=(1001), and the matrix of step 1.2 is visibly an involution; this is the statement s12=s22=1 in the two-dimensional Specht module.

3.2step 2.1step 1.2algebra

Braid relation. With M the matrix of step 2.1 and D=diag⁡(−1,1) that of step 1.2, direct multiplication gives DMD=(1/2−1−3/4−1/2)=MDM, which is s1s2s1=s2s1s2 in the ordered basis.

3.3F3step 2.1algebra

Orthogonal rescaling. Normalize the shorter vector vT′ to norm 1. The norm ratio from [F3], applied first in the shorter-to-longer ordering (T′,T), gives ∥vT∥=3/2. Thus the unit basis in the example's ordering is (uT,uT′)=((2/3)vT,vT′). With E=diag⁡(2/3,1), direct change of basis gives E−1ME=(1/23/23/2−1/2). This real symmetric matrix squares to I and is orthogonal.

4.1F2F3step 1.2step 3.3algebra

Consistency with the row and column cases. The signs s1vT=−vT and s1vT′=+vT′ of step 1.2 are the same-row and same-column scalars of [F2] and are unchanged by the positive unit rescaling, so the full action of S3 on the two-dimensional Specht module is exhibited in both normalizations.

5.1step 3.1step 3.2step 3.3∎

The example is the smallest nontrivial check of the seminormal and orthogonal forms: the axial distance r=2, the structure constants 12,34,1, the rescaling factor 2/3 and the orthogonal block agree with the displayed matrices of the sources, and both matrices were verified by exact rational multiplication in steps 3.1 and 3.2.

Remarks

  • Image placement. The column-image matrix is (1/213/4−1/2); writing the images as rows transposes this array. If both arrays are instead regarded as column-action matrices, they are similar by rescaling vT by 4/3. All computations above use the column-image convention.

  • The orthogonal block. (1/23/23/2−1/2) is the reflection of the plane in the line spanned by the eigenvector of s2 with eigenvalue +1; it squares to the identity and satisfies the braid relation with the diagonal matrix of s1 by step 3.2.

  • Comparison with James. For shape (3,2) the same conventions produce 2×2 blocks with axial distances r=±2,±3; the shape (2,1) block here is its smallest instance and the one displayed in the sources.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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