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.

Weight and stability degree give a uniform representation-stability range

Statement

Let k be a field of characteristic 0 and let V be an FI-module over k with finite-dimensional values, weight d:=weight⁡(V)<∞ and stability degree s:=stab-deg⁡(V)<∞ (Weight of an FI-module over a field of characteristic zero, Injectivity, surjectivity and stability degree). Let (Vn,φn) be the consistent sequence determined by V (Uniform representation stability for consistent sequences of Sn-modules). Then (Vn,φn) is uniformly representation stable with stable range n≥d+s: the maps φn are injective for all n≥d+s, the Sn+1-span of φn(Vn) is all of Vn+1 for all n≥d+s, and for every partition λ the multiplicity cλ,n of V(λ)n in Vn is independent of n for all n≥d+s. No choice principle is used.

Facts & Assumptions

Given: A characteristic-zero field k, an FI-module V over k with finite-dimensional values, d=weight⁡(V)<∞ and s=stab-deg⁡(V)<∞, and the consistent sequence (Vn,φn) with φn induced by the standard inclusion [n]↪[n+1] (Uniform representation stability for consistent sequences of Sn-modules); for n≥∣λ∣+λ1, V(λ)n is the irreducible kSn-module with label λ[n], of multiplicity cλ,n in Vn (Weight of an FI-module over a field of characteristic zero, Specht modules classify the irreducibles over every field of characteristic zero).

[F1]

A consistent sequence is uniformly representation stable with stable range n≥N when (I) φn is injective for all n≥N, (II) the Sn+1-span of φn(Vn) is Vn+1 for all n≥N, and (III) for every partition λ the multiplicity cλ,n is independent of n for all n≥N (Uniform representation stability for consistent sequences of Sn-modules).

[F2]

stab-deg⁡(V)=max⁡(inj-deg⁡(V),surj-deg⁡(V)), so for every a≥0 the transition map T ⁣:Φa(V)n→Φa(V)n+1 is an isomorphism for all n≥s (Injectivity, surjectivity and stability degree, The coinvariant functors Φa and the transition maps T).

[F3]

weight⁡(V)=d means that no irreducible of label λ with ∣λ∣>d occurs as a constituent of Vn for any n≥∣λ∣+λ1; hence cλ,n=0 whenever ∣λ∣>d and cλ,n is defined (Weight of an FI-module over a field of characteristic zero).

[F4]

For μ=λ[n]⊢n and a≤n: (i) (Vμ)Sn−a=0  ⟺  a<∣λ∣; (ii) if a=∣λ∣, then (Vμ)Sn−a≅Vλ; (iii) for fixed λ and a≥∣λ∣, (V(λ)n)Sn−a≅Ind⁡S∣λ∣×Sa−∣λ∣Sa(Vλ⊠k) for all n≥a+λ1; (iv) if an FI-module U over a characteristic-zero field has weight⁡(U)≤a, then, for every n≥a, every subquotient Wn of Un satisfies Wn=0  ⟺  (Wn)Sn−a=0 (Coinvariants detect vanishing of subquotients of bounded weight, and padded irreducibles stabilise).

[F5]

Every constituent V(λ)n of Vn satisfies λ1≤s (A stability degree bounds the first row of every padding tail).

[F6]

Φa(U)n=(Ua⊔n)Sn with transition map T induced by an injection a⊔n→a⊔n+1 fixing a; Φa is a functor, it is exact when k contains Q, and it preserves finite direct sums, so (U⊕U′)Sn≅USn⊕USn′ (The coinvariant functors Φa and the transition maps T, The coinvariants functor).

[F7]

Over the characteristic-zero field k, every finite-dimensional kSn-module is a direct sum of copies of the pairwise non-isomorphic irreducibles V(λ)n (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣, Specht modules classify the irreducibles over every field of characteristic zero).

Proof

technique · direct
1.1F1F6given

The commuting Sa-action on Φa(V) makes every T Sa-equivariant by The coinvariant functors Φa and the transition maps T, so the isomorphisms used below preserve representation types. Let Kn:=ker⁡φn⊆Vn and let φn′:=Ind⁡SnSn+1φn ⁣:Ind⁡SnSn+1Vn→Vn+1 with cokernel Cn+1, so that Cn+1 is a quotient of Vn+1. The image of φn′ is the Sn+1-span of φn(Vn), since φn′(σ⊗v)=σ⋅φn(v); hence condition (I) is Kn=0 for all n≥N and condition (II) is Cn+1=0 for all n≥N.

2.1F3step 1.1

If ∣λ∣>d, then cλ,n=0 for every n for which cλ,n is defined, so condition (III) is automatic for such λ; it remains to treat ∣λ∣≤d.

2.2F3F4step 1.1

Vanishing criteria: for n≥d one has Kn=0  ⟺  (Kn)Sn−d=0, and for n+1≥d one has Cn+1=0  ⟺  (Cn+1)Sn+1−d=0. Indeed Kn is a submodule of Vn and Cn+1 is a quotient of Vn+1, both are subquotients of modules of weight d (Weight of an FI-module over a field of characteristic zero), and F4 applies with a=d.

2.3F6givenstep 1.1

Factorization: for n≥d, identify Φd(V)n−d with (Vn)Sn−d and Φd(V)n+1−d with (Vn+1)Sn+1−d along the standard identifications of d⊔(n−d) with [n] and of d⊔(n+1−d) with [n+1]. The transition map T ⁣:(Vn)Sn−d→(Vn+1)Sn+1−d factors in two ways: T=q∘(φn)Sn−d, where q is the quotient map onto coinvariants of the larger subgroup Sn+1−d≥Sn−d, and T=(φn′)Sn+1−d∘ψ, where ψ is induced by v↦1⊗v. Exactness of coinvariants over k gives (Kn)Sn−d=ker⁡((φn)Sn−d) and (Cn+1)Sn+1−d=coker⁡((φn′)Sn+1−d).

3.1F2F4F5F6F7step 2.1

We prove (III) by induction on m=∣λ∣ in the range m≤d. Fix m≤d, let n≥s+d (so n−m≥s≥0), and assume the multiplicities cμ,n′ are independent of n′ in the range for all ∣μ∣<m. Since n−m≥s, the transition maps give isomorphisms Φm(V)n−m≅Φm(V)i for all i≥s, so the isomorphism class of (Vn)Sn−m=Φm(V)n−m is independent of n. By [F7] Vn=⨁λcλ,nV(λ)n is a finite direct sum of irreducibles, and [F6] gives (Vn)Sn−m=⨁λcλ,n(V(λ)n)Sn−m; by F4 with a=m only the labels with ∣λ∣≤m contribute, and by F4 with a=m those with ∣λ∣=m contribute (V(λ)n)Sn−m≅Vλ. For ∣λ∣<m, F4 gives (V(λ)n)Sn−m≅Ind⁡S∣λ∣×Sm−∣λ∣Sm(Vλ⊠k), independent of n, provided n≥m+λ1; this holds because λ1≤s for every occurring constituent by [F5] and m+λ1≤d+s≤n. Hence in the decomposition (Vn)Sn−m=⨁∣λ∣<mcλ,n(V(λ)n)Sn−m⊕⨁∣λ∣=mcλ,nVλ the first summand has an isomorphism class independent of n (each factor is independent of n and each multiplicity is constant by the induction hypothesis), and the total has an isomorphism class independent of n, so the second summand does too; as the Vλ with ∣λ∣=m are pairwise non-isomorphic, every multiplicity cλ,n with ∣λ∣=m is independent of n in the range. This proves (III) for all λ with ∣λ∣≤d and hence, with step 2.1, for all λ.

3.2F2step 1.1step 2.2step 2.3

Let n≥s+d, so that n−d≥s and T ⁣:Φd(V)n−d→Φd(V)n+1−d is an isomorphism by [F2]. The first factorization in step 2.3 then forces (φn)Sn−d to be injective, and the second forces (φn′)Sn+1−d to be surjective; by the exactness identifications in step 2.3 and the criteria in step 2.2, Kn=0 and Cn+1=0. By step 1.1, conditions (I) and (II) hold for all n≥s+d.

4.1step 2.1step 3.1step 2.2step 2.3step 3.2∎

Steps 2.1 and 3.1 give condition (III) for n≥d+s and steps 2.2, 2.3 and 3.2 give conditions (I) and (II) for n≥d+s; hence the consistent sequence (Vn,φn) is uniformly representation stable with stable range n≥d+s.

Depends on

Used by

Dependency tree · two levels

38 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