Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Span, finite generation and generation degree of an FI-module

Definition

Let V be an FI-module over k (The category FI and FI-modules over a commutative ring) and let Σ be a set of supported elements (S,v), where S is a finite set and v∈VS. The support S is part of the generator data, even when distinct values of V have overlapping underlying sets. Write ΣS:={v∈VS:(S,v)∈Σ}; a sub-FI-module W contains Σ when v∈WS for every (S,v)∈Σ. The sub-FI-module generated by Σ, written span⁡V(Σ), is the intersection of all sub-FI-modules of V that are subfunctors and contain Σ (Submodule of a module, The one-step submodule criterion; intersections and sums of submodules are submodules for the objectwise intersection of submodules). The family is nonempty because V itself qualifies, and the intersection is a sub-FI-module, since each transition map f∗ preserves every member and hence their intersection; thus span⁡V(Σ) is the smallest sub-FI-module of V containing Σ.

Explicitly, span⁡V(Σ)T is the k-span of all elements f∗(v) with (S,v)∈Σ and f ⁣:S→T a morphism of FI: the set of all finite k-linear combinations of such elements is a sub-FI-module of V containing Σ, because g∗(f∗(v))=(g∘f)∗(v), and every sub-FI-module containing Σ contains each f∗(v); hence it equals the intersection. Call V finitely generated when span⁡V(Σ)=V for some finite Σ, and generated in degree ≤d when span⁡V(V≤d)=V, where V≤d={([m],v):0≤m≤d, v∈V[m]} uses the finite skeleton of FI; transport by bijections shows that its span also contains every VS with ∣S∣≤d. The generation degree of V is the least d≥0 such that V is generated in degree ≤d, and ∞ when no such d exists (Generated submodule, cyclic and finitely generated modules, module basis and free module).

Finite generation of V and pointwise finite generation of the individual k-modules VS are different conditions: the pointwise property is implied by finite generation (as shown below by Generation in bounded degree presents an FI-module as a quotient of free FI-modules) but does not imply it, and no pointwise finite generation or finite-dimensionality is built into either notion. A finite generating set gives a finite degree bound: take the maximum cardinality of its supporting sets (and 0 for the empty generating set). When a generator is written simply as v∈VS, its specified support S is understood, so span⁡V(v) means span⁡V({(S,v)}). Generation in bounded degree alone does not imply finite generation. No choice principle is used: span⁡V(Σ) is defined by an intersection of subfunctors, and its explicit description involves only finite k-linear combinations.

Depends on

Used by

Dependency tree · two levels

18 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