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.

Free FI-modules have computable stability degree and weight

Statement

Let W be an FB-module over k and let M(W) be the free FI-module of The free FI-module M(W) generated by an Sm-module. Then inj-deg⁡(M(W))=0, and if Wi=0 for all i>m then surj-deg⁡(M(W))≤m; in particular M(m)=M(k[Sm]) over a nonzero ring k satisfies inj-deg⁡(M(m))=0 and stab-deg⁡(M(m))=m (Injectivity, surjectivity and stability degree). If moreover k is a field of characteristic 0 and λ is a partition, then weight⁡(M(λ))=∣λ∣ (Weight of an FI-module over a field of characteristic zero) and stab-deg⁡(M(λ))=λ1. No choice principle is used.

Facts & Assumptions

Given: An FB-module W over k; for M(W) the FB-module k[Sm] supported at m-element sets (free on bijections [m]→T), and for a partition λ with ∣λ∣=m the FB-module Skλ supported on m-element sets.

[F1]

M(W)S=⨁T⊆SW(T) with transition maps W(f∣T), and M(k[Sm])S has as k-basis the injections [m]↪S; for n≥m, M(Skλ)n≅Ind⁡Sm×Sn−mSn(Skλ⊠k) (The free FI-module M(W) generated by an Sm-module).

[F2]

Φa(V)n=(Va⊔n)Sn=k⊗kSnVa⊔n, and T ⁣:Φa(V)n→Φa(V)n+1 is induced by an injection a⊔n→a⊔n+1 fixing a; over a field containing Q the coinvariant functor is exact (The coinvariant functors Φa and the transition maps T).

[F3]

Branching rule: for μ⊢N and 0≤j≤N, (Res⁡SN−j×SjSNVμ)Sj is the sum of the irreducibles Vν, ν⊢N−j, obtained from μ by removing one box from each of j different columns (multiplicities at most one); dually, for r≥0, the induction from Sm×Sr of Sρ⊠k is the sum of the Sν over ν obtained from ρ by adding one box in each of r different columns (Branching rule for Specht modules: adding or removing boxes in distinct columns).

[F4]

Over a characteristic-zero field, the modules V(η)N with η[N] a padded partition are exactly the irreducible kSN-modules, and a horizontal j-strip in a partition λ (a removal of one box from each of j different columns leaving a partition) exists if and only if j≤λ1 (Specht modules classify the irreducibles over every field of characteristic zero, First-row padding of a partition).

[F5]

The weight of an FI-module over a characteristic-zero field is the supremum of ∣η∣ over the constituents V(η)N of the values (Weight of an FI-module over a field of characteristic zero), and Maschke splits finite-dimensional semisimple modules into simples when char⁡k=0 (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣).

Proof

technique · direct
1.1F1F2given

The Sn-orbits of the subset summands of M(W)a⊔[n] are indexed by (U,r), where U⊆a and 0≤r≤n: take the representative U⊔[r] with [r] in the moving block. Its stabilizer is Sr×Sn−r, and the second factor acts trivially on W(U⊔[r]). Transporting the orbit summands to the representative identifies their coinvariants with (W(U⊔[r]))Sr: different transports differ by a stabilizer element, so they give the same map after quotienting, and the representative inclusion is inverse. Thus ΦaM(W)n≅⨁U⊆a⨁r=0n(W(U⊔[r]))Sr. Choosing a single bijection b→U, with b=∣U∣, identifies this factor with Φb(W)r:=(W(b⊔[r]))Sr; for an FB-module this denotes only a degreewise quotient, without transition maps. The standard inclusion [n]↪[n+1] fixes every representative with r≤n, so T acts as the identity on every existing factor and only adds factors with r=n+1.

1.2F1F3F5given

Let k have characteristic 0 and let ∣λ∣=m. For n≥m the identification M(Skλ)n≅Ind⁡Sm×Sn−mSn(Skλ⊠k) of [F1] together with the branching rule [F3] shows that the constituents of M(λ)n are the Specht modules Sν over the partitions ν⊢n obtained from λ by adding one box in each of n−m different columns; for n<m the value is 0. For such a ν, the added boxes occupy n−m distinct columns, so ν1≥n−m; writing ν=η[n] this gives ∣η∣=n−ν1≤m. Hence every constituent V(η)n of any M(λ)n has ∣η∣≤m, so weight⁡(M(λ))≤m by [F5].

2.1F2step 1.1

By step 1.1 the map T ⁣:ΦaM(W)n→ΦaM(W)n+1 is injective for all a,n, since it is the identity on every direct summand and maps distinct summands to distinct summands; hence inj-deg⁡(M(W))=0. If Wi=0 for i>m, then Φ∣U∣(W)r=0 for r>m, so for n≥m the direct-sum decomposition of step 1.1 is independent of n and T is an isomorphism; hence surj-deg⁡(M(W))≤m. For M(m)=M(k[Sm]) the factor Φ0(k[Sm])m=(k[Sm])Sm≅k is nonzero when k≠0, and it occurs in Φ0(M(m))n only when n≥m; so for m>0 the map T ⁣:Φ0(M(m))m−1→Φ0(M(m))m is not surjective, giving surj-deg⁡(M(m))≥m and hence equality, and stab-deg⁡(M(m))=m. For m=0 the upper bound already gives equality 0; no negative degree is used. Over the zero ring all modules vanish, so all these degrees are 0 instead.

2.2F3F5step 1.2

Conversely, for n≥m+λ1 the padded partition λ[n]=(n−m,λ1,λ2,… ) is obtained from λ by adding one box in each of the first n−m columns, so V(λ)n occurs in M(λ)n by step 1.2; therefore weight⁡(M(λ))≥m, and with step 1.2, weight⁡(M(λ))=m.

2.3F2F3F4step 1.1

For the stability degree, fix a≥0 and use the decomposition of step 1.1 for W=Skλ: the factor indexed by U⊆a is Φ∣U∣(Skλ)r=(Skλ)Sr when ∣U∣+r=m (and 0 otherwise), where Sr acts on the last r points. By the branching rule [F3], (Skλ)Sr is the sum of the Specht modules obtained from λ by removing one box from each of r different columns, and by the strip criterion [F4] such a removal exists exactly when r≤λ1; hence (Skλ)Sr=0 for r>λ1 and is nonzero for r=λ1 provided m≥λ1. Consequently, for every n≥λ1 all nonzero factors of ΦaM(λ)n already occur in ΦaM(λ)λ1, and T acts as the identity on them, so T is surjective for all n≥λ1; thus surj-deg⁡(M(λ))≤λ1.

3.1F2step 1.1step 2.1step 2.3

Sharpness: if λ1>0, take a=m−λ1≥0. The factor with U=a and r=λ1 equals (Skλ)Sλ1≠0 and occurs in ΦaM(λ)n exactly when n≥λ1; in particular T ⁣:ΦaM(λ)λ1−1→ΦaM(λ)λ1 has a nonzero target summand not met by T, so it is not surjective and surj-deg⁡(M(λ))≥λ1. Hence surj-deg⁡(M(λ))=λ1, and by step 2.1, which gives injectivity degree 0, stab-deg⁡(M(λ))=λ1. For λ=∅ we have m=λ1=0, M(∅)=M(k) has all transition maps isomorphisms and stability degree 0.

4.1step 2.1step 1.2step 2.2step 2.3step 3.1∎

Step 2.1 gives the general injectivity and surjectivity bounds and the exact stability degree of M(m); steps 1.2 and 2.2 give weight⁡(M(λ))=∣λ∣; steps 2.3 and 3.1 give stab-deg⁡(M(λ))=λ1.

Depends on

Used by

Dependency tree · two levels

45 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