Prove that the following is a Topology. I really just want to clean it up.

  • Thread starter Thread starter Hodgey8806
  • Start date Start date
  • Tags Tags
    clean Topology
Hodgey8806
Messages
140
Reaction score
3

Homework Statement


Prove that T1={U subset of X: X\U is finite or is all of X} is a topology.

Homework Equations


DeMorgan's Laws will be useful.
Empty set is defined as finite, and X is an arbitrary infinite set.

The Attempt at a Solution


1) X/X = empty set, finite. Thus X is in T1
2) X/empty set = X, infinite. Thus Empty Set is in T1
3) Let {Ua:a is in A} be a collection of sets in T1
Spse Ua ≠ X.
X\(indexed unionUa) = indexed intersection(X\Ua)
This is finite since each X\Ua is finite or is all of X. (element of T1)

Spse Ua = empty set for all a, then the indexed intersection(X\Ua) = X (element of T1)
Spse Ua-bar ≠ empty set for some a, then the indexed intersection(X\Ua) is a subset of X\Ua-bar (element of T1).

4) Let {Ua:a is in A} be a collection of sets in T1
Spse Ua ≠ empty set.
X\(indexed intersectionUa) = indexed union(X\Ua),
Since the number of intersection must be finite and X\Ua is finite for all a,
Then the union of finitely many finite sets is finite. (element of T1)

If Ua = empty set for some a,
Then the indexed union (X\Ua) is either finite or all of X. (element of T1)
 
Physics news on Phys.org
I,m sorry, Idon't get what you're asking.
 
Hodgey8806 said:

Homework Statement


Prove that T1={U subset of X: X\U is finite or is all of X} is a topology.

Homework Equations


DeMorgan's Laws will be useful.
Empty set is defined as finite, and X is an arbitrary infinite set.

The Attempt at a Solution


1) X/X = empty set, finite. Thus X is in T1
2) X/empty set = X, infinite.
Actually, you are NOT given that X is infinite. But the point is that X/empty set is all of X.

Thus Empty Set is in T1
3) Let {Ua:a is in A} be a collection of sets in T1
Spse Ua ≠ X.
X\(indexed unionUa) = indexed intersection(X\Ua)
This is finite since each X\Ua is finite or is all of X. (element of T1)

Spse Ua = empty set for all a, then the indexed intersection(X\Ua) = X (element of T1)
Spse Ua-bar ≠ empty set for some a, then the indexed intersection(X\Ua) is a subset of X\Ua-bar (element of T1).

4) Let {Ua:a is in A} be a collection of sets in T1
Spse Ua ≠ empty set.
X\(indexed intersectionUa) = indexed union(X\Ua),
Since the number of intersection must be finite and X\Ua is finite for all a,
Then the union of finitely many finite sets is finite. (element of T1)

If Ua = empty set for some a,
Then the indexed union (X\Ua) is either finite or all of X. (element of T1)
 
Last edited by a moderator:
Hodgey,

(1.) & (2.) look fine.

I'll edit & make some comments below for the others.

For (3.):
Let \displaystyle <br /> \left\{ \text{U}_\alpha\ :\ \alpha \in \text{A}\right\} be an arbitrary collection of sets in T1 .
[STRIKE]Spse Ua ≠ X. [/STRIKE] (Not needed)

\displaystyle \text{X}\backslash \left(\bigcup\left(\text{U}_\alpha\right)\right)= \bigcap\left(\text{X}\backslash\text{U}_\alpha \right)
If <br /> \displaystyle \text{U}_\alpha = \emptyset \text{ for all }\alpha\in\text{A}\,, then \displaystyle \bigcap\left(\text{X}\backslash\text{U}_\alpha \right)=\text{X}\ .

Otherwise, argue that one of the \displaystyle \text{X}\backslash\text{U}_\alpha is finite for some \displaystyle \text{U}_\alpha ... so that the intersection is finite.​
...​

For (4):
This should be a finite intersection, so a finite collection of sets.​
 
Thank you very much! I understand this a bit better now. To me that piece didn't seem necessary, but we worked through it fast in class so I suppose it was there for good measure.

I argued on 3) that it is finite because if it intersects a finite set, the indexed intersection is now a subset of that particular finite set.

Thanks again! I have many more questions I need guidance on!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top