Proper forcing axiom

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In the mathematical field of set theory, the proper forcing axiom (PFA) is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings.

Statement[edit]

A forcing or partially ordered set P is proper if for all regular uncountable cardinals  \lambda , forcing with P preserves stationary subsets of  [\lambda]^\omega .

The proper forcing axiom asserts that if P is proper and Dα is a dense subset of P for each α<ω1, then there is a filter G \subseteq P such that Dα ∩ G is nonempty for all α<ω1.

The class of proper forcings, to which PFA can be applied, is rather large. For example, standard arguments show that if P is ccc or ω-closed, then P is proper. If P is a countable support iteration of proper forcings, then P is proper. In general, proper forcings preserve \aleph_1 .

Consequences[edit]

PFA directly implies its version for ccc forcings, Martin's axiom. In cardinal arithmetic, PFA implies  2^{\aleph_0} = \aleph_2 . PFA implies any two  \aleph_1-dense subsets of R are isomorphic,[1] any two Aronszajn trees are club-isomorphic,[2] and every automorphism of the Boolean algebra P(\omega)/fin is trivial.[3] PFA implies that the Singular Cardinals Hypothesis holds. An especially notable consequence proved by John R. Steel is that the axiom of determinacy holds in L(R), the smallest inner model containing the real numbers. Another consequence is the failure of square principles and hence existence of inner models with many Woodin cardinals.

Consistency strength[edit]

If there is a supercompact cardinal, then there is a model of set theory in which PFA holds. The proof uses the fact that proper forcings are preserved under countable support iteration, and the fact that if  \kappa is supercompact, then there exists a Laver function for  \kappa .

It is not yet known how much large cardinal strength comes from PFA.

Other forcing axioms[edit]

The bounded proper forcing axiom (BPFA) is a weaker variant of PFA which instead of arbitrary dense subsets applies only to maximal antichains of size ω1. Martin's maximum is the strongest possible version of a forcing axiom.

Forcing axioms are viable candidates for extending the axioms of set theory as an alternative to large cardinal axioms.

The Fundamental Theorem of Proper Forcing[edit]

The Fundamental Theorem of Proper Forcing, due to Shelah, states that any countable support iteration of proper forcings is itself proper. This follows from the Proper Iteration Lemma, which states that whenever \langle P_\alpha\,\colon\alpha\leq\kappa\rangle is a countable support forcing iteration based on \langle Q_\alpha\,\colon
\alpha<\kappa\rangle and N is a countable elementary substructure of H_\lambda for a sufficiently large regular cardinal \lambda, and P_\kappa\in N and \alpha\in \kappa\cap N and p is (N,P_\alpha)-generic and p forces "q\in P_\kappa/G_{P_\alpha}\cap N[G_{P_\alpha}]," then there exists r\in P_\kappa such that r is N-generic and the restriction of r to P_\alpha equals p and p forces the restriction of r to [\alpha,\kappa) to be stronger or equal to q.

This version of the Proper Iteration Lemma, in which the name q is not assumed to be in  N, is due to Schlindwein.[4]

The Proper Iteration Lemma is proved by a fairly straightforward induction on \kappa, and the Fundamental Theorem of Proper Forcing follows by taking \alpha=0.

See also[edit]

References[edit]

  1. ^ Moore (2011)
  2. ^ Abraham, U., and Shelah, S., Isomorphism types of Aronszajn trees (1985) Israel Journal of Mathematics (50) 75 -- 113
  3. ^ Moore (2011)
  4. ^ Schlindwein, C., "Consistency of Suslin's hypothesis, a non-special Aronszajn tree, and GCH", (1994), Journal of Symbolic Logic (59) pp. 1 -- 29