{"id":259,"date":"2016-09-30T08:28:02","date_gmt":"2016-09-30T12:28:02","guid":{"rendered":"http:\/\/blog.richmond.edu\/math320\/?p=259"},"modified":"2017-08-22T17:01:30","modified_gmt":"2017-08-22T21:01:30","slug":"5-fun-facts-about-cantor-set","status":"publish","type":"post","link":"https:\/\/blog.richmond.edu\/math320\/2016\/09\/30\/5-fun-facts-about-cantor-set\/","title":{"rendered":"5 fun facts about Cantor Set"},"content":{"rendered":"
\"cantor

Photo by Det Springende Punkt<\/a> <\/a><\/small><\/p><\/div>\n

The first time that we heard about Cantor’ s name was in Chapter one of abbott’s text “Understanding Analysis”, which talks about Georg Cantor’s proof of uncountability of real numbers. This post explores 5 fun facts of a set that is named after him – the Cantor set.<\/p>\n

Here is the construction of Cantor set:<\/strong><\/p>\n

Let \"C_{0} be the closed interval \"[0,1]\" and define\u00a0\"C_{1} as the set that results when the open middle third of\u00a0\"C_{0} is removed.\u00a0\"C_{1}.<\/p>\n

Similarly,\u00a0\"C_{2} is the set that results when the open middle third of each of the two intervals in\u00a0\"C_{1} is removed.\u00a0\"C_{2}.<\/p>\n

Continue in this process and we can construct\u00a0\"C_{n} consisting of\u00a0\"2^{n}\" closed intervals each having length of\u00a0\"\dfrac{1}{3^{n}}\". The Cantor set C is defined as \"C=<\/p>\n

The picture above demonstrates the process of the construction of the Cantor set. The numbers represent the number of intervals remaining and the fractions represent the length of open intervals removed.<\/p>\n

Fun Fact #1: Zero length<\/strong><\/p>\n

To form \"C_{1}, an open interval of length \"\dfrac{1}{3}\"\u00a0was removed. Length of \"\dfrac{1}{3}\" in total was removed.<\/p>\n

To form \"C_{2}, two open interval of length \"\dfrac{1}{9}\" was removed.Length of \"2*\dfrac{1}{9}\" in total was removed.<\/p>\n

To form \"C_{3}, four\u00a0open interval of length \"\dfrac{1}{27}\" was removed.Length of \"3*\dfrac{1}{27}\" in total was removed.<\/p>\n

Continue in this fashion, to form \"C_{n}, \"2^{n-1}\" open interval of length \"\dfrac{1}{3^{n}}\" was removed.\"2^{n-1}*\u00a0was removed.<\/p>\n

Thus, the total length removed is<\/p>\n

\"\sum^{\infty}_{n=0}\dfrac{1}{3}\left(\dfrac{2}{3}\right)^{n}.<\/p>\n

Since the total length removed is 1, the length of Cantor set is zero<\/em>.<\/p>\n

Fun Fact #2: Uncountable<\/strong><\/p>\n

It seems that the Cantor set is a very small and thin set, and intuitively we might think of it as a countable or even finite set. Surprisingly, the Cantor set is\u00a0actually uncountable with cardinality equal to the cardinality of real numbers.<\/p>\n

As we have proved in the first chapter of the book, the set [0,1] is uncountable. We can create a onto function \"f(x)\" that maps the Cantor set to the uncountable set [0,1]. According to the book\u00a0Counterexamples in Topology, “If \"x\in is written uniquely to the base 3 without using the digit 1, \"f(x)\" is the point in \"[0,1]\" whose binary expansion is obtained by replacing each digit ‘2’ in the ternary expansion of x by the digit ‘1’.” This onto function shows that the cardinality of the Cantor set is equal to or greater than the cardinality of real numbers. However, since the Cantor set is a subset of the real numbers, then\u00a0cardinality of the Cantor set is equal to or less\u00a0than the cardinality of real numbers. Thus, the cardinalities of the Cantor set and real numbers are the same.\u00a0This result is really surprising, especially because the length of Cantor set is zero.\u00a0If you are interested in this proof, you can read more here:\u00a0https:\/\/www.maths.tcd.ie\/~levene\/221\/pdf\/cantor.pdf<\/p>\n

Fun Fact #3: Fractal dimension<\/strong><\/p>\n

A point has a dimension of zero, a line has dimension one, a square has dimension two, and a cube has dimension three…<\/p>\n

How will they change if we magnify each length by a 3?<\/p>\n

A point undergoes no changes (\"3^{0}\"), a line triples in length (\"3^{1}\"), a square contains 9 copies of original square (\"3^{2}\") and a cube contains 27 copies of original cube (\"3^{3}\").\u00a0The new copies is equal to the magnification factor to the power of dimension.<\/p>\n

What is the dimension for Cantor set?<\/p>\n

The Cantor set starts with \"C_{0} with\u00a0the closed interval \"[0,1]\", and we want to magnify the Cantor set by starting with\u00a0the closed interval \"[0,3]\". Deleting open interval of the middle third of the closed interval \"[0,3]\", we will get \"[0,1], which is a starting point for exactly two Cantor set.<\/p>\n

In this fashion, using a magnification factor of 3, we have two copies of the original set. Solve\u00a0\"2=3^{x}\", we can get x(dimension) =\"\dfrac{log. Thus, the Cantor set has a fractal dimension of \"\dfrac{log.<\/p>\n

Fun Fact #4:\u00a0Closed\u00a0<\/strong><\/p>\n

One way to determine if a set \"C is closed is to check if it contains all of its limit points. It is also true that an intersection of closed sets is always closed. Because the Cantor set is the intersection of an arbitrary collection of closed sets, the Cantor set is closed.<\/p>\n

Fun Fact #5: Compact<\/strong><\/p>\n

A set \"C is compact if every sequence in C has a subsequence that converges to a limit that is also in C. Also,\u00a0Another characterization of compactness is that set \"C is compact if and only if it is closed and bounded. Since the Cantor set is constructed from closed interval [0,1], the Cantor set is bounded. Because the Cantor set is bounded and is closed as we proved in Fun Fact #4, it is compact!!<\/p>\n

————————————————————————————————————<\/p>\n

Reference:<\/strong><\/p>\n