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.
A countable nonstandard model has an element above all numerals
Statement
In ZF there is an at most countable nonempty model of in the fixed language and an element such that for every standard . The reduct is not isomorphic to the standard structure .
Facts & Assumptions
Given: The standard natural-number structure and its externally defined sentence theory.
The language, complete semantic theory and numerals , are those of Nonstandard models of the complete natural-number theory.
A finitely satisfiable explicitly countable theory has an at most countable model. (Compactness for explicitly countable languages)
Proof
Add one fresh constant and put . For a finite subset, let be the largest index in its inequalities if any occur, and interpret by in . Then each required inequality is , true since ; every included sentence of the complete theory is true by definition. If no inequality occurs, interpret by . Thus every finite subset has a model in the countable expanded signature.
F2 gives an at most countable . Let be its original-language reduct and . Reducts keep all interpretations of the old symbols, so and for every .
If were an isomorphism, preservation of gives , and preservation of inductively gives . Surjectivity would give for some . But step 2.1 would then say , contradicting , a sentence true in and therefore in its theory. Hence no isomorphism exists.
Depends on
Used by
Dependency tree · two levels
15 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
- Moschovakis, Theorem 1J.5 pp45–46; Weiss–D’Mello, Theorem 3 p15, greater-than-numerals variant. (standard reference, not scraped)