To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

Martin's axiom

From Wikipedia, the free encyclopedia

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.


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

For any partial order P satisfying the countable chain condition (hereafter ccc) and any family D of dense sets in P such that |D| ≤ 𝛋, 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 fails, Martin's axiom is stated as:

Martin's axiom (MA): For every 𝛋 < , MA(𝛋) 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.

is simply true. This is known as the Rasiowa–Sikorski lemma.

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 many points. (See the condition equivalent to below.)

Equivalent forms of MA(𝛋)

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 family 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 family of subsets of A with |F| ≤ 𝛋. 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.


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 < 𝛋.
  • Equivalently for any x in βN\N we have 𝜒(x) ≥ 𝛋, where 𝜒 is the character of x, and so 𝜒(βN) ≥ 𝛋.
  • 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


  1. ^ 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.
  2. ^ Davis, Sheldon W. (2005). Topology. McGraw Hill. p. 29. ISBN 0-07-291006-2.

Further reading

This page was last edited on 6 August 2021, at 20:10
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.