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

Young's orthogonal form from the seminormal rescaling

Statement

Rescale each Young vector of the previous item to a unit vector for the positive-definite invariant inner product on the Specht module induced from the tabloid form, chosen with positive square roots. Then for T with T′=siT standard and i,i+1 in different rows and columns of T, in the phasing of the previous item in which T′ is the longer tableau, the matrix of si on the ordered basis (vT,vT′) is the orthogonal symmetric matrix (r−11−r−21−r−2−r−1),r=cT(i+1)−cT(i), while the same-row and same-column cases remain the scalars +1 and −1. In particular each si acts by a real orthogonal (hence unitary) involution on each complex Specht module with respect to this inner product, and the resulting matrices form Young's orthogonal representation of Sn.

Facts & Assumptions

Given: The Specht module SCλ=Vλ⊆Mλ inside the tabloid module over C (Column antisymmetrizers, polytabloids, and Specht modules), the Hermitian tabloid product, and the seminormal Young basis vectors vT of the previous item (Young's seminormal form from the Jucys-Murphy eigenlines).

[F1]

The tabloid product ⟨⋅,⋅⟩ is a Hermitian form on Mλ which is positive definite, so ⟨x,x⟩>0 for x≠0, and Sn-invariant, so each σ∈Sn acts unitarily and has adjoint σ−1 (Invariant Hermitian product on a tabloid module).

[F2]

Sλ∩(Sλ)⊥={0}: the restriction of the tabloid product to Sλ is nondegenerate, hence, being the restriction of a positive definite form, positive definite (Complex Specht modules have nondegenerate Hermitian self-pairing, Invariant Hermitian product on a tabloid module).

[F3]

In the seminormal normalization of the previous item, if T′=siT is standard with i,i+1 in different rows and columns of T and T′ the longer tableau, then r=cT(i+1)−cT(i)∉{0,±1} and sivT=vT′+r−1vT, sivT′=(1−r−2)vT−r−1vT′; if i,i+1 lie in the same row or column then sivT=±vT (Young's seminormal form from the Jucys-Murphy eigenlines).

[F4]

si2=1 in Sn; consequently a unitary involution is self-adjoint, si∗=si. [F1, given]

[F5]

Distinct Young lines have distinct joint content vectors, and Xk acts on each line by its real node content. (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)

Proof

technique · direct
1.1F1F2F3givenalgebra

Let T have T′=siT standard with i,i+1 in different rows and columns, in the phasing of [F3]. The vectors vT,vT′ are nonzero, so by [F2] their norms ∥vT∥=⟨vT,vT⟩ and ∥vT′∥ are positive real numbers; define uT:=vT/∥vT∥ and uT′:=vT′/∥vT′∥.

2.1F1F3F5step 1.1algebra

Matrix in the unit basis. Each Xk is self-adjoint by [F1], since it is a sum of transpositions, which are unitary involutions. Distinct Young lines have distinct joint content vectors by [F5], so some self-adjoint Xk has different eigenvalues on them; the identity ⟨Xkv,w⟩=⟨v,Xkw⟩ then makes them orthogonal. Thus all the unit vectors uT form an orthonormal basis. Write A for the matrix of si in (vT,vT′) and B for its matrix in (uT,uT′). Since uT=vT/∥vT∥, set D=diag⁡(∥vT∥−1,∥vT′∥−1); then B=D−1AD. By [F3], A=(r−11−r−21−r−1),B=(r−1(1−r−2)∥vT∥/∥vT′∥∥vT′∥/∥vT∥−r−1).

2.2F3step 1.1algebra

Same row and same column. If i,i+1 lie in the same row or column of a standard tableau, [F3] gives sivT=±vT with the sign +1 in the row case and −1 in the column case; rescaling by a positive norm does not change these scalars.

3.1F1F4step 2.1algebra

Symmetry. By [F4] and [F1] the operator si is a unitary involution, hence self-adjoint; in the orthonormal basis (uT,uT′) its matrix B therefore satisfies B=B∗, the conjugate transpose of B. Since B11=r−1 and B22=−r−1 are real, this forces B21=B12‾ and ∣B12∣=∣B21∣.

4.1F3step 2.1step 3.1algebra

The off-diagonal entries are positive and equal. By step 2.1, B21=∥vT′∥/∥vT∥>0, so self-adjointness in step 3.1 makes both off-diagonal entries the same positive real number c. The (1,1) entry of B2=I gives r−2+c2=1, hence c=1−r−2, with ∣r∣>1 by [F3]. In particular ∥vT′∥/∥vT∥=1−r−2, and B is the displayed symmetric orthogonal matrix.

5.1step 4.1F2algebra

Orthogonality. The matrices B of step 4.1 are real, symmetric and satisfy B2=I, hence are orthogonal with determinant −r−2−(1−r−2)=−1; the unit basis was chosen with positive square roots, and the common phase of the initial vector does not affect these matrices. In particular each si acts by a real orthogonal involution on each Vλ for the restricted inner product.

6.1step 2.2step 5.1F3givenalgebra∎

Representation. The matrices so obtained are the matrices of the actual elements si∈Sn in a basis of Vλ, so they satisfy the Coxeter relations si2=1 and sisi+1si=si+1sisi+1 and generate a representation equivalent to Vλ; this is Young's orthogonal representation.

Remarks

  • Positive rescaling. The off-diagonal entry is fixed by B21=∥vT′∥/∥vT∥>0 and self-adjointness; this gives the source's equation (6.5). A common phase of the initial vector remains harmless.

  • Positivity of the form. The argument uses positive definiteness of the restricted form, which follows from the published nondegeneracy statement; no appeal to complete reducibility or to a general averaging argument over C is made beyond the tabloid product itself.

  • Consistency with the seminormal block. For r=2 the matrix is (1/23/23/2−1/2), the block computed on the examples page for shape (2,1).

Depends on

Used by

Dependency tree · two levels

21 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