Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues

Statement

Let k be a field of characteristic p>0 and let μ be a p-restricted partition of d≥1; write D(μ) for the simple kSd-module labelled by μ (Modular simple modules of the symmetric group, p-regular and p-restricted labels under transpose and sign). Let Ai denote the good i-node of μ, for those i∈Z/p with εi(μ)>0 (Residue signatures, normal, good, conormal and cogood nodes). Then soc⁡Sd−1(D(μ)↓Sd−1)=⨁i: εi(μ)>0D(μ∖Ai), a multiplicity-free sum over distinct simple modules: distinct residues give distinct summands. The sum runs over the residues i with εi(μ)>0, one good node per such residue; the completely reducible special case (the restriction is semisimple if and only if every normal node is good, Kleshchev II Theorem 0.6) is a separate statement and is not asserted here.

Facts & Assumptions

Given: A field k of characteristic p>0, a p-restricted partition μ of d≥1, and the good i-nodes Ai of μ.

[F1]

Res⁡Sd−1SdM=⨁i∈Z/pEiM for every finite-dimensional kSd-module M, where each EiM is a kSd−1-submodule and Ei is the residue-summand functor attached to the primary Jucys-Murphy idempotents (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi).

[F2]

For a residue i with εi(μ)>0 the good i-node Ai is the unique normal i-node with no normal i-node above it, and the nodes Ai for distinct residues i are distinct nodes of μ, so the partitions μ∖Ai of d−1 are distinct (Residue signatures, normal, good, conormal and cogood nodes).

[F3]

Steps 1.1–17.1 of The cogood node gives the simple socle and head of the residue induction prove the restriction endpoint independently of this corollary: the root interval primitive lines, compensated containment, Schur-corner socle lift and class-sum localization give soc⁡Sd−1(EiD(μ))={D(μ∖Ai),εi(μ)>0,0,εi(μ)=0. The good-deletion labels are p-restricted by that proof's step 11.1. Only this proved restriction argument is used here; the later induction endpoint and its conormal multiplicity are not needed.

[F4]

Over every field k of characteristic p, the conjugate-sign isomorphism of Conjugate Specht modules are sign-twisted duals over every field identifies S(ν)=(Skν)∗ with Skν′⊗sgn⁡. Twisting by sign preserves submodules and their radicals, since it multiplies each group operator by a unit scalar. Thus its head is D(ν)=Dkν′⊗sgn⁡ for p-restricted ν. These heads are nonzero and absolutely simple by Nonzero modular Specht quotient criterion. They are pairwise nonisomorphic: twisting an isomorphism back by sign and applying the separation assertion of Nonzero maps into tabloid quotients force dominance forces ν1′=ν2′, hence ν1=ν2. No splitting-field descent is assumed.

[F5]

The socle of a finite-dimensional module is the sum of its simple submodules, and the socle of a finite direct sum is the direct sum of the socles of the summands. Indeed each projection of a simple submodule is zero or simple, so that submodule lies in the sum of the summand socles; the reverse inclusion holds because each simple submodule of a summand is a submodule of the sum (The radical, socle, head, and Loewy series of a finite-dimensional module).

Proof

technique · direct
1.1givenF1F5

By [F1] the restriction decomposes as Res⁡D(μ)=⨁i∈Z/pEiD(μ) with each EiD(μ) a kSd−1-submodule, and by [F5] the socle of the restriction is the direct sum ⨁isoc⁡(EiD(μ)).

1.2givenF3F4

By the local restriction argument [F3], for each residue i the module soc⁡(EiD(μ)) is D(μ∖Ai) when εi(μ)>0 and is 0 when εi(μ)=0; by [F3] each μ∖Ai is a p-restricted partition of d−1, so each displayed D(μ∖Ai) is a simple kSd−1-module by [F4].

2.1step 1.1step 1.2F3

Summing the descriptions of step 1.2 over the finitely many residues i∈Z/p and using step 1.1 gives soc⁡Sd−1(D(μ)↓Sd−1)=⨁i: εi(μ)>0D(μ∖Ai).

3.1step 2.1F2F4

The sum is multiplicity-free and its summands are pairwise non-isomorphic: if i≠j and both εi(μ) and εj(μ) are positive, then the good nodes Ai and Aj have different residues and are therefore distinct nodes of μ, so the p-restricted partitions μ∖Ai and μ∖Aj of d−1 are distinct by [F2]; by [F4] their simple modules D(μ∖Ai) and D(μ∖Aj) are non-isomorphic. Each residue contributes its summand once, so each isomorphism class occurs with multiplicity one in the displayed socle.

4.1step 2.1step 3.1given∎

The displayed decomposition of step 2.1 has the left-hand side soc⁡Sd−1(D(μ)↓Sd−1) and, by step 3.1, is a multiplicity-free sum over distinct simple modules with one summand per residue i satisfying εi(μ)>0. No claim is made here about the restriction being semisimple. In the smallest case d=1 one has μ=(1), and the only node of residue 0 is the removable node (1,1), so ε0(μ)=1 and the right-hand side is the single term D(∅)=k, while the restriction to the trivial group S0 is k itself, in agreement with the display; this is the smallest instance in which the summands carry the empty partition as a label.

Remarks

  • Proof input. The per-residue endpoint is proved in steps 1.1–17.1 of The cogood node gives the simple socle and head of the residue induction. That argument does not depend on this corollary or on the later thm-good-node-gives-the-simple-socle-and-head-of-residue-restriction; the latter uses this corollary together with the normal-node count. The cited literature documents the origin of the result.
  • No character theory. Nothing in the proof uses complex characters or reciprocity; modular multiplicities are not computed from characteristic zero data.
  • Choice. All index sets are finite and no choice principle is used.

Depends on

Used by

Dependency tree · two levels

56 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