A First Course in Complex Analysis by Matthias Beck, Gerald Marchesi, Dennis Pixton, and Lucas Sabalka Exer 7.12,7.15
$$\Re(e^{2 \pi i t}) = \sin(2 \pi t)$$
($\cos$ not $\sin$. nvm. lol.)
(7.12) Where are the errors, if any?
Pf:
$\Leftarrow$
Let $\Re(c_n) \to a, \Im(c_n) \to b$. We must show $c_n$ converges. We can do this by showing it converges to a specific complex number, which we guess is $a + bi$.
We are given that $\forall \varepsilon > 0, \exists N_{\Re},N_{\Im} > 0:$
$$|\Re(c_n) - a| < \frac \varepsilon 2 \Leftarrow n > N_{\Re}$$ $$|\Im(c_n) - b| < \frac \varepsilon 2 \Leftarrow n > N_{\Im}$$
$\therefore, \forall \varepsilon > 0, \exists N > 0:$
$$ |c_n - (a+bi)| = |\Re(c_n)-a + (\Im(c_n)-b)i|$$
$$ \le |\Re(c_n)-a| + |\Im(c_n)-b| < \frac \varepsilon 2 + \frac \varepsilon 2 < \varepsilon \ \text{whenever} \ N := \max\{N_{\Re},N_{\Im}\}.$$
$\Rightarrow$
Let $c_n \to a + bi$. We must show its parts converge. We can do this by showing they converge to specific real numbers which we guess to be $\Re(c_n) \to a, \Im(c_n) \to b$.
We are given that $\forall \varepsilon > 0 \exists N >0:$
$$|c_n-(a+bi)| < \varepsilon \ \text{whenever} \ n > N$$
Observe $$|\Re(c_n)-a|, |\Im(c_n)-b| \le \sqrt{|(\Re(c_n)-a)^2 + (\Im(c_n)-b)^2} = |(\Re(c_n)-a) + i(\Im(c_n)-b)| = |c_n-(a+bi)|$$
$\therefore, \forall \varepsilon > 0, \exists N_{\Re},N_{\Im} > 0:$
$$|\Re(c_n)-a| < \varepsilon \ \text{whenever} \ n > N_{\Re} := N $$ $$|\Im(c_n)-b| < \varepsilon \ \text{whenever} \ n > N_{\Im} := N $$
$\therefore,$ we have shown that:
For a convergent complex sequence, we know not only that its parts converge but also their limits: the respective parts of the limit of said convergent complex sequence.
Conversely, if a complex sequence's parts converge, then we know not only that the complex sequence converges but also its limit: the complex number whose real part is the limit of the complex sequence's real part and whose imaginary part is the limit of the complex sequence's imaginary part.
This is stronger than the original Exer 7.13.
QED
-
(7.13) Not really complex analysis. Found answer here: How do you prove that Z (the set of integers) equipped with the Euclidean metric (induced from real numbers) is complete?


Assuming you meant $\text { Re } e^{2\pi i t}= \cos(2\pi t),$ note first $\cos(2\pi t)\le 1$ for any real $t,$ so $1$ is an upper bound for the set $E=\{\cos(2\pi t):t\in \mathbb Q\setminus \mathbb Z\}.$ Now let $s < 1.$ Because $\cos(2\pi(1/n)) \to 1$ as $n\to \infty,$ we have $\cos(2\pi(1/n)) >s$ for large $n.$ Thus $s$ is not an upper bound of $E.$ By definition then, $1$ is the least upper bound of $E.$
Your proof of 7.12 is not correct. In fact I can't see what you are trying to do. Let $c_n=x_n+iy_n.$ You are trying to show $c_n$ converges in $\mathbb C$ to $c=x+iy$ iff $x_n\to x$ in $\mathbb R $ and $y_n\to y$ in $\mathbb R .$ This is exactly the same as showing $(x_n,y_n)\to (x,y)$ in $\mathbb R^2$ iff $x_n\to x$ in $\mathbb R $ and $y_n\to y$ in $\mathbb R .$ You must have seen a proof of the latter sometime, somewhere ...