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.

A supercompact cardinal can be forced to give PFA

Statement

If κ is supercompact, the Laver-guided countable-support iteration Pκ forces PFA and κ=ω2, while preserving ω1 and ZFC.

Facts & Assumptions

Given: A ZFC ground universe V with a supercompact cardinal κ. Generic filters used in the semantic proof are supplied in common outer universes; none is asserted to exist inside its ground model.

[F1]

PFA asks for a filter meeting every family of at most ω1 dense subsets of each nonempty proper partial order. The Proper Forcing Axiom

[F2]

A supercompact cardinal has a Laver anticipation function. Existence of a Laver function at a supercompact

[F3]

The Laver-guided iteration is proper, preserves ω1, forces κ=ω2, and an embedding anticipating a forced-proper name factors its image as Pκ∗Q˙∗R˙. Size, collapse, and factorization for the PFA iteration

[F4]

Set-forcing extensions of ZFC models satisfy ZFC. Generic extensions satisfy ZF and preserve ground-model Choice

[F5]

Forcing is definable formula by formula and satisfies the truth lemma and, when the stated outer generics are available, its semantic characterization. Forcing theorem

[F6]

The bookkeeping iteration uses the anticipated name exactly when the preceding stage forces that it is a nonempty proper order with a greatest condition. Laver-guided proper bookkeeping iteration

[A1]

AC supplies the ground well-orders and the set-sized selections of names, bounds, and embeddings used below. The Axiom of Choice

Proof

1.1F2F3F4F6Given

By F2 fix a Laver function and form Pκ as in F6. By F3 this forcing is proper, preserves ω1, and forces κ=ω2. Let G⊆Pκ be arbitrary V-generic. F4 gives V[G]⊨ZFC. It remains to prove PFA in this arbitrary extension.

2.1F1F5A1step 1.1

Work in V[G]. Fix a nonempty proper partial order Q and a family ⟨Dξ:ξ<λ⟩ of dense subsets, where λ≤ω1. If λ=0, any q∈Q generates a filter and there is nothing to meet. Suppose 0<λ≤ω1 and repeat D0 to regard the family as an ω1-sequence. Choose ground names Q˙,D⃗˙ for these objects. By F5 there is p∈G forcing that Q˙ is proper and that D⃗˙ is an ω1-sequence of dense subsets of it. Restrict every coefficient of Q˙ below p and adjoin a new greatest condition, obtaining a name Q˙∗. In a generic containing p its value is Q with that new top; in a generic on the incompatible side its value is the one-condition order. Adding a top preserves properness: an old condition uses a Q-master, while below the new top a countable model containing the nonempty Q contains an old condition and a Q-master below it. The set of conditions below p or incompatible with p is dense, so F5 shows that 1Pκ forces Q˙∗ to be nonempty, proper, and to have a greatest condition. In the actual extension every Dξ⊆Q remains dense in Q∗.

3.1F2F3F6A1step 2.1

Choose a cardinal large enough for the names in step 2.1 and all restrictions of the desired embedding to them. Laver anticipation and supercompactness give a correspondingly closed j:V→M with critical point κ and j(ℓ)(κ)=Q˙∗. By step 2.1 and F6 the image iteration uses Q˙∗ at stage κ, and F3 gives in M a tail name R˙ and a canonical dense factorization j(Pκ)≃Pκ∗Q˙∗∗R˙.

4.1F3F5Givenstep 3.1

By the outer-universe convention in Given, take g⊆Q∗ generic over V[G], followed by an M[G∗g]-generic H⊆R, all in a common outer universe. Under the factorization let K=G∗g∗H. Every condition of G has countable, hence bounded, support in κ; the canonical first factor therefore sends it into K, so j‘‘G⊆K. Define jG(val⁡G(τ))=val⁡K(j(τ)). If two Pκ-names have the same G-value, F5 gives a condition of G forcing their equality; its image belongs to K, so F5 in M makes the displayed definition independent of the name. The same argument, applied to a formula or its negation, proves formula-by-formula that jG:V[G]→M[K] is elementary and extends j.

5.1F1F5A1step 2.1step 3.1step 4.1

Enumerate in V the transitive closure of the name Q˙∗ below the closure bound chosen in step 3.1. Closure puts the pointwise image of that enumeration in M, and evaluating it with G and K constructs the set restriction jG↾Q∗ in M[K]. There form the upward-closed filter F generated by jG‘‘g. It is directed because g is directed and jG preserves the order. Since crit⁡(jG)=κ>ω1, jG(⟨Dξ:ξ<ω1⟩)=⟨jG(Dξ):ξ<ω1⟩. For every ξ<ω1, genericity gives qξ∈g∩Dξ, and jG(qξ)∈F∩jG(Dξ). Thus M[K] satisfies that a filter on jG(Q∗) meets every member of the image sequence. Elementarity of jG reflects the existential assertion to a filter f on Q∗ in V[G] meeting every Dξ. Because the sequence is nonempty and every Dξ lies in Q, f∩Q is nonempty; it is upward closed in Q, and any common extension in f of two of its members lies in Q, not at the newly adjoined greatest condition. Hence f∩Q is the required filter on Q.

6.1F1F3F4F5A1step 1.1step 5.1∎

The choice of Q and its dense family in V[G] was arbitrary, including the empty-family case, so F1 and step 5.1 give V[G]⊨PFA. Since G was an arbitrary generic, F5 yields Pκ⊩PFA. Step 1.1 and F3 give preservation of ω1 and Pκ⊩κ=ω2, while F4 gives preservation of ZFC. All uses of Choice are those declared in A1; the outer generics facilitate the semantic argument and are not claimed to be elements of V[G].

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