A subset of an infinite-dimensional simplex where no element is in the convex hull of other elements of the subset. Let
$$S=\{x\in R_{+}^\infty \mid \sum_{n=1}^\infty x_n=1\}$$
be an infinite simplex.
Suppose $\hat{S}$ is a countable subset of $S$ such that

for each $x\in \hat{S}$ only at most finitely many coordinates are non-zero, denote the set of those coordinates $N(x)$;
for any $x\neq x’$, $x, x’ \in \hat{S}$, $N(x)\neq N(x’)$.

How could one prove that no $x$ is in a convex hull of other elements of $\hat{S}$, i.e., no $x\in \hat{S}$ can be represented as a convex combination of other elements of $\hat{S}$?
EDIT: Condition (2) should be read: &quot;for any $x\neq x’$, $x, x’ \in \hat{S}$, $N(x)\triangle (\cup_{x'\in \hat{S}}N(x’)) \neq \emptyset$&quot;. Here $\triangle$ stands for a symmetric difference of sets.
Thank you! (These two infinities intimidate me...)
No countable set is convex [unless it is empty] (since in a convex set, an interval between two points is contained in the set, and an interval has uncountably many points. However, your statement after the i.e. has nothing to do with convexity.
No countable set is convex [unless it is empty] (since in a convex set, an interval between two points is contained in the set, and an interval has uncountably many points. However, your statement after the i.e. has nothing to do with convexity.