You need to know: Notation for the set of natural numbers. Cardinality of a set: sets A and B have the same cardinality (we write
) if there exists a bijection from A to B. We write
if there exists a bijection from A to a subset of B. It is known that
or
for every
.
Background: Let mean that set
is finite. Let
be the family of all infinite sequences of natural numbers, and let
. We say that D has a pseudo-intersection if there is an infinite
such that
for all
. We say that D has the strong finite intersection property (s.f.i.p. in short) if every nonempty finite subfamily of D has infinite intersection. D is called well ordered by
if
or
for all
. D is called a tower if it is well ordered by
and has no pseudo-intersection. Let
be the smallest cardinality of
which has the s.f.i.p. but has no pseudo-intersection. Let
be the smallest cardinality of
which is a tower.
The Theorem: On 27th August 2012, Maryanthe Malliaris and Saharon Shelah submitted to arxiv and the Journal of the AMS a paper in which they proved that .
Short context: Cantor proved in 1874 that the cardinality of set of integers (denoted ) is strinctly less than the cardinality of set of real numbers (denoted
). Clearly, both
and
are at least
and no more than
. It is easy to see that
, since a tower has the s.f.i.p. An old open question asks whether equality holds. The Theorem asnwers this question affirmatively.
Links: Free arxiv version of the original paper is here, journal version is here.