My Math professor asked me to prove a theorem in Calculus.
After some thinking, I came up with a simple proof, but I’m not sure if it's correct.
The Challenge
Given $X^i = (X^i_1,\dots,X^i_n)$, prove the following theorem: $$\text{If } X^k \to X \text{ then } X^k_j \to\ X_j \text{ for every }\ j = 1,2,\dots,n. $$
My proof
If $ X^k \to X$ then $\forall \epsilon > 0\exists n \in \mathbb{N}$ so that $\forall k \geq n$, $\|X^k-X\| < \epsilon$.
Let us assume there's some $j$ for which $X^k_j \to\ X_j$ is false.
It follows that $X^k - X = (0,0,\dots,A,0,\dots,0)$ where $A = |X^k_j - X_j|$.
$|X^k - X| = \sqrt{0^2+0^2+\dots+A^2+0^2+\dots+0^2} = \sqrt{A^2} = A$.
$ A > \epsilon$.
From stages 4 and 5, it follows that $\|X^k-X\| > \epsilon$. Contradiction!
Therefore, $X^k_j \to X_j$ Q.E.D.
Thanks in advance!
Your proof is correct.
A straight forward proof is
If $ Xk→X$ then, $ ∀ϵ>0∃n∈N$ so that $∀k≥n, ∥Xk−X∥<ϵ.$
Note that for every j,we have $$|Xkj−Xj|\le ∥Xk−X∥<ϵ.$$.