# Thread:

1. ## Proving union and intersection of indexed family of sets

I have to prove that the union for n an element of the natural numbers of the indexed set D=(-n,1/n) is equal to (-infinity,1).
And that the intersection for n an element of the natural numbers of the indexed set D=(-n,1/n) is equal to (-1,0].

I've asked the professor twice now for help and he hasn't been able to explain it at all.

2. ## Re: Proving union and intersection of indexed family of sets

show inclusions in both directions.
for the intersection :what x is between -n and 1/n for all n?

3. ## Re: Proving union and intersection of indexed family of sets

Originally Posted by skippenmydesign
I have to prove that the union for n an element of the natural numbers of the indexed set D=(-n,1/n) is equal to (-infinity,1).
And that the intersection for n an element of the natural numbers of the indexed set D=(-n,1/n) is equal to (-1,0].
I think you are confused by the notation.
Let $D_n = \left( { - n,\frac{1}{n}} \right)$.
Now consider two examples: $D_3 \cup D_1 = \left( { - 3,1} \right)\;\& \;D_3 \cap D_1 = \left( { - 1,\frac{1}{3}} \right)$

Now let's do an indexed example:
$\bigcup\limits_{k = 1}^{100} {D_k } = \left( { - 100,1} \right)\;\& \;\bigcap\limits_{k = 1}^{100} {D_k } = \left( { - 1,\frac{1}{{100}}} \right)$

Note how the right and left endpoints are limits.
Do you see how it works?

4. ## Re: Proving union and intersection of indexed family of sets

Ok, I'm not familiar with latex so I can't get this into symbolic form but I'm going to attach a picture of what the question is. I have to prove it using the definition that for two things to be equal they each have to be a subset of the other.
Attached Thumbnails

5. ## Re: Proving union and intersection of indexed family of sets

Originally Posted by skippenmydesign
Ok, I'm not familiar with latex so I can't get this into symbolic form but I'm going to attach a picture of what the question is. I have to prove it using the definition that for two things to be equal they each have to be a subset of the other.
Frankly I have no idea why you posted exactly what you posted exactly what I had already posted.
$\lim _{n \to \infty } \bigcup\limits_{k = 1}^n {D_k } = \left( { - \infty ,1} \right)\;\& \,\;\;\lim _{n \to \infty } \bigcap\limits_{k = 1}^n {D_k } = \left( { - 1,0} \right]$

BTW: Why not learn to use LaTeX?

6. ## Re: Proving union and intersection of indexed family of sets

because I need a proof for the answer? not the answer itself? I know the answer but not the proof for it.

7. ## Re: Proving union and intersection of indexed family of sets

Also like I said I know from talking to the professor that the proof needs to use the definition of for things to be equal they have to be subsets of each other. I hope that is clear.

Also I might learn latex sometime but not tonight!

8. ## Re: Proving union and intersection of indexed family of sets

try proving this "in-between" step:

for the first problem-

show that if k < m, that (Dk)U(Dm) = (-m,1/k). what is the smallest k can be, and what is the largest m can be?

for the second problem-

show that for k < m that (Dk)∩(Dm) = (-k,1/m). again: how small can k be, and how large can m be?

(the answer for k in both cases should be "easy". answering for m might take a little thought).

try drawing a picture with k = 3, and m = 4. draw another one with k = 1, and m = 10. what do you notice?
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 4, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9450997710227966, "perplexity_flag": "middle"}