Caratheodory's convex hull theorem

[1/0%]
LaTeX

Suppose KK is a compact convex set in Rn\mathbb {R}^{n}. Prove that every x∈Kx \in K is a convex combination of at most n+1n+1 extreme points of KK. Suggestion: Use induction on nn. Draw a line from some extreme point of KK through xx to where it leaves KK. Use Exercise 1.

?

References

[Rud91] Rudin W. Functional Analysis. 2nd ed., McGraw-Hill, 1991.