proof of Tychonoff’s theorem in finite case
(The finite case of Tychonoff’s Theorem is of course a subset of the infinite
case,
but the proof is substantially easier, so that is why it is presented here.)
To prove that X1×⋯×Xn is compact
if the Xi are compact, it suffices (by induction
) to prove that X×Y is compact
when X and Y are. It also suffices to prove that
a finite subcover can be extracted from every open cover of X×Y
by only the basis sets of the form U×V, where U is open in X and V is open in Y.
Proof.
The proof is by the straightforward strategy of composing a finite subcover from a lower-dimensional subcover. Let the open cover 𝒞 of X×Y by basis sets be given.
The set X×{y} is compact, because it is the image of a
continuous embedding
of the compact set X.
Hence X×{y} has a finite subcover in 𝒞: label the subcover
by 𝒮y={Uy1×Vy1,…,Uyky×Vyky}.
Do this for each y∈Y.
To get the desired subcover of X×Y, we need to pick a finite number
of y∈Y. Consider Vy=⋂kyi=1Vyi.
This is a finite intersection of open sets, so Vy is open in Y.
The collection
{Vy:y∈Y} is an open covering of Y, so pick
a finite subcover Vy1,…,Vyl.
Then ⋃lj=1𝒮yj is a finite subcover
of X×Y.
∎
Title | proof of Tychonoff’s theorem in finite case |
---|---|
Canonical name | ProofOfTychonoffsTheoremInFiniteCase |
Date of creation | 2013-03-22 15:26:27 |
Last modified on | 2013-03-22 15:26:27 |
Owner | stevecheng (10074) |
Last modified by | stevecheng (10074) |
Numerical id | 4 |
Author | stevecheng (10074) |
Entry type | Proof |
Classification | msc 54D30 |