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 be a field of characteristic and let be a finitely generated FI-module over with finite-dimensional values, weight and stability degree , with character polynomial 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
for every , the rational value on the right being read in through the prime field ; in particular is given by a polynomial in of degree at most for all sufficiently large (Character polynomials in the cycle counts ). No choice principle is used.
Facts & Assumptions
Given: A characteristic-zero field and a finitely generated FI-module over with finite-dimensional values, weight , stability degree and character polynomial of weighted degree satisfying for all and all (Finitely generated FI-modules have eventual character polynomials).
For a finite-dimensional -module the character value at the identity is the dimension: (The trace as the sum of the diagonal entries).
The identity permutation of has fixed points and for every (Character polynomials in the cycle counts , Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).
Evaluating a character polynomial of weighted degree at gives a polynomial in over of degree at most : substitution is a ring homomorphism, and the surviving monomials are with (Character polynomials in the cycle counts ).
Proof
Fix . By the character identity of Finitely generated FI-modules have eventual character polynomials applied to , and by [F1] and [F2], .
By [F3] the function is a polynomial over of degree at most ; hence step 1.1 exhibits a polynomial of degree at most agreeing with for every . This proves the claim.
Depends on
- Finitely generated FI-modules have eventual character polynomials
- Character polynomials in the cycle counts $X_i$
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type
- Weight of an FI-module over a field of characteristic zero
- Injectivity, surjectivity and stability degree
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
- 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)
- Thomas Church, Jordan S. Ellenberg, Benson Farb and Rohit Nagpal, “FI-modules over Noetherian rings”, Geom. Topol. 18 (2014) 2951–2984; author-hosted full text (standard reference, not scraped)