Martin's axiom

In the mathematical field of set theory, Martin's axiom, introduced by Donald A. Martin and Robert M. Solovay,^[1] 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[edit]

For a cardinal number κ, define the following statement:

MA(κ): For any partial order P satisfying the countable chain condition (hereafter ccc) and any set D = { D_i }_i∈I of dense subsets of P such that |D| ≤ κ, there is a filter F on P such that F ∩ D_i is non-empty for every D_i ∈ D.

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(ℵ₀) is provable in ZFC and known as the Rasiowa–Sikorski lemma.

MA(2^ℵ₀) is false: [0, 1] is a separable compact Hausdorff space, and so (P, the poset of open subsets under inclusion, is) ccc. But now consider the following two 𝔠-size sets of dense sets in P: no x ∈ [0, 1] is isolated, and so each x defines the dense subset { S | x ∉ S }. And each r ∈ (0, 1], defines the dense subset { S | diam(S) < r }. The two sets combined are also of size 𝔠, and a filter meeting both must simultaneously avoid all points of [0, 1] while containing sets of arbitrarily small diameter. But a filter F containing sets of arbitrarily small diameter must contain a point in ⋂F by compactness. (See also § Equivalent forms of MA(κ).)

Martin's axiom is then that MA(κ) holds for every κ for which it could:

Martin's axiom (MA): MA(κ) holds for every κ < 𝔠.

Equivalent forms of MA(κ)[edit]

The following statements are equivalent to MA(κ):

If X is a compact Hausdorff topological space that satisfies the ccc then X is not the union of κ or fewer nowhere dense subsets.
If P is a non-empty upwards ccc poset and Y is a set of cofinal subsets of P with |Y| ≤ κ 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 set of subsets of A with |F| ≤ κ. Then there is a boolean homomorphism φ : A → Z/2Z such that for every X ∈ F, there is either an a ∈ X with φ(a) = 1 or there is an upper bound b ∈ X with φ(b) = 0.

Consequences[edit]

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

The union of κ or fewer null sets in an atomless σ-finite Borel measure on a Polish space is null. In particular, the union of κ or fewer subsets of R of Lebesgue measure 0 also has Lebesgue measure 0.
A compact Hausdorff space X with |X| < 2^κ is sequentially compact, i.e., every sequence has a convergent subsequence.
No non-principal ultrafilter on N has a base of cardinality less than κ.
Equivalently for any x ∈ βN\N we have 𝜒(x) ≥ κ, where 𝜒 is the character of x, and so 𝜒(βN) ≥ κ.
MA(ℵ₁) implies that a product of ccc topological spaces is ccc (this in turn implies there are no Suslin lines).
MA + ¬CH implies that there exists a Whitehead group that is not free; Shelah used this to show that the Whitehead problem is independent of ZFC.

Further development[edit]

Martin's axiom has generalizations called the proper forcing axiom and Martin's maximum.
Sheldon W. Davis has suggested in his book that Martin's axiom is motivated by the Baire category theorem.^[2]

References[edit]

^ Martin, Donald A.; Solovay, Robert M. (1970). "Internal Cohen extensions". Ann. Math. Logic. 2 (2): 143–178. doi:10.1016/0003-4843(70)90009-4. MR 0270904.
^ Davis, Sheldon W. (2005). Topology. McGraw Hill. p. 29. ISBN 0-07-291006-2.

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

Statement[edit]

Equivalent forms of MA(κ)[edit]

Consequences[edit]

Further development[edit]

References[edit]

Further reading[edit]