14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

158 <strong>Convex</strong> Bodies<br />

Wulff’s Theorem in Crystallography<br />

Why do crystals have such particular forms? Since the late eighteenth century it was<br />

the belief of many crystallographers that underlying each crystal there is a point<br />

lattice, where any lattice parallelotope contains a certain set of atoms, ions or molecules,<br />

<strong>and</strong> any two such parallelotopes coincide up to translation. Compare also the<br />

discussion in Sect. 21. Any facet of the crystal is contained in a 2-dimensional lattice<br />

plane. The free surface energy per unit area of a facet (whatever this means) is small<br />

if the corresponding lattice plane is densely populated by lattice points <strong>and</strong> large otherwise.<br />

Thus, only for a small set of normal directions, the free surface energies per<br />

unit area in the corresponding lattice planes are small. Since real crystals minimize<br />

their total free surface energy according to Gibbs, Curie <strong>and</strong> Wulff, this explains why<br />

crystals have the form of particular polytopes. More precisely, we have the following<br />

theorem of Wulff [1031]. A first proof of it is due to Dinghas [268]. In our version<br />

of Wulff’s theorem, no compatibility condition for the free surface energies per unit<br />

area is needed. For this reason the proof is slightly more difficult than otherwise.<br />

There are various other versions of Wulff’s theorem, for example those of<br />

Busemann [180], Fonseca [339] <strong>and</strong> Fonseca <strong>and</strong> Müller [340]. See also the surveys<br />

of Taylor [990], McCann [702] <strong>and</strong> Gardner [360] <strong>and</strong> the book of Dobrushin,<br />

Koteck´y <strong>and</strong> Shlosman [275]. For applications to statistical mechanics <strong>and</strong> combinatorics,<br />

compare the report of Shlosman [932].<br />

Theorem 8.13. Let u1,...,un ∈ S d−1 (the exterior unit normal vectors of the facets<br />

of the crystal) be such that E d ={α1u1 +···+αnun : αi ≥ 0}. Let ε1,...,εn > 0<br />

(the free surface energies per unit area of the facets). Let K be the convex polytope<br />

K = � x : ui · x ≤ εi for i = 1,...n �<br />

(the crystal). Then, amongst all convex polytopes with volume equal to V (K ), <strong>and</strong><br />

such that the exterior normal vectors of their facets belong to {u1,...,un}, those<br />

with minimum total free surface energy are precisely the translates of K .<br />

The proof of Dinghas is difficult to underst<strong>and</strong>. Possibly, our proof is what Dinghas<br />

had in mind. It is related to Minkowski’s proof of the isoperimetric inequality, see<br />

Theorem 8.7. Let v(·) denote the (d − 1)-dimensional area measure.<br />

Proof. We may assume that each of the halfspaces {x : ui · x ≤ εi}, i = 1,...,m,<br />

contributes a ((d − 1)-dimensional) facet to K ,say<br />

Fi = � �<br />

x : ui · x = εi ∩ K,<br />

while each of the halfspaces {x : ui · x ≤ εi}, i = m + 1,...,n, has the property that<br />

Fi = � �<br />

x : ui · x = δiεi ∩ K<br />

is a face of K with dim Fi < d − 1, where 0 ≤ δi ≤ 1 is chosen such that the<br />

hyperplane {x : x · ui = δiεi} supports K .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!