Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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: consistent first-order ZF has a unique model up to isomorphism

Statement

False conditional claim: If the coded first-order theory TZF is syntactically consistent, it has a unique set model up to isomorphism.

The refutation is conditional in ZFC: assuming that consistency antecedent, there are nonisomorphic models of cardinalities ℵ0 and ℵ1. No assertion of Con⁡(ZF) is made.

Facts & Assumptions

Given: ZFC and the explicit antecedent that TZF is syntactically consistent.

[F1]

TZF is a set of sentences in the explicitly countable membership signature. (The set of first-order ZF axiom sentences)

[F2]

Every nonempty set model of this coded theory has infinite external carrier, without assuming transitivity or external well-foundedness. (Every set model of first-order ZF has infinitely many elements)

[F3]

A consistent theory in an explicitly countable signature has an at most countable nonempty model. (Completeness for explicitly countable set languages)

[F4]

In ZFC an infinite structure has an elementary extension of any cardinal at least its size and language size. (Upward Löwenheim–Skolem, including elementary extensions)

[A1]

AC is assumed for the upward cardinal-size result. (The Axiom of Choice)

Refutation

1.1F1F2F3

Under the stated consistency antecedent, F1 and F3 supply M⊨TZF with carrier injecting into ω. F2 makes this carrier infinite. An infinite subset of ω can be enumerated in increasing order: after finitely many entries it has a least unused member, and each member is eventually reached since only finitely many natural numbers precede it. Composing this enumeration with the injection's inverse on its range gives a bijection ω→M. Thus ∣M∣=ℵ0.

2.1F4A1step 1.1∎

Under A1 apply F4 with κ=ℵ1: M is infinite, its size is ℵ0≤ℵ1, and the membership signature is finite. It gives N⪰M of size ℵ1, which satisfies every sentence of TZF by elementarity. An isomorphism M→N would be a bijection, contradicting ℵ0≠ℵ1. These are the promised two witnesses under the antecedent. Neither the use of F2 nor the extension argument identifies either internal membership relation with external membership or asserts well-foundedness.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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