Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-06 (claude-opus-5)
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.

Every function f:ABf : A \to B factors as f=ιfˉπf = \iota \circ \bar f \circ \pi with π:AA/kerf\pi : A \to A/{\ker f} the surjective quotient map, fˉ:A/kerff[A]\bar f : A/{\ker f} \to f[A] the bijection [a]f(a)[a] \mapsto f(a), and ι:f[A]B\iota : f[A] \to B the inclusion injection; fˉ\bar f is the only function making the factorisation hold

Statement

Let f:ABf : A \to B, write \sim for kerf\ker f and let π:AA/\pi : A \to A/{\sim} be the quotient map. Put ι:=Δf[A]\iota := \Delta_{f[A]}, the identity relation on f[A]f[A]. Then

  • (i) π\pi is surjective;
  • (ii) there is a function fˉ:A/f[A]\bar f : A/{\sim} \to f[A] with fˉ([a])=f(a)\bar f([a]) = f(a) for every aAa \in A, and it is a bijection;
  • (iii) ι\iota is an injective function f[A]Bf[A] \to B with ι(y)=y\iota(y) = y;
  • (iv) ιfˉπ=f\iota \circ \bar f \circ \pi = f;
  • (v) fˉ\bar f is the only function A/f[A]A/{\sim} \to f[A] satisfying (iv).

Facts & Assumptions

Given: a function f:ABf : A \to B, with \sim denoting kerf\ker f.

[L5]

A/  :=  {[a]  :  aA}A/{\sim} \;:=\; \{\, [a] \;:\; a \in A \,\} (Equivalence relation, equivalence class, and the quotient set A/A/{\sim}).

[L6]

ff is injective (one-to-one) if f(x)=f(y)f(x) = f(y) implies x=yx = y, for all x,yAx, y \in A (Injection, surjection, bijection).

[L7]

ff is surjective (onto) if for every bBb \in B there is some xAx \in A with f(x)=bf(x) = b (Injection, surjection, bijection).

[L8]

We write f:ABf : A \to B, and say ff is a function from AA to BB, when ff is a function with domf=A\operatorname{dom} f = A and ranfB\operatorname{ran} f \subseteq B (A function is a relation ff with (a,b)f(a,b) \in f and (a,c)f(a,c) \in f implying b=cb = c; f:ABf : A \to B, the value f(a)f(a), domain and codomain).

[L9]

bR[A]b \in R[A] holds if and only if (a,b)R(a,b) \in R for some aAa \in A (The image R[A]R[A] and the preimage R1[B]R^{-1}[B] of a set under a relation).

[L12]

f=gf = g if and only if domf=domg\operatorname{dom} f = \operatorname{dom} g and f(x)=g(x)f(x) = g(x) for every xdomfx \in \operatorname{dom} f (Functions ff and gg are equal if and only if domf=domg\operatorname{dom} f = \operatorname{dom} g and f(x)=g(x)f(x) = g(x) for every xx in that common domain).

[L13]

ranR:={b:a (a,b)R}\operatorname{ran} R := \{\, b : \exists a\ (a,b) \in R \,\} (Relation, domR\operatorname{dom} R, ranR\operatorname{ran} R, fldR\operatorname{fld} R, and the specialisations "relation from AA to BB" and "relation on AA").

Proof

technique · direct
1.1

\sim is an equivalence relation on AA and aaa \sim a' says exactly f(a)=f(a)f(a) = f(a'); so the hypothesis of the universal property is satisfied, and clause (i) is the surjectivity already recorded for the quotient map.

L1L2L3
1.2

Claim (iii): ι=Δf[A]\iota = \Delta_{f[A]} is a function with domain f[A]f[A] and ι(y)=y\iota(y) = y; its range is f[A]f[A], which is contained in BB because every element of f[A]f[A] is a value of ff and ranfB\operatorname{ran} f \subseteq B. It is injective, since ι(y)=ι(y)\iota(y) = \iota(y') reads y=yy = y'.

L6L8L9L10L13L14L16
2.1

Claim (ii): the universal property gives a function g:A/Bg : A/{\sim} \to B with gπ=fg \circ \pi = f and g([a])=f(a)g([a]) = f(a) for every aAa \in A. Every value of gg is therefore a value of ff, so rangf[A]\operatorname{ran} g \subseteq f[A], and the same set gg is a function A/f[A]A/{\sim} \to f[A]; call it fˉ\bar f. It is onto f[A]f[A], because each element of f[A]f[A] is f(a)=fˉ([a])f(a) = \bar f([a]) for some aAa \in A; and it is injective, because fˉ([a])=fˉ([a])\bar f([a]) = \bar f([a']) gives f(a)=f(a)f(a) = f(a'), that is aaa \sim a', and therefore [a]=[a][a] = [a']. Hence fˉ\bar f is a bijection.

L3L4L5L6L7L8L9L13L17step 1.1
3.1

Claim (iv): ιfˉπ\iota \circ \bar f \circ \pi is unambiguous by associativity, it is a function with domain AA, and for aAa \in A its value is ι(fˉ(π(a)))=ι(f(a))=f(a)\iota(\bar f(\pi(a))) = \iota(f(a)) = f(a); so it equals ff.

L11L12L15step 1.2step 2.1
3.2

Claim (v): if h:A/f[A]h : A/{\sim} \to f[A] also satisfies ιhπ=f\iota \circ h \circ \pi = f, then for CA/C \in A/{\sim} choose aa with C=[a]C = [a] and compute h(C)=ι(h(π(a)))=f(a)=fˉ(C)h(C) = \iota(h(\pi(a))) = f(a) = \bar f(C); both have domain A/A/{\sim}, so h=fˉh = \bar f.

L5L10L11L12step 1.2step 2.1
4.1

Claims (i) to (v) are established, which is the statement.

step 1.1step 1.2step 2.1step 3.1step 3.2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 35 results over 15 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