Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite-dimensional vector spaces
|
| gptkbp:describes |
representation of points in convex hulls
|
| gptkbp:field |
gptkb:mathematics
convex analysis |
| https://www.w3.org/2000/01/rdf-schema#label |
Pontryagin's lemma
|
| gptkbp:namedAfter |
gptkb:Lev_Pontryagin
|
| gptkbp:relatedTo |
gptkb:Carathéodory's_theorem
|
| gptkbp:state |
A point in the convex hull of a set can be represented as a convex combination of at most n+1 points, where n is the dimension of the space.
|
| gptkbp:usedIn |
control theory
optimization theory |
| gptkbp:bfsParent |
gptkb:Soviet_school_of_topology
|
| gptkbp:bfsLayer |
8
|