The study of convex sets and convex bodies in Euclidean and normed spaces, together with their combinatorial, metric, and analytic properties; includes support functions, Minkowski addition, extreme points, separation theorems, mixed volumes, and isoperimetric-type inequalities.

Principle

Convexity imposes strong global regularity: local linear or separation conditions control global shape via extreme points, supporting hyperplanes, and linear functionals; monotonicity and additivity (Minkowski sums) organize volume and shape relations.

Demonstration

Analyze a convex polytope: describe it as an intersection of half-spaces or as the convex hull of vertices, compute face lattice and extreme points, apply Helly's theorem to a family of convex sets to infer a common intersection, and use the Brunn–Minkowski inequality to relate volumes under Minkowski addition.

Misapplication

Applying convexity theorems to non-convex regions (for instance assuming existence of unique supporting hyperplanes for arbitrary shapes) or misusing separation arguments in infinite-dimensional normed spaces without verifying compactness or reflexivity conditions.

Consequence

Correct use yields powerful results in optimization (duality, existence of minimizers), geometric inequalities (isoperimetric, Brunn–Minkowski), structural classification of convex bodies (extreme points, support functions), and links to functional analysis and probability (concentration, log-concavity).

Reversal

Negate convexity and study non-convex or concave phenomena: uniqueness and separation fail, extreme-point descriptions are insufficient, and combinatorial complexity rises; many inequalities reverse or cease to hold, requiring different tools (Morse theory, variational methods).

Boundary

Focuses on convexity in linear spaces; excludes inherently non-convex topological or fractal objects and many global metric properties unrelated to convex structure; infinite-dimensional generalizations require additional functional-analytic hypotheses.

Semantic Tension

Overlaps with metric geometry (distance and norms influence convexity) and with functional analysis (convex functionals, duality); tension arises when discrete combinatorial aspects of polytopes meet analytic volume inequalities applicable to smooth convex bodies.

Synthesis

Convex geometry studies how linear separation and convex aggregation shape sets and functions in Euclidean and normed spaces, yielding combinatorial structure, analytic inequalities, and applications from optimization to geometric measure theory under the unifying theme of convexity.