Let $\mathbf{x},\mathbf{y} \in \mathbb{C}^2$ be two linearly independent vectors in two dimensional complex space. Assume that $\|\mathbf{x}\|\leq \|\mathbf{x} \pm \mathbf{y}\|$. I want to show (or understand why the following does not hold) that $\|\mathbf{x}\| \leq \|\mathbf{x} + \alpha \mathbf{y}\|$ for all $\alpha \in \mathbb{C}$ such that $|\alpha|\geq 1$. Any hints as to how to prove the inequality would be greatly appreciated, and if it doesn't necessarily hold, what other constraints need to be imposed on $\alpha$?
So far I have managed to show the trivial case that this holds where we have either $\|\mathbf{x}\|>2\|\mathbf{y}\|$ or $\|\mathbf{y}\|>2\|\mathbf{x}\|$. I am struggling to prove it for the other cases.
This is not true in general -- for example, take $x = (10,0)$ and $y = (10i,i)$. Then:
$\|x\| = 10$, $\|y\| = \sqrt{101}$, and $\|x \pm y\| = \|(10 \pm 10i, \pm i)\| = \sqrt{201}$, which is bigger than $\|x\|$.
On the other hand, take $\alpha = i$. Then $$ x + \alpha y = (10,0) + (-10,-1) = (0,-1), $$ so $\|x + \alpha y\| = 1$ which is smaller than $\|x \| = 10$.
It doesn't seem to me like it should be true in general. A strong constraint which you may be able to impose would be $\alpha \in \mathbb{R}$, but I guess you would probably not find that interesting.