Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-07-25
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.

The natural numbers N\mathbb{N} (von Neumann)

Definition

The set of natural numbers is the smallest inductive set (Inductive set),

N=ω:={I:I is inductive},\mathbb{N} = \omega := \bigcap\,\{\, I : I \text{ is inductive} \,\},

which exists and is itself inductive by The natural numbers exist: a smallest inductive set (the Axiom of Infinity, The Axiom of Infinity: there is a set containing a set with no elements and closed under yy{y}y \mapsto y \cup \{y\}, supplies one inductive set to intersect within, and Separation, The Axiom Schema of Separation: for each formula φ\varphi, pˉxyz(zy(zxφ(z,pˉ)))\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar p))), makes the intersection a set). On N\mathbb{N} we take

0:=,σ(n):=n{n},0 := \varnothing, \qquad \sigma(n) := n \cup \{n\},

the distinguished element and the successor function. Thus 0=0 = \varnothing, 1={0}1 = \{0\}, 2={0,1}2 = \{0, 1\}, 3={0,1,2}3 = \{0, 1, 2\}, and in general n={0,1,,n1}n = \{0, 1, \dots, n-1\} is the set of its predecessors.

Remarks

"Smallest" means ωI\omega \subseteq I for every inductive set II. This minimality is exactly the induction principle (The principle of mathematical induction): a subset of N\mathbb{N} that contains 00 and is closed under σ\sigma is itself inductive, hence contains ω=N\omega = \mathbb{N}, hence equals N\mathbb{N}.

With 00 and σ\sigma so defined, (N,0,σ)(\mathbb{N}, 0, \sigma) satisfies the Peano axioms (Peano system, proved in The von Neumann naturals form a Peano system), so it is a model of the abstract natural numbers. By categoricity (Categoricity: the natural numbers are unique up to unique isomorphism) any other model is uniquely isomorphic to it, so the particular set-theoretic encoding chosen here is immaterial to every arithmetic and order property that follows: those are developed from the Peano axioms, not from the sets themselves.

Depends on

Used by

…and 212 more results.

Dependency tree · next 3 levels

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