In mathematics, particularly in set theory, Fodor's lemma states the following:
If
κ
is a regular, uncountable cardinal,
S
is a stationary subset of
κ
, and
f
:
S
→
κ
is regressive (that is,
f
(
α
)
<
α
for any
α
∈
S
,
α
≠
0
) then there is some
γ
and some stationary
S
0
⊆
S
such that
f
(
α
)
=
γ
for any
α
∈
S
0
. In modern parlance, the nonstationary ideal is normal.
The lemma was first proved by the Hungarian set theorist, Géza Fodor in 1956. It is sometimes also called "The Pressing Down Lemma".
We can assume that
0
∉
S
(by removing 0, if necessary). If Fodor's lemma is false, for every
α
<
κ
there is some club set
C
α
such that
C
α
∩
f
−
1
(
α
)
=
∅
. Let
C
=
Δ
α
<
κ
C
α
. The club sets are closed under diagonal intersection, so
C
is also club and therefore there is some
α
∈
S
∩
C
. Then
α
∈
C
β
for each
β
<
α
, and so there can be no
β
<
α
such that
α
∈
f
−
1
(
β
)
, so
f
(
α
)
≥
α
, a contradiction.
Fodor's lemma also holds for Thomas Jech's notion of stationary sets as well as for the general notion of stationary set.
Another related statement, also known as Fodor's lemma (or Pressing-Down-lemma), is the following:
For every non-special tree
T
and regressive mapping
f
:
T
→
T
(that is,
f
(
t
)
<
t
, with respect to the order on
T
, for every
t
∈
T
), there is a non-special subtree
S
⊂
T
on which
f
is constant.
