Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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, p>ω1: every family of at most ω1 infinite subsets of ω with the strong finite intersection property has an infinite pseudointersection.

Facts & Assumptions

Given: PFA and a family A[ω]ω of cardinality at most ω1 with the strong finite intersection property.

[F1]

The definitions of strong finite intersection, pseudointersection, and p use modulo-finite containment and require the witness to be infinite. P-ideals, PID, the pseudointersection number, and S-spaces

[F2]
[F3]

MA(1) applies to ccc partial orders and at most ω1 dense sets with the stronger-is-smaller filter convention. Martin's Axiom at a cardinal and Martin's Axiom

[A1]

AC supplies an omega-one indexing when needed and is the ambient choice principle in the stated ZFC result. The Axiom of Choice

Proof

1.1

Let P consist of pairs (s,F) with s[ω]<ω and F[A]<ω. Put (t,G)(s,F) exactly when st, FG, and tsF, taking =ω. For a fixed finite stem s, 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 ω, P is sigma-centered and therefore ccc.

F1A1Given
2.1

For each aA, the set Ea={(s,F):aF} is dense, because adding a to F changes no stem. For each n<ω, let Dn={(s,F):(ks) kn}. Given (s,F) outside Dn, the strong finite intersection property makes F infinite, so choose kF with kn and extend the stem by k; hence Dn is dense. The family of all Ea and Dn has cardinality at most ω1.

F1A1step 1.1
3.1

By F2 and F3, choose a filter GP meeting every set from step 2.1, and put b={s:(s,F)G}. Meeting all Dn makes b unbounded in ω, hence infinite. Fix aA and choose (s,F)GEa. For any (t,H)G, directedness gives (u,K)G below both; the order relative to (s,F) gives usFa, and tu. Thus tas, and after taking the union, bas is finite. Therefore ba for every aA, so b is an infinite pseudointersection.

F1F2F3A1step 2.1
4.1

Since every at-most-ω1 strong-finite-intersection family has such a pseudointersection, no family witnessing the definition of p has cardinality at most ω1. By F1, p>ω1. Empty and finite A are included: the same forcing works, and for A= the constructed b is simply infinite.

F1step 3.1

Depends on

Used by

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