Carathéodory's theorem (convex hull) Created 2026-10-14 Updated 2026-10-18
Every point in the convex hull of a subset of is a convex combination of at most points of that subset. Thus in the plane three ingredients always suffice, however many samples were supplied. The representation of in convex hull illustrates this bound. Two ingredients need not suffice: the centroid of a triangle with only its three vertices as input is on none of their three pairwise line segments.
A short proof outline removes redundant ingredients. With more than points, the augmented vectors are linearly dependent. A dependence lets the weights vary while preserving both their sum and the represented point. Move along it until one positive weight first becomes zero; all weights stay nonnegative. Repeating leaves at most positive weights.
In his 1911 paper, Constantin Carathéodory used convex geometry to investigate the possible Fourier coefficients of positive harmonic functions. Its introduction interprets convex mixtures through the center of mass, connecting finite-dimensional geometry to constraints on a function's coefficients.[ref]
Über den Variabilitätsbereich der Fourier’schen Konstanten von positiven harmonischen Funktionen by Constantin Carathéodory. English translation by Nicholas J. Williams, Introduction §4, original printed p. 195; §I concerns the smallest containing convex domain
Discrete geometry 2026-11-05
Discrete geometry studies finite or discrete configurations of geometric objects, such as points, lines, circles, polytopes, and packings. Typical questions count incidences, optimize separation or coverage, or determine which combinatorial patterns can be realized geometrically.
For example, distinct points in the Euclidean plane determine at most different lines, because every determined line contains a pair of points. Equality holds when no three points are collinear; collinearity merges several pairs into the same line. This simple argument connects a geometric degeneracy to a change in a counting problem.
Other problems ask how many equal disks can touch a given disk without overlapping, or how a polygon can be triangulated. Convex geometry, graph theory, and computational geometry supply complementary tools: coordinates constrain realizability, while a combinatorial description records which objects meet.
Galyna V. Livshyts 2026-11-05
Galyna V. Livshyts studies convex geometry, analysis and high-dimensional probability theory. Her research page connects these areas through geometric inequalities and properties of convex sets.[ref]
Her course Topics in Concentration of Measure and Convexity by Galyna V. Livshyts develops concentration of measure, isoperimetric inequalities and Steiner symmetrization. Replacing each parallel fibre of a set by a centred interval of the same length preserves volume while increasing symmetry, making some inequalities easier to prove. The course page credits the written notes to students, with editing by Livshyts.[ref]
Topics in Concentration of Measure and Convexity by Galyna V. Livshyts. Definition 3.1 and Claim 3.2, p. 28; course-page authorship credit