Hadwiger's theorem

Hadwiger's theorem

In integral geometry (otherwise called geometric probability theory), Hadwiger's theorem states that the space of "measures" (see below) defined on finite unions of compact convex sets in R"n" consists of one "measure" that is "homogeneous of degree "k" for each "k" = 0, 1, 2, ..., "n", and linear combinations of those "measures".

Here "measure" means a real-valued function "m" that is invariant under rigid motions (combinations of rotations and translations), finitely additive (if "A" and "B" are finite unions of compact convex sets then "m"("A" ∪ "B") = "m"("A") + "m"("B") − "m"("A" ∩ "B"), and "m"(∅) = 0), and convex-continuous (its restriction to convex sets is continuous with respect to the Hausdorff metric). The countable additivity condition that is usually a part of the definition of measure is not required here.

"Homogeneous of degree "k" means that rescaling any set by any factor "c" > 0 multiplies the set's measure by "c""k". The one that is homogeneous of degree "n" is the ordinary "n"-dimensional volume. The one that is homogeneous of degree "n" − 1 is the "surface volume." The one that is homogeneous of degree 1 is a function called the "mean width", a misnomer. The one that is homogeneous of degree 0 is the Euler characteristic.

The theorem was proved by Hugo Hadwiger, and led to further work on intrinsic volumes.

References

An account and a proof of Hadwiger's theorem may be found in "Introduction to Geometric Probability" by Daniel Klain and Gian-Carlo Rota, Cambridge University Press, 1997.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Hadwiger conjecture — There are two main conjectures known as the Hadwiger conjecture or Hadwiger s conjecture :* Hadwiger conjecture (graph theory). * Hadwiger conjecture (combinatorial geometry).See also Hadwiger s theorem …   Wikipedia

  • Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

  • Hadwiger–Nelson problem — Unsolved problems in mathematics How many colors are needed to color the plane so that no two points at unit distance are the same color? In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks… …   Wikipedia

  • Hugo Hadwiger — (1908 ndash; 1981) was a Swiss mathematician. He is known for Hadwiger s theorem in integral geometry, and a number of conjectures. He also worked on a Swiss enhancement of the Enigma cipher machine, known as NEMA.His 1957 book Vorlesungen über… …   Wikipedia

  • Four color theorem — Example of a four colored map A four colori …   Wikipedia

  • De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …   Wikipedia

  • Hugo Hadwiger — (* 23. Dezember 1908 in Karlsruhe; † 29. Oktober 1981 in Bern) war ein Schweizer Mathematiker, der sich mit Integralgeometrie, konvexer und kombinatorischer Geometrie und Graphentheorie beschäftigte. Hugo Hadwiger 1973 Hadwiger studierte 1929 bis …   Deutsch Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Mixed volume — In mathematics, more specifically, in convex geometry, the mixed volume is a way to associate a non negative number to an n tuple of convex bodies in the n dimensional space. This number depends on the size of the bodies and their relative… …   Wikipedia

  • Mean width — In geometry, the mean width is a measure of dimension length of the size a body; see Hadwiger s theorem for more about the available measures of bodies. In n dimensions, one has to consider (n − 1) dimensional hyperplanes perpendicular to a given …   Wikipedia

Share the article and excerpts

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