2024-10-06

804: For Topological Space and Finite Number of Open Covers, Intersection of Covers Is Open Cover

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for topological space and finite number of open covers, intersection of covers is open cover

Topics


About: topological space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any topological space and any finite number of any open covers, the intersection of the covers is an open cover.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
T: { the topological spaces }
A1: { the possibly uncountable index sets }
...
An: { the possibly uncountable index sets }
A: =A1×...×An
C1: ={U1,α1|α1A1}, { the open covers of T}
...
Cn: ={Un,αn|αnAn}, { the open covers of T}
C: ={U1,α1...Un,αn|α=(α1,...,αn)A}: which is being called "the intersection of the open covers"
//

Statements:
C{ the open covers of T}
//


2: Proof


Whole Strategy: Step 1: take each tT and see that t is contained in an element of C: Step 2: see that each element of C is open on T; Step 3: conclude the proposition.

Step 1:

Let tT be any.

Let us see that t is contained in an element of C.

As Cj is a cover, there is a Uj,βjCj such that tUj,βj.

β=(β1,...,βn)A, and so, U1,β1...Un,βnC.

tU1,β1...Un,βn.

Step 2:

Each element of C is U1,α1...Un,αn, which is open on T, as a finite intersection of open subsets.

Step 3:

There may be some duplications in C, but such duplications are automatically eliminated by the definition of set (no set has any duplication). And may be contained in C, but that is not any problem for C's being an open cover.

So, C is an open cover of T.


References


<The previous article in this series | The table of contents of this series | The next article in this series>