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.
Injectivity, surjectivity and stability degree
Definition
Let be an FI-module over and let and be the coinvariant functors and transition maps of The coinvariant functors and the transition maps . The injectivity degree is the least such that for every the transition map is injective for all ; the surjectivity degree is the least such that for every the map is surjective for all . The stability degree is
Each of the three is when no such exists; here the bounds are read as elements of the extended nonnegative integers with the evident order, in which every nonempty subset of has a least element (The natural numbers (von Neumann)), so "the least " is well defined. Equivalently, is an isomorphism for all and all : the map is an isomorphism exactly when it is both injective and surjective, and for finite bounds a threshold that controls all simultaneously is the larger of the two thresholds, while each of the two stated bounds remains the least threshold controlling its own property.
The three bounds are kept distinct: is the maximum of the other two, and nothing in the definition requires . No finiteness is asserted: each bound is allowed to be . No choice principle is used.
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
- 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
- Finite generation is equivalent to uniform representation stability Theorem
- Finitely generated FI-modules have eventual character polynomials Theorem
Dependency tree · two levels
16 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)