Basic Analysis – Gently Done Topological Vector Spaces
Basic Analysis – Gently Done Topological Vector Spaces
Basic Analysis – Gently Done Topological Vector Spaces
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
28 <strong>Basic</strong> <strong>Analysis</strong><br />
Proposition 3.7 Suppose that F is any collection of subsets of a given set X<br />
satisfyingthefip. ThenthereisamaximalcollectionDcontaining Fandsatisfying<br />
the fip, i.e., if F ⊆ F ′ and if F ′ satisfies the fip, then F ′ ⊆ D. Furthermore,<br />
(i) if A 1 ,...,A n ∈ D, then A 1 ∩···∩A n ∈ D, and<br />
(ii) if A is any subset of X such that A∩D �= ∅ for all D ∈ D, then A ∈ D.<br />
Proof As might be expected, we shall use Zorn’s lemma. Let C denote the<br />
collection of those families of subsets of X which contain F and satisfy the fip.<br />
Then F ∈ C, so C is not empty. Evidently, C is ordered by set-theoretic inclusion.<br />
Suppose that Φ is a totally ordered set of families in C. Let A = �<br />
S. Then<br />
F ⊆ A, since F ⊆ S, for all S ∈ Φ. We shall show that A satisfies the fip. To<br />
see this, let S1 ,...,S n ∈ A. Then each Si is an element of some family Si that<br />
belongs to Φ. But Φ is totally ordered and so there is i0 such that Si ⊆ S for all i0<br />
1 ≤ i ≤ n. Hence S1 ,...,S n ∈ Si0 and so S1 ∩···∩S n �= ∅ since S satisfies the i0<br />
fip. It follows that A is an upper bound for Φ in C. Hence, by Zorn’s lemma, C<br />
contains a maximal element, D, say.<br />
(i) Now suppose that A 1 ,...,A n ∈ D and let B = A 1 ∩···∩A n . Let D ′ = D∪{B}.<br />
Then any finite intersection of members of D ′ is equal to a finite intersection of<br />
members of D. Thus D ′ satisfies the fip. Clearly, F ⊆ D ′ , and so, by maximality,<br />
we deduce that D ′ = D. Thus B ∈ D.<br />
(ii) Suppose that A ⊆ X and that A∩D �= ∅ for every D ∈ D. Let D ′ = D∪{A},<br />
and let D 1 ,...,D m ∈ D ′ . If D i ∈ D, for all 1 ≤ i ≤ m, then D 1 ∩···∩D m �= ∅<br />
since D satisfies the fip. If some D i = A and some D j �= A, then D 1 ∩···∩D m<br />
has the form D 1 ∩···∩D k ∩A with D 1 ,...,D k ∈ D. By (i), D 1 ∩···∩D k ∈ D<br />
and so, by hypothesis, A∩(D 1 ∩...D k ) �= ∅. Hence D ′ satisfies the fip and, again<br />
by maximality, we have D ′ = D and thus A ∈ D.<br />
We are now ready to prove Tychonov’s theorem which states that the product<br />
of compact topological spaces is compact with respect to the product topology. In<br />
fact we shall present three proofs. The first is based on the previous proposition,<br />
the second (due to P. Chernoff) uses the idea of partial cluster points together<br />
with Zorn’s lemma, and the third uses universal nets.<br />
Department of Mathematics King’s College, London<br />
S∈Φ