Advertisement
Maco153

discrete Project

Dec 8th, 2019
1,765
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Latex 8.17 KB | None | 0 0
  1. \documentclass[12pt, a4paper]{article}
  2. \usepackage[utf8]{inputenc}
  3. \usepackage{amsthm}
  4. \usepackage{amsmath, amssymb}
  5. \usepackage{xcolor}
  6.  
  7. \theoremstyle{plain}
  8. \newtheorem{theorem}{Theorem}[section]
  9. \newtheorem{corollary}[theorem]{Corollary}
  10. \newtheorem{definition}[theorem]{Definition}
  11. \newtheorem{example}[theorem]{Example}
  12.  
  13. \parindent=0mm
  14. \parskip=1.9mm
  15. \linespread{1.1}
  16.  
  17. \renewcommand\qedsymbol{$\blacksquare$}
  18. \renewcommand{\restriction}{\mathord{\upharpoonright}}
  19.  
  20. \binoppenalty=\maxdimen
  21. \relpenalty=\maxdimen
  22.  
  23. \title{Cantor's Paradise}
  24. \author{Your Name \\ ID: xxxxxxx \\ The American University in Cairo}
  25. %\email{@aucegypt.edu}
  26. %\address{The American University in Cairo}
  27.  
  28.  
  29. \begin{document}
  30. \maketitle
  31.  
  32. \textcolor{red}{Dear student, remarks in RED like this one is meant to guide you through the project and you have to delete them at the end. Please write this paper in your own words and style, using well-formed complete English sentences and correct use of punctuation marks.\\
  33. As described below, this paper has two sections: Cantor's Life and Cantor's Theorem. Your task is to complete and develop these two sections.}
  34.  
  35. \textbf{Abstract.}
  36.  
  37. \textcolor{red}{Write here a brief summary describing your article in 4-6 lines. You write the abstract once you finish the paper.}
  38.  
  39. \section{Cantor's Life}
  40.  
  41. \textcolor{blue}{In this section, we are asked to introduce us to the life of Cantor, his ideas, mental health, and final years by summarising the article "The Nature of Infinity - and Beyond".
  42. Please ignore the technical mathematics in the article, just extract a story about the life and work of Cantor in 2 to 3 pages only.}
  43.  
  44. We will present the life story of Cantor based on Veisdal's article \cite{Veisdal}.
  45.  
  46. \textcolor{red}{You have to cite any references you use in this paper, see the line above. Check the end of this latex code to see how to add more references.}
  47.  
  48. \section{Cantor's Theorem}
  49. \textcolor{red}{In this section you are asked to prove Cantor's Theorem (see below). Introduce all the definitions and notation you need here to state and prove the theorem. For example, you need to define a set, a subset, the power set of a set, an injective function, a bijective function, $|A|<|B|$, etc.}
  50.  
  51. \textcolor{red}{Whenever you need to write mathematical symbols you have to write them between dollar signs. For example see the latex code for:\\
  52. $x \leq y$ and $a \in A$ and $b\notin A$ and $x^2, x^{27}, a_1, a_2, \ldots, a_n$ and
  53. $f:A \to B$ and $A\subseteq B$ and
  54. $\mathbb{N, Z, Q, R}$.}
  55.  
  56. We start by defining a set.
  57.  
  58. \begin{definition}\rm
  59. A \textit{set} is a collection of objects.
  60. \end{definition}
  61.  
  62. \begin{definition}\rm
  63. Let $A$ and $B$ be sets. We say that $A$ is a \textit{subset} of $B$, and write $A
  64. \subseteq B$ if \textcolor{blue}{$\forall x (x\in A \implies x\in B)$ }
  65. \end{definition}
  66.  
  67. \begin{example}\rm The following are examples of subsets.
  68. \textcolor{red}{[Give more examples of subsets]}
  69. \begin{enumerate}
  70.    \item The set of natural numbers is a subset of the set of integers.
  71.    \item The set of integers is a subset of the set rational numbers
  72.    \item The set of rational numbers is a subset of the real numbers
  73. \end{enumerate}
  74. \end{example}
  75.  
  76. We are now ready to introduce the notion of a power set.  
  77. \begin{definition}\rm
  78. 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 $S$\\ $\mathcal{P}(S)=\{x\mid x\subseteq S \}$}.
  79. \end{definition}
  80.  
  81. \begin{example}
  82. \textcolor{blue}{let $A=\{1,2\}$ then $\mathcal{P}(A)=\{1,2,\phi, \{1,2\}\}$ \\
  83.                      $B=\{1\}$ then $\mathcal{P}(B)=\{1,\phi \}$  }
  84. \end{example}
  85.  
  86. \begin{definition}\rm Let $A$ and $B$ be sets.
  87. \begin{itemize}
  88.    \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}
  89.    
  90.    \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 }
  91.    
  92.    \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|$}.
  93.    
  94.    \item We say a set is \textit{countably infinite} if \textcolor{blue}{$|\mathbb{N}|=|S|$ (there is a bijection function from the set of natural numbers $\mathbb {N}$ to the set)}
  95. \end{itemize}
  96. \end{definition}
  97.  
  98. We will now show that the set of integers is a countably infinite set.
  99.  
  100. \begin{theorem}
  101. The set of integers $\mathbb{Z}$ is countably infinite.
  102. \end{theorem}
  103.  
  104. \begin{proof}
  105. \textcolor{blue}{Let Assume the domain of a function is $\mathbb {N}$ and its codomain is $\mathbb {Z}$, we can obtain a bijection function where $f \colon \mathbb {N} \to \mathbb {Z} $ as following: \\
  106. \(f(n) =\[ \begin{cases}
  107.      \frac{-n}{2} & $n is even$\\
  108.      \frac{n+1}{2} & $n is odd$\\
  109.   \end{cases}
  110. \]\\
  111. It is clear that the two branches of the function are both bijective keeping in mind the domain and the codomain, so there is a bijection from $\mathbb {N}$ to $\mathbb {Z}$, which means that the set of integers is countably infinite.
  112. \end{proof}
  113. }
  114. We will now present the main theorem of the article, Cantor's Theorem, which states that it is impossible to have a bijection between any set and its powerset.
  115.  
  116. \begin{theorem}[Cantor's Theorem]
  117. Let $S$ be any (finite or infinite) set. Then $|S|<|\mathcal{P}(S)|$.
  118. \end{theorem}
  119. \begin{proof}
  120. Let $S$ be any set.
  121.  
  122. First, we will show that $S\leq \mathcal{P}(S)$ by constructing an injective function $g:S\to \mathcal{P}(S)$ where f is the set of identity function:  $\(f(x)=\{x\}$ and as no element is repeated in the domain and the codomain (power set) contains all the elements of the set, every element in the domain has exactly one image.
  123.  
  124. \textcolor{red}{[continue ...]}
  125.  
  126. 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)$.
  127.  
  128. \textcolor{blue}{Suppose that h is surjective for the sake of contradiction, so it is surjective. Let assume a set containing all the elements in the set itself, but it is not in an image of the function where:\\
  129. $B=\{s\in S \land s\notin h(x)\}$, so $B\in\mathcal{P}(S) $ and as h is surjective, $B=h(x)$ for some elements in the domain, and this contradicts our assumption that $B$ contains only the elements which is in $S$ and not in the range of the function, so $h$ is not surjective}
  130.  
  131. Therefore, we have shown that $|S| < |\mathcal{P}(S)|$.
  132. \end{proof}
  133.  
  134.  
  135.  
  136. From Cantor's theorem we can deduce the following consequences.
  137.  
  138.  
  139.  
  140. \begin{corollary}
  141. The power set of the natural numbers is uncountable.
  142. \end{corollary}
  143.  
  144. \begin{proof}
  145. \textcolor{blue}{To prove that a set is uncountable we first prove that there is no bijection from the set of the natural numbers to the set. Using Cantor's theorom, $|S| < |\mathcal{P}(S)|$. Then $|\mathbb{N}|<|\mathcal{P}(\mathbb{N})|$, which means there is injection and there is no bijection $f\colon \mathbb{N} \to \mathcal{P}(\mathbb{N})$, therefore the power set of the natural numbers is uncountable.}
  146. \end{proof}
  147.  
  148.  
  149. \begin{corollary}
  150. 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.
  151. \end{corollary}
  152. \begin{proof}
  153. \textcolor{blue}{Using Cantor's theorom, $|S| < |\mathcal{P}(S)|$. Therefore,  the power set of the power set of the set has cardinality that is strictly bigger than the power set of the set, and we keep doing this to have infinte secuence where every element is the power set of the previous element.\\
  154. $|S| < |\mathcal{P}(S)|<|\mathcal{P}(\mathcal{P}(S))|<|\mathcal{P}(\mathcal{P}(\mathcal{P}(S)))|<........$\\
  155. 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}$
  156. }
  157. \end{proof}
  158.  
  159.  
  160. \begin{thebibliography}{9}
  161.  
  162. \bibitem{Veisdal}
  163. Jorgen Veisdal. \textit{The Nature of Infinity - and Beyond}. Medium, 2018.
  164.  
  165. \end{thebibliography}
  166.  
  167. \end{document}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement