Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Generation in bounded degree presents an FI-module as a quotient of free FI-modules

Statement

Let V be an FI-module over k (The category FI and FI-modules over a commutative ring), with free FI-modules M(m) as in The free FI-module M(W) generated by an Sm-module and span as in Span, finite generation and generation degree of an FI-module.

(a) For v∈Vm the map of FI-modules M(m)→V sending the canonical generator idm∈M(m)m to v has image span⁡V(v); more generally, for any set Σ of elements, each lying in some VS, the canonical map ⨁s∈ΣM(Ss)→V sending idSs to s has image span⁡V(Σ). Here Ss is the specified supporting set of s, and M(S)T is the free k-module on injections S→T, with postcomposition as transition maps. Each M(S) is isomorphic to M(∣S∣) after choosing a single bijection [∣S∣]→S.

(b) V is finitely generated if and only if there is a finite family m1,…,mr≥0 with a surjection

M(m1)⊕⋯⊕M(mr)↠V;

V is generated in degree ≤d if and only if there is a surjection ⨁i∈IM(mi)↠V with mi≤d for all i. In particular, if V is generated in degree ≤d, then the evaluation map ⨁m≤dM(Vm)→V, whose value on a summand VT supported on an m-element subset T⊆S is the transition map VT→VS, is surjective.

(c) If V is finitely generated, then VS is a finitely generated k-module for every finite set S (Generated submodule, cyclic and finitely generated modules, module basis and free module).

No choice principle is used: all maps come from a finite or explicitly indexed set of generators, and the image computations are linear algebra on the values at a fixed finite set.

Facts & Assumptions

Given: An FI-module V over k, a set Σ of elements with each element lying in some VS, and for each m the free FI-module M(m) with its canonical generator idm.

[F1]

M(m)S has as k-basis the injections [m]↪S; for a map of FI-modules F ⁣:M(m)→V and the element v=F(idm)∈Vm, naturality forces F(f)=f∗(v) for an injection f ⁣:[m]↪S; the module M(m) represents the functor V↦Vm (The free FI-module M(W) generated by an Sm-module).

[F2]

span⁡V(Σ) is the smallest sub-FI-module of V containing Σ, and span⁡V(Σ)T is the k-span of the elements f∗(s) with (S,s)∈Σ and f ⁣:S→T a morphism of FI; V is finitely generated when span⁡V(Σ)=V for a finite Σ, and generated in degree ≤d when span⁡V(V≤d)=V (Span, finite generation and generation degree of an FI-module).

[F3]

A direct summand inclusion and the coordinate maps of a direct sum are k-linear, and the image of a direct sum of maps is the sum of the images (The direct sum of an indexed family of modules, Module homomorphism and isomorphism, kernel, image and cokernel).

[F4]

A quotient of a finitely generated k-module is finitely generated, and a finitely generated free k-module on a finite set is finitely generated (Generated submodule, cyclic and finitely generated modules, module basis and free module).

Proof

technique · direct
1.1F1F2given

For v∈Vm let F ⁣:M(m)→V correspond to v under the representing property, so F(idm)=v and F(f)=f∗(v) for every injection f ⁣:[m]↪S [F1]. Then im⁡(F)S is the k-span of the elements f∗(v), which is exactly span⁡V(v)S by [F2]; hence im⁡(F)=span⁡V(v).

2.1F2F3step 1.1

More generally, the map ⨁s∈ΣM(Ss)→V has image the sum of the images of its summands, and the summand indexed by s∈VS sends a basis injection f:S→T to f∗(s), so has image span⁡V(s) by the same computation as step 1.1; hence the image is span⁡V(Σ) by [F2, F3].

2.2F1F2step 1.1

The same argument with an arbitrary index set I shows that V is generated in degree ≤d if and only if there is a surjection ⨁i∈IM(mi)→V with all mi≤d: the generators vi of the image lie in degrees mi≤d, and conversely the skeletal generating set V≤d produces a surjection from the sum of the M(m) indexed by (m,v) with m≤d and v∈Vm. Separately, the adjunction defining M gives the evaluation map ⨁m≤dM(Vm)→V from the FB-module which agrees with V on sets of cardinality m and is zero elsewhere: its VT summand maps by the inclusion T↪S. Its image consists of the transition images from degrees ≤d and is therefore V.

3.1F1F2step 2.1

If V=span⁡V(Σ) for a finite Σ, then the map of step 2.1 is surjective onto V and the finitely many supporting sets can be transported to [mi] by finitely many bijections, giving generators s1,…,sr with si∈Vmi, so M(m1)⊕⋯⊕M(mr)↠V. Conversely, if ⨁i=1rM(mi)↠V is a surjection, let vi be the image of the canonical generator of the i-th summand; step 2.1 identifies the image with span⁡V(v1,…,vr), so this span is V and V is finitely generated.

4.1F1F4step 3.1

If V is finitely generated, fix a surjection M(m1)⊕⋯⊕M(mr)↠V from step 3.1. Evaluating at a finite set S gives a surjection of k-modules M(m1)S⊕⋯⊕M(mr)S↠VS, and each M(mi)S is free with the finite basis Inj⁡([mi],S) [F1]; a finite direct sum of finitely generated free modules is finitely generated, and its quotient VS is finitely generated by [F4]. This proves (c).

5.1step 1.1step 2.1step 3.1step 2.2step 4.1∎

Steps 1.1 and 2.1 prove (a); steps 3.1 and 2.2 prove (b), including the evaluation map; step 4.1 proves (c).

Depends on

Used by

Dependency tree · two levels

25 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