1. An Overview of Mathematics

　　What do we talk about when we talk about Mathematics? Does it necessarily correlate to quantities, structures or spaces?

　　In my perspective, mathematics is a discipline that sheds light on thinking methods which can be tapped to numerous disciplines of natural science, even though mathematics itself is strikingly different from physics, chemistry or any other areas of natural science. Mathematics appears more like a bag of inventions than a collection of discoveries, which are usually made in laboratories by physicists or chemists. As a matter of fact, modern mathematics is based on a handful of axioms rather than observations in any experiments. However, mathematics constitutes the very foundation of modern science and technology since it provides necessary thinking tools for the development of human cognition.

　　As far as I know, mathematics covers far more topics than what we have learned in class or from any textbooks. Here I shall provide a big piture of mathematics in my apprehension:

　　As a computer science major, I feel obliged to master some basic mathematical knowledge since what we call computer science was exactly derived from mathematics dating back to the times of von Neumann and Alan Turing. Mathematics is the supporting pillar of the so-called Computation Theory, which incorporates (1) Formal Language, (2) Computability Theory and (3) Computation Complexity Theory, and it is largely based on mathematical logic.

　　Moreover, we should drink deep in mathematics since mathematis itself is more than captivating by virtue of its beauty of rigidity and the challenges of thorny problems. That's exactly the reason why I was entirely gripped by the book Sureal Numbers last summer even though I was having an awful fever at that time.

2. ZFC Axiomatic System

　　ZFC is short for Zermelo-Fraenkel Set Theory with Choice Axiom, which is the most common foundation of modern mathematics. It includes the following axioms:

　　(1) Extensionality Axiom: two sets are equal iff they have exactly the same members

　　(2) Regularity Axiom: every nonempty set A has a member m with $m\cap A=\varnothing$

　　(3) Empty Set Axiom: there exists a set containing no members

　　(4) Infinity Set Axiom: there exists an inductive set $A$  i.e. $(\exists A)(\varnothing\in A\wedge(\forall A)(a^+\in A))$

　　(5) Paring Axiom: for any sets $u$ and $v$, there is a set containing exactly $u$ and $v$

　　(6) Subset Axiom: $(\forall x)(\exists y)(\forall z)(z\in y\leftrightarrow(z\in x\wedge P(z)))$, where $P(z)$ is a predicate logic

　　(7) Union Axiom: for any set $A$, there exists a set $B$ whose elements are exactly the members of the members of $A$

　　(8) Power Set Axiom: for any set $A$, there is a set whose members are exactly the subsets of $A$

　　(9) Replacement Axiom: for any formula $\alpha(x,y)$ not containing the letter $B$, the following is an axiom

　　　　$(\forall A)[(\forall x\in A)(\forall y_1)(\forall y_2)(\alpha(x,y_1)\wedge\alpha(x,y_2)\rightarrow y_1=y_2)\rightarrow(\exists B)(\forall y)((y\in B)\leftrightarrow(\exists x\in A)\alpha(x,y))]$

　　(10) Choice Axiom: for any relation $R$, there exists a function $F$ such that $F\subseteq R$, and $Dom(R)=Dom(F)$

3. Set Operations

　　In an axiomatic system, a new notion can be introduced in either the Axiomatic Appoach or the Constructive Approach. Though I will omit the rigid proofs, all the notions I list below are constructed based on the axioms in ZFC system.

　　(1) Union, Intersection and Complement: see  Boolean Algebra

　　(2) Power Set:　　$x\in 2^A$  iff  $x\subseteq A$

　　then we have:　　$2^A\subseteq 2^B\Leftrightarrow A\subseteq B$　　$2^A\in 2^B\Leftrightarrow A\in B$　　$2^A\cap 2^B=2^{A\cap B}$　　$2^A\cup 2^B\subseteq 2^{A\cup B}$

　　(3) Arbitrary Union/Intersection:　　$x\in\bigcup A$  iff $(\exists a)(x\in a\wedge a\in A)$　　$x\in\bigcap A$  iff  $(\forall a)(a\in A\rightarrow x\in a)$

　　then we have:　　$\varnothing\neq A\subseteq B\Rightarrow \bigcap B\subseteq\bigcap A$　　$A\subseteq B\Rightarrow\bigcup A\subseteq\bigcup B$

　　(4) Kuratowski's Construction of Ordered Pair: $<x, y> = {{x}, {x,y}}$

　　for n-ary tuple (n>2):　　$<x_1,...,x_n>=<<x_1,...,x_n>,x_n>$

　　(5) Cartesian Product: a collection of ordered pairs (n-ary tuples) on the given sets

　　(6) Relation: a subset of the Cartesian product on the given sets

　　(7) Function: a special relation such that for every $x\in D$, there exists exactly one $y\in R$ such that $y = f(x)$

　　

 4. Natural Number Set

　　The key idea of ZFC Axiomatic System is that everything is a set and the entire mathematics can be embedded in Set Theory.

　　To construct the natural number set, we should first define the Successor of a set: $a^+=a\cap{a}$. And then we introduce the concept of Inductive Set: a set $A$ is inductive iff $\varnothing\in A$ and $A$ is closed under successor. According to Infinity Axiom, there must exist some inductive sets, and thus we can define the natural number set $\omega$ as a set belongs to every inductive set in light of Subset Axiom.

　　One may easily find that $\omega$ is an inductive set itself and has a property as follow: any inductive subset of ω coincides with ω. This is a useful principle, which constitutes the foundation of Mathematical Induction. Moreover, $\omega$ is also a transitive set and every natural number is a transitive set, which indicates it is a Peano System. Now, we can define the ordering on $\omega$ and prove the transitivity, trichotomy and well ordering principle respectively. Once we have proved the well ordering principle, the Strong Induction on $\omega$ is valid now.

　　Besides Induction Principle, another thing we should mention is Recursion Theorem on $\omega$: given $a\in A$ and $F: A\rightarrow A$, there exists a unique function $h: \omega\rightarrow A$ such that $h(0)=a$ and $h(n^+)=F(h(n))$ (I can recall that the proof of this theorem was far beyond my grasp when I read it for the first time). Based on this principle, arithmetic operations such as addition, multiplication and exponentiation can be well defined, and we can derive their numerous properties as well.

　　From natural number set, we can construct Integer Set, Rational Number Set and Real Number Set step by step, and embed all of them into Set Theory.

5. Cardinal Numbers

　　To begin with, we define a set $A$ is equinumerous to a set $B$ iff there is a bijection from $A$ to $B$. We can find that equinumerousity is an equivalent relation since it satisfies reflexivity, symmetry and transitivity. By proper construction, we can prove that the natural number set is equinumerous to the odd/even number set, the integer set, and even the rational number set. However, Cantor's Diagonal Method can lend support to the fact that a set can never be equinumerous to its power set, which indicates that the real number set cannot be equinumerous to the natural number set. We define that a set is finite if it is equinumerous to some natural number, and then the Pigeonhole Principle comes into being: no finite set is equinumerous to its proper subset. With a further exploration, you can prove that a set is infinite if and only if it has a proper subset that is equinumerous to itself.

　　Now we would invite the notion Cardinal Number of a set such that $|A|=|B|$ iff $A$ and $B$ are equinumerous. For a finite set, the cardinal number can be defined as the natural number that is equinumerous to it. As regards infinite sets, you can refer to the Ordinal Number of a well-ordering set. We can define the arithmetic operations on cardinal numbers according to the set operations. Also, we can define the ordering of cardinal numbers based on the concept domination: a set $A$ is dominated by a set $B$ iff there exists an injection from $A$ to $B$. Domination is a partial order since it satisfies reflexivity and transitivity. A strong conclusion about domination is Schröder-Bernstein Theorem, which states that two sets are equinumerous if they are dominated by each other. (The proof of this theorem is one of the most tricky constructions that I've ever seen.) Another property of domination is an equivalent statement of Choice Axiom: for any two sets $A$ and $B$, either $A$ is dominated by $B$ or $B$ is dominated by $A$.

　　A set is countable iff it is dominated by the natural number set. A set is denumerable iff it is equinumerous to the natural number set, and a  countable set is either finite or denumerable. This is based on the fact that the natural number set is dominated by any other infinite sets. There is a Continuum Hypothesis that the next smallest cardinal number should be the cardinal number of the real number. However, as Kurt Gödel argued, this hypothesis can never be proved or belied in the ZFC Axiomatic System.

References:

　　1. Enderton, Herbert B. Elements of Set Theory [M]. 北京：人民邮电出版社. 2006-04