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.
Jucys–Murphy Elements and Seminormal Forms — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Characters and the Orthogonality Relations
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Jucys–Murphy Elements and Seminormal Forms
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Specht Modules and the Irreducibles of the Symmetric Group
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Products of Modules
- The Branching Rule and the Young Graph
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
These computations exercise the Jucys–Murphy machinery at the smallest symmetric groups. The first expands the elementary symmetric evaluations in inside 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 of coincide modulo , 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 , with axial distance and rescaling factor , 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
Elementary Jucys-Murphy class sums through S_4
Statement
In with , , : the element is the sum of the six transpositions, the permutations of with cycles; the element is the sum of the permutations with cycles (the three double transpositions and the eight -cycles); and is the sum of the six -cycles, the permutations with one cycle. The evaluations are central: and are single class sums, while is the sum of the class sums of types and .
Facts & Assumptions
Given: The symmetric group acting on and the elements , , of (The Jucys-Murphy elements of the symmetric group algebra).
The elementary symmetric polynomials are , , in three variables (The elementary symmetric polynomials ).
For one has , the sum of all permutations of with exactly cycles (Elementary symmetric Jucys-Murphy evaluations are cycle-count class sums).
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 has cycles exactly when it is a transposition, cycle exactly when it is a -cycle, and the elements with cycles are the three double transpositions together with the eight -cycles.
Proof
The displayed elements are , and ; the products below are computed in the group algebra , in which distinct permutations form a -basis.
.
.
.
, the six transpositions, i.e. the six permutations with cycles by [F3].
Adding the three products of steps 2.1-2.3 gives : eight -cycles and the three double transpositions, i.e. permutations, all with cycles by [F3].
, the six -cycles, i.e. the permutations with one cycle by [F3]; indeed the product is and the six products of the three transpositions of with and the two transpositions of are exactly the six listed -cycles, with no repetitions among them.
By [F2] with the evaluations equal the class sums for , 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 , as the explicit expansions of steps 3.1 and 3.2 show.
The case gives and the case gives ; 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. has transpositions, double transpositions, three-cycles and four-cycles, so the three sums have , and terms; these are the class sizes of the cycle types , , and .
-
Centrality. By [F2] each evaluation is a sum of conjugacy-class sums, hence lies in . There are four nonidentity conjugacy classes; combines two of them, so these three evaluations do not individually list all four class sums.
Ordinary Jucys-Murphy projection formulas do not survive content collision
Statement refuted
For every field and every standard tableau of size , the characteristic-zero interpolation formula defines an element of and yields the primitive tableau idempotents of the group algebra over , by the same recursion as over .
Facts & Assumptions
Given: Let be the field with two elements and , so that is the group algebra over (For every prime and , a field with elements exists, Finite fields and their order).
In one has ; in particular the integer is zero in . [thm-existence-of-finite-fields, def-finite-field-and-its-order, algebra]
For the two standard tableaux are and , with content vectors and ; these vectors are congruent modulo the relation in , i.e. they have the same entries in (The content of a node and the content vector of a standard tableau).
The common size-one prefix of and has shape , which has exactly two addable nodes and , of contents and ; the entry of sits in and the entry of sits in (Removable and addable nodes, The content of a node and the content vector of a standard tableau).
Over the modular Specht module is the span of the -polytabloids and is nonzero (Integral and field-valued Specht modules).
Proof
The interpolation recursion of the refuted statement, applied with to the tableau whose entry lies in the addable node of content of the shape , is because by [F3]; thus the factor is .
The failure is not caused by the absence of the module: over the Specht module and its endomorphism algebra continue to exist by [F4]. Writing for the tabloid with in its singleton row, the polytabloids span the two-dimensional subspace , since these differences are independent and every polytabloid is a difference . The two content vectors of [F2] even coincide after reduction to ; what fails is precisely the separation of the two addable contents and that the interpolation denominators encode.
Evaluation of the displayed factor in requires the inverse of the integer in ; but in by [F1], so the factor is not an element of and the formula does not define over . The same applies to the companion tableau , whose factor is .
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 : 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 , nor that no formula with different coefficients can exist. The smallest failure is the step , where the denominator 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).
The Jucys-Murphy spectrum and projectors for S_3
Statement
The four standard tableaux of size three have content vectors for the row tableau of shape , for the tableau of shape , for , and for the column tableau of shape . Writing and in , the recursion of Primitive tableau idempotents by Jucys-Murphy interpolation gives the four primitive idempotents with denominators and ; they satisfy , for and , each acts on its own content vector by the identity and on the other content vectors by zero, and the sum of the two -projectors is the central idempotent of the two-dimensional Specht module.
Facts & Assumptions
Given: The group algebra with basis and the elements , (The Jucys-Murphy elements of the symmetric group algebra).
For the standard tableaux of size three the addable-content sets of the predecessor shapes are , and , and the recursion of the cited theorem gives the displayed four products; the denominators are at step and at step ; their products give the denominator in the displayed formulas (Primitive tableau idempotents by Jucys-Murphy interpolation, Removable and addable nodes).
for the Young line of each standard tableau , 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).
: the four lines are independent, the are pairwise orthogonal idempotents summing to , and the sum of the over the tableaux of a fixed shape is the corresponding central idempotent of (The Gelfand-Tsetlin algebra is the diagonal algebra of the Young basis).
Proof
Multiplication in gives , and , whence also ; every product below is evaluated with these relations and the basis of the Given block.
Contents. The row tableau carries entries in the cells of contents ; the tableau carries them in of contents ; the tableau in of contents ; and the column tableau in of contents . This gives the four content vectors of the Statement.
The recursion of [F1] at gives and , because the two addable contents of are and ; at the factors are and over the shape , and and over the shape . Multiplying gives exactly the four displayed elements, with denominators and .
Expanded in the basis of the Given block, the four elements are
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 using the coefficient sums in step 3.1. This verifies all algebraic assertions about .
Action on the spectrum. By [F3] each is the projection onto the line , so acts by on the content-vector eigenvector of and by on the eigenvectors of the other tableaux, whose content vectors are the four listed in step 1.2.
The sum of the two -projectors is , which is central in and, by [F3], is the central idempotent of the two-dimensional Specht module ; the remaining two projectors are the central idempotents of the one-dimensional modules and .
The example exhibits the interpolation formula at the smallest nontrivial size: the recursion inverts only at step and at step , giving the denominator in the products, and the failure of the formula in characteristic is recorded separately in Ordinary Jucys-Murphy projection formulas do not survive content collision.
Remarks
-
The four spectra. The content vectors are the four vectors satisfying conditions (1)-(3) for ; the first and last belong to the one-dimensional modules of the trivial and sign representations.
-
The central idempotent. has the standard form of the central idempotent attached to .
The seminormal and orthogonal blocks for shape (2,1)
Statement
Let and be the two standard tableaux of shape , so that and . In the seminormal normalization of the cited theorem the two relations are so the matrix of in the ordered basis with columns the images is ; its transpose records the same images as rows rather than columns. Taking to have unit norm, the longer vector has norm , so unit normalization multiplies by , and the orthogonal form of becomes the symmetric orthogonal block . For the entries lie in the same row of and in the same column of , so and . Both matrices square to the identity and satisfy on the two-dimensional Specht module.
Facts & Assumptions
Given: The two standard tableaux of shape , with obtained from the row tableau by the transposition , and the Young basis vectors of the seminormal theorem (Young's seminormal form from the Jucys-Murphy eigenlines, Tableaux and standard tableaux).
For a standard tableau the contents of the cells containing and are and ; carries in and in so that , and ; the size-two prefixes are of shape and of shape (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).
The seminormal formulas: if is standard with in different rows and columns and the longer tableau, then and , where ; in the reverse ordering the pair is governed by the same formulas with interchanged and replaced by ; entries in the same row or column give (Young's seminormal form from the Jucys-Murphy eigenlines).
Rescaling the seminormal basis to unit vectors for the invariant form gives the symmetric orthogonal block on , the positive square root being taken (Young's orthogonal form from the seminormal rescaling).
Proof
Apply [F2] with (the row tableau, of length ) and (of length , the longer one): here , so and .
The action of : in the entries occupy and , the same column, so ; in they occupy and , the same row, so . Hence acts by in the ordered basis.
Matrix. In the ordered basis whose columns are the images, step 1.1 gives . The transpose is the array obtained when the images are written as rows. The matrix acting on coordinate columns is .
Involution. Squaring the matrix of step 2.1 gives , and the matrix of step 1.2 is visibly an involution; this is the statement in the two-dimensional Specht module.
Braid relation. With the matrix of step 2.1 and that of step 1.2, direct multiplication gives , which is in the ordered basis.
Orthogonal rescaling. Normalize the shorter vector to norm . The norm ratio from [F3], applied first in the shorter-to-longer ordering , gives . Thus the unit basis in the example's ordering is . With , direct change of basis gives . This real symmetric matrix squares to and is orthogonal.
Consistency with the row and column cases. The signs and 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 on the two-dimensional Specht module is exhibited in both normalizations.
The example is the smallest nontrivial check of the seminormal and orthogonal forms: the axial distance , the structure constants , the rescaling factor 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 ; writing the images as rows transposes this array. If both arrays are instead regarded as column-action matrices, they are similar by rescaling by . All computations above use the column-image convention.
-
The orthogonal block. is the reflection of the plane in the line spanned by the eigenvector of with eigenvalue ; it squares to the identity and satisfies the braid relation with the diagonal matrix of by step 3.2.
-
Comparison with James. For shape the same conventions produce blocks with axial distances ; the shape block here is its smallest instance and the one displayed in the sources.
Sources
- Garsia, Young Seminormal Representation, Murphy Elements and Content Evaluations, UCSD lecture notes (2003), section 3 and Theorem 5.10, printed pp. 18-25 and 51-52
- Okounkov-Vershik, A New Approach to the Representation Theory of the Symmetric Groups, Selecta Math. (N.S.) 2 (1996) 581-605; complete arXiv repost math/0503040, section 3, printed pp. 12-16
- Andrew Mathas, Seminormal Forms and Gram Determinants for Cellular Algebras, J. reine angew. Math. 619 (2008) 141-173; arXiv:math/0604108, sections 2.8-2.15 and 4 (residues and content collisions in the seminormal/Carter setting), printed pp. 4-8 and 14-21
- Garsia, Young Seminormal Representation, Murphy Elements and Content Evaluations, UCSD lecture notes (2003), Theorems 3.4-3.5, printed pp. 22-24
- Okounkov-Vershik, A New Approach to the Representation Theory of the Symmetric Groups, Selecta Math. (N.S.) 2 (1996) 581-605; complete arXiv repost math/0503040, sections 5-6, printed pp. 17-24
- Okounkov-Vershik, A New Approach to the Representation Theory of the Symmetric Groups, Selecta Math. (N.S.) 2 (1996) 581-605; complete arXiv repost math/0503040, section 6, printed pp. 22-24
- James, The Representation Theory of the Symmetric Groups, Lecture Notes in Mathematics 682, Springer (1978), section 25 (Young's orthogonal form, 25.1-25.5 and Theorem 25.3), printed pp. 114-124
- Garsia, Young Seminormal Representation, Murphy Elements and Content Evaluations, UCSD lecture notes (2003), Theorems 4.2-4.4, printed pp. 26-32