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 (von Neumann)
Definition
The set of natural numbers is the smallest inductive set (Inductive set),
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 , supplies one inductive set to intersect within, and Separation, The Axiom Schema of Separation: for each formula , , makes the intersection a set). On we take
the distinguished element and the successor function. Thus , , , , and in general is the set of its predecessors.
Remarks
"Smallest" means for every inductive set . This minimality is exactly the induction principle (The principle of mathematical induction): a subset of that contains and is closed under is itself inductive, hence contains , hence equals .
With and so defined, 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
- Inductive set
- The natural numbers exist: a smallest inductive set
- Peano system
- The Axiom of Infinity: there is a set containing a set with no elements and closed under $y \mapsto y \cup \{y\}$
- 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)))$
Used by
- A rational root of xᵏ = m is an integer: if k ≥ 1, m ∈ ℤ, x ∈ ℚ and xᵏ is the image of m, then x is the image of an integer Corollary
- Addition is a well-defined total operation Corollary
- Every linear subspace U of a vector space V has a complement: a linear subspace W with V = U ⊕ W Corollary
- Every nondegenerate interval of ℝ is uncountable Corollary
- Every nonzero integer n is u ∏_i<r pᵢ with u ∈ {1,-1} and every pᵢ prime; u and r are determined by n, and the list is determined up to a permutation Corollary
- For an integer p > 1: p is prime if and only if, for all integers a and b, p ∣ ab implies p ∣ a or p ∣ b Corollary
- If a prime p divides a finite product ∏_i<n aᵢ of integers then p ∣ aᵢ for some i < n; at n = 0 the product is 1 and the hypothesis cannot hold Corollary
- If V = bigoplus_i<n Uᵢ with every Uᵢ finite-dimensional, then V is finite-dimensional and dim_F V = ∑_i<n dim_F Uᵢ; in particular dim_F(U ⊕ W) = dim_F U + dim_F W Corollary
- If V has a spanning set with n elements, then every linearly independent subset of V is finite with at most n elements; in particular V has no linearly independent subset equinumerous with ℕ Corollary
- lvertP(A)| = 2^| A| for finite A Corollary
- Multiplication is a well-defined total operation Corollary
- ℝ((t⁻¹)) has the nested interval property for lengths tending to 0 Corollary
- The extended Euclidean algorithm: the same descent produces integers x, y with ax + by = gcd(a,b), so Bézout coefficients are computed and not merely shown to exist Corollary
- {(1,0), (0,1), (1,1)} spans F² and is linearly dependent, so a spanning set need not be a basis; each of its three two-element subsets is a basis Counterexample
- A commutative monoid in which cancellation holds need not be a group: (ℕ, +) Counterexample
- A count that overcounts because the blocks are not disjoint, and exactly where the sum rule's hypothesis is spent Counterexample
- A poset with a bottom, a top and countably many incomparable middle elements has an infinite interval, so convolution of constant-one functions is not defined Counterexample
- Collapsing the set of naturals inside ℝ to a point gives a quotient of ℝ that is not locally compact at the collapsed point Counterexample
- If 1 were admitted as a prime, uniqueness would fail: 6 = 2 · 3 = 1 · 2 · 3 = 1 · 1 · 2 · 3, lists of different lengths that no permutation matches Counterexample
- In the bounded real-valued functions on ℕ with the supremum metric, the closed unit ball is closed and bounded and is not compact: the indicator functions of the singletons are pairwise at distance 1 Counterexample
- In the indiscrete topology every sequence converges to every point, and in the cofinite topology on an infinite set an injective sequence converges to every point Counterexample
- In the multiplicative monoid H = {1, 4, 7, 10, …} of positive integers one more than a multiple of 3, the element 100 has two genuinely different factorisations into irreducibles, 4 · 25 and 10 · 10 Counterexample
- Inside the space of eventually zero families, the linear subspace spanned by { eᵢ : i ≥ 1 } is proper and has a basis equinumerous with a basis of the whole space, so "equal dimension forces equality" fails without finite dimension Counterexample
- ℕ × {a,b} with the indiscrete topology on the second factor is limit point compact and not countably compact, so the hypothesis that singletons are closed is not decoration Counterexample
- ℕ with the discrete metric is bounded and is not totally bounded Counterexample
- On (0,∞) the metrics |x-y| and |1/x - 1/y| have the same topology and are not uniformly equivalent Counterexample
- On ℕ with d(m,n) = 1 + 1/(m+n) for m ≠ n the sets {n, n+1, …} are nested, closed, bounded and complete with empty intersection Counterexample
- On the positive integers the metrics |m-n| and |1/m - 1/n| both induce the discrete topology, and only the first is complete Counterexample
- Refuted: every limit ordinal has an at most countable cofinal subset — ω₁ has none, assuming countable choice Counterexample
- The first quadrant of ℝ² contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by -1 Counterexample
- The induction axiom is independent of the other Peano axioms Counterexample
- The one-point compactification of discrete ℕ is not βℕ Counterexample
- The Samuel compactification map need not be a uniform embedding for the original uniformity Counterexample
- The standard unit families { eᵢ : i ∈ ℕ } are linearly independent in F^ℕ but do not span it: the constant family 1_F is not a finite linear combination of them Counterexample
- The union of the two coordinate axes of F² is closed under scalar multiplication and is not closed under addition, so neither closure condition implies the other Counterexample
- Three distinct lines U₀, U₁, U₂ in F² have dim_F(U₀+U₁+U₂) = 2 while the inclusion-exclusion analogue of the dimension formula predicts 3, so the two-subspace formula does not extend Counterexample
- Three lines in F² that meet pairwise only in 0 and whose sum is F² with decompositions that are not unique, so pairwise trivial intersection does not give a direct sum Counterexample
- Two sets of the same finite cardinality between which the bijection is not unique Counterexample
- ℤ and {n + 1/n : n ≥ 2} are disjoint closed subsets of ℝ at distance 0, so the set-to-set distance is not a metric Counterexample
- ψ(1/x) has no limit at 0: two sequences tending to 0 give values constantly 0 and constantly 1/2 Counterexample
…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
- Set-theoretic definition of natural numbers (Wikipedia) (standard reference, not scraped)
- Axiom of infinity (Wikipedia) (standard reference, not scraped)
- Peano axioms (Wikipedia) (standard reference, not scraped)
- B. Kaya, MATH 320 Set Theory (METU lecture notes) (standard reference, not scraped)