I'm really struggling with this question.
"Let {An}n∈N be a family of subsets of a set S. Let
X:=⋃n∈N(⋂k≥nAk),Y:=⋂n∈N(⋃k≥nAk).
Does any of the relations X ⊂ Y, X = Y, Y ⊂ X hold?"
Currently, by using the definition of Unions and Intersections I already proved that X ⊂ Y. However I'm stuck trying to prove whether the inverse, Y ⊂ X holds. Intuitively, something tells me that Y ⊂ X holds, but I can't prove it correctly. I would appreciate some help. Thanks.
Answer
Suppose A2k={1}, and A2k+1={2}, for all k≥0; i.e. the even-indexed sets are all the same, and the odd-indexed sets are also all the same. You will find that X=∅ while Y={1,2}.
No comments:
Post a Comment