Alphabeta Math
PropositionStatement: 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.

Each padded irreducible family is realised by a finitely generated FI-module

Statement

Let k be a field of characteristic 0, let λ be a partition with m:=∣λ∣ and first part λ1, and put d:=m+λ1. For a partition μ⊢n write Vμ for the irreducible kSn-module with label μ (Specht modules classify the irreducibles over every field of characteristic zero), and for n≥d let λ[n] be the first-row padding of λ to n (First-row padding of a partition).

Then there is a sub-FI-module V(λ) of the free FI-module M(λ) (The free FI-module M(W) generated by an Sm-module) with

V(λ)n≅Vλ[n](n≥d),V(λ)n=0(n<d),

so that the value of this FI-module at [n] is the irreducible kSn-module denoted V(λ)n in Weight of an FI-module over a field of characteristic zero. This FI-module is generated in degree ≤d (Span, finite generation and generation degree of an FI-module), and its generation degree is exactly d. It has

weight⁡(V(λ))=m,inj-deg⁡(V(λ))=0,surj-deg⁡(V(λ))=stab-deg⁡(V(λ))=λ1,

where weight is as in Weight of an FI-module over a field of characteristic zero and the three degrees are as in Injectivity, surjectivity and stability degree. No choice principle is used.

Facts & Assumptions

Given: A field k of characteristic 0, a partition λ with m=∣λ∣ and first part λ1, the integer d=m+λ1, and the free FI-module M(λ)=M(Skλ) over the FB-module Skλ supported on m-element sets (The free FI-module M(W) generated by an Sm-module); for μ⊢n, Vμ denotes the irreducible kSn-module with label μ (Specht modules classify the irreducibles over every field of characteristic zero).

[F1]

M(W)S=⨁T⊆SW(T), and for W=Skλ only the m-element subsets T contribute; the transition map along an injection f is the sum of the isomorphisms W(f∣T) ⁣:W(T)→W(f(T)) over distinct summands, hence is injective, and M is additive in W; also M(λ)n≅Ind⁡Sm×Sn−mSn(Skλ⊠k) for n≥m, while M(λ)n=0 for n<m (The free FI-module M(W) generated by an Sm-module).

[F2]

Branching rule: Ind⁡Sa×SrSa+r(Skμ⊠k)≅⨁νSkν, summed over the partitions ν⊢a+r obtained from μ by adding one box in each of r different columns, equivalently ν⊇μ with ν/μ a horizontal r-strip; all multiplicities are 0 or 1 (Branching rule for Specht modules: adding or removing boxes in distinct columns).

[F3]

Over the characteristic-zero field k, every finite-dimensional kSn-module is a direct sum of copies of the Skν and Skν≅Skμ if and only if ν=μ; the irreducible with label λ[n] is Vλ[n] (Specht modules classify the irreducibles over every field of characteristic zero, Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣).

[F4]

Φa(V)n=(Va⊔n)Sn, and T ⁣:Φa(V)n→Φa(V)n+1 is induced by an injection a⊔n→a⊔n+1 fixing a; Φa is a functor, so an inclusion W⊆V of FI-modules induces maps commuting with T, surjections induce surjections in every degree, and over a field containing Q the induced maps on submodules are injective (The coinvariant functors Φa and the transition maps T).

[F5]

For μ=λ[n]⊢n and a≤n: (Vμ)Sn−a=0 if and only if n−a>μ1; and if n−a=μ1, then (Vμ)Sn−a≅Vλ (Coinvariants detect vanishing of subquotients of bounded weight, and padded irreducibles stabilise).

[F6]

For every FB-module W one has inj-deg⁡(M(W))=0; over characteristic zero weight⁡(M(λ))=m and stab-deg⁡(M(λ))=λ1, hence surj-deg⁡(M(λ))=λ1 (Free FI-modules have computable stability degree and weight, Injectivity, surjectivity and stability degree).

[F7]

V is generated in degree ≤d when span⁡V(V≤d)=V, and then the evaluation map ⨁m≤dM(Vm)→V is surjective (Span, finite generation and generation degree of an FI-module, Generation in bounded degree presents an FI-module as a quotient of free FI-modules).

Proof

technique · direct
1.1F1F2F3given

For n≥d the padded partition λ[n]=(n−m,λ1,λ2,… ) is obtained from λ=(λ1,λ2,… ) by adding exactly one box in each of the first n−m columns and none elsewhere, because n−m≥λ1; hence Vλ[n] occurs in M(λ)n with multiplicity one by [F1] and [F2]. For n≥d let V(λ)n⊆M(λ)n be the sum of all kSn-submodules isomorphic to Vλ[n], and set V(λ)n:=0 for n<d. As the multiplicity is at most one, this sum is the unique subspace of M(λ)n isomorphic to Vλ[n], so V(λ)n≅Vλ[n] for n≥d.

1.2F1givenalgebra

We show that these subspaces are preserved by transition maps. Let f ⁣:[p]→[q] be an injection with p≥d (if p<d, then V(λ)p=0 and there is nothing to show), so that q≥d; put Y:=f∗(V(λ)p)⊆M(λ)q. Since f∗ is injective by [F1], Y≅Vλ[p]. The subspace Y is stable under H:=Φf(Sp), because f∗∘σ∗=Φf(σ)∗∘f∗ for all σ∈Sp, and it is fixed pointwise by K:={τ∈Sq:τ∣f([p])=id}≅Sq−p, because τ∘f=f gives τ∗∘f∗=f∗ by functoriality. The subgroups H and K commute, H×K is conjugate in Sq to the standard ordered block subgroup Sp×Sq−p, and the pair (Y,H-action) is isomorphic to (Vλ[p],Sp-action); hence the Sq-span Z of Y, which is the image of the Sq-module map Ind⁡H×KSq(Y⊠k)→M(λ)q, (u,y)↦u∗y, is a quotient of Ind⁡Sp×Sq−pSq(Vλ[p]⊠k).

2.1F1F2step 1.1step 1.2

Every constituent Vν of Z occurs both in Ind⁡Sp×Sq−pSq(Vλ[p]⊠k) and in M(λ)q≅Ind⁡Sm×Sq−mSq(Skλ⊠k) by step 1.2; by [F2] this means that ν⊇λ[p] with νi+1≤λ[p]i and ν⊇λ with νi+1≤λi. Since λ[p]i+1=λi for i≥1, the inequalities λi=λ[p]i+1≤νi+1≤λi force νi+1=λi for every i≥1, and ν⊢q gives ν1=q−∑i≥1λi=q−m; hence ν=λ[q] is the only possible constituent of Z. The multiplicity of Vλ[q] in M(λ)q is at most one by [F2], so every submodule of M(λ)q all of whose constituents are isomorphic to Vλ[q] is contained in the isotypic piece V(λ)q; in particular Z⊆V(λ)q, hence Y⊆V(λ)q.

3.1F1givenstep 1.2step 2.1

For a finite set S with ∣S∣=n≥d define V(λ)S:=β∗−1(V(λ)n)⊆M(λ)S for any bijection β ⁣:S→[n]; this does not depend on β, since any other bijection is σ∘β with σ∈Sn and σ∗(V(λ)n)=V(λ)n. For ∣S∣<d set V(λ)S:=0. If f ⁣:S→T is an injection with ∣S∣=p≥d and α ⁣:[p]→S, β ⁣:[q]→T are bijections, write f=β∘f0∘α−1 with f0 ⁣:[p]→[q]; then f∗(V(λ)S)=β∗(f0)∗α∗−1α∗(V(λ)p)=β∗(f0)∗(V(λ)p)⊆β∗(V(λ)q)=V(λ)T by step 1.2, using the functoriality of M(λ). Hence V(λ) is a sub-FI-module of M(λ) with the stated values.

4.1F1F3F7step 1.2step 3.1

For n≥d and any injection f ⁣:[d]→[n], the map f∗ ⁣:M(λ)d→M(λ)n is injective by [F1], so its restriction f∗(V(λ)d) is nonzero because V(λ)d≅Vλ[d]≠0 [F3], and it lies in V(λ)n by step 1.2. Every injection [d]→[n] equals σ∘f for some σ∈Sn, and (σ∘f)∗=σ∗∘f∗, so span⁡V(λ)(V(λ)d)n is the Sn-span of f∗(V(λ)d): a nonzero kSn-submodule of the irreducible V(λ)n [F3], hence all of V(λ)n. For n<d both sides are 0, so span⁡V(λ)(V(λ)≤d)=V(λ); thus V(λ) is generated in degree ≤d by [F7], and as V(λ)n=0 for n<d with V(λ)d≠0, its generation degree is exactly d. A finite k-basis of the finite-dimensional V(λ)d generates all of it, so this FI-module is finitely generated.

4.2givenF3step 3.1

For n≥d the value V(λ)n≅Vλ[n] is irreducible of label λ[n], and the tail label has ∣λ∣=n−(n−m)=m; a subquotient of an irreducible module is 0 or the module itself, so V(λ)n is the only constituent of itself, its label being λ with ∣λ∣=m (Weight of an FI-module over a field of characteristic zero). For n<d the value is 0. Hence weight⁡(V(λ))=m, the supremum being attained in every degree n≥d.

4.3F4F6step 3.1

By step 3.1 the module V(λ) is a sub-FI-module of M(λ). For all a,n the inclusion V(λ)a⊔n⊆M(λ)a⊔n induces an injective map ΦaV(λ)n→ΦaM(λ)n because k contains Q [F4], and by naturality of T these maps commute with the transition maps. If T ⁣:ΦaM(λ)n→ΦaM(λ)n+1 is injective, then T ⁣:ΦaV(λ)n→ΦaV(λ)n+1 is injective as well; since inj-deg⁡(M(λ))=0 by [F6], the latter holds for all n≥0, so inj-deg⁡(V(λ))=0.

5.1F1F4F6F7step 4.1

Let μ:=λ[d]⊢d, so that μ1=d−m=λ1. By step 4.1 the module V(λ) is generated in degree ≤d, so the evaluation map e ⁣:M(V(λ)d)→V(λ) is surjective by [F7]; since V(λ)d≅Vμ is irreducible, M(V(λ)d)≅M(μ) by the additivity of M in [F1]. For any surjection q ⁣:U↠W of FI-modules and all a,n, the map Φa(q)n is surjective because Φa preserves surjections [F4], and naturality gives TW∘Φa(q)n=Φa(q)n+1∘TU; hence TU surjective implies TW surjective, so surj-deg⁡(W)≤surj-deg⁡(U) (Lemma 3.1.6 of the source). Applying this to e and using [F6], surj-deg⁡(V(λ))≤surj-deg⁡(M(μ))=μ1=λ1.

6.1F1F4F5step 1.1step 3.1step 4.3step 5.1

Suppose λ1≥1. With a:=m one has a+λ1=d, so by [F5] applied with n:=d, a:=m and μ:=λ[d], whose first part is μ1=d−m=λ1, the coinvariants (V(λ)d)Sλ1 are isomorphic to Vλ≠0, and by [F4] they are ΦmV(λ)λ1 (under the identification of the set m⊔λ1 of size d with [d], which is immaterial because conjugate subgroups have isomorphic coinvariants); moreover ΦmV(λ)λ1−1=(V(λ)d−1)Sλ1−1=0, since V(λ) vanishes below d by step 1.1. Hence T ⁣:ΦmV(λ)λ1−1→ΦmV(λ)λ1 has zero source and nonzero target, so it is not surjective and surj-deg⁡(V(λ))≥λ1; with step 5.1, surj-deg⁡(V(λ))=λ1, and with step 4.3, stab-deg⁡(V(λ))=max⁡(0,λ1)=λ1. If λ1=0, then λ=∅, m=d=0 and M(∅)=M(k) has all values k and all transition maps isomorphisms by [F1], so V(∅)=M(∅) and inj-deg⁡=surj-deg⁡=stab-deg⁡=0=λ1.

7.1step 1.1step 1.2step 2.1step 3.1step 4.1step 4.2step 4.3step 5.1step 6.1∎

Steps 1.1, 1.2, 2.1 and 3.1 construct the sub-FI-module V(λ)⊆M(λ) with values Vλ[n] for n≥d and 0 otherwise; step 4.1 shows that its generation degree is exactly d; step 4.2 gives weight⁡(V(λ))=m; and steps 4.3–6.1 give inj-deg⁡(V(λ))=0 and surj-deg⁡(V(λ))=stab-deg⁡(V(λ))=λ1. The only selections made are bijections between finite sets, and the value at each finite set was shown to be independent of the selection, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

71 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