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 be a field of characteristic and let be a finitely generated FI-module over with finite-dimensional values (The category FI and FI-modules over a commutative ring). Put and ; both are finite because 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 of weighted degree at most such that
for every and every , where is the character of the -module (Character polynomials in the cycle counts , The trace as the sum of the diagonal entries). No choice principle is used.
Facts & Assumptions
Given: A characteristic-zero field , a finitely generated FI-module over with finite-dimensional values, generated in degree for some , and the character functions (Span, finite generation and generation degree of an FI-module, The trace as the sum of the diagonal entries).
Generation in degree is equivalent to the existence of a surjection with all , and is finitely generated exactly when some such presentation has finite index set (for some finite degree bound); is the free FI-module on the regular -module (Generation in bounded degree presents an FI-module as a quotient of free FI-modules, The free FI-module generated by an -module).
Generation in degree implies , and over a characteristic-zero field it implies (Bounded generation degree bounds surjectivity degree and weight).
for every FB-module (Free FI-modules have computable stability degree and weight).
Every sub-FI-module of a finitely generated FI-module over a commutative Noetherian ring containing is finitely generated (FI-modules over a Noetherian -algebra form a Noetherian category).
is exact over fields of characteristic , 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 and the transition maps ).
, where and are the least thresholds beyond which all transition maps are injective, respectively surjective (Injectivity, surjectivity and stability degree).
If an FI-module over a characteristic-zero field has finite-dimensional values and finite weight and stability degree , then its consistent sequence is uniformly representation stable with stable range ; consequently the multiplicity of in is independent of for (Weight and stability degree give a uniform representation-stability range, Weight of an FI-module over a field of characteristic zero).
Every constituent of satisfies whenever is finite (A stability degree bounds the first row of every padding tail).
For a partition with there is a character polynomial of weighted degree at most such that the character of the padded Specht module satisfies for all and all (Padded irreducible characters are eventually given by character polynomials, First-row padding of a partition).
The field-valued Specht modules are the scalar extensions of the single -model built from polytabloids (Integral and field-valued Specht modules), and the -module is , the irreducible with label (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 on is the image under of an integer and equals the value of the character polynomial of [F9] evaluated at the cycle counts of .
If two character polynomials agree as functions on for infinitely many , 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 ).
The trace on a finite direct sum is the sum of the block traces. Also , so for invertible . These follow from the diagonal-sum definition (The trace as the sum of the diagonal entries).
Proof
Since is generated in degree , [F2] gives , so . By [F1] there is a finite surjection with all ; let be its kernel. The module is finitely generated, so is finitely generated by [F4] applied over the field ; say is generated in degree .
We show that . For every the exactness of gives an exact sequence by [F5]. The transition map of is the direct sum of the transition maps of the finitely many free modules , each injective in every degree by [F3] and [F5], so is injective for all ; and is surjective for by [F2]. Then is injective for : a lift of with has in the image of , so for some , and injectivity on gives , whence . Hence ; since also by [F2], [F6] gives .
By [F7] applied with the finite numbers and of step 2.1, the consistent sequence of is uniformly representation stable with stable range ; that is, for every the multiplicities of the irreducibles in are independent of , so with one has for all , the sum being finite because only labels with occur. Moreover every with satisfies by the definition of weight and by [F8]; hence throughout the range.
For each with , [F9] and [F10] give a character polynomial of weighted degree at most with for all and all . Define , a finite sum; every summand has weighted degree at most , so does too by [F11], including the empty sum . For and , additivity of the trace over the direct sum [F12] gives , and by step 3.1 every summand satisfies , so this equals .
The polynomial of step 4.1 has the required degree bound and represents for all and all . It is unique: two character polynomials agreeing on for all agree on infinitely many , hence are equal by [F11]. This proves the theorem.
Depends on
- Finite generation is equivalent to uniform representation stability
- Character polynomials in the cycle counts $X_i$
- Padded irreducible characters are eventually given by character polynomials
- Weight of an FI-module over a field of characteristic zero
- Injectivity, surjectivity and stability degree
- A stability degree bounds the first row of every padding tail
- First-row padding of a partition
- Weight and stability degree give a uniform representation-stability range
- Bounded generation degree bounds surjectivity degree and weight
- Free FI-modules have computable stability degree and weight
- FI-modules over a Noetherian $\mathbb Q$-algebra form a Noetherian category
- Generation in bounded degree presents an FI-module as a quotient of free FI-modules
- The free FI-module $M(W)$ generated by an $S_m$-module
- The coinvariant functors $\Phi_a$ and the transition maps $T$
- Specht modules classify the irreducibles over every field of characteristic zero
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Integral and field-valued Specht modules
- The category FI and FI-modules over a commutative ring
- Span, finite generation and generation degree of an FI-module
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
- Thomas Church, Jordan S. Ellenberg and Benson Farb, “FI-modules and stability for representations of symmetric groups”, arXiv:1204.4533v4 (2014); published in Duke Math. J. 164 (2015) 1833–1910 (standard reference, not scraped)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford Mathematical Monographs, 1995 (author-hosted full text) (standard reference, not scraped)