Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-06 (claude-opus-5) rests on unproved material
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 1 statement not proved in this library. Every dependency marked below is recorded with a citation but 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.

FALSE: assuming ZF is consistent, ZF proves that every surjection f:ABf : A \to B has a right inverse g:BAg : B \to A with fg=ΔBf \circ g = \Delta_B

Statement

False statement. Assume ZF is consistent. Then ZF proves that every surjection f:ABf : A \to B has a right inverse, that is, a function g:BAg : B \to A with fg=ΔBf \circ g = \Delta_B.

The consistency assumption is not decoration: an inconsistent ZF proves everything, so without it the claim would be unrefutable.

Facts & Assumptions

Given: ZF is consistent, and the claim above.

[A1]

If ZF is consistent, then ZF does not prove the Axiom of Choice (Cohen 1963, Cohen 1963: ZF does not prove the Axiom of Choice ). This is an external result, established by forcing and quoted rather than proved here.

[L1]

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).

[L2]

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]

An indexed family with index set II is a function AA with domA=I\operatorname{dom} A = I (An indexed family (Ai)iI(A_i)_{i \in I} is a function with domain II; {Ai:iI}\{A_i : i \in I\} is its range).

[L11]

domR:={a:b (a,b)R},ranR:={b:a (a,b)R}\operatorname{dom} R := \{\, a : \exists b\ (a,b) \in R \,\}, \qquad \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").

[L12]

(a,b)=(c,d)(a,b) = (c,d) if and only if a=ca = c and b=db = d ((a,b)=(c,d)(a,b) = (c,d) if and only if a=ca = c and b=db = d).

[L14]

An equivalent formulation of the Axiom of Choice is that a product of nonempty sets is nonempty: if XiX_i \ne \varnothing for every iIi \in I, then iIXi\prod_{i \in I} X_i \ne \varnothing (The Axiom of Choice).

Refutation

technique · contradiction
1.1

Suppose ZF proves that every surjection has a right inverse.

assume-contra
1.2

Let (Xi)iI(X_i)_{i \in I} be any indexed family with XiX_i \neq \varnothing for every iIi \in I. Separating inside I×iIXiI \times \bigcup_{i \in I} X_i gives the set E:={(i,x):iIxXi}E := \{\,(i,x) : i \in I \wedge x \in X_i\,\}, and separating inside E×IE \times I gives f:={(z,i)E×I:x(z=(i,x))}f := \{\,(z,i) \in E \times I : \exists x\,(z = (i,x))\,\}, which is a function EIE \to I sending (i,x)(i,x) to ii.

L2L8L9L10L11L12L13
2.1

ff is surjective: for iIi \in I the set XiX_i has an element xx, so (i,x)E(i,x) \in E and f((i,x))=if((i,x)) = i.

L1step 1.2
3.1

By the supposition ff has a right inverse g:IEg : I \to E with fg=ΔIf \circ g = \Delta_I. For iIi \in I we get f(g(i))=if(g(i)) = i, so g(i)=(i,x)g(i) = (i,x) for some xXix \in X_i; hence rang\operatorname{ran} g is a set of pairs, one for each iIi \in I, which is a function with domain II whose value at ii lies in XiX_i. That function is an element of iIXi\prod_{i \in I} X_i, so that product is nonempty.

L3L5L6L7L11L12step 1.1step 1.2step 2.1
4.1

So ZF would prove that a product of nonempty sets is nonempty, over an arbitrary index set, which is the product formulation of the Axiom of Choice (The Axiom of Choice); note that the hypothesis XiX_i \neq \varnothing is exactly what rules out the collapse of the product recorded in the cited computation of small products. Under the assumption that ZF is consistent, ZF does not prove the Axiom of Choice, so the supposition is untenable and the claim is false.

A1L4L14step 3.1discharge-contradiction

Remarks

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: 42 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