Theoremintro
Carathéodory's theorem
Also called Caratheodory theorem.
Any point in the convex hull of a set in R^d is a convex combination of at most d+1 points of the set.
Any point in the convex hull of a set in R^d is a convex combination of at most d+1 points of the set.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag V08SST Edit this page History Report an error