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.
Corson's Stone obstruction is ordinal boundable
Statement
The sentence asserting that there is a rational-valued metric space with an open cover having no point-finite open refining cover is an atom-blind boundable sentence in the sense of Boundable sentences over an atom set, with the explicit absolute bound of the source's Lemma 5.
Facts & Assumptions
Given: Corson's model and the covering failure certified in Corson's rational metric space is not metacompact.
A formula is boundable when a fixed absolutely defined ordinal makes ZFA prove ; its existential closure is then a boundable sentence (Boundable sentences over an atom set).
The metric space is the ordered rational Urysohn space of Corson's ordered-rational permutation model, its metric is rational-valued, and its open cover has no point-finite refinement (Corson's rational metric space is not metacompact, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Metacompactness: every open cover has a point-finite open refinement).
With the standard set encodings, , and successively constructing , , , , and puts in . [source, Corson Lemma 5]
With Kuratowski ordered pairs, each for lies in , so the set of all those pairs lies in , not necessarily in . The larger stated bounds remain valid: the pure rational codebook from [L1] dominates this one-level correction, so a function lies in ; a family of subsets of lies in ; an ordered triple lies in ; and a function from a natural number into an open cover of lies in . [L1, source, Corson Lemma 5]
Proof
Let say that is a rational-valued metric on and is an open cover in its metric topology. Let say that both and satisfy and that refines . Let say that is an injection from into . These are formulas built only from equality, membership, the carried sets, and the fixed pure rational codebook.
Define to be together with the assertion that for every , if , then some has the following property: for every there is such that and for every . Thus says exactly that has no point-finite open refining cover.
The bounds [L1]-[L2] contain every object quantified in step 2.1: candidate covers and refinements lie in the second relative level over , while every finite injection witnessing arbitrarily many members through lies below level . Expanding the displayed definitions therefore gives the ZFA theorem .
The formula is atom-blind: its base sort is used only opaquely through the carried metric, subsets, covers, and finite function graphs; its atomic tests are equality and membership together with the fixed pure rational parameter, and it never tests whether an element of is an atom or inspects its internal membership structure.
By [F1] and step 3.1, the existential closure is boundable with the fixed absolute bound ; step 3.2 supplies the atom-blind typed certificate, and [F2] supplies a witness in Corson's model.
Depends on
- Corson's ordered-rational permutation model
- Corson's rational metric space is not metacompact
- Boundable sentences over an atom set
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Metacompactness: every open cover has a point-finite open refinement
Used by
Dependency tree · two levels
23 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
- Samuel Corson, The Independence of Stone's Theorem from the Boolean Prime Ideal Theorem (standard reference, not scraped)