Proof about operations on sets

chocolatelover
Messages
238
Reaction score
0

Homework Statement


Let the set Ar: r is an element of all real numbers and the set Br: r is an element of all real numbers be two indexed families of sets.

Prove that (upside U r is an element of the reals Ar) U (upside U r is an element of the reals Br) is a subset of upside U r is an element of the reals (ArUBr).


Homework Equations





The Attempt at a Solution



Could someone please give me a hint? I know that Ar and Br have to be unions of each other and at the same they are subsets of the other one, but I don't really know how I would go about proving this.

Thank you much
 
Physics news on Phys.org
That's kind of hard to read. But if x is an element of the left hand side, then it's either in all of the A_r or it's in all of the B_r. If x is in the right hand side then it's in either A_r or B_r for all r. Assume each of the conditions on the left and prove they imply the right.
 
Thank you very much

Regards
 
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