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 of an FI-module over a field of characteristic zero
Definition
Let be a field of characteristic and let be an FI-module over (The category FI and FI-modules over a commutative ring). For a partition and put , the first-row padding (First-row padding of a partition), with and , and let
be the scalar extension of the rational Specht model of (Complex Specht modules are irreducible, Specht modules classify the irreducibles over every field of characteristic zero). By the classification lemma, is the irreducible -module with label , and every irreducible -module is isomorphic to exactly one : indeed, every partition of is uniquely for the partition obtained by deleting the first row, and holds precisely because ; consequently the labels run over the partitions of without repetition. At the only label and its tail are both , and with the trivial -action.
Say that occurs as a constituent of when there are -submodules with (Submodule of a module, Quotient module with scalar multiplication on additive cosets); this is a condition on subquotients and requires no decomposition or finite-dimensionality of . The weight of is
the supremum over all pairs as displayed. The set of integers displayed is a set of nonnegative integers, so the supremum is well defined in ; it is for , and exactly when the displayed set is unbounded. No finiteness of is asserted.
If is a subquotient of , meaning that for sub-FI-modules computed pointwise, then : a constituent of is a subquotient of the subquotient of , hence a subquotient of , so it contributes the same label to the supremum for . No choice principle is used: the labels , constituents and the supremum are set-theoretic data, and no bases or decompositions are chosen.
Depends on
Used by
- Dimensions of finitely generated FI-modules are eventually polynomial Corollary
- The padded family V((2,1)) begins at rank five, with weight three and stability degree two Example
- Bounded generation degree bounds surjectivity degree and weight Lemma
- Coinvariants detect vanishing of subquotients of bounded weight, and padded irreducibles stabilise Lemma
- Free FI-modules have computable stability degree and weight Lemma
- A stability degree bounds the first row of every padding tail Proposition
- Each padded irreducible family is realised by a finitely generated FI-module Proposition
- Weight and stability degree give a uniform representation-stability range Proposition
- FI-modules over a Noetherian ℚ-algebra form a Noetherian category Theorem
- Finite generation is equivalent to uniform representation stability Theorem
- Finitely generated FI-modules have eventual character polynomials Theorem
- Murnaghan stability for Kronecker coefficients Theorem
Dependency tree · two levels
37 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)