Prove Sums of Cantor Sets in [0,2]

  • Thread starter Thread starter kathrynag
  • Start date Start date
  • Tags Tags
    Cantor Sets Sums
kathrynag
Messages
595
Reaction score
0
I'm supposed to show that the sum C+C ={x+y,x,y in C}=[0,2]
a) Show there exist x1,y1 in C1 for which x1+y1=s. Show in general for any arbitrary n in the naturals, we can always find xn, yn in Cn for which xn+yn=s.
b) Keeping in mind that the sequences xn and yn do not necessarily converge show show that they never the less be used to produce the desired x and y in C satisfying x+y=s.


a) Let's be in [0,2]
C1=[0,1/3]U[2/3,1]
That's about as far as I get and then I get stuck.
 
Physics news on Phys.org
I also considered writing x as a^i/3^i where a is in {0,1} but not sure what else to do
 
I would guess from your title that C is the Cantor trinary set but it would have been better if you had said so. And I have no idea what C1, C2, or Cn is.
 
I'm assuming C is the Cantor set since the problem is dealing with Cantor sets, but the problem doesn't explicitly say what C is.
 
I say earlier in my book some talk about cantor sets with C1=C0\(1/3,2/3)=[0,1/3]U[2/3,1]
C2=([0,1/9)U[2/3,1/3])U([2/3,7/9]U[8/9,1])
 
Cantor set C=intersection(C_n)
 
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