Principles of Mathematical Analysis, Rudin, 3th ed, Chapter 2, Problem 4

Problem

Is the set of all irrational real numbers countable?

Answer

No.

Suppose that the set of all irrational real numbers is countable. Then the set of real number is countable since it is a union of two countable sets, which is contradiction.

Comments

Post a Comment

Popular posts from this blog

Show that $(0,1)$ and $(0,1]$ have the same cardinality.

Answer Define a function $f:(0,1) \rightarrow (0,1]$ as $$f(x) = \begin{cases} 2x, & \text{$x = 1/2^n$ for $n=1,2,\cdots$} \\ x, & \text{otherwise} \end{cases}$$ (1) Injective: suppose $f(x_1) = f(x_2)$. If $f(x_1)=f(x_2)=1/2^n$ for some $n \in \{0,1,2,\cdots\}$, then $x_1=1/2^{n+1}=x_2$. Otherwise, $x_1=f(x_1)=f(x_2)=x_2$. (2) Surjective: suppose $y \in (0,1]$. If $y = 1/2^n$ for some $n \in \{0,1,2,\cdots\}$, then $y = f(1/2^{n+1})$. Otherwise, $y = f(y)$.
Read more

Elementary Classical Analysis, Marsden, 2nd ed, Chapter 2, Problem 1

Problem Discuss whether the following sets are open or closed: (a) (1,2) in $\mathbb{R}$ (b) [2,3] in $\mathbb{R}$ (c) $\bigcap_{n=1}^\infty [-1,1/n)$ in $\mathbb{R}$ (d) $\mathbb{R}^n$ in $\mathbb{R}^n$ (e) A hyperplane in $\mathbb{R}^n$ (f) $\{r \in (0,1) \;|\; \text{$r$ is rational} \}$ in $\mathbb{R}$ (g) $\{(x,y) \in \mathbb{R}^2 \;|\; 0<x \leq 1\}$ in $\mathbb{R}^2$ (h) $\{x \in \mathbb{R}^n \;|\; \|x\|=1\}$ in $\mathbb{R}^n$. Answer (a) Open: For $x \in (1,2)$, we can choose $\epsilon = \min(x-1,2-x)$ so that $D(x,\epsilon) \subset (1,2)$. (b) Closed: For $x \in [2,3]^c$, we can choose $\epsilon = \min(2-x,x-3)$ so that $D(x,\epsilon) \subset [2,3]^c$. (c) Closed: We first prove that $[-1,0] = A:=\bigcap_{n=1}^\infty [-1,1/n)$. Since $[-1,0] \subset [-1,1/n)$ for all $n \in \mathbb{N}$, $[-1,0] \subset A$. To prove $A \subset [-1,0]$, we assume that $x \in A$. Then obviously, $x \geq -1$. If $x > 0$, then there exists $n \in \mathbb{N}$ such that $x > 1/n$, which means ...
Read more

Principles of Mathematical Analysis, Rudin, 3th ed, Chapter 2, Problem 29

Problem Prove that every open set in $\mathbb{R}^1$ is the union of an at most countable collection of disjoint segments. Answer Let $K_l:=\{[m,m+1/2^l)\;|\; m \in \mathbb{Z}/2^l\}$. Then $K_l$ is a collection of coutable disjoint segments with length $1/2^l$. For open set $G \subset \mathbb{R}^1$, define $$S_0:=\{Q \in K_0\;|\; Q \subset G\}.$$ $$S_n:=\{Q \in K_n\;|\; Q \subset G, \text{$Q \not\subset Q'$ for some $Q' \in \bigcup_{i=1}^{n-1}K_i$}  \}.$$ $$S:=\bigcup_{n=1}^\infty S_n.$$ Then $S$ is at most countable collection of disjoint segments and $\bigcup_{Q \in S}Q \subset G$. For $x \in G$, there exists $N \in \mathbb{N}$ such that $N_{1/2^N}(x) \subset G$. Then, we can find $m \in \mathbb{Z}/2^N$ such that $m \leq x$ and $m \in N_{1/2^N}(x)$. This means $x \in Q$ for some $Q \in \bigcup_{n=1}^N S_n$. Hence $G \subset \bigcup_{Q \in S}Q$.
Read more