Convex body

A compact convex subset of finite-dimensional Euclidean space with nonempty ambient interior under the standard convention.

Version

v1 · 2026-09-28 · History

Domain-specific #

8709

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Convex Geometry → Mathematics

Core Idea

A convex body combines three restrictions. Convexity fills every segment between its points; compactness prevents escape to infinity and includes boundary limits; nonempty interior makes the set full-dimensional in its stated ambient space. Together they define the principal objects of convex geometry.

Additional structures refine the class. Central symmetry links bodies to norm balls, Hausdorff distance compares shapes, polarity creates an inclusion-reversing dual when the origin lies inside, and Minkowski operations build new bodies. Every use should state whether lower-dimensional compact convex sets are admitted.

How would you explain it like I'm…

No-Dent Solid Shape

A convex body is a solid shape, like a ball or a brick, with no dents or holes. If you pick any two spots inside it and stretch a string straight between them, the string stays inside the shape. It isn't endless, it includes its own outside skin, and it's truly solid, not flat like paper.

No-Dent, No-Flat Shapes

A convex body is a shape that follows three rules. First, it's convex: for any two points in it, the straight line between them stays inside, so there are no dents. Second, it's bounded and includes its edge: it doesn't go on forever, and its outer skin counts as part of it. Third, it has some 'inside room' in every direction of the space it lives in; for example, in 3D a solid ball counts, but a flat disk doesn't. Balls, cubes, and pyramids are examples.

Compact Full-Dimensional Convex Set

A convex body is a set with three properties at once. It is convex: for any two points in it, the whole line segment between them is also in it. It is compact: it is bounded, so it doesn't stretch to infinity, and closed, so it includes its boundary points. And it has a nonempty interior: it contains a small ball of the full dimension of the space, so a flat disk in 3D space doesn't count. These are the main objects studied in convex geometry. Mathematicians compare convex bodies with the Hausdorff distance, build new ones by adding them point by point (Minkowski addition), and study symmetric ones, which correspond to the unit balls of ways of measuring length (norms). Some authors also allow lower-dimensional compact convex sets, so a statement should say which convention it uses.

 

A convex body is a subset of a finite-dimensional real space (typically R^n) satisfying three restrictions together: convexity (it contains every segment between its points), compactness (it is closed and bounded, so it cannot escape to infinity and contains its boundary limits), and nonempty interior (it is full-dimensional in the stated ambient space). These are the principal objects of convex geometry. Additional structure refines the class. Centrally symmetric convex bodies correspond to unit balls of norms. The Hausdorff distance provides a metric for comparing shapes. When the origin lies in the interior, polarity gives a dual body with an inclusion-reversing correspondence. Minkowski addition and scaling build new convex bodies from old ones. Because some authors admit lower-dimensional compact convex sets as convex bodies and others do not, any use should state which convention is in force.

Scope of Application

• Convex geometry. Studies support functions, widths, volume, and extreme structure.
• Optimization. Uses compact feasible bodies to guarantee extrema and analyze duality.
• Normed spaces. Represents norms by origin-symmetric unit bodies.
• Geometric probability. Samples points, sections, and projections of bodies.
• Shape convergence. Uses Hausdorff distance and selection theorems.

Clarity

Specify ambient dimension, interior convention, topology, closure and boundedness, symmetry or origin assumptions, and the metric or operation used. Check affine dimension before applying full-dimensional volume, polarity, or selection results. Inclusion test: Require a fixed finite-dimensional Euclidean ambient space, segment convexity, compactness, and nonempty ambient interior unless a named alternate convention is explicitly adopted. Exclusion test: Exclude open convex domains, unbounded convex sets, disconnected compact sets, and lower-dimensional polytopes called bodies without declaring the relaxed convention. Nearest boundary: A convex set need not be bounded, closed, or full-dimensional; a convex body adds compactness and usually nonempty interior. Exit condition: The identity ends when convexity or compactness fails, or when full dimension is required but interior is empty. Common misclassifications: It is not every convex set. It is not an open convex domain. It is not necessarily centrally symmetric. It is not lower-dimensional under the standard ambient-interior convention. Nearest named distinctions: Convex Set: A convex set can be open, unbounded, or lower-dimensional; a convex body adds compactness and usually nonempty interior. Polytope: A polytope is a finitely generated or finitely intersected convex body when full-dimensional, but convex bodies may have curved boundaries. Star-Shaped Set: Star-shaped sets contain segments from one center, not necessarily between every pair of points. Ideal Polyhedron: An ideal hyperbolic polyhedron can have vertices at infinity and belongs to a different ambient geometry and compactness convention.

Manages Complexity

The abstraction identifies the regular full-dimensional objects on which convex-geometric operations behave well. It separates local segment closure from global boundedness and topological closure, preventing results for bodies from being overextended to arbitrary convex sets.

Abstract Reasoning

1. Fix the Euclidean ambient space.
2. Test every joining segment for membership.
3. Verify closedness and boundedness, hence compactness in finite dimension.
4. Check that an open set exists inside the candidate relative to the ambient space.
5. Add symmetry, origin, smoothness, or polyhedral assumptions only as needed.
6. Apply metric, polar, or volume results under their exact hypotheses.

Knowledge Transfer

The transferable cargo is a well-behaved compact full-dimensional convex carrier. It transfers to affine and normed finite-dimensional settings with adjusted topology; it stops at calling every bounded shape or feasible set a body.

Relationships to Other Abstractions

Current abstraction Convex body Domain-specific

Parents (1) — more general patterns this builds on

• Convex body is a kind of Convexity Prime

  A convex body is exactly a case where the convexity mixture property holds, restricted to a compact, full-dimensional Euclidean set.

Children (3) — more specific cases that build on this

• John Ellipsoid Domain-specific is a kind of Convex body

  A nondegenerate John ellipsoid is a convex body with an additional relative extremal property.

• Macbeath Region Domain-specific is a kind of, typical Convex body

  A Macbeath region K∩(2x−K) is itself a compact, centrally symmetric convex body carved from a given convex body.

• Milman's reverse Brunn–Minkowski inequality Domain-specific presupposes Convex body

  The inequality necessarily operates on two centrally symmetric convex bodies; convex bodies exist without this particular theorem.

Hierarchy path (1) — routes to 1 parentless root

• Convex body → Convexity → Optimization

Neighborhood in Abstraction Space

Convex body sits in a crowded region of the domain-specific corpus (30^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Algebraic Varieties & Topological Invariants (27 abstractions)

Nearest neighbors

• Algebraic Surface — 0.90
• Solid Modeling — 0.90
• Assouad–Nagata Dimension — 0.89
• Radon Measure — 0.88
• Digon — 0.88

Computed from structural-signature embeddings · 2026-10-08