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.
FALSE: assuming ZF is consistent, ZF proves that every surjection has a right inverse with
Statement
False statement. Assume ZF is consistent. Then ZF proves that every surjection has a right inverse, that is, a function with .
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.
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.
is surjective (onto) if for every there is some with (Injection, surjection, bijection).
We write , and say is a function from to , when is a function with and (A function is a relation with and implying ; , the value , domain and codomain).
an element of is a function with domain that takes its value at each index inside the member carried by that index (The product ).
if for some then (; if for some then ; and for the evaluation is a bijection ).
is a function, , and for every in that domain (If and are functions then is a function with domain and there; is a function with ; and for ).
is a function with and for every (If and are functions then is a function with domain and there; is a function with ; and for ).
holds if and only if and (The identity relation and the membership relation ).
holds if and only if for some and some (The Cartesian product ).
An indexed family with index set is a function with (An indexed family is a function with domain ; is its range).
For any parameters and any set , there is a set whose elements are exactly the elements of for which holds (The Axiom Schema of Separation: for each formula , ).
if and only if and ( if and only if and ).
holds if and only if for some (, and for ).
An equivalent formulation of the Axiom of Choice is that a product of nonempty sets is nonempty: if for every , then (The Axiom of Choice).
Refutation
Suppose ZF proves that every surjection has a right inverse.
Let be any indexed family with for every . Separating inside gives the set , and separating inside gives , which is a function sending to .
is surjective: for the set has an element , so and .
By the supposition has a right inverse with . For we get , so for some ; hence is a set of pairs, one for each , which is a function with domain whose value at lies in . That function is an element of , so that product is nonempty.
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 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.
Remarks
-
What is true, and where the line falls. A two-sided inverse is available without any choice principle, because it is determined rather than selected: that is is a bijection if and only if there is a function with and ; such a is unique, equals the inverse relation , and is itself a bijection. So is a left inverse for an injection with nonempty domain, For with : is injective if and only if there is with ; for the empty function is injective and has a left inverse if and only if . Only the right inverse of a surjection requires choosing one preimage at each point at once.
-
The external ingredient. The refutation quotes one result it does not prove, the unprovability of Choice in ZF, and everything else in it is proved on this page's own material.
Depends on
- Cohen 1963: ZF does not prove the Axiom of Choice
- The Axiom of Choice
- Injection, surjection, bijection
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
- The product $\prod_{i \in I} A_i := \{\, f : I \to \bigcup_{i \in I} A_i \ \mid\ f(i) \in A_i \text{ for every } i \in I \,\}$
- $\prod_{i \in \varnothing} A_i = \{\varnothing\}$; if $A_j = \varnothing$ for some $j \in I$ then $\prod_{i \in I} A_i = \varnothing$; and for $I = \{j\}$ the evaluation $f \mapsto f(j)$ is a bijection $\prod_{i \in I} A_i \to A_j$
- If $f$ and $g$ are functions then $g \circ f$ is a function with domain $f^{-1}[\operatorname{dom} g]$ and $(g \circ f)(x) = g(f(x))$ there; $\Delta_A$ is a function with $\Delta_A(a) = a$; and $f \circ \Delta_A = f = \Delta_B \circ f$ for $f : A \to B$
- The identity relation $\Delta_A = \{\,(a,b) \in A \times A : a = b\,\}$ and the membership relation $\in_A\, = \{\,(a,b) \in A \times A : a \in b\,\}$
- The Cartesian product $A \times B := \{\, z \in \mathcal{P}(\mathcal{P}(A \cup B)) : \exists a \in A\ \exists b \in B\ z = (a,b) \,\}$
- An indexed family $(A_i)_{i \in I}$ is a function with domain $I$; $\{A_i : i \in I\}$ is its range
- The Axiom Schema of Separation: for each formula $\varphi$, $\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar p)))$
- Relation, $\operatorname{dom} R$, $\operatorname{ran} R$, $\operatorname{fld} R$, and the specialisations "relation from $A$ to $B$" and "relation on $A$"
- $\bigcup_{i \in I} A_i := \bigcup \{A_i : i \in I\}$, and $\bigcap_{i \in I} A_i := \bigcap \{A_i : i \in I\}$ for $I \neq \varnothing$
- $(a,b) = (c,d)$ if and only if $a = c$ and $b = d$
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
- Axiom of choice (Wikipedia) (standard reference, not scraped)
- P. J. Cohen, The independence of the continuum hypothesis (PNAS 1963) (standard reference, not scraped)
- B. Kaya, MATH 320 Set Theory (METU), §5 (standard reference, not scraped)