Let $u \in \mathbb{R}^k$ be a vector with one component positive, one component negative, and the remaining $k-2$ can have at most one component that is equal to zero. Then is there a vector $v \in \mathbb{R}^k$ such that all its components are strictly positive and $u \cdot v= 0$?
Intuitively this seems to be true. But how can I go about showing this formally?