Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-02 (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.

The induction axiom is independent of the other Peano axioms

Statement refuted

Refuted claim: any triple (N,0,σ) satisfying (P1) 0 is not a successor and (P2) σ is injective automatically satisfies (P3) induction. The witness is N=N⊔Z (a disjoint union of a copy of the naturals and a copy of the integers), with base point 0 the zero of the N-copy and σ the usual successor n↦n+1 on each copy separately.

Facts & Assumptions

Given: N=N⊔Z with σ acting as successor within each copy; 0= the N-copy's zero. Write NN,NZ for the two copies.

[L1]

The Peano axioms P1, P2, P3 (Peano system).

[L2]

N itself is the standard model (The natural numbers N (von Neumann)).

Counterexample

technique · direct
1.1

P1 holds: σ is the successor within each copy; 0 is the N-copy zero, which is not the successor of any element (nothing in NN maps to it, and σ maps NZ into NZ), so σ(x)≠0 for all x.

givenL1
1.2

P2 holds: σ is injective on NN and on NZ separately, and σ maps each copy into itself, so σ is injective on N.

givenL1
1.3

P3 fails: let S=NN, the N-copy; then 0∈S and σ maps S into S (σ(NN)⊆NN), so S contains 0 and is closed under σ; the N-copy is the standard model [L2].

givenL1L2
2.1

But S=NN≠N, since the Z-copy NZ is disjoint from S and nonempty.

step 1.3
3.1

Thus (N,0,σ) satisfies P1 and P2 but not P3, refuting the claim: induction is independent of P1 and P2 and cannot be dropped.

step 1.1step 1.2step 1.3step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources