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

Dimensions of finitely generated FI-modules are eventually polynomial

Statement

Let k be a field of characteristic 0 and let V be a finitely generated FI-module over k with finite-dimensional values, weight d=weight⁡(V) and stability degree s=stab-deg⁡(V), with character polynomial PV as in Finitely generated FI-modules have eventual character polynomials (Weight of an FI-module over a field of characteristic zero, Injectivity, surjectivity and stability degree). Then

dim⁡kVn=PV(n,0,0,… )

for every n≥s+d, the rational value on the right being read in k through the prime field Q⊆k; in particular dim⁡kVn is given by a polynomial in n of degree at most d for all sufficiently large n (Character polynomials in the cycle counts Xi). No choice principle is used.

Facts & Assumptions

Given: A characteristic-zero field k and a finitely generated FI-module V over k with finite-dimensional values, weight d<∞, stability degree s<∞ and character polynomial PV∈Q[X1,X2,… ] of weighted degree ≤d satisfying χVn(σ)=PV(X1(σ),X2(σ),… ) for all n≥s+d and all σ∈Sn (Finitely generated FI-modules have eventual character polynomials).

[F1]

For a finite-dimensional kSn-module the character value at the identity is the dimension: χVn(idn)=tr⁡(idn;Vn)=dim⁡kVn (The trace tr⁡(A) as the sum of the diagonal entries).

[F2]

The identity permutation of Sn has X1(idn)=n fixed points and Xi(idn)=0 for every i≥2 (Character polynomials in the cycle counts Xi, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).

[F3]

Evaluating a character polynomial P∈Q[X1,X2,… ] of weighted degree ≤d at (n,0,0,… ) gives a polynomial in n over Q of degree at most d: substitution is a ring homomorphism, and the surviving monomials are X1a1 with a1≤d (Character polynomials in the cycle counts Xi).

Proof

technique · direct
1.1F1F2given

Fix n≥s+d. By the character identity of Finitely generated FI-modules have eventual character polynomials applied to σ=idn, and by [F1] and [F2], dim⁡kVn=χVn(idn)=PV(X1(idn),X2(idn),… )=PV(n,0,0,… ).

2.1F3step 1.1∎

By [F3] the function n↦PV(n,0,0,… ) is a polynomial over Q of degree at most d; hence step 1.1 exhibits a polynomial of degree at most d agreeing with dim⁡kVn for every n≥s+d. This proves the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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