请输入您要查询的字词:

 

单词 EveryNetHasAUniversalSubnet
释义

every net has a universal subnet


Theorem - (Kelley’s theorem) - Let X be a non-empty set. Every net (xα)α𝒜 in X has a universalPlanetmathPlanetmath subnet (http://planetmath.org/Ultranet). That is, there is a subnet such that for every EX either the subnet is eventually in E or eventually in X-E.

Proof : Let be a section filter for the net (xα)α𝒜.

Let 𝒟={(α,U):α𝒜,U,xαU}. 𝒟 is a directed setMathworldPlanetmath under the order relation given by

(α,U)(β,V){αβVU

The map f:𝒟𝒜 defined by f(α,U):=α is order preserving and cofinal. Therefore there is a subnet (y(α,U))(α,U)𝒟 of (xα)α𝒜 associated with the map f (that is, y(α,U)=xα).

We now prove that (y(α,U))(α,U)𝒟 is a net.

Let EX. We have that (y(α,U))(α,U)𝒟 is frequently in E or frequently in X-E.

Suppose (y(α,U))(α,U)𝒟 is frequently in E.

Let A and S(α):={xβ:αβ}. We have that S(α) by definition of section filter.

As is a filter, AS(α) and so there exists β with αβ such that xβA. Hence, (β,A)𝒟.

As (y(α,U))(α,U)𝒟 is frequently in E, there exists (γ,B)𝒟 with (β,A)(γ,B) such that y(γ,B)E.

Also, y(γ,B) is in B, and therefore, in A. So AE.

We conclude that EA for every A. Therefore, {E} a filter in X. As is a maximal filter we conclude that E, and consequently, (γ,E)𝒟.

We can now see that for every (δ,C) with (γ,E)(δ,C), y(δ,C) is in C and so is in E. Therefore, (y(α,U))(α,U)𝒟 is eventually in E.

Remark: If (y(α,U))(α,U)𝒟 is frequently in X-E, by an analogous we can conclude that it is eventually in X-E.

This proves that (y(α,U))(α,U)𝒟 is a subnet of (xα)α𝒜.

随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 17:47:19