For $i=1, \ldots, N$, let $x^i := [x^i_1, \ldots, x_n^i]^\top$ be a $n \times 1$ matrix in which every entry is non-negative and their sum is equal to $1$. This means $x^i$ belongs to the probability simplex of $\mathbb R^n$. I'm interested in when the sum $$ S :=\sum_{i=1}^N x^i (x^i)^\top $$ is invertible. If $n=2$, I get $$ \det S = \sum_{i=1}^N (x^i_1)^2 \sum_{i=1}^N (x^i_2)^2 - \left (\sum_{i=1}^N x^i_1 x^i_2 \right )^2. $$
By Cauchy-Schwarz inequality, $$ \det S = 0 \iff \frac{x_1^i}{x^i_2} = \frac{x_1^j}{x^j_2} \quad \forall i,j = 1,\ldots, N. $$
On the other hand, each $x^i_1+x^i_2 = 1$ for all $i$. Then the equality happens if and only if $x^i=x^j$ for all $i,j = 1,\ldots, N$.
Can we generalize above result to the case $n>2$?
Update: Let $X := [x^1, \ldots, x^N]$. Then $S = XX^\top$. Then $S$ is invertible if and only if $\{x^1, \ldots, x^N\}$ is linearly independent.