# Martin's axiom

In the mathematical field of set theory, Martin's axiom, introduced by Template:Harvs, 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, c, behave roughly like ${\displaystyle \aleph _{0}}$. 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 of Martin's axiom

For any cardinal k, we define a statement, denoted by MA(k):

For any partial order P satisfying the countable chain condition (hereafter ccc) and any family D of dense sets in P such that |D|k, there is a filter F on P such that Fd is non-empty for every d in D.

Since it is a theorem of ZFC that MA(c) fails, the Martin's axiom is stated as:

Martin's axiom (MA): For every k < c, MA(k) holds.

In this case (for application of ccc), an antichain is a subset A of P such that any two distinct members of A are incompatible (two elements are said to be compatible if there exists a common element below both of them in the partial order). This differs from, for example, the notion of antichain in the context of trees.

MA(${\displaystyle \aleph _{0}}$) is simply true. This is known as the Rasiowa–Sikorski lemma.

MA(${\displaystyle 2^{\aleph _{0}}}$) is false: [0, 1] is a compact Hausdorff space, which is separable and so ccc. It has no isolated points, so points in it are nowhere dense, but it is the union of ${\displaystyle 2^{\aleph _{0}}}$ many points.

## Equivalent forms of MA(k)

The following statements are equivalent to Martin's axiom:

• If P is a non-empty upwards ccc poset and Y is a family of cofinal subsets of P with |Y|k then there is an upwards directed set A such that A meets every element of Y.
• Let A be a non-zero ccc Boolean algebra and F a family of subsets of A with |F|k. Then there is a boolean homomorphism φ: AZ/2Z such that for every X in F either there is an a in X with φ(a) = 1 or there is an upper bound b for X with φ(b) = 0.

## Consequences

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

## Notes

• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• Jech, Thomas, 2003. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer. ISBN 3-540-44085-2.
• Kunen, Kenneth, 1980. Set Theory: An Introduction to Independence Proofs. Elsevier. ISBN 0-444-86839-9.
• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

## References

1. Sheldon W. Davis, 2005, Topology, McGraw Hill, p.29, ISBN 0-07-291006-2.