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.
Large Cardinals, Measures, and Elementary Embeddings: Examples and Counterexamples
1 · Prerequisites
- Cardinal Arithmetic, Cofinality and the Alephs
- Club, Stationary Sets, and Pressing Down
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Deduction, Soundness, Completeness, and Compactness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Formal Set-Theoretic Syntax, Structures, and Satisfaction
- Foundations of the Real Numbers for Analysis
- Large Cardinals, Measures, and Elementary Embeddings
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Set-Theoretic Trees, Delta Systems, and Diamond
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Well-Founded Relations, Rank, and the Cumulative Hierarchy
2 · Summary
The principal ultrapower is calculated by evaluation at its distinguished coordinate. A normal measure instead moves the identity class to kappa, and the successor calculation gives a strict bound inside j(kappa). A supplied free ultrafilter on omega yields explicit truncated-subtraction functions whose classes descend indefinitely; this conditional calculation adds no choice assumption.
The final examples distinguish inaccessible existence from stronger properties and from provability. A club of strong-limit cardinals witnesses that the least inaccessible is not Mahlo. A fixed purported ZFC proof of inaccessible existence can be reflected into the least inaccessible rank segment and converted into a contradiction, giving conditional nonprovability without assuming Con(ZFC).
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A principal ultrapower is the original structure
Example
In ZF, let I contain i_0, let , and let M be a nonempty set structure. The constant-family quotient is well-defined without AC, and
is an isomorphism from its ultrapower to M, sending to a.
Facts & Assumptions
Given: ZF, conditional on the displayed data. Computed equality, every symbol and relation at the principal coordinate, with constant functions proving surjectivity and product nonemptiness without AC.
Set ultraproducts and constant-map ultrapowers: Use the stated quotient and coordinate-symbol formulas; their well-definedness and nonemptiness in this constant principal case are proved here in ZF.
Verification
In the displayed U, a coordinate equality set belongs to U exactly when f(i_0)=g(i_0). This proves directly that the quotient equivalence is equality at i_0 and evaluation is well-defined and injective. Every a in M has the explicitly defined constant function c_a in the product, so evaluation is surjective and sends [c_a] to a. Nonemptiness of M therefore gives a nonempty product and quotient, without any family of choices.
A constant symbol evaluates at i_0 to its original interpretation. For a function symbol F and representatives f_1,...,f_n, evaluation of its interpreted class is exactly . This also shows independence of representatives in that interpreted symbol. A relation holds in the quotient exactly when its coordinate truth set contains i_0, that is, when it holds on the evaluated tuple in M. Thus evaluation preserves functions and preserves and reflects relations, including equality by step 1.1; it is an isomorphism. Zero-arity symbols give the same calculation with the empty tuple. This local verification uses the formulas of F1, not the choice-dependent general Los theorem.
Identity and successor in a normal ultrapower
Example
In ZFC, assume U is a normal measure on kappa and write Scott classes through their transitive collapse. For every alpha<kappa,
Facts & Assumptions
Given: ZFC. Computed constant, identity and successor classes and verified the strict bound from all coordinate successors remaining below kappa.
Measurability, normal measures and elementary embeddings: Normality identifies the collapsed identity class with kappa.
The critical point of a measurable ultrapower: Constant ordinal classes below kappa are fixed.
Los schema for the universe ultrapower: Universe Los transfers each fixed first-order membership formula to the Scott ultrapower and hence through its collapse.
Verification
F2 gives [c_alpha]=j(alpha)=alpha for alpha<kappa; F1 gives [id]=kappa. At every coordinate xi, the ordinal xi+1 is the set xi union {xi}, namely the successor of xi. F3 transfers this fixed defining formula, so the collapsed class of xi maps to xi+1 is the successor of [id], exactly kappa+1.
An infinite cardinal kappa is a limit ordinal: any infinite successor ordinal beta+1 is equinumerous with beta by shifting a countably infinite subset, so cannot be an initial ordinal. Therefore xi+1<kappa for every xi<kappa. The successor representative takes its values in kappa at all coordinates, so its class belongs to j(kappa) by coordinate membership. Step 1.1 identifies this member with kappa+1, proving the strict inequality.
A countably incomplete ultrapower need not be well-founded
Statement refuted
The assertion that every universe ultrapower is well-founded fails, conditional on a free ultrafilter U on omega. In ZF with that supplied U, the Scott classes of
form an infinite descending membership chain of internal naturals in the universe ultrapower. No existence of a free ultrafilter is asserted in ZF.
Facts & Assumptions
Given: ZF with a supplied free ultrafilter. Calculated the exact cofinite truth sets for truncated-subtraction functions and exhibited their nonminimal Scott range without additional choice.
Scott coding and set-likeness of ultrapower membership: Scott membership is exactly U-large coordinate membership, and its representatives are sets in ZF.
Counterexample
A free ultrafilter on omega contains no finite set: if a finite union of singletons belonged to U, the ultrafilter complement decision and finite intersections would force one singleton to belong, making it principal. Hence each cofinite tail belongs to U. Their countable intersection is empty, explicitly witnessing failed countable completeness.
For n>m, and . Since these are finite von Neumann ordinals, this is exactly . F1 therefore gives . Also every g_m(n) belongs to omega, so every displayed class belongs to [c_omega], the internal natural-number set. For n<=m both functions in the comparison are zero, so membership fails there; the truth set is exactly B_m, not just an unspecified large set.
Replacement forms the nonempty set . Each member has its next displayed class as an E-predecessor in this set, so the set has no E-minimal member and the relation is not well-founded. All functions and classes were explicitly defined; no choice of representatives and no additional AC were used.
The least inaccessible is not Mahlo
Example
In ZFC, if an inaccessible cardinal exists, the least inaccessible is not Mahlo and therefore is not weakly compact.
Facts & Assumptions
Given: ZFC conditional on an inaccessible. The club of infinite strong limits below the least one avoids every uncountable regular, explicitly witnessing non-Mahloness.
Weak compactness implies stationary reflection and Mahloness: Weak compactness implies Mahloness.
Size and rank bounds below an inaccessible: An inaccessible has a club of infinite strong-limit cardinals below it.
The Axiom of Choice: Every family of nonempty sets has a choice function.
Verification
Given an inaccessible, minimize the ordinals at or below it satisfying that property; Separation and ordinal well-ordering give a least one kappa. Let C be the club of infinite strong-limit cardinals below kappa from F2. No uncountable regular cardinal belongs to C, because such a member would be uncountable regular strong limit, an inaccessible below kappa. Thus the set of uncountable regular cardinals used in the page's definition of Mahloness misses the actual club C; omega is not in that set. AC is retained through F2's cardinal-size estimates; the least-ordinal selection itself uses only Separation and ordinal well-ordering.
Missing C means that set is nonstationary, so kappa is not Mahlo. If kappa were weakly compact, F1 would make it Mahlo, contradicting step 1.1. Therefore it is not weakly compact. AC is also retained through F1's cardinal estimates and pressing-down argument. The argument is conditional on the initial existence hypothesis and does not prove that hypothesis consistent.
ZFC proves there is an inaccessible cardinal
Statement
False assertion: ZFC proves that a strongly inaccessible cardinal exists.
The refutation is conditional: if ZFC is consistent, there is no such proof. This makes no assertion of Con(ZFC).
Facts & Assumptions
Given: ZFC finite-proof metatheory. For a fixed purported proof, reflected its finite axiom list into the least inaccessible rank segment, checked actual cardinalhood of the internal witness, and built a contradiction without a CTM-from-consistency assumption.
An inaccessible rank segment models ZFC: An inaccessible rank segment satisfies each ZFC axiom, and small-cardinal inaccessibility is absolute.
Soundness for arbitrary set signatures: Finite derivations are sound for a set model of their finitely many axiom instances.
Relativization agrees with induced set satisfaction: Fixed-formula relativization agrees with the actual set structure satisfaction.
Refutation
Fix, externally, a purported finite ZFC derivation p of the sentence E asserting that an inaccessible exists. Only finitely many ZFC axiom instances occur as assumptions in p; call their conjunction A_p. Soundness F2 applied to this fixed finite derivation is a theorem of ZF saying that any nonempty set structure satisfying those instances satisfies E. No assertion about a truth predicate for V is involved.
Work now inside ZFC under E. Choose the least inaccessible kappa by ordinal minimization below one witness. F1 proves each of the finitely many instances in A_p relativized to V_kappa; combining these finite proofs and F3 makes its nonempty membership structure a model of A_p. Step 1.1 gives that V_kappa satisfies E. Thus some alpha in V_kappa is internally an inaccessible ordinal. Transitivity gives an actual ordinal alpha<kappa. Its internal cardinalhood is actual cardinalhood: any external bijection between alpha and a smaller ordinal has a graph of rank at most alpha plus finitely many successors, hence belongs to V_kappa, contradicting internal cardinalhood if it existed. F1's inaccessibility absoluteness now applies to this actual cardinal and makes alpha an actual inaccessible, contradicting leastness of kappa.
The preceding construction is a finite ZFC derivation of E implies contradiction, depending on the fixed finite proof p. Append it to p, which derives E, and infer a contradiction in ZFC. Therefore the existence of such p implies inconsistency of ZFC. Contraposition yields exactly the stated conditional nonprovability. This neither extracts a transitive model from Con(ZFC) nor invokes a uniform universe satisfaction relation.