请输入您要查询的字词:

 

单词 ProofOfEveryFilterIsContainedInAnUltrafilteralternateProof
释义

proof of every filter is contained in an ultrafilter (alternate proof)


Let 𝔘 be the family of filters over X which are finer than , under the partial orderMathworldPlanetmath of inclusion.

Claim 1. Every chain in U has an upper bound also in U.

Proof.

Take any chain in 𝔘, and consider the set 𝒞=. Then 𝒞 is also a filter: it cannot contain the empty setMathworldPlanetmath, since no filter in the chain does; the intersectionMathworldPlanetmath of two sets in 𝒞 must be present in the filters of ; and 𝒞 is closed under supersetsMathworldPlanetmath because everyfilter in is. Obviously 𝒞 is finer than .∎

So we conclude, by Zorn’s lemma, that 𝔘 must have a maximal filter say 𝒰, which must contain . All we need to show is that 𝒰 is an ultrafilterMathworldPlanetmath. Now, for any filter 𝒰, and any set YX, we must have:

Claim 2. Either U1={ZY:ZU} or U2={Z(X\\Y):ZU} (or both) are a filter subbasis.

Proof.

We prove by contradictionMathworldPlanetmathPlanetmath that at least one of 𝒰1 or 𝒰2 must have the finite intersection property. If neither has the finite intersection property, then for some Z1,Zk we must have

=1ikZiY=1ikZi(X\\Y).

But then

=(1ikZiY)(1ikZi(X\\Y))=1ikZi,

and so 𝒰 does not have the finite intersection property either. This cannot be, since 𝒰 is a filter.∎

Now, by Claim 2, if 𝒰 were not an ultrafilter, i.e., if for some Y subset of X we would have neither Y nor X\\Y in 𝒰, then the filter generated 𝒰1 or 𝒰2 would be finer than 𝒰, and then 𝒰 would not be maximal.

So 𝒰 is an ultrafilter containing , as intended.

随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 9:15:07