Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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 transposition class sum acts on a complex Specht module by total content

Statement

Let m≥0, let ν⊢m, and let SCν be the complex Specht module. Put Tm=∑1≤a<b≤m(a b),n(ν)=∑i(i−1)νi. Then Tm is central in C[Sm] and acts on SCν as the scalar zν=∑i(νi2)−∑j(νj′2)=∑(r,c)∈[ν](c−r)=n(ν′)−n(ν). If m≥2, dν=dim⁡CSCν and χν is its character, then χν((1 2))=dνzν(m2). For m=0,1, Tm=0 and zν=0; no transposition character value is asserted.

Facts & Assumptions

Given: m,ν, the complex Specht module, and the displayed transposition sum.

[F1]

Row and column stabilizers preserve the individual row and column sets. The tabloid stabilizer is the row stabilizer. The Specht module lies in the finite-dimensional tabloid permutation module and contains et=∑γ∈Ctsgn⁡(γ)γ{t}, whose coefficient at {t} is 1 because Rt∩Ct={1}. (Row and column stabilizers, Young subgroups, tabloids, and permutation modules, Column antisymmetrizers, polytabloids, and Specht modules)

[F2]

Complex Specht modules are nonzero irreducible representations. An endomorphism of a finite-dimensional irreducible representation over an algebraically closed field is scalar. (Complex Specht modules are irreducible, Over an algebraically closed field, every endomorphism of an irreducible representation is scalar)

[F3]

A partition's conjugate records its column heights; its diagram consists of the nodes (r,c) with 1≤c≤νr. Characters are traces, and trace is linear. (Partitions, English diagrams, and conjugation, The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation, Trace is a linear functional on Mn(F))

Proof

1.1F1F2givenconstruct

Conjugation by any permutation sends (a b) to the transposition of its two images, hence permutes the summands of Tm. Thus Tm is central, so its action on the nonzero finite-dimensional irreducible Specht module is an intertwiner and equals zid⁡ for some z∈C by [F2]. Choose the row-filled tableau t of shape ν, and use its nonzero polytabloid et. Taking the coefficient of {t} in Tmet=zet recovers z, since that coefficient in et is 1 by [F1].

2.1F1step 1.1algebra

A summand indexed by a transposition τ=(a b) and γ∈Ct contributes to this coefficient precisely when τγ∈Rt. Put r=τγ, so τ=rγ−1. If x∉{a,b}, then rγ−1(x)=x. The entry γ−1(x) has the column of x, and since r preserves each row it also has the row of x. Their row-column intersection consists of x alone, so γ−1(x)=x and r(x)=x. Thus both r and γ fix the complement of {a,b}; each is either the identity or τ. Their product is τ exactly when one is τ and the other is the identity. Therefore the contributing pairs are exactly: γ=1, τ∈Rt, of sign +1; and γ=τ, τ∈Ct, of sign −1. These cases cannot overlap, since two distinct entries cannot share both row and column.

3.1F3step 1.1step 2.1algebra

There are ∑i(νi2) transpositions within rows and ∑j(νj′2) within columns. By steps 1.1 and 2.1 their difference is z. Summing c−1 within every row gives the first count, and summing r−1 within every column gives the second; hence their difference is ∑(r,c)∈[ν](c−r). Also n(ν)=∑(r,c)∈[ν](r−1) and n(ν′)=∑(r,c)∈[ν](c−1), proving every formula for zν. This includes m=0,1: there are no row or column pairs and the transposition sum is zero.

4.1F3step 3.1algebra∎

For m≥2, all (m2) transpositions are conjugate, so their representing matrices are similar and have character value χν((1 2)). Taking traces of the scalar action in step 3.1 gives (m2)χν((1 2))=dνzν by [F3]. Dividing by the nonzero integer (m2) proves the stated character formula. The construction and coefficient count are finite and use no choice of an arbitrary family or seminormal-basis input.

Depends on

Used by

Dependency tree · two levels

25 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