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.
PFA implies the simple ideal dichotomy
Statement
The Proper Forcing Axiom proves both of Abraham's forms for every ideal of countable subsets generated modulo finite by members:
- either the ground set is a countable union of sets inside , or it has an uncountable subset outside ;
- either the ground set is a countable union of sets outside , or it has an uncountable subset inside .
Consequently PFA implies the simple dichotomy for every such ideal. No P-ideal hypothesis is assumed.
Facts & Assumptions
Given: ZFC plus PFA, an uncountable set , and an ideal on generated modulo finite by .
The simple dichotomy for omega-one-generated ideals gives the ideal, generation, inside, outside, restriction, and simple-dichotomy conventions.
The Proper Forcing Axiom supplies a filter meeting any at-most family of dense subsets of a nonempty proper forcing.
Properness may be proved by adding an -master below every ; masterhood means that is predense below it for every dense (Master conditions and proper posets, Master-condition characterizations).
Suitable countable elementary submodels exist (Countable elementary submodels and their collapses).
Every ccc forcing is proper (Ccc and countably closed forcings are proper).
Under AC, every uncountable family of finite sets has an uncountable -system (Under choice, the uncountable -system lemma for finite sets), a countable union of countable sets is countable (Countable unions of at most countable sets, assuming ), and by infinite-cardinal absorption (Absorption: for cardinals with infinite and , , and when ).
The Axiom of Choice supplies all model, enumeration, thinning, and witness selections below and is part of the ambient ZFC of PFA.
Proof
Put and . Generation modulo finite makes outside . AC chooses an enumeration of each countable , so injects into and [F6] gives . If is uncountable, it already supplies the outside branch of Form 1. Otherwise , and uncountability gives ; transport , and the generators along a bijection with . Thus, for the nontrivial Form-1 case, we may work on .
Assume that is not a countable union of sets inside . Define as follows. A condition has finite and a finite membership chain of countable elementary submodels of a fixed well-ordered expansion of containing and the generator map. Require that whenever are in , some satisfies and , equivalently ; this is the meaning of “the models separate distinct points of .” If lies above for , then belongs to no that is inside . A stronger enlarges all three finite coordinates and, for each , freezes .
For every , conditions putting a point above into are dense. Given , append a countable model containing and , so and . The union of the countably many inside sets belonging to cannot cover by the assumption in step 2.1. A point outside that union is outside because every singleton from is an inside set in ; append that point to . For every , the set of conditions with is dense by simply enlarging .
To prove properness, take a large countable containing and a condition . Append to the side chain. Because every finite coordinate of lies in , this is a condition . Fix and dense , and first strengthen into . The model cuts the increasing enumeration after some ; the lower part belongs to .
Let be the set of -tuples end-extending the -coordinate of that occur as the -coordinate of some condition in extending that lower part. It contains . We use the following fibre observation at each side model: if is countable, avoids every inside set in , , and contains , then is not inside ; otherwise the condition's avoidance clause would exclude . Starting at and moving down to , apply this observation to the definable successive fibres of . The intervening side model contains and all earlier coordinates but lies below the current coordinate. We obtain in nested non-inside candidate sets such that every successive choice from them completes to a tuple in .
Put . At a candidate stage, is not inside, so elementarity gives a countable with and . Since , choose ; countability of gives . Recursing through the nested fibres gives a tuple in and hence extending , with every new -point outside . The union of and is a condition: their model chains merge through ; upper points of avoid every inside generator named by ; and the replacement points of avoid every generator named by . These last two facts verify both directions of the freezing requirement. Thus is compatible with .
Step 5.1 says that is an -master, so [F3] makes proper. Apply PFA to the dense sets in step 3.1. For the resulting filter , let . It is unbounded, hence uncountable. For each generator , a condition in puts into its finite -coordinate, after which directedness and freezing show that is exactly that condition's finite intersection. By [F1], is outside . Together with the alternative excluded in step 2.1 and the reduction in step 1.1, this proves Form 1.
Now suppose there is no uncountable set inside . For every uncountable , apply Form 1 to . Its countable-union branch would make some inside piece uncountable by [F6], contrary to the supposition. Hence every uncountable contains an uncountable subset outside .
Retain and from step 1.1. The set is outside. If is countable, partition it into singletons, which are outside, and add as one more piece; this proves the countable outside decomposition. Assume henceforth that is uncountable. Then by [F6].
On define to consist of pairs with finite and finite. Put when extends both coordinates and, for every and every , Thus a recorded generator freezes every colour already present, while a new colour may be introduced once.
The forcing is ccc. Given uncountably many conditions, apply [F6] to their function domains and -coordinates, thin to fixed finite sizes and common roots, and make all functions agree on the domain root. Enumerate the disjoint domain petals in a fixed order. Repeatedly use step 7.1 so that, for each petal coordinate, its uncountable set of values is outside . Their finite union is outside. For each remaining condition , the set is finite. Thin the finite to a -system. Its root meets at most one disjoint domain petal, while its disjoint petals and the domain petals each meet only finitely many petals of the other family. Hence choose distinct with each condition's domain petal disjoint from the other's -set. The coordinatewise unions of their functions and side sets then satisfy both freezing clauses and form a common extension.
The following sets are dense in : conditions deciding a specified , conditions placing a specified into , and conditions whose function range contains a specified . For the first or third demand, if necessary assign a new point a colour not yet in the finite range (the specified itself when it is absent); this cannot violate a freeze, which only mentions old colours.
By steps 10.1 and [F5], is proper. PFA applied to the at-most- dense sets of step 10.2 gives a filter whose union is a total . Fix and . Directedness combines a condition recording with one already using colour ; below their common extension that intersection is frozen. Consequently is finite. Each colour class is outside by [F1], so these classes, together with , form a countable outside decomposition of . This proves Form 2 under the no-inside hypothesis; its other branch is precisely an uncountable inside set.
Finally, Form 1 alone yields the simple dichotomy: its outside branch is already a witness, while in its countable-union branch [F6] makes at least one inside piece uncountable. Form 2 gives the symmetric conclusion as well. Empty finite coordinates, empty roots, a generator-free , and new colours were handled in steps 1.1, 8.1, 9.1, and 10.2. All model, thinning, enumeration, and witness choices are the AC uses recorded by [F7].
Depends on
- The simple dichotomy for omega-one-generated ideals
- The Proper Forcing Axiom
- Master conditions and proper posets
- Master-condition characterizations
- Ccc and countably closed forcings are proper
- Countable elementary submodels and their collapses
- Under choice, the uncountable $\Delta$-system lemma for finite sets
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- The Axiom of Choice
Used by
Dependency tree · two levels
38 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
- Abraham, Lecture notes on the P-ideal dichotomy, First Form through Theorem 1.4, rendered lines 44–207 (standard reference, not scraped)
- Abraham, Three applications of ideal dichotomy, slides 1–4 (standard reference, not scraped)