Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedaudited 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 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 I[S]ω.

[F1]

PFA supplies a filter meeting at most ω1 dense sets in every proper forcing. The Proper Forcing Axiom

[F2]

The P-ideal property supplies modulo-finite pseudounions, and PID's two conclusions are an uncountable Z with all countable subsets in I or a countable cover by sets orthogonal to I. P-ideals, PID, the pseudointersection number, and S-spaces

[F3]

A model-generic condition forces the model-generic intersection and the ground/ordinal trace properties used below. Master-condition characterizations

[A1]

AC supplies simultaneous P-ideal bounds, well-ordered elementary models, finite-chain choices, names, and the omega-one recursions. The Axiom of Choice

Proof

1.1

Fix a large regular θ. For every countable XI, use F2 and A1 to fix IXI with aIX for all aX, and put IN=INI for a countable NHθ. Define QI as follows. A condition p=(Zp,Np) has finite ZpS and a finite membership-chain Np of countable elementary submodels containing I; distinct points of Zp are separated by some NNp; and if NNp and XNI, then XZpN. Put pq when ZqZp, NqNp, and (ZpZq)NIN for every NNq. These clauses are preserved by extension and make the empty pair a greatest condition.

F2A1Given
2.1

We verify properness, including the combinatorial compatibility step. Let M be suitable, p0QIM, and add N=MHθ to its side chain; the result q is a condition below p0. Fix once and for all the well-order of Hθ carried by the elementary structure. For a condition u and a model KNu, define the condition trace uK=(ZuK,NuK), and enumerate the finite set ZuK in the fixed well-order, writing tu,KSZuK for the resulting tuple. It suffices by F3 to take rq and dense DM, first strengthen r into D, and then find a member of DM compatible with this strengthening; rename the strengthened condition r. Put r0=rN and n=ZrN. By elementarity, restrict D to the conditions s carrying a distinguished NsNs such that sNs=r0 and ZsNs=n; the witnesses for r are Nr=N and tr,N. Let T={ts,Ns:sD}Sn and let J be the sigma-ideal generated by I. For USn, let U retain the tuples u for which, at every coordinate k<n, the fibre of possible kth entries above uk is J-positive. The derivative claim in Moore's cited tutorial says that T=nT is a nonempty J+-splitting member of M and contains the external tuple tr,N. Its finite induction uses the membership chain and clause 4 of the forcing: if tr,N first disappeared, the least bad fibre's countable I decomposition, coded in the relevant side model, would put one of the corresponding outside points of Zr in a member of I from that model, contrary to clause 4. In particular, this claim does not assume that tr,N itself belongs to M. Starting with the empty tuple, choose successively in M an initial segment extendible in T. Its next-coordinate set CM is not in J, hence is not orthogonal to I; elementarity gives an infinite HIM with HC. For every one of the finitely many outer models PNrM, membership-chain coherence gives HPI, so HIP. Choose the next coordinate in HPNrMIP. After n choices, elementarity supplies sDM whose tuple ts,Ns is the chosen one, and hence ZsNs is contained in every IP. Then (ZsZr,NsNr) is a common extension. Thus q is an (M,QI)-master and QI is proper.

F2F3A1step 1.1
3.1

If S is a countable union of members of I, PID's second alternative holds. Otherwise choose a suitable countable M and xS(MI). Then q=({x},{MHθ}) is a condition and, by step 2.1, an M-master. For a QI-generic G containing q, set Z˙=pG˙Zp and N˙=pG˙Np. The master condition forces Z˙ uncountable: if an M-name enumerated it countably, F3 would put all of its ground points in M, contrary to xZ˙M. Properness gives the ground-model countable-covering property by the same master-name argument, so every countable subset of Z˙ is contained in some side model NN˙. The order clause gives NZ˙IN, and therefore NZ˙I. Hence q forces every countable subset of Z˙ to lie in I.

F2F3A1step 2.1
4.1

Work in the proper cone QIq. Choose names f˙:ω1Z˙ and g˙:ω1I such that q forces f˙ injective and f˙ξg˙(ξ) for every ξ<ω1; step 3.1 supplies them. For each ξ, the set Dξ of conditions deciding both values is dense. By F1 there is a filter meeting all Dξ. Compatibility within the filter makes the decided values coherent, producing in the ground universe an injection f:ω1S and g:ω1I with fξg(ξ). Put Z=fω1. If aZ is countable, the set of its f-indices is bounded by some ξ<ω1, so afξg(ξ)I and downward closure gives aI. Thus Z 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.

F1F2A1step 3.1

Depends on

Used by

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