Martin's axiom


In the mathematical field of set theory, Martin's axiom, introduced by Donald A. Martin and Robert M. Solovay, is a statement that is independent of the usual axioms of ZFC set theory. It is implied by the continuum hypothesis, but it is consistent with ZFC and the negation of the continuum hypothesis.
Informally, it says that all cardinals less than the cardinality of the continuum,, behave roughly like. The intuition behind this can be understood by studying the proof of the Rasiowa–Sikorski lemma. It is a principle that is used to control certain forcing arguments.

Statement

For a cardinal number, define the following statement:
;MA: For any partial order P satisfying the countable chain condition and any set D = i∈''I of dense subsets of P'' such that |D|κ, there is a filter F on P such that FDi is non-empty for every DiD.
In this context, a set D is called dense if every element of P has a lower bound in D. For application of ccc, an antichain is a subset A of P such that any two distinct members of A are incompatible. This differs from, for example, the notion of antichain in the context of trees.
MA is provable in ZFC and known as the Rasiowa–Sikorski lemma.
MA is false: is a separable compact Hausdorff space, and so ccc. But now consider the following two ?-size sets of dense sets in P: no x ∈ is isolated, and so each x defines the dense subset. And each r
Martin's axiom is then that MA holds for every for which it could:
;Martin's axiom : MA holds for every.

Equivalent forms of MA(''κ'')

The following statements are equivalent to MA:

Consequences

Martin's axiom has a number of other interesting combinatorial, analytic and topological consequences:

Further development