Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Jucys–Murphy Elements and Seminormal Forms — Examples

1 · Prerequisites

2 · Summary

These computations exercise the Jucys–Murphy machinery at the smallest symmetric groups. The first expands the elementary symmetric evaluations e1,e2,e3 in X2,X3,X4 inside S4 and matches them with the sums of transpositions, elements with two cycles, and four-cycles.

The counterexample shows that characteristic-zero interpolation formulas fail in characteristic two: the addable contents 1,−1 of (1) coincide modulo 2, so their Lagrange denominator vanishes, while the modular Specht module still exists. The following example lists the four size-three content vectors and primitive idempotents, verifying idempotence, orthogonality, the partition of unity, and the central idempotent of the two-dimensional module.

The final example computes the seminormal and orthogonal blocks for shape (2,1), with axial distance r=2 and rescaling factor 2/3, and verifies the involution and braid relations by exact matrix multiplication.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Elementary Jucys-Murphy class sums through S_4

Statement

In S4 with X2=(1 2), X3=(1 3)+(2 3), X4=(1 4)+(2 4)+(3 4): the element e1(X2,X3,X4)=X2+X3+X4 is the sum of the six transpositions, the permutations of S4 with 3 cycles; the element e2(X2,X3,X4) is the sum of the 11 permutations with 2 cycles (the three double transpositions and the eight 3-cycles); and e3(X2,X3,X4) is the sum of the six 4-cycles, the permutations with one cycle. The evaluations are central: e1 and e3 are single class sums, while e2 is the sum of the class sums of types (2,2) and (3,1).

Facts & Assumptions

Given: The symmetric group S4 acting on {1,2,3,4} and the elements X2=(1 2), X3=(1 3)+(2 3), X4=(1 4)+(2 4)+(3 4) of Z[S4] (The Jucys-Murphy elements of the symmetric group algebra).

[F1]

The elementary symmetric polynomials are e1=x1+x2+x3, e2=x1x2+x1x3+x2x3, e3=x1x2x3 in three variables (The elementary symmetric polynomials e0,e1,…,en).

[F2]

For 0≤s≤n one has es(X2,…,Xn)=∑ρ⊢n, ℓ(ρ)=n−sCρ(n), the sum of all permutations of Sn with exactly n−s cycles (Elementary symmetric Jucys-Murphy evaluations are cycle-count class sums).

[F3]

Cycle type, support and cycle decomposition are as defined in Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type: a permutation of S4 has 3 cycles exactly when it is a transposition, 1 cycle exactly when it is a 4-cycle, and the elements with 2 cycles are the three double transpositions together with the eight 3-cycles.

Proof

technique · direct
1.1F1F3given

The displayed elements are X2=(1 2), X3=(1 3)+(2 3) and X4=(1 4)+(2 4)+(3 4); the products below are computed in the group algebra Z[S4], in which distinct permutations form a Z-basis.

2.1step 1.1algebra

X2X3=(1 2)((1 3)+(2 3))=(1 2)(1 3)+(1 2)(2 3)=(1 3 2)+(1 2 3).

2.2step 1.1algebra

X2X4=(1 2)((1 4)+(2 4)+(3 4))=(1 2)(1 4)+(1 2)(2 4)+(1 2)(3 4)=(1 4 2)+(1 2 4)+(1 2)(3 4).

2.3step 1.1algebra

X3X4=((1 3)+(2 3))((1 4)+(2 4)+(3 4))=(1 3 4)+(1 4 3)+(2 3 4)+(2 4 3)+(1 3)(2 4)+(1 4)(2 3).

2.4F1F3step 1.1algebra

e1(X2,X3,X4)=X2+X3+X4=(1 2)+(1 3)+(2 3)+(1 4)+(2 4)+(3 4), the six transpositions, i.e. the six permutations with 3 cycles by [F3].

3.1F1F3step 2.1step 2.2step 2.3algebra

Adding the three products of steps 2.1-2.3 gives e2(X2,X3,X4)=X2X3+X2X4+X3X4=(1 3 2)+(1 2 3)+(1 4 2)+(1 2 4)+(1 3 4)+(1 4 3)+(2 3 4)+(2 4 3)+(1 2)(3 4)+(1 3)(2 4)+(1 4)(2 3): eight 3-cycles and the three double transpositions, i.e. 11 permutations, all with 2 cycles by [F3].

3.2F1F3step 1.1step 2.3algebra

e3(X2,X3,X4)=X2X3X4=(1 2 3 4)+(1 2 4 3)+(1 3 2 4)+(1 3 4 2)+(1 4 2 3)+(1 4 3 2), the six 4-cycles, i.e. the permutations with one cycle by [F3]; indeed the product is X2(X3X4) and the six products of the three transpositions of X4 with (1 2) and the two transpositions of X3 are exactly the six listed 4-cycles, with no repetitions among them.

4.1F2step 3.1step 2.4step 3.2algebra

By [F2] with n=4 the evaluations es(X2,X3,X4) equal the class sums ∑ℓ(ρ)=4−sCρ(4) for s=1,2,3, which are exactly the three displayed finite sums; each class sum is central because conjugation permutes each conjugacy class. In particular no term cancels and every coefficient is 1, as the explicit expansions of steps 3.1 and 3.2 show.

5.1F2step 4.1∎

The case s=0 gives e0=1 and the case s=4 gives e4=0; the example exhibits the three nontrivial evaluations and confirms the identity of [F2] at the first size with three nonzero positive-degree elementary evaluations.

Remarks

  • The counts. S4 has 6 transpositions, 3 double transpositions, 8 three-cycles and 6 four-cycles, so the three sums have 6, 3+8=11 and 6 terms; these are the class sizes of the cycle types 2 12, 22, 3 1 and 4.

  • Centrality. By [F2] each evaluation is a sum of conjugacy-class sums, hence lies in Z(C[S4]). There are four nonidentity conjugacy classes; e2 combines two of them, so these three evaluations do not individually list all four class sums.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Ordinary Jucys-Murphy projection formulas do not survive content collision

Statement refuted

For every field F and every standard tableau T of size n, the characteristic-zero interpolation formula PT=PT↓[n−1]∏c∈A(μ)c≠cT(n)Xn−ccT(n)−c defines an element of F[Sn] and yields the primitive tableau idempotents of the group algebra over F, by the same recursion as over C.

Facts & Assumptions

Given: Let F be the field with two elements and n=3, so that F[S3] is the group algebra over F (For every prime p and n≥1, a field with pn elements exists, Finite fields and their order).

[F1]

In F one has 1+1=0; in particular the integer 2 is zero in F. [thm-existence-of-finite-fields, def-finite-field-and-its-order, algebra]

[F2]

For λ=(2,1) the two standard tableaux are T=123 and T′=132, with content vectors (0,1,−1) and (0,−1,1); these vectors are congruent modulo the relation 1=−1 in F, i.e. they have the same entries in Z/2 (The content of a node and the content vector of a standard tableau).

[F3]

The common size-one prefix of T and T′ has shape (1), which has exactly two addable nodes (1,2) and (2,1), of contents 1 and −1; the entry 2 of T sits in (1,2) and the entry 2 of T′ sits in (2,1) (Removable and addable nodes, The content of a node and the content vector of a standard tableau).

[F4]

Over F the modular Specht module SF(2,1) is the span of the (2,1)-polytabloids and is nonzero (Integral and field-valued Specht modules).

Proof

technique · direct
1.1F3givenalgebra

The interpolation recursion of the refuted statement, applied with n=2 to the tableau whose entry 2 lies in the addable node of content 1 of the shape (1), is PT=P[1]X2−ccT(2)−cwith cT(2)=1, c=−1, because A((1))={1,−1} by [F3]; thus the factor is (X2+1)/(1−(−1))=(X2+1)/2.

1.2F2F3F4algebra

The failure is not caused by the absence of the module: over F the Specht module SF(2,1) and its endomorphism algebra continue to exist by [F4]. Writing bj for the tabloid with j in its singleton row, the polytabloids span the two-dimensional subspace span⁡F{b3−b1,b2−b1}, since these differences are independent and every polytabloid is a difference bj−bk. The two content vectors of [F2] even coincide after reduction to Z/2; what fails is precisely the separation of the two addable contents 1 and −1 that the interpolation denominators encode.

2.1F1step 1.1algebra

Evaluation of the displayed factor in F[S3] requires the inverse of the integer 2 in F; but 2=0 in F by [F1], so the factor (X2+1)/2 is not an element of F[S3] and the formula does not define PT over F. The same applies to the companion tableau T′, whose factor is (1−X2)/2.

3.1step 2.1step 1.2algebra∎

Hence the characteristic-zero interpolation formula for the primitive idempotents does not reduce to a formula of the same shape over a field of characteristic 2: the collision prevents these factors from separating the two prefixes. No nonexistence assertion about other idempotents follows from this calculation. This refutes the displayed statement and completes the counterexample.

Remarks

  • What is and is not claimed. The item refutes only the transfer of the interpolation formula as written; it does not claim that the idempotents or the Specht module fail to exist over F, nor that no formula with different coefficients can exist. The smallest failure is the step n=1→2, where the denominator cT(2)−c=2 collides with the characteristic.

  • Residues. Modular approaches can aggregate tableau projectors with the same residue vector, rather than separating coincident contents. The residue idempotents need not be central or primitive. Mathas, Lemma 4.2 and Definition 4.3 (printed pp. 15–16), distinguishes these from the central residue-linkage idempotents of Corollary 4.7 (printed p. 18).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Jucys-Murphy spectrum and projectors for S_3

Statement

The four standard tableaux of size three have content vectors Cont⁡=(0,1,2) for the row tableau of shape (3), (0,1,−1) for the tableau 123 of shape (2,1), (0,−1,1) for 132, and (0,−1,−2) for the column tableau of shape (1,1,1). Writing X2=(1 2) and X3=(1 3)+(2 3) in C[S3], the recursion of Primitive tableau idempotents by Jucys-Murphy interpolation gives the four primitive idempotents Prow=(X2+1)(X3+1)6,P123=(X2+1)(2−X3)6,P132=(1−X2)(X3+2)6,Pcol=(1−X2)(1−X3)6, with denominators 2 and 6; they satisfy PT2=PT, PTPT′=0 for T≠T′ and ∑TPT=1, each PT acts on its own content vector by the identity and on the other content vectors by zero, and the sum of the two (2,1)-projectors is the central idempotent of the two-dimensional Specht module.

Facts & Assumptions

Given: The group algebra C[S3] with basis 1,(1 2),(1 3),(2 3),(1 2 3),(1 3 2) and the elements X2=(1 2), X3=(1 3)+(2 3) (The Jucys-Murphy elements of the symmetric group algebra).

[F1]

For the standard tableaux of size three the addable-content sets of the predecessor shapes are A((1))={1,−1}, A((2))={2,−1} and A((1,1))={1,−2}, and the recursion of the cited theorem gives the displayed four products; the denominators cT(n)−c are ±2 at step n=2 and ±3 at step n=3; their products give the denominator 6 in the displayed formulas (Primitive tableau idempotents by Jucys-Murphy interpolation, Removable and addable nodes).

[F2]

XkvT=cT(k)vT for the Young line of each standard tableau T, and the four content vectors of size three are exactly the vectors satisfying conditions (1)-(3) (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors, The content of a node and the content vector of a standard tableau).

[F3]

GZ(3)=⨁TCPT: the four lines are independent, the PT are pairwise orthogonal idempotents summing to 1, and the sum of the PT over the tableaux of a fixed shape is the corresponding central idempotent of C[S3] (The Gelfand-Tsetlin algebra is the diagonal algebra of the Young basis).

Proof

technique · direct
1.1givenalgebra

Multiplication in S3 gives X22=1, X2X3=X3X2=(1 2 3)+(1 3 2) and X32=(1 2 3)+(1 3 2)+2, whence also (X2X3)2=X2X3+2; every product below is evaluated with these relations and the basis of the Given block.

1.2F2givenalgebra

Contents. The row tableau carries entries 1,2,3 in the cells (1,1),(1,2),(1,3) of contents 0,1,2; the tableau 123 carries them in (1,1),(1,2),(2,1) of contents 0,1,−1; the tableau 132 in (1,1),(2,1),(1,2) of contents 0,−1,1; and the column tableau in (1,1),(2,1),(3,1) of contents 0,−1,−2. This gives the four content vectors of the Statement.

2.1F1step 1.2algebra

The recursion of [F1] at n=2 gives P[1 2]=(X2+1)/2 and P12=(1−X2)/2, because the two addable contents of (1) are 1 and −1; at n=3 the factors are (X3+1)/3 and (2−X3)/3 over the shape (2), and (X3+2)/3 and (1−X3)/3 over the shape (1,1). Multiplying gives exactly the four displayed elements, with denominators 2 and 6.

3.1step 2.1algebra

Expanded in the basis of the Given block, the four elements are Prow=16(1+(1 2)+(1 3)+(2 3)+(1 2 3)+(1 3 2)), P123=13⋅1+13(1 2)−16(1 3)−16(2 3)−16(1 2 3)−16(1 3 2), P132=13⋅1−13(1 2)+16(1 3)+16(2 3)−16(1 2 3)−16(1 3 2), Pcol=16(1−(1 2)−(1 3)−(2 3)+(1 2 3)+(1 3 2)).

4.1step 1.1step 3.1F3algebra

Idempotence and orthogonality. Squaring each of the four elements of step 3.1 with the relations of step 1.1 returns the same element, and each product of two distinct ones vanishes; equivalently, the four elements are the orthogonal rank-one projections of [F3], and their sum is 16+13+13+16=1, using the coefficient sums in step 3.1. This verifies all algebraic assertions about PT.

5.1F2F3step 1.2step 4.1algebra

Action on the spectrum. By [F3] each PT is the projection onto the line CvT, so PT acts by 1 on the content-vector eigenvector of T and by 0 on the eigenvectors of the other tableaux, whose content vectors are the four listed in step 1.2.

5.2step 3.1step 4.1F3algebra

The sum of the two (2,1)-projectors is P123+P132=23⋅1−13(1 2 3)−13(1 3 2), which is central in C[S3] and, by [F3], is the central idempotent of the two-dimensional Specht module V(2,1); the remaining two projectors are the central idempotents of the one-dimensional modules V(3) and V(1,1,1).

6.1F1step 2.1step 5.2∎

The example exhibits the interpolation formula at the smallest nontrivial size: the recursion inverts only 2 at step n=2 and 3 at step n=3, giving the denominator 6 in the products, and the failure of the formula in characteristic 2 is recorded separately in Ordinary Jucys-Murphy projection formulas do not survive content collision.

Remarks

  • The four spectra. The content vectors (0,1,2),(0,1,−1),(0,−1,1),(0,−1,−2) are the four vectors satisfying conditions (1)-(3) for n=3; the first and last belong to the one-dimensional modules of the trivial and sign representations.

  • The central idempotent. 23⋅1−13(1 2 3)−13(1 3 2) has the standard form (dim⁡V/∣G∣)∑gχ(g−1)g of the central idempotent attached to V(2,1).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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.

Sources