Can the intersection over a finite set be written as a sum?

Raziel2701
Messages
128
Reaction score
0
I know the union can be, but how about the intersection? I am trying to prove that:

Suppose (X,T) is a finite topological space, n is a positive integer and U_i\in T for 1<= i <= n. Use mathematical induction to prove \bigcap U_i \in T, where the intersection goes from i=1 to n.
 
Physics news on Phys.org
can you show the intersection of 2 open sets is open?
 
I don't see that open or closed enters into this problem, unless I'm missing something. For the base case, show that if two sets U1 and U2 are in T, then their intersection is also in T.
 
fair point, depending where you start from you can do it stright from the defintion of the sets in T, but those sets are the open sets
 
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