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.
Blass's finite-modification classes and parameter-HOD model
Definition
Work in the metatheory with a countable transitive . Thus satisfies Choice by the canonical constructible well-order, and this is the only ambient source of Choice in the setup. Force over with
the finite partial functions ordered by reverse inclusion. If is -generic, define the mutually Cohen-generic reals
For any real , its finite-modification class is
where is the symmetric difference of The difference , the symmetric difference , and the complement relative to a set . Put
and
Blass's class consists of all such that every member of is uniquely definable in from , finitely many members of , and finitely many ordinal parameters. This is the convention denoted , or “HOD over ,” in the source. It is important that acts as a reservoir of finitely many parameters, not as one pointwise named parameter: is definable from the single permitted parameter , while individual definitions may also use only finitely many reals from its displayed union.
The range
is therefore a canonically enumerated family of pairs in . The later term Blass model refers to this parameter-HOD class . The ordinary HOD coding convention is that of Ordinal definability and HOD; the usual HOD inner-model proof from HOD as an inner model and comparison with L must be relativized to this finite-parameter reservoir before any ZF conclusion about is used.
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
- Eleftherios Tachtsis, On the Existence of Free Ultrafilters on omega and on Russell-sets in ZF, Theorem 4 construction, printed pp. 5–7 (standard reference, not scraped)
- A. Blass, A model without ultrafilters, Bull. Acad. Polon. Sci. 25 (1977), 329–331; bibliographic record (standard reference, not scraped)