Professional Documents
Culture Documents
THEOREM
LEO GOLDMAKHER
B0 = B
B1 = f (A0 )
B2 = f (A1 )
..
.
Bn = f (An1 )
..
.
Thus, to continue our line of argument, we require analogues of the sets Ai which are pairwise
disjoint. Fortunately, this isnt difficult to cook up. For each n, set An := An An+1 . By the
remark directly after Lemma 3, we see that all of the sets An are nonempty; moreover, they are
pairwise disjoint. Similarly defining sets Bn , we have the following analogue of Lemma 2:
Lemma 2*.
A0 B1 A2 B3 A4
B0 A1 B2 A3 B4
We can now carry out our prior attack. Since A0 B1 and A1 B0 , Lemma 4 implies that
A0 A1 B0 B1 .
More generally, we deduce that
for all n. Taking the union over all n and once again applying Lemma 4, we conclude that
[
[
An
Bn .
n0
n0
At this point, were nearly finished; the left hand side looks a lot like A, and the right hand side
e and the right hand side by B,
e so that we have
like B. For brevity, denote the left hand side by A
e B.
e
A
(1)
n0
e is a partition of A, and B = B B
e is a partition of B.
Lemma 5. A = A A
Once again by Lemma 4, we see that to conclude the proof of the theorem it suffices to show that
A B. This is an immediate consequence of the following:
Lemma 6. f (A) = B and g(B) = A.
This concludes the proof of the theorem.
R EFERENCES
[1] A. N. Kolmogorov and S. V. Fomin, Introductory Real Analysis, translated by R. A. Silverman, Dover Publications, New York, 1975. 1
D EPARTMENT OF M ATHEMATICS , U NIVERSITY OF T ORONTO , T ORONTO , ON, C ANADA
E-mail address: lgoldmak@math.toronto.edu