Sharp Geometric Inequalities in Normed Spaces

This direction is split into other directions: characterization of geometric properties. Its last version stays readable and citable here.

Version 1 of 117 papers36 conceptsfrozen 2026-10-04

In standard Euclidean geometry, the properties of a shape are rigid. If you know the side lengths of a triangle, its area and circumradius are fixed. However, this rigidity is a special property of the Euclidean norm—the "ruler" we use to measure distance.

In a general normed space (or Minkowski plane), distance is defined by a unit ball: a symmetric convex body representing all points at a distance of one from the origin. If the unit ball is a circle, we have Euclidean geometry. If it is a square, we have the $l_\infty$ (maximum) norm. Because the unit ball can take almost any convex shape, the "distance" between two points depends on the direction you are traveling. This flexibility transforms fixed geometric values into ranges and necessitates the search for universal bounds.

The Unit Ball as a Geometric Ruler

The core intuition of this research area is that the shape of the unit ball dictates the "physics" of the space. Gennadiy Averkov and Horst Martini demonstrate this in On area and side lengths of triangles in normed planes, showing that a triangle's area is no longer a single value determined by its sides. Instead, the area exists within an interval. The specific area depends on how the triangle is oriented relative to the "corners" or "flat parts" of the unit ball.

Despite this variability, there are universal limits. For instance, Averkov proved that the minimal enclosing radius (the circumradius) of a triangle can always be bounded by a rational function of its side lengths, regardless of which norm is used (Circumradius versus side lengths of triangles in linear normed spaces). These bounds represent the "worst-case" geometries—often occurring when the unit ball is a hexagon or a parallelogram.

Quantifying Deviation from the Ideal

If Euclidean space (a Hilbert space) is the "perfect" geometric environment, how do we measure how "warped" other spaces are? Researchers use geometric constants to quantify this deviation.

Zhijian Yang and Yongjin Li develop metrics to measure the "squareness" or lack of uniform convexity in a space (New geometric constants of isosceles orthogonal type). By calculating the supremum of ratios of vector norms under orthogonality constraints, they can place a space on a spectrum between a round Hilbert space and a "flat" or "square" Banach space.

This "squareness" isn't just a theoretical curiosity; it determines what kinds of structures can exist within the space. For example, Averkov found that spaces "close" to the $l_\infty$ norm are remarkably flexible, capable of hosting isometric copies of nearly any equilateral set of points (On Nearly Equilateral Simplices and Nearly l∞ Spaces).

Efficiency and Extremal Shapes

A major goal in this field is identifying the "most efficient" or "most extreme" shapes for certain geometric functionals. In On the Inequality for Volume and Minkowskian Thickness, Averkov explores the ratio between a body's volume and its "thickness" (minimal width).

In two dimensions, the parallelogram emerges as the "most efficient" unit ball for this relationship. This line of inquiry helps mathematicians understand the Banach-Mazur compactum—the abstract space of all possible convex bodies—by determining the maximum possible "distance" or distortion between different geometric norms.

Straightening the Path with Hilbert Geometry

While most of this research focuses on the constraints of normed spaces, some directions look at how to use non-Euclidean geometry to simplify complex problems. Frank Nielsen utilizes Hilbert geometry to study the space of complex matrices (Hilbert geometry of the Siegel disk: The Siegel-Klein disk model).

By defining distance through the cross-ratio of points relative to a boundary, Hilbert geometry allows geodesics (the shortest paths) to be represented as Euclidean straight lines. This "straightening" of the geometry makes it significantly easier to run optimization algorithms, such as finding the Smallest Enclosing Ball for a set of high-dimensional data points, which would be computationally grueling in a standard curved metric.

Papers in this version

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_sharp_geometric_inequalities_in_normed_s_9b638d86,
  title = {Sharp Geometric Inequalities in Normed Spaces},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/sharp-geometric-inequalities-in-normed-spaces/rdr_9b638d869f56454f89618fcc7ff204e3},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_sharp_geometric_inequalities_in_normed_s_9b638d86_v1,
  title = {Sharp Geometric Inequalities in Normed Spaces},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/sharp-geometric-inequalities-in-normed-spaces/rdr_9b638d869f56454f89618fcc7ff204e3/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}