Clever Geek Handbook
📜 ⬆️ ⬇️

Carathéodory convex hull theorem

The Carathéodory convex hull theorem states that for any point of the convex hull of a subset of a Euclidean space, there exists a non-degenerate simplex containing it with vertices in this subset.

Another formulation: The convex hull of a finite-dimensional compact is a compact [1] .

Statement of the theorem

Let beA⊂Rm {\ displaystyle A \ subset R ^ {m}}   Is a compact in m- dimensional Euclidean space . Then∀x∈coA {\ displaystyle \ forall x \ in co \ A}   (the convex hull of A) is a convex combination of at most m + 1 points in the setA {\ displaystyle A}   [2] :

coA={x:x=∑i=onem+oneλixi(x),xi(x)∈A,λi⩾0,∑i=onem+oneλi=one,i=one,2,...,m+one}{\ displaystyle co \ A = \ left \ {x: x = \ sum _ {i = 1} ^ {m + 1} \ lambda _ {i} x_ {i} (x), \ quad x_ {i} ( x) \ in A, \ quad \ lambda _ {i} \ geqslant 0, \ quad \ sum _ {i = 1} ^ {m + 1} \ lambda _ {i} = 1, \ quad i = 1, \ 2, \ \ dots, \ m + 1 \ right \}}  

Related Results

In the case when one of the coordinates of the pointx∈coA {\ displaystyle x \ in co \ A}   reaches an extreme value (for the set A ), this point can be represented as a convex combination of no more than m points A [2] .

Helly's theorem [2] is also connected with the Carathéodory convex hull theorem .

Notes

  1. ↑ § 1 Convex hulls. Lemma and Carathéodory's theorem
  2. ↑ 1 2 3 Yudin, 1974 , p. 22.

Literature

  • Yudin D. B. Mathematical control methods in conditions of incomplete information. - M .: "Soviet Radio", 1974. - 400 p.
Source - https://ru.wikipedia.org/w/index.php?title=Karateodori_on_convex_theorem theorem&oldid = 68943363


More articles:

  • Laroche, Emmanuel
  • Bardakchi, Ulash
  • Moscow International School
  • Mazurov, Kirill Trofimovich
  • Gymnastics at the 1896 Summer Olympics - team bar
  • Talnikov, David Lazarevich
  • Chen Yun
  • Old Castle Mersburg
  • Bystrov, Boris Evgenievich
  • US 6

All articles

Clever Geek | 2019