This proof requires two parts. Let $\textbf{x} = \langle x_1, \dots, x_n \rangle$.
Part 1 ($\implies$): Assume $c=0$ or $\textbf{x}=\mathbf{0}$. Show $c\textbf{x}=\mathbf{0}$.
- If $c=0$, then $c\textbf{x} = 0 \cdot \langle x_1, \dots, x_n \rangle = \langle 0 \cdot x_1, \dots, 0 \cdot x_n \rangle = \langle 0, \dots, 0 \rangle = \mathbf{0}$.
- If $\textbf{x}=\mathbf{0}$, then $\textbf{x} = \langle 0, \dots, 0 \rangle$. So $c\textbf{x} = c\langle 0, \dots, 0 \rangle = \langle c \cdot 0, \dots, c \cdot 0 \rangle = \langle 0, \dots, 0 \rangle = \mathbf{0}$.
In both cases, the result is the zero vector.
Part 2 ($\impliedby$): Assume $c\textbf{x}=\mathbf{0}$. Show $c=0$ or $\textbf{x}=\mathbf{0}$.
We prove this by contradiction. Assume $c\textbf{x}=\mathbf{0}$ AND $c \neq 0$ AND $\textbf{x} \neq \mathbf{0}$.
Since $\textbf{x} \neq \mathbf{0}$, at least one of its components must be non-zero. Let's say $x_i \neq 0$.
The equation $c\textbf{x}=\mathbf{0}$ means $\langle cx_1, \dots, cx_n \rangle = \langle 0, \dots, 0 \rangle$.
This implies that $cx_i = 0$ for every component $i$.
Since we assumed $c \neq 0$, we can divide by $c$:
\[ x_i = \frac{0}{c} = 0 \]
This contradicts our assumption that at least one component $x_i$ was non-zero. Therefore, the assumption that "$c \neq 0$ and $\textbf{x} \neq \mathbf{0}$" must be false. This leaves only the possibility that if $c\textbf{x}=\mathbf{0}$, then $c=0$ or $\textbf{x}=\mathbf{0}$.