Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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:Set→Grp and free-module functor R(−):Set→R-Mod

Example

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

Facts & Assumptions

Given: A unital ring R and sets with functions between them.

[L2]

The reduced-word group on X has the free-group universal property (Free group on a set of generators, Reduced words form the free group on an alphabet).

[L3]

A free module has a basis, and finite sums in its additive commutative monoid are defined and invariant under reindexing (Generated submodule, cyclic and finitely generated modules, module basis and free module, A finite sum in a commutative monoid indexed by an arbitrary finite set).

[L4]

A finite sum over a finite index set in a commutative monoid is well defined and independent of the enumeration, and reindexes along a bijection (A finite sum in a commutative monoid indexed by an arbitrary finite set, Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).

Verification

technique · direct
1.1

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

L2
1.2

Construct R(X) explicitly, since [L3] says only what it means for a module to be free and does not build one: let R(X) be the set of functions a:X→R whose support supp⁡(a)={x:ax≠0} is finite, with pointwise addition and scalar multiplication. Both operations preserve finite support because supp⁡(a+b)⊆supp⁡(a)∪supp⁡(b) and supp⁡(ra)⊆supp⁡(a), so R(X) is a left R-module, and the family ex with ex(x)=1 and ex=0 elsewhere is a basis: every a is the finite sum ∑x∈supp⁡(a)axex, and a vanishing finite combination has every coefficient zero by evaluating at each index. So R(X) is free in the sense of [L3]. Now R(f) sends a to the family y↦∑x∈f−1(y)∩supp⁡(a)ax; the index set is finite because it lies in supp⁡(a), which is what [L4] requires, whereas f−1(y) itself may be infinite. The result again has finite support, contained in f[supp⁡(a)], and R(f) is additive and R-linear because each coefficient is a finite sum of the corresponding coefficients of a. On basis elements it sends ex to ef(x).

L3L4
2.1

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

step 1.1step 1.2L2L3
2.2

For X→fY→gZ, the maps F(gf) and F(g)F(f) agree on every generator. The module maps R(gf) and R(g)R(f) likewise send ex to eg(f(x)); finite-sum reindexing gives the same equality in coefficient form.

step 1.1step 1.2L2L3
3.1

Hence X↦F(X) and X↦R(X), with the maps above, define functors Set→Grp and Set→R-Mod.

step 2.1step 2.2L1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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