Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Coinvariants detect vanishing of subquotients of bounded weight, and padded irreducibles stabilise

Statement

Let k be a field of characteristic 0, let μ⊢n, and write μ=λ[n] as in First-row padding of a partition; set V(λ)n:=Vμ, the irreducible kSn-module with label μ (Specht modules classify the irreducibles over every field of characteristic zero). Read μ1=0 when μ=∅. For 0≤a≤n, put k0=n−a; for a vector space carrying an action of Sa×Sk0, write ( ⋅ )Sk0 for Sk0-coinvariants of the restriction to that product (The coinvariant functors Φa and the transition maps T).

(i) For a≤n, with k0=n−a, the Sa-representation (Vμ)Sk0 is zero if and only if n−a>μ1, equivalently (V(λ)n)Sn−a=0 if and only if a<∣λ∣.

(ii) If n−a=μ1 (that is, a=∣λ∣), then (V(λ)n)Sn−a≅Vλ as S∣λ∣-modules.

(iii) For fixed λ and a≥∣λ∣, the Sa-module (V(λ)n)Sn−a is independent of n once n≥a+λ1; in fact (V(λ)n)Sn−a≅Ind⁡S∣λ∣×Sa−∣λ∣Sa(Vλ⊠k) throughout that range.

(iv) If V is an FI-module over k with weight⁡(V)≤a (Weight of an FI-module over a field of characteristic zero), then, for every n≥a, every subquotient Wn (Submodule of a module) of the Sn-module Vn satisfies Wn=0  ⟺  (Wn)Sn−a=0.

No choice principle is used.

Facts & Assumptions

Given: A field k of characteristic 0, a partition λ with ∣λ∣=m and, for each n≥m+λ1, the padded partition μ=λ[n]⊢n and the irreducible kSn-module V(λ)n=Vμ.

[F1]

Branching rule (Branching rule for Specht modules: adding or removing boxes in distinct columns): (a) for μ⊢n and 0≤k0≤n, the Sn−k0-module (Res⁡Sn−k0×Sk0SnVμ)Sk0 is the direct sum of the irreducibles Vν, ν⊢n−k0, over the partitions obtained from μ by removing one box from each of k0 different columns, each with multiplicity at most one; (b) dually, for ρ⊢m and r≥0, Ind⁡Sm×SrSm+r(Vρ⊠k) is the direct sum of the irreducibles Vν, ν⊢m+r, over the partitions obtained from ρ by adding one box in each of r different columns, each with multiplicity at most one.

[F2]

Over a characteristic-zero field the simple kSd-modules are exactly the modules V(η)d with η a partition and d≥∣η∣+η1 (Specht modules classify the irreducibles over every field of characteristic zero), and for a finite group Q and a finite-dimensional kQ-module M with char⁡k=0, Maschke's theorem makes M a direct sum of simple modules, so M≠0 if and only if M contains a simple submodule (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣).

[F3]

Coinvariants over a field containing Q are exact: the averaging map identifies MQ with the invariants MQ naturally, and kernels of Sa-equivariant maps are computed pointwise, so inclusions induce injections and quotients induce surjections on coinvariants (The coinvariant functors Φa and the transition maps T).

Proof

technique · direct
1.1F1given

Apply [F1] with μ=λ[n]⊢n and k0=n−a: the Sa-module (V(λ)n)Sn−a is the sum of the irreducibles Vν, ν⊢a, over the partitions obtained from μ by removing one box from each of k0=n−a different columns, all multiplicities at most one.

2.1step 1.1

The partition μ=(μ1,μ2,… ) has exactly μ1 columns, so no such removal exists when n−a>μ1; conversely, for every 0≤k0≤μ1, removing the bottom box of each of the k0 rightmost columns is a valid horizontal-strip removal and leaves the partition ν with column heights μj′−1 for those columns. Since μ1=n−m, the condition n−a>μ1 is a<m=∣λ∣, so (V(λ)n)Sn−a=0 if and only if a<∣λ∣, proving (i).

2.2F1step 1.1

If n−a=μ1, the strip has one box in each of the μ1 columns of μ, and each removed box must be the bottom box of its column for the complement to remain a partition; the resulting partition has column heights μj′−1, namely λ (because μj′−1=#{i:λi≥j} in the padded shape μ=(n−m,λ1,λ2,… )). Hence (V(λ)n)Sn−a≅Vλ, which is (ii).

2.3F1givenstep 1.1

For (iii), let ν⊢a and compare the two constituent conditions. By step 1.1, ν occurs in (V(λ)n)Sn−a if and only if ν is obtained from μ=(n−m,λ1,λ2,… ) by removing one box from each of n−a different columns, i.e. μi≥νi≥μi+1 for all i; these inequalities read n−m≥ν1≥λ1 and λi−1≥νi≥λi for i≥2. By [F1] applied to the induction from Sm×Sa−m with m=∣λ∣ (part (i) of that lemma), ν occurs in Ind⁡Sm×Sa−mSa(Vλ⊠k) if and only if ν is obtained from λ by adding one box in each of a−m different columns, i.e. νi≥λi≥νi+1 for all i. The two systems differ only in the bound ν1≤n−m, which is automatic in the range n≥a+λ1 because ν1≤λ1+(a−m)≤n−m; hence the two modules have exactly the same constituents, each with multiplicity at most one, and they are isomorphic.

3.1F2F3step 2.1∎

For (iv), suppose first that Wn≠0. Choose 0≠w∈Wn and let U⊆Wn be the k-span of the finite Sn-orbit of w; then U is a nonzero finite-dimensional kSn-submodule. By [F2] U has a simple submodule, which by the classification is V(η)n=Vρ for some partition ρ=η[n] with η⊢r. As Vρ is a constituent of Vn and weight⁡(V)≤a, we have r=∣η∣≤a (Weight of an FI-module over a field of characteristic zero). Put k0=n−a≤n−r, and apply step 2.1 with λ′=η: since a≥r, the coinvariants (V(η)n)Sn−a are nonzero. The inclusion V(η)n↪U↪Wn induces an injection on coinvariants by exactness [F3], so (Wn)Sn−a≠0. Conversely, if Wn=0 then (Wn)Sn−a=0 trivially. This proves (iv) and completes the lemma.

Depends on

Used by

Dependency tree · two levels

37 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