discrete Project Roshdy

Maco153 Dec 9th, 2019 126 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. \documentclass[12pt, a4paper]{article}
  2. \usepackage[utf8]{inputenc}
  3. \usepackage{amsthm}
  4. \usepackage{amsmath, amssymb}
  5. \usepackage{xcolor}
  7. \theoremstyle{plain}
  8. \newtheorem{theorem}{Theorem}[section]
  9. \newtheorem{corollary}[theorem]{Corollary}
  10. \newtheorem{definition}[theorem]{Definition}
  11. \newtheorem{example}[theorem]{Example}
  13. \parindent=0mm
  14. \parskip=1.9mm
  15. \linespread{1.1}
  17. \renewcommand\qedsymbol{$\blacksquare$}
  18. \renewcommand{\restriction}{\mathord{\upharpoonright}}
  20. \binoppenalty=\maxdimen
  21. \relpenalty=\maxdimen
  23. \title{Cantor's Paradise}
  24. \author{Mohamed Roshdy \\ \\ The American University in Cairo}
  25. %\email{}
  26. %\address{The American University in Cairo}
  29. \begin{document}
  30. \maketitle
  32. \textcolor{red}{}
  34. \textbf{Abstract.}
  36. \textcolor{blue}{In this paper, we will begin by a summary of Cantor's life and highlights of his most significant theorems. Then we will introduce some definitions about sets and countability of sets. After that, we will prove one of Cantor's theorem and two corollaries using the previous theorem.}
  38. \section{Cantor's Life}
  40. \textcolor{blue}{ Georg Cantor was born in Saint Petersburg on the 3rd of March 1845 to Danish parents. His mother Marie came from a family famous for music. His father Georg Woldemar was a very successful businessman who helped his son in may situations with his great advice, however, he also tried to convince him to study engineering rather than mathematics as he thought it was more promising. His education was not much different of the education of all the great minds, he showed early signs of excellence, which resulted in an early recognition of his talent at a very early age. At first, he received private tutoring lessons in Saint Petersburg, then he attended private school in Frankfurt at the Darmstadt nonclassical school, that was before he got into the Wiesbaden Gymnasium in 1860. He graduated from the Realshule in Darmstadt in 1862 to begin his university studies. He actually started his university education as an engineering student, he studied engineering for two years at Höheren Gewerbschule, before switching to the Swiss Federal Politechnic to study mathematics, then after his father died he transferred to the University of Berlin. In Berlin, he attended lectures by some great mathematicians. His huge interest in math affected his earliest work hugely. After receiving his PH.D he left Berlin to work as a Privatdozent at Hale University to work under Eduard Heine the professor of mathematics there. Some people claimed that the reason for Cantor’s groundbreaking work can be actually traced back to his very early post graduation publications. As a matter of fact, one could actually find traces of his early work in his later work. His first paper titled “On a theorem concerning the trigonometric series” was completed and published in march of 1870. In this paper he presented Cantor’s Uniqueness Theorem, which states that every function can only have a maximum of one representation by a trigonometric series. In 1871, he strengthen his theorem by proving that it holds even if the series diverges at a finite number of points in any given interval, this result was attempted by a handful of known mathematicians before him, but none of them could prove to be true. His second paper, which was published in 1872, extended the results of his first paper and strengthened it further. He proved that his theorem holds even if the trigonometric series diverges at an infinite number of points. In the same year, he provided a definition of real numbers, which earned him a promotion to associate professor at Halle University in the same year. Later in the same year, Cantor met Richard Dedekind for the first time. Richard was a mathematics professor at the Technische Hochshule at Brunswick. He previously published a paper related to the topic of real numbers. Cantor and him exchanged letters over the years. In one of their letters in 1973, Cantor sent a letter to Dedekind, which contained a proof, which states that the real numbers cannot be put in one-to-one correspondence with the natural numbers. Two days later, Cantor sent him a simpler proof, Dedekind approved of the proof. Cantor’s work in the period between 1873-1884 led to the creation of the set theory. The origins of set theory is traced back to some of his earlier work, mainly a single paper he published in 1874 titled “On a Property of the Collection of All Real Algebraic Numbers.”. The paper was published just before Cantor turned 30 years old, this shows how successful he was at such a young age. His paper introduced three main points, which are the set of algebraic numbers is countable, in every interval [a,b] there are infinitely many numbers not included in sequence, which means that the set of rea numbers are uncountably infinite. Cantor provided a definition of the concept of a set, his definition basically stated that a set is a collection of elements. He also provided the concept of countability, which stated that a countable set has the same cardinality as one of the subsets of the set of the natural numbers, which led to the definition of a countable set. He defines a set S to be countable if there exists an injective function from it (S) to the set of Natural numbers. In 1873, Cantor proved that the set of rational numbers are countable. A year later in 1874, Cantor proved that the set of real algebraic numbers are countable. In 1874, Cantor published his most fruitful work regarding the topic of countability, he published the paper that proves the uncountability of real numbers, which he was exchanging letter with Dedekind as mentioned earlier. In 1891, Cantor presented his diagonal argument, which is a simpler proof of the uncountability of the set of real numbers. Cantoor’s gave a definition of infinite sets, stating that a set is infinite only of there is a one-toone correspondence between A and a set X which is a proper set oof A. in 1878, Cantor provided a definition of cardinal numbers. Cantor also introduced the continuum hypothesis. He spent many years of his life attempting to prove the truth of his continuum hypothesis, he tried many different strategies, provided many proofs, but all of them were false. Cantor suffered his first serious mental breakdown in 1884, he had just returned from a trip to paris, most historians believe the breakdown occurred as a result of his dispute with Leopold Kronecker who had been refusing Cantor’s work and trying to hold him back. After his 1884 hospitalization, there was no record to show that he has been hospitalized again until 1899. That was the year his youngest son died and he reportedly lost his passion for mathematics then. In 1903, Julios Konig presented a paper which attempted to disprove the basic tenants of transfinite set theory, Cantor descriped it as public humiliation and it shook his believe in God, after he was a devout Christian his whole life. He was hospitalized many times in the following two to three years, he spent the last 20 years in depression and bad mental health until he died in 1918 of a heart attack. He never left Halle University.
  41. .}
  44. \section{Cantor's Theorem}
  46. \textcolor{red}{}
  48. We start by defining a set.
  50. \begin{definition}\rm
  51. A \textit{set} is a collection of objects.
  52. \end{definition}
  54. \begin{definition}\rm
  55. Let $A$ and $B$ be sets. We say that $A$ is a \textit{subset} of $B$, and write $A
  56. \subseteq B$ if \textcolor{blue}{$\forall x (x\in A \implies x\in B)$ }
  57. \end{definition}
  59. \begin{example}\rm The following are examples of subsets.
  60. \textcolor{red}{}
  61. \begin{enumerate}
  62.   \item The set of natural numbers is a subset of the set of integers.
  63.   \item The set of integers is a subset of the set of real numbers.
  64.   \item The empty set is a subset of any other set.
  65. \end{enumerate}
  66. \end{example}
  68. We are now ready to introduce the notion of a power set.  
  69. \begin{definition}\rm
  70. The \textit{power set} $\mathcal{P}(S)$ of a set $S$ is \textcolor{blue}{the set that contains the all the subsets of the subset}.
  71. \end{definition}
  73. \begin{example}
  74. \textcolor{blue}{let $A=\{5,10\}$ then $\mathcal{P}(A)=\{\{5\},\{10\},\phi, \{5,10\}\}$ \\
  75.                     $B=\{b\}$ then $\mathcal{P}(B)=\{b,\phi \}$  }
  76. \end{example}
  78. \begin{definition}\rm Let $A$ and $B$ be sets.
  79. \begin{itemize}
  80.   \item We say that the cardinality of $A$ is equal to the cardinality of $B$, and write $|A|=|B|$, if there is a \textcolor{blue}{ $bijection$ function f \colon A \to B}
  82.   \item We say that the cardinality of $A$ is less than or equal to the cardinality of $B$, and write $|A|\leq |B|$, if there is an \textcolor{blue}{ $injection$ function f \colon A \to B }
  84.   \item We say that the cardinality of $A$ is strictly less than the cardinality of $B$, and write $|A|<|B|$, if \textcolor{blue}{$|A|\leq|B| \hspace {0.1cm} and \hspace {0.1cm} |A|\neq|B|$}.
  86.   \item We say a set is \textit{countably infinite} if \textcolor{blue}{ there is a bijection function from the set of natural numbers $\mathbb {N}$ to the set}
  87. \end{itemize}
  88. \end{definition}
  90. We will now show that the set of integers is a countably infinite set.
  92. \begin{theorem}
  93. The set of integers $\mathbb{Z}$ is countably infinite.
  94. \end{theorem}
  96. \begin{proof}
  97. \textcolor{blue}{Let the domain of a function is $\mathbb {N}$ and the codomain is $\mathbb {Z}$,  where $f \colon \mathbb {N} \to \mathbb {Z} $ defined in the next line: \\
  98. \(f(n) =\[ \begin{cases}
  99.     \frac{-n}{2} & $ when n is even$\\
  100.     \frac{n+1}{2} & $when n is odd$\\
  101.  \end{cases}
  102. \]\\
  103. Both branches of the function are both bijective in this domain, so there is a bijection from $\mathbb {N}$ to $\mathbb {Z}$, so we proved that the set of integers is countably infinite.
  104. \end{proof}
  105. }
  107. \begin{theorem}[Cantor's Theorem]
  108. Let $S$ be any (finite or infinite) set. Then $|S|<|\mathcal{P}(S)|$.
  109. \end{theorem}
  110. \begin{proof}
  111. Let $S$ be any set.
  113. First, we will show that $S\leq \mathcal{P}(S)$ by deriving an injective function $g:S\to \mathcal{P}(S)$ where  $\(f(x)=\{x\}$ and as the codomain (power set) contains all the elements of the domain, all elements in the domain have exactly one image.
  115. \textcolor{red}{}
  117. Second, we will prove that $|S|\neq |\mathcal{P}(S)|$. For the sake of contradiction, assume that there is a bijection $h:S\to \mathcal{P}(S)$.
  119. \textcolor{blue}{First we assume that h is bijective for the sake of contradiction, so by definition it is surjective. Let us define a new set where:\\
  120. $B=\{s\in S \land s\notin h(x)\}$, so $B\in\mathcal{P}(S) $ and using surjectivity, $B=h(x)$ for some $x$ in the domain, and this creates a contradiction that $B$ contains only the elements which is in $S$ and not in the range of the function, so $h$ is not surjective}
  122. Therefore, we have shown that $|S| < |\mathcal{P}(S)|$.
  123. \end{proof}
  127. From Cantor's theorem we can deduce the following consequences.
  131. \begin{corollary}
  132. The power set of the natural numbers is uncountable.
  133. \end{corollary}
  135. \begin{proof}
  136. \textcolor{blue}{Applying Cantor's theorom, $|\mathbb{N}|<|\mathcal{P}(\mathbb{N})|$, so there is injection and there is no bijection $f\colon \mathbb{N} \to \mathcal{P}(\mathbb{N})$, for a set to be uncountable, there must not be any bijection, therefore the power set of the natural numbers is uncountable.}
  137. \end{proof}
  140. \begin{corollary}
  141. There is an infinite sequence $A_0, A_1, A_2, \ldots$ of infinite sets such that $|A_i|<|A_{i+1}|$ for all $i\in \mathbb{N}$. In other words, there is an infinity hierarchy of infinities.
  142. \end{corollary}
  143. \begin{proof}
  144. \textcolor{blue}{Applying Cantor's theorom, $|S| < |\mathcal{P}(S)|$. Therefore,  whenever we get the power set of a set, we will have greater cardinality. if we keep getting the power set, we will have infinte secuence where the $nth term =\mathcal{P}(n-1) $.\\
  145. \\
  146. Therefore, we proved that there is an infinite sequence $A_0, A_1, A_2, \ldots$ of infinite sets such that $|A_i|<|A_{i+1}|$ for all $i\in \mathbb{N}$
  147. }
  148. \end{proof}
  151. \begin{thebibliography}{9}
  153. \bibitem{Veisdal}
  154. Jorgen Veisdal. \textit{The Nature of Infinity - and Beyond}. Medium, 2018.
  156. \end{thebibliography}
  158. \end{document}
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand