Finsler Metric, Systolic Inequality, Isometr
Total Page:16
File Type:pdf, Size:1020Kb
DISCRETE SURFACES WITH LENGTH AND AREA AND MINIMAL FILLINGS OF THE CIRCLE MARCOS COSSARINI Abstract. We propose to imagine that every Riemannian metric on a surface is discrete at the small scale, made of curves called walls. The length of a curve is its number of wall crossings, and the area of the surface is the number of crossings of the walls themselves. We show how to approximate a Riemannian (or self-reverse Finsler) metric by a wallsystem. This work is motivated by Gromov's filling area conjecture (FAC) that the hemisphere minimizes area among orientable Riemannian sur- faces that fill a circle isometrically. We introduce a discrete FAC: every square-celled surface that fills isometrically a 2n-cycle graph has at least n(n−1) 2 squares. We prove that our discrete FAC is equivalent to the FAC for surfaces with self-reverse metric. If the surface is a disk, the discrete FAC follows from Steinitz's algo- rithm for transforming curves into pseudolines. This gives a combinato- rial proof of the FAC for disks with self-reverse metric. We also imitate Ivanov's proof of the same fact, using discrete differential forms. And we prove a new theorem: the FAC holds for M¨obiusbands with self- reverse metric. To prove this we use a combinatorial curve shortening flow developed by de Graaf-Schrijver and Hass-Scott. The same method yields a proof of the systolic inequality for Klein bottles with self-reverse metric, conjectured by Sabourau{Yassine. Self-reverse metrics can be discretized using walls because every normed plane satisfies Crofton's formula: the length of every segment equals the symplectic measure of the set of lines that it crosses. Directed 2- dimensional metrics have no Crofton formula, but can be discretized as well. Their “fine structure" is a triangulation where the length of each edge is 1 in one way and 0 in the other, and the area of the surface is the number of triangles. This structure can be described as a simplicial set, dual to a plabic graph. The role of the walls is played by Postnikov's strands. Keywords: Finsler metric, systolic inequality, isometric filling, integral geometry, lattice polygons, pseudoline arrangements, discrete differential forms, discrete curvature flow, simplicial sets, plabic graphs. Contents 1. Overview 4 1.1. The filling area of the circle 4 1.2. Fillings with Finsler metric 4 1.3. Discretization of self-reverse metrics on surfaces 5 1.4. Discrete FAC for square-celled surfaces 7 1.5. Directed metrics on surfaces and their discretization 7 1.6. Work to do next 8 1 2 MARCOS COSSARINI 1.7. Possibly unconventional terminology 9 2. Finsler manifolds and their Holmes{Thompson volume 10 3. From geodesic scattering to the filling area conjecture 14 3.1. Finsler filling area problem 17 3.2. Rational counterexamples to the Finsler FAC 18 4. Length and area according to integral geometry 20 5. Discrete self-reverse metrics on surfaces and the discrete filling area problem 24 5.1. Wallsystems 25 5.2. Square-celled surfaces 26 5.3. Duality between cellular wallsystems and square-celled decompositions of a surface 28 5.4. Topology of surfaces that fill a circle, and how to make a wallsystem cellular 30 5.5. Even wallsystems and even square-celled surfaces 31 6. Polyhedral approximation of Finsler surfaces 36 6.1. Filling a circle with piecewise-Finsler or polyhedral-Finsler surfaces 38 6.2. Triangulating Finsler surfaces 40 6.3. Polyhedral approximation of piecewise-Finsler manifolds 41 6.4. Smooth approximation of polyhedral-Finsler surfaces 44 6.5. Polygonal approximation of curves 48 6.6. Proof that the discrete FAC implies the continuous FAC 50 7. Discretization of self-reverse Finsler metrics on surfaces 55 7.1. Discretization of planes with self-reverse integral norms 56 7.2. Proof of the discretization theorem for self-reverse Finsler metrics on surfaces 59 8. Continuization of square-celled surfaces 63 9. Proof of the equivalence between discrete FAC and continuous FAC 67 10. Wallsystems on the disk 68 10.1. Steinitz's algorithm for tightening wallsystems on the disk 71 10.2. Tightening wallsystems on the disk by smoothing cusps 75 11. Differential forms on square-celled surfaces 77 11.1. Chains, differential forms and integration 77 11.2. Boundaries, exterior derivatives and Stokes' formula 77 11.3. Exterior products 78 11.4. Proof of the FAC for square-celled disks using cyclic content 80 11.5. Higher cyclic contents 82 12. Isometric fillings homeomorphic to the M¨obiusband and systolic inequality for the Klein bottle 83 12.1. Tightening wallystems on surfaces 84 12.2. Closed curves on the Klein bottle 87 12.3. Crossing numbers of curves on the Klein bottle 89 13. Discretization of directed metrics on surfaces 98 13.1. Fine metrics on graphs and fine surfaces 99 13.2. Directed version of the filling area conjecture 100 13.3. Duality between fine surfaces and plabic graphs 102 DISCRETE SURFACES WITH LENGTH AND AREA 3 14. Work to do next 106 14.1. Minimum filling by integer linear programming 106 14.2. Poset of minlength functions and algorithms 107 14.3. Discretization of d-dimensional metrics 109 14.4. Riemannian rigidity and random surfaces 111 References 112 4 MARCOS COSSARINI 1. Overview In this section we describe the content, main theorems and structure of this thesis. The motivation and context of this work are presented later, in Sections 3 and 4. All definitions and theorems presented here will be repeated later, with more detail. 1.1. The filling area of the circle. Let C be a Riemannian circle, that is, a closed curve of a certain length. A filling of C is a compact surface M with boundary @M = C.A Riemannian filling of C is a filling with a Riemannian metric. It is called an isometric filling if dM (x; y) = dC (x; y) for every x; y 2 C, where the distance dX (x; y) on any space X is the infimum length of paths from x to y along that space X. For example, a Euclidean flat disk fills its boundary non-isometrically, but the Euclidean hemisphere is an isometric filling. The Riemannian filling area of the circle is the infimum area of all Riemannian isometric fillings. Gromov [Gro83] posed the problem of com- puting the Riemannian filling area of the circle, proved the minimality of the hemisphere among Riemannian isometric fillings homeomorphic to a disk, and conjectured its minimality among all orientable Riemannian isometric fillings; this is the (Riemannian) filling area conjecture, or FAC. For ori- entable Riemannian isometric fillings of genus ≤ 1 the Riemannian FAC is known to hold also; the hemisphere is minimal in this class as well [Ban+05]. Computing this single number, the Riemannian filling area of the circle, may seem a very specialized task, but it is related to the problem of de- termining a whole region of space based on how geodesic trajectories are affected when they cross the region, a problem known as \inverse geodesic scattering". In the introductory Section 3 we discuss this connection and what is known about the FAC. 1.2. Fillings with Finsler metric. Ivanov and Burago extended the filling area problem by admitting as fillings surfaces with Finsler metrics, and proved the minimality of the hemisphere among Finsler disks [Iva01; Iva11a; BI02]. Roughly speaking, a Finsler surface is a smooth surface M with a Finsler metric F , that continuously assigns to each tangent vector v a length F (v) ≥ 0, also denoted kvk. The full definition is given in Section 2. A Finsler metric F enables one to define the length of any differentiable R 0 curve γ in M by the usual integration LenF (γ) := kγ (t)k dt. Finsler metrics are more general than Riemannian metrics because they need not satisfy the Pythagorean equation at the infinitesimal scale. More precisely, the Finsler metric restricted to the tangent plane at each point is a norm that need not be related to an inner product. In this thesis, norms, Finsler metrics and distance functions are in principle directed, not self-reverse; this means that we may have k − vk= 6 kvk and d(x; y) 6= d(y; x).1 For the filling area problem, smooth Finsler surfaces are equivalent to piecewise-Finsler surfaces (triangulated surfaces with a Finsler met- ric on each face) and are also equivalent to polyhedral-Finsler surfaces (surfaces made of triangles cut from normed planes), in the sense that when 1Self-reverse Finsler metrics are called \reversible" or \symmetric" by other authors. DISCRETE SURFACES WITH LENGTH AND AREA 5 we fill isometrically the circle, the infimum area that can be attained with isometric fillings of any of the three kinds is the same; this is proved in Theorem 6.3. The definition of area of a Finsler surface that we use here is due to Holmes{Thompson. It involves the standard symplectic form on the cotan- gent bundle T ∗M, which is related to the Hamiltonian approach to the study of geodesic trajectories. However, it is easy to define the Holmes{ Thompson area when the Finsler surface is polyhedral: the area of a triangle cut from some normed plane is its usual (Cartesian) area in any system of linear coordinates xi on the plane, multiplied by the area of the dual unit ball in the dual coordinates pi. Note that we use a non-standard normalization: the Holmes{Thompson area of a Euclidean triangle (or any Riemannian surface) is π times greater than the usual value. Conjecture 1.1 (continuous FAC for surfaces with self-reverse Finsler met- ric).