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 pseudointersection number exceeds omega-one
Statement
In ZFC plus PFA, : every family of at most infinite subsets of with the strong finite intersection property has an infinite pseudointersection.
Facts & Assumptions
Given: PFA and a family of cardinality at most with the strong finite intersection property.
The definitions of strong finite intersection, pseudointersection, and use modulo-finite containment and require the witness to be infinite. P-ideals, PID, the pseudointersection number, and S-spaces
PFA implies . PFA implies MA(aleph-one) and the Suslin Hypothesis
applies to ccc partial orders and at most dense sets with the stronger-is-smaller filter convention. Martin's Axiom at a cardinal and Martin's Axiom
AC supplies an omega-one indexing when needed and is the ambient choice principle in the stated ZFC result. The Axiom of Choice
Proof
Let consist of pairs with and . Put exactly when , , and , taking . For a fixed finite stem , every finite collection of conditions with that stem has the common extension whose side set is the union of their side sets. Since there are countably many finite subsets of , is sigma-centered and therefore ccc.
For each , the set is dense, because adding to changes no stem. For each , let . Given outside , the strong finite intersection property makes infinite, so choose with and extend the stem by ; hence is dense. The family of all and has cardinality at most .
By F2 and F3, choose a filter meeting every set from step 2.1, and put . Meeting all makes unbounded in , hence infinite. Fix and choose . For any , directedness gives below both; the order relative to gives , and . Thus , and after taking the union, is finite. Therefore for every , so is an infinite pseudointersection.
Since every at-most- strong-finite-intersection family has such a pseudointersection, no family witnessing the definition of has cardinality at most . By F1, . Empty and finite are included: the same forcing works, and for the constructed is simply infinite.
Depends on
Used by
- PFA implies that there are no S-spaces Corollary
Dependency tree · two levels
19 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
- Todorcevic, Forcing with a coherent Souslin tree, Section 2 and discussion preceding Section 7 (standard reference, not scraped)