Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Carathéodory's theorem (convex hull)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Carathéodory's number === For any nonempty <math>P\subset \R^d</math>, define its '''Carathéodory's number''' to be the smallest integer <math>r</math>, such that for any <math>x\in \mathrm{Conv}(P)</math>, there exists a representation of <math>x</math> as a convex sum of up to <math>r</math> elements in <math>P</math>. Carathéodory's theorem simply states that any nonempty subset of <math>\R^d</math> has Carathéodory's number <math>\leq d+1</math>. This upper bound is not necessarily reached. For example, the unit sphere in <math>\R^d</math> has Carathéodory's number equal to 2, since any point inside the sphere is the convex sum of two points on the sphere. With additional assumptions on <math>P\subset \R^d</math>, upper bounds strictly lower than <math>d+1</math> can be obtained.<ref>{{Cite journal |last1=Bárány |first1=Imre |last2=Karasev |first2=Roman |date=2012-07-20 |title=Notes About the Carathéodory Number |journal=Discrete & Computational Geometry |language=en |volume=48 |issue=3 |pages=783–792 |arxiv=1112.5942 |doi=10.1007/s00454-012-9439-z |issn=0179-5376 |s2cid=9090617}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)