Given $E$ a finite subset of a real vector space $V$, a circuit of the associated matroid is a minimal linearly dependent subset of $E$. For each circuit $\underline C$, a minimal linear dependence $$\sum_{v\in \underline C}\lambda_vv=0$$ gives rise to a signed circuit $C = (C^+,C^-)$ defined by $$C^+= \{v\in \underline C: \lambda_v>0\}$$ and $$C^-=\{v\in \underline C:\lambda_v<0\}.$$ (So $(C^-,C^+)$ is also a signed circuit.)
Given an arbitrary linear dependence of the form $$\sum_{v\in S\subset E}\lambda_v v = 0$$ with $\lambda_v\neq 0$ for all $v\in S$, by definition there is a circuit $\underline C$ with $\underline C\subset S$.
My question is: if we define $S^+ = \{v\in S:\lambda_v>0\}$ and $S^-=\{v\in S:\lambda_v<0\}$, must there exist a signed circuit $C$ with $C^+\subset S^+$ and $C^-\subset S^-$? Certainly not every circuit $\underline C\subset S$ has such a signature, but it seems easy enough to find one in particular examples by ad hoc means.
If it's useful or necessary, for my purposes I am only interested in situations where all coefficients are integers.
Thanks.