On BPI in Symmetric Extensions Part 1
Brian Ransom

TL;DR
This paper introduces a new framework for proving the Boolean Prime Ideal theorem (BPI) in models without choice, using filter extension properties and dynamical techniques, including a novel virtual Ramsey property.
Contribution
It provides the first direct proof of BPI in generalized Cohen models and introduces the virtual Ramsey property as a new criterion for BPI in symmetric extensions.
Findings
First direct proof of BPI in Cohen models with added Dedekind-finite sets.
Extension of Harrington's proof to large index sets in permutation models.
Introduction of the virtual Ramsey property as a sufficient condition for BPI.
Abstract
Historically, proofs of in models without choice have relied on a contradiction framework that was introduced by Halpern. We introduce the filter extension property for permutation models and symmetric extensions, which formalizes the na\"ive approach to extend arbitrary filters to ultrafilters by repeatedly extending filters by minimal increments. We use this framework to give the first direct proof of in the generalized Cohen model -- a model that adds a Dedekind-finite set of mutually -generic filters over a ground model . In the case that the index set is large, we adapt Harrington's proof of the Halpern-L\"auchli theorem to prove the result. We then extend the results from Karagila and Schlicht to show that can be assumed to be large without loss of generality. The approach given by Harrington's proof is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Graph Theory Research · Complexity and Algorithms in Graphs
