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.
Relative consistency of BPI with failure of Stone's theorem
Statement
If is consistent, then with a metrizable nonmetacompact space is consistent; a fortiori does not prove that every metrizable space is paracompact (The Boolean prime ideal principle, Metacompactness: every open cover has a point-finite open refinement, Paracompactness: every open cover has a locally finite open refinement, with no separation axiom built into the word).
Facts & Assumptions
Given: Corson's permutation model, its rational metric space, and the assumed consistency of .
The finite point stabilisers of the model are extremely amenable, so the model satisfies BPI (Aut(U_Q^<) is extremely amenable, Extreme amenability yields BPI in finite-support permutation models, Corson's ordered-rational permutation model).
The model contains the rational metric space with an open cover having no point-finite open refinement (Corson's rational metric space is not metacompact), and that failure is certified as an atom-blind boundable sentence with the bound (Corson's Stone obstruction is ordinal boundable).
Pincus transfer with the exceptional clauses transfers BPI together with the certified sentence (Pincus transfer for BPI and injectively boundable conjunctions). Corson's Proposition 6 states this exact transfer for the conjunction of BPI and the ordinal-boundable Stone obstruction. [source]
The verified constructible-universe reduction gives (Formal consistency of ZFC plus GCH relative to ZF), and countable first-order completeness supplies a model of the latter theory without a transitivity or well-foundedness conclusion (Completeness for explicitly countable set languages).
Proof
Assume . By [F4] obtain a possibly externally ill-founded model of . All following constructions are interpreted internally in .
In choose its countable rational ordered Urysohn metric structure and let , carrying the transported order and metric. Represent sets by tagged objects and form the class hierarchy , , with unions at limits and membership in a tag given by membership in its second coordinate. Internally this satisfies ZFA+AC: tagged set operations give the elementary axioms and Power Set; translated Separation and Replacement follow in , with Collection bounding construction ranks; minimal construction rank gives Foundation; and 's well-orders give tagged choice functions. No external well-foundedness of is used.
Form Corson's ordered-rational finite-support permutation model inside this ZFA+AC interpretation. The group, topology, finite stabilisers and their extreme amenability are all computed internally. Hence [F1], using the arbitrary-ground form of the fixed-point theorem, gives BPI in the hereditarily symmetric interpretation. By [F2] that interpretation also contains the certified rational metric space and its open cover with no point-finite open refinement.
By [F3], the conjunction of BPI with the certified sentence transfers from this permutation model to an atom-free model of . Consequently This is Corson's external relative-consistency construction. Completeness did not supply a transitive model; the internal tagged interpretation and the arbitrary-ground BPI theorem provide the required bridge. No application of the formal proof-reduction interface, and hence no unprovided uniform code map, is asserted.
A space that is not metacompact has an open cover with no point-finite open refinement. Every locally finite open refinement is point-finite, so that cover has no locally finite open refinement either. The space is therefore not paracompact, and Stone's theorem fails in the transferred model.
Depends on
- Completeness for explicitly countable set languages
- Corson's ordered-rational permutation model
- Corson's rational metric space is not metacompact
- Aut(U_Q^<) is extremely amenable
- Extreme amenability yields BPI in finite-support permutation models
- Corson's Stone obstruction is ordinal boundable
- Pincus transfer for BPI and injectively boundable conjunctions
- The Boolean prime ideal principle
- Formal consistency of ZFC plus GCH relative to ZF
- Paracompactness: every open cover has a locally finite open refinement, with no separation axiom built into the word
- Metacompactness: every open cover has a point-finite open refinement
Used by
Dependency tree · two levels
49 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)