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

Finitely generated FI-modules have eventual character polynomials

Statement

Let k be a field of characteristic 0 and let V be a finitely generated FI-module over k with finite-dimensional values (The category FI and FI-modules over a commutative ring). Put d:=weight⁡(V) and s:=stab-deg⁡(V); both are finite because V is finitely generated (Weight of an FI-module over a field of characteristic zero, Injectivity, surjectivity and stability degree). Then there is a unique character polynomial PV∈Q[X1,X2,… ] of weighted degree at most d such that

χVn(σ)=PV(X1(σ),X2(σ),… )

for every n≥s+d and every σ∈Sn, where χVn(σ):=tr⁡(σ;Vn) is the character of the kSn-module Vn (Character polynomials in the cycle counts Xi, The trace tr⁡(A) as the sum of the diagonal entries). No choice principle is used.

Facts & Assumptions

Given: A characteristic-zero field k, a finitely generated FI-module V over k with finite-dimensional values, generated in degree ≤g for some g≥0, and the character functions χVn(σ)=tr⁡(σ;Vn) (Span, finite generation and generation degree of an FI-module, The trace tr⁡(A) as the sum of the diagonal entries).

[F1]

Generation in degree ≤d is equivalent to the existence of a surjection ⨁i∈IM(mi)↠V with all mi≤d, and V is finitely generated exactly when some such presentation has finite index set (for some finite degree bound); M(m)=M(k[Sm]) is the free FI-module on the regular kSm-module (Generation in bounded degree presents an FI-module as a quotient of free FI-modules, The free FI-module M(W) generated by an Sm-module).

[F2]

Generation in degree ≤d implies surj-deg⁡(V)≤d, and over a characteristic-zero field it implies weight⁡(V)≤d (Bounded generation degree bounds surjectivity degree and weight).

[F3]

inj-deg⁡(M(W))=0 for every FB-module W (Free FI-modules have computable stability degree and weight).

[F4]

Every sub-FI-module of a finitely generated FI-module over a commutative Noetherian ring containing Q is finitely generated (FI-modules over a Noetherian Q-algebra form a Noetherian category).

[F5]

Φa is exact over fields of characteristic 0, natural in the FI-module variable, and preserves finite direct sums, so the transition map of a direct sum is the direct sum of the transition maps (The coinvariant functors Φa and the transition maps T).

[F6]

stab-deg⁡(V)=max⁡(inj-deg⁡(V),surj-deg⁡(V)), where inj-deg⁡ and surj-deg⁡ are the least thresholds beyond which all transition maps are injective, respectively surjective (Injectivity, surjectivity and stability degree).

[F7]

If an FI-module over a characteristic-zero field has finite-dimensional values and finite weight d and stability degree s, then its consistent sequence is uniformly representation stable with stable range n≥d+s; consequently the multiplicity cλ,n of V(λ)n in Vn is independent of n for n≥d+s (Weight and stability degree give a uniform representation-stability range, Weight of an FI-module over a field of characteristic zero).

[F8]

Every constituent V(λ)n of Vn satisfies λ1≤s whenever s=stab-deg⁡(V) is finite (A stability degree bounds the first row of every padding tail).

[F9]

For a partition λ with ∣λ∣=m there is a character polynomial Pλ∈Q[X1,X2,… ] of weighted degree at most m such that the character of the padded Specht module satisfies χλ[n](σ)=Pλ(X1(σ),X2(σ),… ) for all n≥m+λ1 and all σ∈Sn (Padded irreducible characters are eventually given by character polynomials, First-row padding of a partition).

[F10]

The field-valued Specht modules are the scalar extensions of the single Z-model SZλ built from polytabloids (Integral and field-valued Specht modules), and the kSn-module V(λ)n is k⊗QSQλ[n], the irreducible with label λ[n] (Weight of an FI-module over a field of characteristic zero, Specht modules classify the irreducibles over every field of characteristic zero). Consequently the trace of σ∈Sn on V(λ)n is the image under Z→k of an integer and equals the value of the character polynomial of [F9] evaluated at the cycle counts of σ.

[F11]

If two character polynomials agree as functions on Sn for infinitely many n, they are equal; the weighted degree of a sum is at most the maximum of the weighted degrees of the summands (Character polynomials in the cycle counts Xi).

[F12]

The trace on a finite direct sum is the sum of the block traces. Also tr⁡(AB)=∑i,jaijbji=tr⁡(BA), so tr⁡(B−1AB)=tr⁡(A) for invertible B. These follow from the diagonal-sum definition (The trace tr⁡(A) as the sum of the diagonal entries).

Proof

technique · direct
1.1F1F2F4

Since V is generated in degree ≤g, [F2] gives weight⁡(V)≤g, so d≤g<∞. By [F1] there is a finite surjection M:=⨁i=1rM(mi)↠V with all mi≤g; let K be its kernel. The module M is finitely generated, so K is finitely generated by [F4] applied over the field k; say K is generated in degree ≤r′.

2.1F2F3F5F6step 1.1

We show that s=stab-deg⁡(V)≤max⁡(g,r′)<∞. For every a the exactness of Φa gives an exact sequence 0→Φa(K)→Φa(M)→Φa(V)→0 by [F5]. The transition map of M is the direct sum of the transition maps of the finitely many free modules M(mi), each injective in every degree by [F3] and [F5], so T ⁣:Φa(M)n→Φa(M)n+1 is injective for all n; and T ⁣:Φa(K)n→Φa(K)n+1 is surjective for n≥r′ by [F2]. Then T ⁣:Φa(V)n→Φa(V)n+1 is injective for n≥r′: a lift x~ of x with Tx=0 has Tx~ in the image of Φa(K), so Tx~=Ty~ for some y~∈Φa(K)n, and injectivity on Φa(M) gives x~=y~, whence x=0. Hence inj-deg⁡(V)≤r′; since also surj-deg⁡(V)≤g by [F2], [F6] gives s≤max⁡(g,r′)<∞.

3.1F7F8step 2.1

By [F7] applied with the finite numbers d and s of step 2.1, the consistent sequence of V is uniformly representation stable with stable range n≥s+d; that is, for every n≥s+d the multiplicities cλ,n of the irreducibles V(λ)n in Vn are independent of n, so with cλ:=cλ,n one has Vn≅⨁λcλV(λ)n for all n≥s+d, the sum being finite because only labels with ∣λ∣≤d occur. Moreover every λ with cλ≠0 satisfies ∣λ∣≤d by the definition of weight and λ1≤s by [F8]; hence ∣λ∣+λ1≤d+s≤n throughout the range.

4.1F9F10F11F12step 3.1

For each λ with cλ≠0, [F9] and [F10] give a character polynomial Pλ of weighted degree at most ∣λ∣ with χV(λ)n(σ)=Pλ(X1(σ),X2(σ),… ) for all n≥∣λ∣+λ1 and all σ∈Sn. Define PV:=∑λcλPλ, a finite sum; every summand has weighted degree at most d, so PV does too by [F11], including the empty sum PV=0. For n≥s+d and σ∈Sn, additivity of the trace over the direct sum [F12] gives χVn(σ)=∑λcλχV(λ)n(σ), and by step 3.1 every summand satisfies n≥∣λ∣+λ1, so this equals ∑λcλPλ(X(σ))=PV(X(σ)).

5.1F11step 4.1∎

The polynomial PV of step 4.1 has the required degree bound and represents χVn for all n≥s+d and all σ∈Sn. It is unique: two character polynomials agreeing on Sn for all n≥s+d agree on infinitely many Sn, hence are equal by [F11]. This proves the theorem.

Depends on

Used by

Dependency tree · two levels

82 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