Why if $k>d+1$ then $\{x_j-x_1\}_{j=2}^k\subset \mathbb R^d$ is linearly dependent?

299 Views Asked by At

I don't get this step in proof of Carathéodory's theorem (convex hull) Why:

Suppose k > d + 1 (otherwise, there is nothing to prove). Then, the points $x_2 − x_1, ..., x_k − x_1$ are linearly dependent

Why is this true?

How can we cay these points are linearly dependent?

2

There are 2 best solutions below

2
On

Note that $k > d+1$, and that our points are vectors in $\Bbb R^d$. In $\Bbb R^d$ (or any $d$-dimensional vector space), any set consisting of more than $d$ vectors is linearly dependent.

0
On

What is the cardinality of $\{x_2 − x_1, ..., x_k − x_1\}$? Now remember that there aren't any linearly independent set of cardinality greater than $d$ in $\Bbb R^d$.