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

A pullback of module maps is computed as a kernel of a difference map

Example

For module maps f:M→P and g:N→P, the pullback is the submodule

M×PN={(m,n)∈M⊕N:f(m)=g(n)},

which is the kernel of (f,−g):M⊕N→P.

Facts & Assumptions

Given: Module maps f:M→P and g:N→P.

[L1]

Pullbacks in an abelian category are kernels of the corresponding difference maps (A pullback is the kernel of the difference of the two legs, and dually for pushouts).

[L2]

Modules and their homomorphisms form a category (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod).

Verification

technique · direct
1.1

The kernel of (f,−g):M⊕N→P consists exactly of those pairs (m,n) with f(m)=g(n).

L2
2.1

By [L1], that kernel is the pullback of f and g. So the fiber product of two module maps is computed by the familiar subgroup of compatible pairs.

L1L2step 1.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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