Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

For every ring R, the category R-Mod is complete and cocomplete

Statement

For every ring R, the category R-Mod of left R-modules and R-linear maps has all small limits and all small colimits.

Facts & Assumptions

Given: A fixed ring R.

[L1]

Small products and equalizers characterize completeness, and small coproducts and coequalizers characterize cocompleteness (A category is complete exactly when it has all small products and equalizers, and cocomplete exactly when it has all small coproducts and coequalizers).

[F2]

Submodules are closed under addition, inverses, and scalar multiplication (Submodule of a module).

[F3]

A subset BM is a basis when every element of M has a unique expression as a finite R-linear combination of elements of B, and a module possessing a basis is free (Generated submodule, cyclic and finitely generated modules, module basis and free module). This supplies the definition only; the free module on a set and its extension property are constructed in step 1.4 below.

[F4]

Quotients by submodules are modules, and a linear map factors uniquely through the quotient precisely when it kills that submodule (Quotient module M/N with scalar multiplication on additive cosets, A module homomorphism vanishing on N factors uniquely through M/N).

Proof

technique · explicit constructions and the criteria
1.1

A set-indexed Cartesian product of left R-modules, with componentwise addition and scalar multiplication, is a module. Coordinatewise pairing gives its product universal property. The empty product is the zero module.

F1algebra
1.2

For parallel linear maps f,g:MN, their agreement set is ker(fg) and is a submodule by [F1] and [F2]. Corestriction through its inclusion gives the equalizer universal property. Hence [L1] gives completeness.

F1F2L1
1.3

For f,g:MN, quotient N by the submodule generated by {f(m)g(m):mM}. The quotient map equalizes f,g, and [F4] says every equalizing linear map factors through it uniquely. Thus this is a coequalizer.

F2F4
1.4

For a set S, let R(S) be the set of functions λ:SR vanishing outside some finite subset, with pointwise addition and scalar multiplication; these are again finitely supported, so [F1] makes R(S) a left R-module. For sS let es take the value 1 at s and 0 elsewhere. Each λ is the finite sum sλ(s)es over its support, and evaluating any such expression at a point of S returns its coefficient there, so the expression is unique; hence {es:sS} is a basis and R(S) is free in the sense of [F3]. Given a left R-module P and any function g:SP, the assignment λsλ(s)g(s), summed over the finite support, is R-linear by [F1] and sends es to g(s); and any linear map agreeing with g on every es agrees with it on every finite R-combination of the es, hence everywhere. So a linear map out of R(S) may be prescribed arbitrarily on the basis and is determined by that prescription.

F1F2F3algebra
2.1

For modules (Mi), let S=i{i}×Mi. In the free module R(S) of step 1.4, quotient by the submodule generated by [i,0], [i,x+y][i,x][i,y], and [i,rx]r[i,x]. The maps MiR(S)/N induced by x[i,x]+N are linear.

F2F4step 1.4
3.1

A family of linear maps MiP extends uniquely from S to the free module by step 1.4, kills the displayed generators, and therefore factors uniquely through the quotient by [F4]. This is the coproduct universal property. For an empty family, it returns the zero module.

F4step 1.4step 2.1
4.1

Steps 2.1, 3.1, and 1.3 give all small coproducts and coequalizers, so [L1] gives cocompleteness.

L1step 2.1step 3.1step 1.3

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: 54 results over 16 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