Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

The free-group functor F:SetGrpF:\mathbf{Set}\to\mathbf{Grp} and free-module functor R():SetR-ModR^{(-)}:\mathbf{Set}\to R\text{-}\mathbf{Mod}

Example

Free groups and free left RR-modules vary functorially with their sets of generators.

Facts & Assumptions

Verification

technique · direct
1.1

For a function f:XYf:X\to Y, the composite XfYF(Y)X\xrightarrow fY\to F(Y) extends uniquely by [L2] to a homomorphism F(f):F(X)F(Y)F(f):F(X)\to F(Y).

L2
1.2

Construct R(X)R^{(X)} explicitly, since [L3] says only what it means for a module to be free and does not build one: let R(X)R^{(X)} be the set of functions a:XRa:X\to R whose support supp(a)={x:ax0}\operatorname{supp}(a)=\{x:a_x\ne0\} is finite, with pointwise addition and scalar multiplication. Both operations preserve finite support because supp(a+b)supp(a)supp(b)\operatorname{supp}(a+b)\subseteq\operatorname{supp}(a)\cup\operatorname{supp}(b) and supp(ra)supp(a)\operatorname{supp}(ra)\subseteq\operatorname{supp}(a), so R(X)R^{(X)} is a left RR-module, and the family exe_x with ex(x)=1e_x(x)=1 and ex=0e_x=0 elsewhere is a basis: every aa is the finite sum xsupp(a)axex\sum_{x\in\operatorname{supp}(a)}a_xe_x, and a vanishing finite combination has every coefficient zero by evaluating at each index. So R(X)R^{(X)} is free in the sense of [L3]. Now R(f)R^{(f)} sends aa to the family yxf1(y)supp(a)axy\mapsto\sum_{x\in f^{-1}(y)\cap\operatorname{supp}(a)}a_x; the index set is finite because it lies in supp(a)\operatorname{supp}(a), which is what [L4] requires, whereas f1(y)f^{-1}(y) itself may be infinite. The result again has finite support, contained in f[supp(a)]f[\operatorname{supp}(a)], and R(f)R^{(f)} is additive and RR-linear because each coefficient is a finite sum of the corresponding coefficients of aa. On basis elements it sends exe_x to ef(x)e_{f(x)}.

L3L4
2.1

Both maps assigned to 1X1_X fix every generator. The uniqueness of the free extensions therefore gives F(1X)=1F(X)F(1_X)=1_{F(X)} and R(1X)=1R(X)R^{(1_X)}=1_{R^{(X)}}.

step 1.1step 1.2L2L3
2.2

For XfYgZX\xrightarrow fY\xrightarrow gZ, the maps F(gf)F(gf) and F(g)F(f)F(g)F(f) agree on every generator. The module maps R(gf)R^{(gf)} and R(g)R(f)R^{(g)}R^{(f)} likewise send exe_x to eg(f(x))e_{g(f(x))}; finite-sum reindexing gives the same equality in coefficient form.

step 1.1step 1.2L2L3
3.1

Hence XF(X)X\mapsto F(X) and XR(X)X\mapsto R^{(X)}, with the maps above, define functors SetGrp\mathbf{Set}\to\mathbf{Grp} and SetR-Mod\mathbf{Set}\to R\text{-}\mathbf{Mod}.

step 2.1step 2.2L1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 81 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources