Optimality of the Triangular Lattice for a Particle System with Wasserstein Interaction

We prove strong crystallization results in two dimensions for an energy that arises in the theory of block copolymers. The energy is defined on sets of points and their weights, or equivalently on the set of atomic measures. It consists of two terms; the first term is the sum of the square root of t...

Full description

Saved in:
Bibliographic Details
Published in:Communications in mathematical physics Vol. 329; no. 1; pp. 117 - 140
Main Authors: Bourne, D. P., Peletier, M. A., Theil, F.
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01-07-2014
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove strong crystallization results in two dimensions for an energy that arises in the theory of block copolymers. The energy is defined on sets of points and their weights, or equivalently on the set of atomic measures. It consists of two terms; the first term is the sum of the square root of the weights, and the second is the quadratic optimal transport cost between the atomic measure and the Lebesgue measure. We prove that this system admits crystallization in several different ways: (1) the energy is bounded from below by the energy of a triangular lattice (called T ); (2) if the energy equals that of T , then the measure is a rotated and translated copy of T ; (3) if the energy is close to that of T , then locally the measure is close to a rotated and translated copy of T . These three results require the domain to be a polygon with at most six sides. A fourth result states that the energy of T can be achieved in the limit of large domains, for domains with arbitrary boundaries. The proofs make use of three ingredients. First, the optimal transport cost associates to each point a polygonal cell ; the energy can be bounded from below by a sum over all cells of a function that depends only on the cell. Second, this function has a convex lower bound that is sharp at T . Third, Euler’s polytope formula limits the average number of sides of the polygonal cells to six, where six is the number corresponding to the triangular lattice.
ISSN:0010-3616
1432-0916
DOI:10.1007/s00220-014-1965-5