Alphabeta Math
TheoremStatement: 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 simple ideal dichotomy

Statement

The Proper Forcing Axiom proves both of Abraham's forms for every ideal I of countable subsets generated modulo finite by ω1 members:

  1. either the ground set is a countable union of sets inside I, or it has an uncountable subset outside I;
  2. either the ground set is a countable union of sets outside I, or it has an uncountable subset inside I.

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 S, and an ideal I on S generated modulo finite by Aξ:ξ<ω1.

[F1]

The simple dichotomy for omega-one-generated ideals gives the ideal, generation, inside, outside, restriction, and simple-dichotomy conventions.

[F2]

The Proper Forcing Axiom supplies a filter meeting any at-most ω1 family of dense subsets of a nonempty proper forcing.

[F3]

Properness may be proved by adding an (M,P)-master below every pMP; masterhood means that DM is predense below it for every dense DM (Master conditions and proper posets, Master-condition characterizations).

[F4]

Suitable countable elementary submodels exist (Countable elementary submodels and their collapses).

[F5]

Every ccc forcing is proper (Ccc and countably closed forcings are proper).

[F6]

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 ACω), and 10=1 by infinite-cardinal absorption (Absorption: for cardinals κ,λ with κ infinite and λκ, κλ=κ, and κλ=κ when λ0).

[F7]

The Axiom of Choice supplies all model, enumeration, thinning, and witness selections below and is part of the ambient ZFC of PFA.

Proof

technique · direct forcing construction
1.1

Put T=ξ<ω1Aξ and R=ST. Generation modulo finite makes R outside I. AC chooses an enumeration of each countable Aξ, so T injects into ω1×ω and [F6] gives T1. If R is uncountable, it already supplies the outside branch of Form 1. Otherwise S1, and uncountability gives S=1; transport S,I, and the generators along a bijection with ω1. Thus, for the nontrivial Form-1 case, we may work on S=ω1.

F1F6F7given
2.1

Assume that S is not a countable union of sets inside I. Define P1 as follows. A condition p=(xp,dp,Np) has finite xp,dpω1 and a finite membership chain Np of countable elementary submodels of a fixed well-ordered expansion of H(2) containing I and the generator map. Require that whenever α<β are in xp, some NNp satisfies αN and βN, equivalently α<Nω1β; this is the meaning of “the models separate distinct points of xp.” If ηxp lies above Nω1 for NNp, then η belongs to no YN that is inside I. A stronger qp enlarges all three finite coordinates and, for each ξdp, freezes xqAξ=xpAξ.

F1F4F7step 1.1
3.1

For every γ<ω1, conditions putting a point above γ into xp are dense. Given p, append a countable model N containing p and γ, so xpN and γ<Nω1. The union of the countably many inside sets belonging to N cannot cover S by the assumption in step 2.1. A point outside that union is outside Nω1 because every singleton from N is an inside set in N; append that point to xp. For every ξ<ω1, the set of conditions with ξdp is dense by simply enlarging dp.

F1F4F7step 2.1
3.2

To prove properness, take a large countable MH(κ) containing P1 and a condition p0MP1. Append N=MH(2) to the side chain. Because every finite coordinate of p0 lies in M, this is a condition pp0. Fix rp and dense DM, and first strengthen r into D. The model N cuts the increasing enumeration xr={α0<<αk} after some αi; the lower part rM belongs to M.

F3F4F7step 2.1
4.1

Let EM be the set of (k+1)-tuples end-extending the x-coordinate of rM that occur as the x-coordinate of some condition in D extending that lower part. It contains (α0,,αk). We use the following fibre observation at each side model: if N is countable, bN avoids every inside set in N, aN, and H={z<ω1:φ(z,a)}N contains b, then H is not inside I; otherwise the condition's avoidance clause would exclude b. Starting at αk and moving down to αi+1, apply this observation to the definable successive fibres of E. The intervening side model contains E and all earlier coordinates but lies below the current coordinate. We obtain in M nested non-inside candidate sets Yi+1,,Yk such that every successive choice from them completes to a tuple in E.

F1step 2.1step 3.2
5.1

Put Z=ξdrAξI. At a candidate stage, Yj is not inside, so elementarity gives a countable CjM with CjYj and CjI. Since ZI, choose ajCjZ; countability of CjM gives CjM. Recursing through the nested fibres gives a tuple in EM and hence qDM extending rM, with every new xq-point outside Z. The union of q and r is a condition: their model chains merge through N; upper points of r avoid every inside generator named by dqM; and the replacement points of q avoid every generator named by dr. These last two facts verify both directions of the freezing requirement. Thus q is compatible with r.

F1F3F7step 3.2step 4.1
6.1

Step 5.1 says that p is an (M,P1)-master, so [F3] makes P1 proper. Apply PFA to the dense sets in step 3.1. For the resulting filter G, let X=pGxp. It is unbounded, hence uncountable. For each generator Aξ, a condition in G puts ξ into its finite d-coordinate, after which directedness and freezing show that XAξ is exactly that condition's finite intersection. By [F1], X is outside I. Together with the alternative excluded in step 2.1 and the reduction in step 1.1, this proves Form 1.

F1F2F3step 1.1step 2.1step 3.1step 5.1
7.1

Now suppose there is no uncountable set inside I. For every uncountable YS, apply Form 1 to IY. Its countable-union branch would make some inside piece uncountable by [F6], contrary to the supposition. Hence every uncountable YS contains an uncountable subset outside I.

F1F6F7step 6.1
8.1

Retain T and R from step 1.1. The set R is outside. If T is countable, partition it into singletons, which are outside, and add R as one more piece; this proves the countable outside decomposition. Assume henceforth that T is uncountable. Then T=1 by [F6].

F1F6step 1.1step 7.1
9.1

On T define P2 to consist of pairs (fp,dp) with fp:Tω finite and dpω1 finite. Put qp when q extends both coordinates and, for every ξdp and every nran(fp), fq1{n}Aξ=fp1{n}Aξ. Thus a recorded generator freezes every colour already present, while a new colour may be introduced once.

F1step 7.1step 8.1
10.1

The forcing P2 is ccc. Given uncountably many conditions, apply [F6] to their function domains and d-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 I. Their finite union O is outside. For each remaining condition pη, the set Bη=OξdpηAξ is finite. Thin the finite Bη 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 B-set. The coordinatewise unions of their functions and side sets then satisfy both freezing clauses and form a common extension.

F1F6F7step 7.1step 9.1
10.2

The following sets are dense in P2: conditions deciding a specified tT, conditions placing a specified ξ<ω1 into dp, and conditions whose function range contains a specified n<ω. For the first or third demand, if necessary assign a new point a colour not yet in the finite range (the specified n itself when it is absent); this cannot violate a freeze, which only mentions old colours.

step 9.1
11.1

By steps 10.1 and [F5], P2 is proper. PFA applied to the at-most-ω1 dense sets of step 10.2 gives a filter whose union is a total f:Tω. Fix n and ξ. Directedness combines a condition recording ξ with one already using colour n; below their common extension that intersection is frozen. Consequently f1{n}Aξ is finite. Each colour class is outside I by [F1], so these classes, together with R, form a countable outside decomposition of S. This proves Form 2 under the no-inside hypothesis; its other branch is precisely an uncountable inside set.

F1F2F5step 8.1step 10.1step 10.2
12.1

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 T, 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].

F1F6F7step 6.1step 11.1

Depends on

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