Carathéodory's theorem (convex hull)
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite-dimensional real vector spaces
|
| gptkbp:category |
theorems in mathematics
theorems in convex geometry |
| gptkbp:field |
gptkb:mathematics
convex geometry |
| https://www.w3.org/2000/01/rdf-schema#label |
Carathéodory's theorem (convex hull)
|
| gptkbp:namedAfter |
gptkb:Constantin_Carathéodory
|
| gptkbp:relatedTo |
gptkb:Helly's_theorem
gptkb:Radon's_theorem convex hull convex combination |
| gptkbp:sentence |
If a point x of Rd lies in the convex hull of a set P, then x can be written as the convex combination of at most d+1 points in P.
|
| gptkbp:yearProposed |
1907
|
| gptkbp:bfsParent |
gptkb:Constantine_Caratheodory
gptkb:Constantin_Carathéodory |
| gptkbp:bfsLayer |
7
|