Jung's theorem

Jung's theorem

In geometry, Jung's theorem is an inequality between the diameter of a set of points in any Euclidean space and the radius of the minimum enclosing ball of that set. It is named after Heinrich Jung, who first studied this inequality in 1901.

Statement

Consider a compact set

:Ksubset mathbb{R}^n

and let

:d = max olimits_{p,qin K} | p - q |_2

be the diameter of "K", that is, the largest Euclidean distance between any two of its points. Jung's theorem states that there exists a closed ball with radius

:r leq d sqrt{frac{n}{2(n+1),

that contains "K". The boundary case of equality is attained by the regular "n"-simplex.

Jung's theorem in the plane

Most common is the case of Jung's theorem in the plane, that is "n" = 2. In this case the theorem states that there exists a circle enclosing all points whose radius satisfies

:r leq frac{d}{sqrt{3.

No tighter bound on "r" can be shown: when "S" is an equilateral triangle (or its three vertices), then

:r = frac{d}{sqrt{3.

General metric spaces

For any bounded set "S" in any metric space, "d"/2 ≤ "r" ≤ "d". The first inequality is implied by the triangle inequality for the center of the ball and the two diametral points, and the second inequality follows since a ball of radius "d" centered at any point of "S" will contain all of "S". In a "uniform metric space", that is, a space in which all distances are equal, "r" = "d". At the other end of the spectrum, in an injective metric space such as the Manhattan distance in the plane, "r" = "d"/2: any two closed balls of radius "d"/2 centered at points of "S" have a nonempty intersection, therefore all such balls have a common intersection, and a radius "d"/2 ball centered at a point of this intersection contains all of "S". Versions of Jung's theorem for various non-Euclidean geometries are also known (see e.g. Dekster 1995, 1997).

References

*Katz, M.: Jung's theorem in complex projective geometry, Quart. J. Math. Oxford (2) 36 (1985) 451-466.

*cite journal
author = Dekster, B. V.
title = The Jung theorem for the spherical and hyperbolic spaces
journal = Acta Math. Sci. Hungar.
volume = 67
issue = 4
year = 1995
pages = 315–331
doi = 10.1007/BF01874495

*cite journal
author = Dekster, B. V.
title = The Jung theorem in metric spaces of curvature bounded above
journal = Proceedings of the American Mathematical Society
volume = 125
issue = 8
year = 1997
pages = 2425–2433
doi = 10.1090/S0002-9939-97-03842-2

*cite journal
author = Jung, Heinrich
title = Über die kleinste Kugel, die eine räumliche Figur einschließt
journal = J. Reine Angew. Math.
volume = 123
year = 1901
pages = 241–257
format = in German

*cite journal
author = Jung, Heinrich
title = Über den kleinsten Kreis, der eine ebene Figur einschließt
journal = J. Reine Angew. Math.
volume = 137
year = 1910
pages = 310–313
format = in German

*cite book
author = Rademacher, Hans; Toeplitz, Otto
title = The Enjoyment of Mathematics
year = 1990
publisher = Dover
id = ISBN 978-0-486-26242-0
pages = chapter 16

External links

*mathworld | title = Jung's Theorem | urlname = JungsTheorem


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Théorème de Jung — En géométrie, le théorème de Jung est une inégalité entre le diamètre d un ensemble de points dans un espace euclidien et le rayon de la boule englobante minimale de cet ensemble. Il est nommé d après Heinrich Jung, qui a étudié cette inégalité… …   Wikipédia en Français

  • List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

  • List of mathematics articles (J) — NOTOC J J homomorphism J integral J invariant J. H. Wilkinson Prize for Numerical Software Jaccard index Jack function Jacket matrix Jackson integral Jackson network Jackson s dimensional theorem Jackson s inequality Jackson s theorem Jackson s… …   Wikipedia

  • Circumscribed circle — Circumscribed circle, C, and circumcenter, O, of a cyclic polygon, P In geometry, the circumscribed circle or circumcircle of a polygon is a circle which passes through all the vertices of the polygon. The center of this circle is called the… …   Wikipedia

  • List of inequalities — This page lists Wikipedia articles about named mathematical inequalities. Inequalities in pure mathematics =Analysis= * Askey–Gasper inequality * Bernoulli s inequality * Bernstein s inequality (mathematical analysis) * Bessel s inequality *… …   Wikipedia

  • Injective metric space — In metric geometry, an injective metric space, or equivalently a hyperconvex metric space, is a metric space with certain properties generalizing those of the real line and of L∞ distances in higher dimensional vector spaces. These properties can …   Wikipedia

  • Diameter — For the notion of diameter in graph theory, see Distance (graph theory). For the computer network protocol, see Diameter (protocol). Diameter In geometry, a diameter of a circle is any straight line segment that passes through the center of the… …   Wikipedia

  • logic, history of — Introduction       the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic       There was a medieval tradition according to which the Greek philosopher …   Universalium

  • Jacques Hadamard — Infobox Scientist name = Jacques Hadamard |300px image width = 300px caption = Jacques Salomon Hadamard birth date = birth date|1865|12|8|mf=y birth place = Versailles, France death date = death date and age|1963|10|17|1865|12|8|mf=y death place …   Wikipedia

  • Resolution of singularities — Strong desingularization of Observe that the resolution does not stop after the first blowing up, when the strict transform is smooth, but when it is simple normal crossings with the exceptional divisors. In algebraic geometry, the problem of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”