In mathematics, the Tarski's theorem, proved by Alfred Tarski (1924), states that in ZF the theorem "For every infinite set
A
, there is a bijective map between the sets
A
and
A
×
A
" implies the axiom of choice. The opposite direction was already known, thus the theorem and axiom of choice are equivalent.
Tarski told Jan Mycielski (2006) that when he tried to publish the theorem in Comptes Rendus de l'Académie des Sciences Paris, Fréchet and Lebesgue refused to present it. Fréchet wrote that an implication between two well known propositions is not a new result. Lebesgue wrote that an implication between two false propositions is of no interest.
Our goal is to prove that the axiom of choice is implied by the statement "For every infinite set
A
:
|
A
|
=
|
A
×
A
|
". It is known that the well-ordering theorem is equivalent to the axiom of choice, thus it is enough to show that the statement implies that for every set
B
there exist a well-order.
For finite sets it is trivial, thus we will assume that
B
is infinite.
Since the collection of all ordinals such that there exist a surjective function from
B
to the ordinal is a set, there exist a minimal non-zero ordinal,
β
, such that there is no surjective function from
B
to
β
. We assume without loss of generality that the sets
B
and
β
are disjoint. By our initial assumption,
|
B
∪
β
|
=
|
(
B
∪
β
)
×
(
B
∪
β
)
|
, thus there exists a bijection
f
:
B
∪
β
→
(
B
∪
β
)
×
(
B
∪
β
)
.
For every
x
∈
B
, it is impossible that
β
×
{
x
}
⊆
f
[
B
]
, because otherwise we could define a surjective function from
B
to
β
. Therefore, there exists at least one ordinal
γ
∈
β
, such that
f
(
γ
)
∈
β
×
{
x
}
, thus the set
S
x
=
{
γ
|
f
(
γ
)
∈
β
×
{
x
}
}
is not empty.
With this fact in our mind we can define a new function:
g
(
x
)
=
min
S
x
. This function is well defined since
S
x
is a non-empty set of ordinals, hence it has a minimum. Recall that for every
x
,
y
∈
B
,
x
≠
y
the sets
S
x
and
S
y
are disjoint. Therefore, we can define a well order on
B
, for every
x
,
y
∈
B
we shall define
x
≤
y
⟺
g
(
x
)
≤
g
(
y
)
, since the image of
g
, i.e.
g
[
B
]
, is a set of ordinals and therefore well ordered.
