Riemannian and Lorentzian flow-cut theorems
Matthew Headrick, Veronika E. Hubeny
TL;DR
This work establishes geometric max flow–min cut dualities in both Riemannian and Lorentzian settings using convex optimization, Lagrangian duality, and convex relaxation. In the Riemannian case, it proves that the maximum flux of a divergenceless vector field with unit-norm bound through a boundary region equals the minimum area of a homologous bulk surface, and it extends the result to relative homology and nesting. In the Lorentzian setting, it proves a min flow–max cut analogue where a divergenceless timelike flow with norm bound and boundary conditions is dual to the maximal-volume achronal slice homologous to the boundary region, with extensions to Dilworth-type continuum theorems and degenerate metrics. Throughout, the authors emphasize that convex-analytic methods provide a powerful, broadly applicable framework for translating geometric minimization problems into tractable dual problems, with potential applications to holographic entanglement entropy and holographic complexity. The paper thus advances a unified variational perspective on flows, cuts, and their dual geometric objects in both Riemannian and Lorentzian geometries, independent of dynamical equations like Einstein’s equations.
Abstract
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous min flow-max cut theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field with norm at least 1. This theorem includes as a special case a continuum version of Dilworth's theorem from the theory of partially ordered sets. We include a brief review of the necessary tools from the theory of convex optimization, in particular Lagrangian duality and convex relaxation.
