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 P-ideal dichotomy
Statement
In ZFC, PFA implies PID: every P-ideal of countable subsets of an arbitrary set satisfies one of the two alternatives in the P-ideal dichotomy.
Facts & Assumptions
Given: PFA and a P-ideal .
PFA supplies a filter meeting at most dense sets in every proper forcing. The Proper Forcing Axiom
The P-ideal property supplies modulo-finite pseudounions, and PID's two conclusions are an uncountable with all countable subsets in or a countable cover by sets orthogonal to . P-ideals, PID, the pseudointersection number, and S-spaces
A model-generic condition forces the model-generic intersection and the ground/ordinal trace properties used below. Master-condition characterizations
AC supplies simultaneous P-ideal bounds, well-ordered elementary models, finite-chain choices, names, and the omega-one recursions. The Axiom of Choice
Proof
Fix a large regular . For every countable , use F2 and A1 to fix with for all , and put for a countable . Define as follows. A condition has finite and a finite membership-chain of countable elementary submodels containing ; distinct points of are separated by some ; and if and , then . Put when , , and for every . These clauses are preserved by extension and make the empty pair a greatest condition.
We verify properness, including the combinatorial compatibility step. Let be suitable, , and add to its side chain; the result is a condition below . Fix once and for all the well-order of carried by the elementary structure. For a condition and a model , define the condition trace and enumerate the finite set in the fixed well-order, writing for the resulting tuple. It suffices by F3 to take and dense , first strengthen into , and then find a member of compatible with this strengthening; rename the strengthened condition . Put and . By elementarity, restrict to the conditions carrying a distinguished such that and ; the witnesses for are and . Let and let be the sigma-ideal generated by . For , let retain the tuples for which, at every coordinate , the fibre of possible th entries above is -positive. The derivative claim in Moore's cited tutorial says that is a nonempty -splitting member of and contains the external tuple . Its finite induction uses the membership chain and clause 4 of the forcing: if first disappeared, the least bad fibre's countable decomposition, coded in the relevant side model, would put one of the corresponding outside points of in a member of from that model, contrary to clause 4. In particular, this claim does not assume that itself belongs to . Starting with the empty tuple, choose successively in an initial segment extendible in . Its next-coordinate set is not in , hence is not orthogonal to ; elementarity gives an infinite with . For every one of the finitely many outer models , membership-chain coherence gives , so . Choose the next coordinate in . After choices, elementarity supplies whose tuple is the chosen one, and hence is contained in every . Then is a common extension. Thus is an -master and is proper.
If is a countable union of members of , PID's second alternative holds. Otherwise choose a suitable countable and . Then is a condition and, by step 2.1, an -master. For a -generic containing , set and . The master condition forces uncountable: if an -name enumerated it countably, F3 would put all of its ground points in , contrary to . Properness gives the ground-model countable-covering property by the same master-name argument, so every countable subset of is contained in some side model . The order clause gives , and therefore . Hence forces every countable subset of to lie in .
Work in the proper cone . Choose names and such that forces injective and for every ; step 3.1 supplies them. For each , the set of conditions deciding both values is dense. By F1 there is a filter meeting all . Compatibility within the filter makes the decided values coherent, producing in the ground universe an injection and with . Put . If is countable, the set of its -indices is bounded by some , so and downward closure gives . Thus witnesses PID's first alternative. Together with the first sentence of step 3.1, this proves PID. AC is used exactly through A1 and the stated ZFC suppliers.
Depends on
Used by
- PFA implies that there are no S-spaces Corollary
Dependency tree · two levels
17 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
- Moore, The Proper Forcing Axiom: a tutorial, notes by Venturi, Sections 3.2, 4, and 5, pp.5-9 (standard reference, not scraped)
- Todorcevic, Forcing with a coherent Souslin tree, Sections 2 and 6-7 (standard reference, not scraped)