Thread:

1. Cantor set question

Let $C$ represent the Cantor set.

Q: Show that there exists $x_{1},y_{1}\in{C}$ satisfying $x_{1}+y_{1}=s\in[0,2]$.

I found some work that goes like this...

$C_{1}=[0,1/3]\cup[2/3,1]$. Then we have, $[0,1/3]+[0,1/3]=[0,1/3]\cup[0,2/3]+[2/3,1]=[2/3,4/3]\cup[2/3,1]<br /> +[2/3,1]$. So, $C_{1}+C_{1}=[0, 2/3]\cup[2/3, 4/3]\cup[4/3, 2]=[0, 2]$. Thus, for all $s\in[0, 2]$, we can find an $x_{1} , y_{1}$ $C_{1}$ satisfying $x_{1} + y_{1} = s$

I am not sure that I follow exactly what is being done. Can someone help me to understand the work above. Do I think of these intervals as only lengths?

thanks

2. Originally Posted by Danneedshelp
Let $C$ represent the Cantor set.

Q: Show that there exists $x_{1},y_{1}\in{C}$ satisfying $x_{1}+y_{1}=s\in[0,2]$.

I found some work that goes like this...

$C_{1}=[0,1/3]\cup[2/3,1]$. Then we have, $\color{blue}[0,1/3]+[0,1/3]=[0,1/3]\cup[0,2/3]+[2/3,1]=[2/3,4/3]\cup[2/3,1]<br /> +[2/3,1]$. So, $C_{1}+C_{1}=[0, 2/3]\cup[2/3, 4/3]\cup[4/3, 2]=[0, 2]$. Thus, for all $s\in[0, 2]$, we can find an $x_{1} , y_{1}$ $C_{1}$ satisfying $x_{1} + y_{1} = s$

I am not sure that I follow exactly what is being done. Can someone help me to understand the work above. Do I think of these intervals as only lengths?
$C_1+C_1$ means the set of all numbers that are equal to an element of $C_1$ plus an element of $C_1$. But $C_1 = [0,1/3]\cup[2/3,1]$. By adding two numbers from the interval [0,1/3] you can get anything in the interval [0,2/3]. By adding a number from the interval [0,1/3] and a number from the interval [2/3,1] you can get anything in the interval [2/3,4/3]. By adding two numbers from the interval [2/3,1] you can get anything in the interval [4/3,2]. Putting those facts together, you see that by adding two numbers from the set $C_1$ you can get anything in the interval [0,2]. That is what is meant by the line $C_{1}+C_{1}=[0, 2/3]\cup[2/3, 4/3]\cup[4/3, 2]=[0, 2]$. (The previous line, which I have highlighted in blue, seems totally confused.) Therefore, for any $s\in[0,2]$, we can find $x_1,\ y_1 \in C_1$ with $x_1+y_1=s$.

That is just the first stage of this proof. You need to go on to show that $C_n+C_n = [0,2]$ for each of the sets $C_n$ used in the construction of the Cantor set. So there exist $x_n,\ y_n \in C_n$ with $x_n+y_n=s$. Finally, you need to show that a subsequence of the sequence $(x_n)$ converges to a point x in the Cantor set. The corresponding subsequence of the $y_n$s will then converge to a point y in the Cantor set, with x+y=s.
{"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": 35, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": false, "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.9466156959533691, "perplexity_flag": "head"}