{"id":990,"date":"2017-10-06T23:08:05","date_gmt":"2017-10-07T03:08:05","guid":{"rendered":"http:\/\/blog.richmond.edu\/math320\/?p=990"},"modified":"2017-10-08T20:31:52","modified_gmt":"2017-10-09T00:31:52","slug":"the-cantor-set-2","status":"publish","type":"post","link":"https:\/\/blog.richmond.edu\/math320\/2017\/10\/06\/the-cantor-set-2\/","title":{"rendered":"The Cantor Set"},"content":{"rendered":"<p>By Nick Wan and Elaine Wissuchek<\/p>\n<p><strong>Introduction to the Cantor Set<\/strong><\/p>\n<p><img data-recalc-dims=\"1\" loading=\"lazy\" decoding=\"async\" class=\"alignnone size-medium\" src=\"https:\/\/i0.wp.com\/s3.amazonaws.com\/illustrativemathematics\/images\/000\/001\/024\/large\/Task_1_402b282318c657a6bc5ba4cc59de8a8b.jpg?resize=400%2C270&#038;ssl=1\" width=\"400\" height=\"270\" \/><\/p>\n<p>Cantor set is a special subset of the closed interval [0, 1] invented by a German mathematician Georg Cantor in 1883. In order to construct this set, we need to construct infinitely many subset of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5B0%2C+1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"[0, 1]\" class=\"latex\" \/> inductively and take the intersection of all of them. Specifically:<\/p>\n<p>Let <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_0+%3A%3D+%5B0%2C+1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_0 := [0, 1]\" class=\"latex\" \/>. Remove the open middle third <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%281%2F3%2C+2%2F3%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(1\/3, 2\/3)\" class=\"latex\" \/> from <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_0\" class=\"latex\" \/>.<\/p>\n<p>Let <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_1%3A+%3D+%5B0%2C+1%2F3%5D%5Ccup%5B2%2F3%2C+1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_1: = [0, 1\/3]&#92;cup[2\/3, 1]\" class=\"latex\" \/>, precisely <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_1+%3D+I_0%5Csetminus+%281%2F3%2C+2%2F3%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_1 = I_0&#92;setminus (1\/3, 2\/3)\" class=\"latex\" \/>. Remove middle third open intervals <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%281%2F9%2C+2%2F9%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(1\/9, 2\/9)\" class=\"latex\" \/> and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%287%2F9%2C+8%2F9%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(7\/9, 8\/9)\" class=\"latex\" \/> from the respective closed intervals whose union is <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_1&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_1\" class=\"latex\" \/>.<\/p>\n<p>Let <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_2%3A+%3D+%5B0%2C+1%2F9%5D%5Ccup%5B2%2F9%2C+3%2F9%5D%5Ccup%5B6%2F9%2C+7%2F9%5D%5Ccup%5B8%2F9%2C+9%2F9%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_2: = [0, 1\/9]&#92;cup[2\/9, 3\/9]&#92;cup[6\/9, 7\/9]&#92;cup[8\/9, 9\/9]\" class=\"latex\" \/> say, <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_2%5E1%5Ccup+I_2%5E2%5Ccup+I_2%5E3%5Ccup+I_2%5E4&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_2^1&#92;cup I_2^2&#92;cup I_2^3&#92;cup I_2^4\" class=\"latex\" \/>.<\/p>\n<p>Continue this procedure of removal of open intervals from each closed interval <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I%5Ek_j&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I^k_j\" class=\"latex\" \/> where <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=1%5Cleq+k+%5Cleq+2%5Ej&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"1&#92;leq k &#92;leq 2^j\" class=\"latex\" \/> whose union is <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_j\" class=\"latex\" \/> where <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=j+%3D+3%2C+4%2C..+&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"j = 3, 4,.. \" class=\"latex\" \/> and get <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_%7B%28j%2B1%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_{(j+1)}\" class=\"latex\" \/> by taking the union of whatever is left from each <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I%5Ek_j&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I^k_j\" class=\"latex\" \/> after the removal of open intervals as before.<\/p>\n<p>Define the Cantor set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C%3A%3D+%5Ccap_%7Bn%3D1%7D%5E%7B%5Cinfty%7D+I_n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C:= &#92;cap_{n=1}^{&#92;infty} I_n\" class=\"latex\" \/>.<\/p>\n<p>Another way to view the Cantor set is in terms of ternary expansions:<\/p>\n<p>Given <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x%5Cin+%280%2C1%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x&#92;in (0,1)\" class=\"latex\" \/> a real number, there is a sequence of integers <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28a_k%29%5E%7B%5Cinfty%7D_%7Bk%3D1%7D%2C+a_k%5Cin+%5C%7B0%2C1%2C2%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(a_k)^{&#92;infty}_{k=1}, a_k&#92;in &#92;{0,1,2&#92;}\" class=\"latex\" \/> with <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k&#92;in &#92;mathbb{N}\" class=\"latex\" \/> such that the series <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Csum_%7Bk%3D1%7D%5E%7B%5Cinfty%7D+%5Cfrac%7Ba_k%7D%7B3%5Ek%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;sum_{k=1}^{&#92;infty} &#92;frac{a_k}{3^k}\" class=\"latex\" \/> converges to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x\" class=\"latex\" \/>. In other words, we can write <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x\" class=\"latex\" \/> in a ternary form: <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x%3D0.a_1+a_2+a_3+...&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x=0.a_1 a_2 a_3 ...\" class=\"latex\" \/> (base 3). For example, <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cfrac%7B1%7D%7B9%7D%3D%280.01000...%29_3&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;frac{1}{9}=(0.01000...)_3\" class=\"latex\" \/>.<\/p>\n<p>In the case or our Cantor set, any point <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x\" class=\"latex\" \/> in <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C\" class=\"latex\" \/> has the following ternary expansion:<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x%3D%5Csum_%7Bi%3D1%7D%5E%7B%5Cinfty%7D+%5Cfrac%7Bd_k%7D%7B3%5Ek%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x=&#92;sum_{i=1}^{&#92;infty} &#92;frac{d_k}{3^k}\" class=\"latex\" \/> with all <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_k%5Cin%5C%7B0%2C2%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_k&#92;in&#92;{0,2&#92;}\" class=\"latex\" \/> from the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=a_k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"a_k\" class=\"latex\" \/>.<\/p>\n<p>For example, the element of the Cantor set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x%3D%5Cfrac%7B1%7D%7B3%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x=&#92;frac{1}{3}\" class=\"latex\" \/> corresponds to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_k%3D%280%2C2%2C2%2C2%2C2%2C2%2C2%2C...%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_k=(0,2,2,2,2,2,2,...)\" class=\"latex\" \/> and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x%3D%5Cfrac%7B2%7D%7B3%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x=&#92;frac{2}{3}\" class=\"latex\" \/> corresponds to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_k%3D%282%2C0%2C0%2C0%2C0%2C0%2C0%2C...%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_k=(2,0,0,0,0,0,0,...)\" class=\"latex\" \/>.<\/p>\n<p><strong>Uncountability of the Cantor Set by Diagonalization<\/strong><\/p>\n<p>We can use Cantor&#8217;s diagonalization method to show that the Cantor set is not countable.<\/p>\n<p>Let <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29%3D%5C%7B%C2%A0%28d_k%29_n+%3A+n+%5Cin+%5Cmathbb%7BN%7D%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n)=&#92;{\u00a0(d_k)_n : n &#92;in &#92;mathbb{N}&#92;}\" class=\"latex\" \/> be a sequence so that each <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=v_n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"v_n\" class=\"latex\" \/> represents an element of the Cantor set. Let all\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29+%5Cin+V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n) &#92;in V\" class=\"latex\" \/>. Assume that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f%3A%5Cmathbb%7BN%7D+%5Crightarrow+V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f:&#92;mathbb{N} &#92;rightarrow V\" class=\"latex\" \/> is a one-to-one correspondence between the natural numbers and the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"V\" class=\"latex\" \/> so that the elements of the cantor set are countable.<\/p>\n<p>Consider\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29%5E%2A+%5Cin+V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n)^* &#92;in V\" class=\"latex\" \/> where <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29%5E%2A%3D%5C%7B%C2%A0%28d_k%29_n%5E%2A+%3D2&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n)^*=&#92;{\u00a0(d_k)_n^* =2\" class=\"latex\" \/> if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28d_n%29_n+%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(d_n)_n =0\" class=\"latex\" \/> and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28d_k%29_n%5E%2A+%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(d_k)_n^* =0\" class=\"latex\" \/> if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28d_n%29_n+%3D2&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(d_n)_n =2\" class=\"latex\" \/> for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28d_k%29_n%5E%2A+%5Cin%C2%A0%28v_n%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(d_k)_n^* &#92;in\u00a0(v_n)\" class=\"latex\" \/> and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28d_n%29_n+%5Cin%C2%A0%28v_n%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(d_n)_n &#92;in\u00a0(v_n)\" class=\"latex\" \/>. Therefore <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n)^*\" class=\"latex\" \/> will be distinct from any\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29+%5Cin+V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n) &#92;in V\" class=\"latex\" \/> in the <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/>th position. Thus for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28v_n%29%5E%2A+%5Cin+V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(v_n)^* &#92;in V\" class=\"latex\" \/>, we cannot find an <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%5Cin%C2%A0%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n&#92;in\u00a0&#92;mathbb{N}\" class=\"latex\" \/> for which <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f%28n%29%3D%28v_n%29%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f(n)=(v_n)^*\" class=\"latex\" \/>, so <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f\" class=\"latex\" \/> is not onto, a contradiction to the one-to-one correspondence of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f\" class=\"latex\" \/>. Hence by contradicting the definition of countability, that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BN%7D+%5Csim+V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;mathbb{N} &#92;sim V\" class=\"latex\" \/>, <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"V\" class=\"latex\" \/> is uncountable. Since all elements of the cantor set are represented in <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"V\" class=\"latex\" \/>, the Cantor set is uncountable.<\/p>\n<p><strong>The Cantor Set is Closed <\/strong><\/p>\n<p>Each <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=In&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"In\" class=\"latex\" \/> is a union of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=2%5En&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"2^n\" class=\"latex\" \/> closed intervals. As a finite union of closed intervals, it is a closed set in <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5B0%2C+1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"[0, 1]\" class=\"latex\" \/>. Then <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C\" class=\"latex\" \/> is a closed subset of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5B0%2C+1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"[0, 1]\" class=\"latex\" \/> being the intersection of closed sets <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=I_n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"I_n\" class=\"latex\" \/> for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n+%3D+1%2C+2..&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n = 1, 2..\" class=\"latex\" \/><\/p>\n<p><strong>The Cantor Set is perfect<\/strong><\/p>\n<p>A set is considered perfect if the set is closed and all the points of the set are limit points of the set. For each endpoint in the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C\" class=\"latex\" \/> there will always exist another point in the set within a deleted neighborhood of some radius <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon &gt; 0\" class=\"latex\" \/> on one side of that point since the remaining intervals at each step are being divided into infinitely small subintervals and since the real numbers are infinitely dense. Likewise, for each nonendpoint in the set there will always exist another point in the set within a deleted neighborhood of some radius <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon &gt; 0\" class=\"latex\" \/> on both sides of that point. Hence, all deleted neighborhoods of any radius <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon &gt; 0\" class=\"latex\" \/> around each point of the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C\" class=\"latex\" \/> for which the intersection of that deleted neighborhood and the set are nonempty. Therefore, each point in the set is a limit point of the set, and since the set is closed, the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C\" class=\"latex\" \/> is perfect.<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Dimension of the Cantor Set<\/strong><\/p>\n<p>Definition: Dimension<\/p>\n<ul>\n<li>The Topological Definition: A set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"S\" class=\"latex\" \/> is of dimension <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/> when each point <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=s%5Cin+S&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"s&#92;in S\" class=\"latex\" \/> has an <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon\" class=\"latex\" \/> neighborhood whose boundaries meet other points in a set of dimension <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k-1&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k-1\" class=\"latex\" \/> and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/> is the lease non-negative integer for which this holds.<\/li>\n<\/ul>\n<p>The empty set has a topological dimension (<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_T&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_T\" class=\"latex\" \/>) of -1. Consider a finite set of points <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/>\u00a0because by the definition of isolated points, they are not limit points, so there exists an\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon\" class=\"latex\" \/> neighborhood that does not intersect\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/>. Instead, this\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon\" class=\"latex\" \/> neighborhood intersects the empty set, so a finite set of points will have\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_T%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_T=0\" class=\"latex\" \/>.<\/p>\n<p>Notice that we can choose <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%28%5Cfrac%7B1%7D%7B3%7D%29%5E%7Bn%2B1%7D%3C%5Cvarepsilon+%3C2%28%5Cfrac%7B1%7D%7B3%7D%29%5E%7Bn%2B1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"(&#92;frac{1}{3})^{n+1}&lt;&#92;varepsilon &lt;2(&#92;frac{1}{3})^{n+1}\" class=\"latex\" \/> for any <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> so that\u00a0there exists an\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon\" class=\"latex\" \/> neighborhood that does not intersect the Cantor set. Instead, this\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon\" class=\"latex\" \/> neighborhood intersects the empty set, so the Cantor set&#8217;s topological dimension (<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_T&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_T\" class=\"latex\" \/>) is 0.<\/p>\n<p>However, this does not account for the infinite number of points that will still exist within the defined epsilon neighborhood of the point in the cantor set, wherever <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cvarepsilon+%5Cleq+%28%5Cfrac%7B1%7D%7B3%7D%29%5E%7Bn%2B1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;varepsilon &#92;leq (&#92;frac{1}{3})^{n+1}\" class=\"latex\" \/>. The Topological definition of dimension is further limited because it does not describe the way the cantor set scales well. To fix these problems, we turn to a definition that allows for fractional dimensions.<\/p>\n<ul>\n<li>The Hausdorff-Besicovitch Definition: The exponent <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d\" class=\"latex\" \/> that a scale factor <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cfrac%7B1%7D%7Bk%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;frac{1}{k}\" class=\"latex\" \/> must take so that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k%5Ed%3DN&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k^d=N\" class=\"latex\" \/> where <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"N\" class=\"latex\" \/> is the number of scaled objects needed to create the original object.<\/li>\n<\/ul>\n<p>When the Cantor set is scaled to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cfrac%7B1%7D%7Bk%7D%3D%5Cfrac%7B1%7D%7B3%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;frac{1}{k}=&#92;frac{1}{3}\" class=\"latex\" \/> of its original size, it takes <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=N%3D2&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"N=2\" class=\"latex\" \/> of the scaled objects to recreate the original Cantor set. Thus <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=3%5Ed%3D2&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"3^d=2\" class=\"latex\" \/>. <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d%3D%5Cfrac%7Bln2%7D%7Bln3%7D%5Capprox+.631&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d=&#92;frac{ln2}{ln3}&#92;approx .631\" class=\"latex\" \/> The Cantor set&#8217;s HB dimension (<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_%7BHB%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_{HB}\" class=\"latex\" \/>) <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Capprox+.631&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;approx .631\" class=\"latex\" \/>.<\/p>\n<p>Not only is\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_%7BHB%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_{HB}\" class=\"latex\" \/> a fraction,\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_%7BHB%7D%3E%C2%A0d_T&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_{HB}&gt;\u00a0d_T\" class=\"latex\" \/>, whereas typically <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d_%7BHB%7D%3Dd_T&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d_{HB}=d_T\" class=\"latex\" \/> when <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=d%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"d&#92;in &#92;mathbb{N}\" class=\"latex\" \/>.<\/p>\n<p>References:<\/p>\n<p><a href=\"http:\/\/www.ias.ac.in\/article\/fulltext\/reso\/019\/11\/1000-1004\">http:\/\/www.ias.ac.in\/article\/fulltext\/reso\/019\/11\/1000-1004<\/a><\/p>\n<p><a href=\"http:\/\/www.iiserpune.ac.in\/~supriya\/teaching\/Topology-MTH322\/files\/CantorSet.pdf\">http:\/\/www.iiserpune.ac.in\/~supriya\/teaching\/Topology-MTH322\/files\/CantorSet.pdf<\/a><\/p>\n<p><a href=\"http:\/\/studylib.net\/doc\/11695972\/an-exploration-of-the-cantor-set-introduction\">http:\/\/studylib.net\/doc\/11695972\/an-exploration-of-the-cantor-set-introduction<\/a><\/p>\n<p><a href=\"http:\/\/blog.mathteachersresource.com\/?p=848\">http:\/\/blog.mathteachersresource.com\/?p=848<\/a><\/p>\n<p><a href=\"https:\/\/ocw.mit.edu\/courses\/mathematics\/18-091-mathematical-exposition-spring-2005\/lecture-notes\/lecture11part1.pdf\">https:\/\/ocw.mit.edu\/courses\/mathematics\/18-091-mathematical-exposition-spring-2005\/lecture-notes\/lecture11part1.pdf<\/a><\/p>\n<p><a href=\"https:\/\/wakespace.lib.wfu.edu\/bitstream\/handle\/10339\/39274\/Walsh_wfu_0248M_10559.pdf\">https:\/\/wakespace.lib.wfu.edu\/bitstream\/handle\/10339\/39274\/Walsh_wfu_0248M_10559.pdf<\/a><\/p>\n<p><a href=\"https:\/\/s3.amazonaws.com\/illustrativemathematics\/images\/000\/001\/024\/large\/Task_1_402b282318c657a6bc5ba4cc59de8a8b.jpg?1341153948\">https:\/\/s3.amazonaws.com\/illustrativemathematics\/images\/000\/001\/024\/large\/Task_1_402b282318c657a6bc5ba4cc59de8a8b.jpg?1341153948<\/a>(Image)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>By Nick Wan and Elaine Wissuchek Introduction to the Cantor Set Cantor set is a special subset of the closed interval [0, 1] invented by a German mathematician Georg Cantor in 1883. In order to construct this set, we need to construct infinitely many subset of inductively and take the intersection of all of them. [&hellip;]<\/p>\n","protected":false},"author":3528,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[58818],"tags":[],"class_list":["post-990","post","type-post","status-publish","format-standard","hentry","category-class-blogs"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p7L4E1-fY","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/990","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/users\/3528"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/comments?post=990"}],"version-history":[{"count":0,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/990\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/media?parent=990"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/categories?post=990"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/tags?post=990"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}