请输入您要查询的字词:

 

单词 ProofOfTychonoffsTheoremInFiniteCase
释义

proof of Tychonoff’s theorem in finite case


(The finite case of TychonoffPlanetmathPlanetmath’s Theorem is of course a subset of the infiniteMathworldPlanetmath case,but the proof is substantially easier, so that is why it is presented here.)

To prove that X1××Xn is compactPlanetmathPlanetmathif the Xi are compact, it suffices (by inductionMathworldPlanetmath) to prove that X×Y is compactwhen X and Y are. It also suffices to prove thata finite subcover can be extracted from every open cover of X×Yby 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 subcoverfrom a lower-dimensional subcover. Let the open cover 𝒞 of X×Yby basis sets be given.

The set X×{y} is compact, because it is the image of acontinuousPlanetmathPlanetmath embeddingMathworldPlanetmathPlanetmath of the compact set X.Hence X×{y} has a finite subcover in 𝒞: label the subcoverby 𝒮y={U1y×V1y,,Ukyy×Vkyy}.Do this for each yY.

To get the desired subcover of X×Y, we need to pick a finite numberof yY. Consider Vy=i=1kyViy.This is a finite intersectionMathworldPlanetmathPlanetmath of open sets, so Vy is open in Y.The collectionMathworldPlanetmath {Vy:yY} is an open covering of Y, so picka finite subcover Vy1,,Vyl.Then j=1l𝒮yj is a finite subcoverof X×Y.∎

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 8:40:25