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.
A pointwise one-dimensional FI-module that is not finitely generated
Statement refuted
Refuted claim: an FI-module over a field whose values are finite-dimensional for every finite set is finitely generated.
The witness is built below: over a field , take one-dimensional for every finite set , with bijections acting as the identity identification of the lines and non-bijections acting as . Then for all , but no finite set of elements generates (Span, finite generation and generation degree of an FI-module).
Facts & Assumptions
Given: A field and, for every finite set , the one-dimensional -vector space with distinguished nonzero vector ; for an injection let send when is a bijection and otherwise.
An FI-module over is a covariant functor from the category of finite sets and injections to -modules, so and for composable injections (The category FI and FI-modules over a commutative ring).
For a set of supported elements , is the -span of the elements with and an injection; is finitely generated when for some finite (Span, finite generation and generation degree of an FI-module).
A composite of bijections is a bijection; if and are bijections then is a bijection; and if is not a bijection then is not a bijection (Injection, surjection, bijection).
For every the set has exactly elements (The finite symmetric group , one-line notation, and cycle notation).
Counterexample
is a functor: sends to because is a bijection; and for composable injections , the two sides of agree on in each case — if and are bijections both sides send ; if fails to be a bijection then fails to be a bijection, so both sides are ; and if fails to be a bijection then fails to be a bijection and both sides are . Hence is an FI-module and for every finite set .
Suppose is a finite set of supported elements that generates , with , and put (if , then , so ). For every finite set with , every injection satisfies , so is not a bijection and .
By the explicit description of the span, step 1.2 shows for every finite set with . Taking , which has elements, gives while ; hence and no finite set of elements generates .
Thus has for every finite set by step 1.1, yet is not finitely generated by step 2.1: pointwise finite-dimensionality does not imply finite generation, and the refuted claim fails.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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)