Papers
Topics
Authors
Recent
2000 character limit reached

Minkowski Centered Convex Compact Sets

Updated 11 December 2025
  • Minkowski centered convex compact sets are convex bodies defined by having a designated center that guarantees optimal symmetric containment based on the Minkowski asymmetry.
  • They underpin sharp geometric inequalities, including optimal harmonic-arithmetic mean relationships and explicit bounds on diameter-to-width ratios in the planar case.
  • These sets are pivotal in convex geometry and functional analysis, as evidenced by extremal examples like the golden house pentagon which illustrate maximal asymmetry.

A Minkowski centered convex compact set is a fundamental object in convex geometry, encapsulating optimal symmetry properties, extremal containments, and key geometric functionals in finite dimensions—especially in the plane. Such sets play a central role in quantitative symmetrization inequalities, classification of extremal polytopes, and diameter-width ratio problems. The heart of the theory lies in the interplay among Minkowski centers, the Minkowski asymmetry, and precise comparison of symmetrizations, all admitting sharp, dimension-dependent thresholds and unique extremal examples such as the golden house pentagon.

1. Definitions: Minkowski Centered Sets and Asymmetry

Let CC be a full-dimensional compact convex set in Rd\mathbb{R}^d. A point cRdc \in \mathbb{R}^d is called a Minkowski center of CC if

Ccs(C)(Cc),C-c \subseteq -s(C) (C-c),

where the Minkowski asymmetry s(C)s(C) is

s(C)=inf{λ>0:xRd such that Cxλ(Cx)}.s(C) = \inf\{\lambda > 0 : \exists x \in \mathbb{R}^d \text{ such that } C-x \subseteq -\lambda(C-x)\}.

The set is Minkowski centered if $0$ is a Minkowski center, i.e.,

Cs(C)C.C \subseteq -s(C) C.

Key support-function characterization: cc is a Minkowski center iff for all uRdu \in \mathbb{R}^d,

hCc(u)s(C)hCc(u),h_{C-c}(u) \leq s(C) h_{C-c}(-u),

with hC(u)=maxxCu,xh_C(u) = \max_{x \in C} \langle u, x \rangle. In the planar case (d=2d=2), the range 1s(C)21 \leq s(C) \leq 2 holds, with s(C)=1s(C) = 1 iff CC is centrally symmetric. Maximal asymmetry is achieved for simplices, which for d=2d=2 is the triangle (Brandenberg et al., 2020).

2. Algebraic and Geometric Structure

Minkowski-centeredness is tightly linked to geometric and algebraic properties:

  • Unique Center: When the balanced translate CcC-c is both balanced and radially compact, the center is unique (Karn, 2022).
  • Functional Analytic Duality: For compact convex sets with a Minkowski center, the space of continuous affine functions A(C)A(C) is the dual of a base-normed space whose base has the given center.
  • Gauge Interpretations: The Minkowski functional (gauge) γC(x)=inf{λ>0:xλC}\gamma_C(x) = \inf\{\lambda > 0 : x \in \lambda C\} allows measurement of "balls" and circumcenters, leading to alternative intrinsic or gauge-centered notions of symmetry and minimal containment (Jahn, 2014).

3. Symmetrizations and Mean Sets

For any compact convex set CC, two primary symmetrizations are considered:

  • Arithmetic Mean: 12(C+(C))\tfrac12(C + (-C)), corresponding to the midpoint set.
  • Harmonic Mean: (C+(C))(C^\circ + (-C)^\circ)^\circ, where CC^\circ is the polar of CC.

Key chain of inclusions (planar case): C(C)C!C12(C+(C))conv(C(C))C \wedge (-C) \subseteq C !- C \subseteq \tfrac12(C + (-C)) \subseteq \mathrm{conv}(C \cup (-C)) Here, C!CC !- C is the harmonic mean, and C(C)C \wedge (-C) denotes the intersection. Simultaneous optimality for all inclusions occurs only for symmetric sets (Brandenberg et al., 2020).

4. Sharpened Containment Results: The Golden Ratio and Extremal Sets

A cornerstone result is the golden-ratio threshold for planar Minkowski-centered sets: $C\,!\,-C\;\copt\;\tfrac12\bigl(C+(-C)\bigr) \iff s(C) \leq \varphi = \tfrac{1+\sqrt5}{2} \approx 1.618$ where $\copt$ denotes optimal containment (no homothetic shrinking of the outer set possible).

  • Extremal Example: The "golden house" pentagon is uniquely characterized (up to linear transformation) as the Minkowski-centered convex compact set for which s(C)=φs(C) = \varphi and the above containment is optimal. Explicitly:

CGH=conv{(1,1),(1,0),(0,φ),(1,0),(1,1)}C_{\mathrm{GH}} = \mathrm{conv}\{ (-1,-1),\,(-1, 0),\,(0,\varphi),\,(1,0),\,(1,-1) \}

This pentagon realizes the maximal asymmetry compatible with optimal harmonic-arithmetic mean containment (Brandenberg et al., 2020).

  • Generalization to Other Means: Analogous sharp inequalities hold for containment of K(K)K \cap (-K) in KK2\frac{K-K}{2}, with bounds on the containment factor τ(K)\tau(K) as functions of s(K)s(K), e.g.,

2s(K)+1τ(K)1,\frac{2}{s(K)+1} \leq \tau(K) \leq 1,

with explicit piecewise formulae in the planar case (Dichter et al., 4 Dec 2025).

5. Extremal Inequalities and Diameter-Width Ratios

The structure of Minkowski-centered convex compact sets allows the derivation of sharp diameter-to-width ratio bounds for pseudo-complete sets. Given a symmetric gauge body CC and pseudo-complete KK: D(K,C)w(K,C)s(K)+12c(s(K))\frac{D(K,C)}{w(K,C)} \leq \frac{s(K)+1}{2}\, c(s(K)) where c(s)c(s) is an explicit function piecewise defined in terms of s(K)s(K), with the maximum φ+121.309\frac{\varphi+1}{2} \approx 1.309 attained by the golden house (Dichter et al., 4 Dec 2025, Brandenberg et al., 2023). For s(K)=2s(K) = 2 (triangle), this ratio reaches its minimal sharp value.

6. Geometric and Combinatorial Properties

For planar Minkowski-centered convex sets with s(K)>φs(K) > \varphi, the intersection bd(K)bd(K)\operatorname{bd}(K) \cap \operatorname{bd}(-K) consists of exactly six points—a result connected with the combinatorics of optimal support, and mirrored in the geometric transition from the golden house (five points) to triangles (six points at maximal asymmetry) (Brandenberg et al., 2023). These intersection patterns are crucial in the classification of extremal polytopes for symmetrization inequalities.

7. Connections and Applications

Minkowski centered convex compact sets bridge convex geometry, functional analysis, and optimization. Their properties underlie:

  • Classification of affine extremal bodies for symmetrization and containment inequalities (Brandenberg et al., 2020).
  • Explicit construction of extremal and interpolating polytopes realizing all possible pairs (s,τ)(s, \tau) in the plane (Dichter et al., 4 Dec 2025).
  • Applications to functional-analytic dualities and the structure of affine function spaces on compact convex sets (Karn, 2022).
  • Geometric realization of bounds for ratios such as diameter/width, illuminating the fundamental role of asymmetry in geometric optimization (Brandenberg et al., 2023).

The Minkowski centered convex compact set thus represents an archetype for the study of asymmetry, extremality, and optimal containment in convex geometry, with deep ramifications in analysis and metric geometry.

Whiteboard

Follow Topic

Get notified by email when new papers are published related to Minkowski Centered Convex Compact Set.