WorksMathematics
A non-zero gap for the planar Mumford-Shah convex lifting and the nonexistence of crack-tip calibrations
Abstract
We prove that the convex lifting of the Mumford-Shah functional constructed through the notion of calibration introduced in [2] is not sharp in dimension two. For Dirichlet boundary data prescribed by the crack-tip function, we construct a lifted competitor whose energy is strictly lower than that of the crack-tip subgraph. Since the crack-tip minimizes the original Mumford-Shah functional, this establishes a strict gap between the infima of the original and lifted problems. As a consequence we establish that the crack-tip admits no calibration.
Introduction
In this work we consider the homogeneous Mumford-Shah functional defined for functions of special bounded variation as
where is an open, bounded set, is the singular set of and is the dimensional Hausdorff measure. Originally introduced by Mumford and Shah [33, 32] as a model for image segmentation, the full functional includes an additional fidelity term penalizing deviations from the observed image :
again considered on . The existence and regularity of minimizers of , together with the characterization of local and global minimizers of , have been the subject of extensive mathematical research over the past four decades [16, 18, 11, 17, 3, 19]. This interest is motivated, in particular, by the central role that the characterization of minimizers of plays in understanding the regularity of minimizers of [5], and by its close connection to the longstanding Mumford–Shah conjecture [29].1 Notably, a ground-breaking result by Bonnet and David [6] has shown that in the so-called crack-tip, defined in polar coordinates as
is a global minimizer of MS.
With the goal of proving the minimality of candidate minimizers, in [2], Alberti, Bouchitté and Dal Maso introduced the theory of calibrations for the Mumford–Shah functional. Their approach builds on foundational work by Federer [23] in geometric measure theory, by Harvey and Lawson [26] in calibrated geometry and generalizes previous approaches related to null-lagrangians of integral functionals [25]. Calibrations are a tool to certify the minimality of a given candidate and, in case of the Mumford–Shah functional, they are divergence free vector fields satisfying suitable properties tailored to the candidate minimizer. In particular, their construction can provide an elegant proof of minimality with respect to either MS (with Dirichlet boundary conditions) or . Following [2] the calibration theory for the Mumford–Shah functional and its variants has also been extensively developed in subsequent years [31, 15, 30]. Moreover, similar approaches have been used for various integral and free discontinuity functionals [1, 36], free boundary problems [28, 20, 12, 27, 13, 34] and mean curvature flows [24, 35]. It was therefore natural to seek a proof of the minimality of the crack-tip through the explicit construction of a suitable calibration. However, despite considerable efforts by several authors, including the first author of this paper, such a construction has remained elusive.
A closely related, more fundamental question is whether the crack-tip admits a calibration at all. A negative answer would explain why attempts to construct one have been unsuccessful. The main goal of this work is to show that the crack-tip does not admit a calibration of the form proposed in [2].
Questions of this kind have been investigated for various classes of functionals [23, 9, 14, 10], and their answers are often closely connected to the sharpness of a suitable convex lifting of the original functional and, more generally, to the presence of a duality gap [7, 8]. For the homogeneous Mumford–Shah functional, the convex lifting has been introduced in [2] as a byproduct of the notion of calibration. It takes the form
where and is the set of bounded Borel vector fields satisfying the properties:
To establish that this lifting is not sharp for prescribed boundary data, it suffices to find a Dirichlet minimizer of MS and a competitor , agreeing with (the indicator function of the subgraph of ) outside a given set, such that , that is a non-zero gap exists. Crucially, such a non-zero gap also rules out the existence of a calibration for .
In this work, we show that the convex lifting of the Mumford–Shah functional is not sharp in dimension two. We take to be the crack-tip, whose minimality follows from Bonnet and David [6]. We show that for this choice a non-zero gap exists effectively ruling out the existence of calibration for the crack-tip. Our result also identifies a limitation of numerical approaches based on this convex lifting. For boundary data exhibiting a positive gap, a minimizer of the lifted problem cannot be the subgraph lift of an admissible function. Therefore, solving the lifted problem does not, in general, recover a minimizer of the original functional.
We conclude this introduction by outlining the main idea of the proof. We construct a competitor where is chosen to be the annulus . Here is a positive parameter that will be chosen sufficiently big. This annular choice allows us to establish a strictly positive lifting gap in and it is made to avoid the fact that calibrations for the crack-tip (if exists) need to be chosen singular close to the origin, due to the crack-tip singularity (see Remark 3.1). We construct by perturbing the lifted subgraph of the crack-tip while preserving its boundary data at the annulus. Specifically, we use the layer-cake construction
where is a radial cut-off function vanishing for and and having a plateau equal to on a smaller annulus inside . Such perturbation is not modifying the jump set of the crack-tip. Moreover, on the plateau, we have . There, the key observation is that for any admissible field the lifting cannot recover the Dirichlet energy of the crack-tip. Indeed, due to the first constraint in the definition of , no-gap implies that
The second condition in rules this out wherever , which holds throughout a smaller annulus inside the plateau because of the crack-tip singularity: . Quantitatively, this construction produces an averaged deficit of order , uniformly over all admissible fields. The cutoff, that is crucially chosen logarithmically, restores the boundary data at a cost of order , so choosing sufficiently large provides a competitor with strictly smaller lifted energy than the crack-tip.
AI statement. The initial idea for constructing a competitor exhibiting a positive gap emerged from discussions between the authors and GPT-6 Astra in September 2026. Following several unsuccessful attempts to construct a calibration for the crack-tip, GPT-6 Astra suggested investigating the existence of a positive gap in the convex lifting and subsequently proposed the initial competitor. The paper is built on the initial idea and it has been integrally written without the use of AI, apart from a grammar and a notational check. The authors take full responsibility for the mathematical content, references and presentation of the manuscript.
Reflections and Acknowledgments 2. Having spent years of the PhD trying to calibrate the crack-tip, this problem has obviously a deeply personal significance for me. Perhaps this explains why completing the paper and finally having an answer to this question feels bittersweet almost ten years after completing my PhD. On one hand, I am enthusiastic about the result and glad to understand why my attempts to construct a calibration could not succeed. On the other hand, knowing that the key idea came from an AI leaves me with this sense of bitterness.
Anyway I believe that some acknowledgements are in order. First and foremost, I would like to thank my PhD advisor, Bernd Kirchheim, for introducing me to this problem and for the many hours we spent exploring strategies, working through computations, and discussing unsuccessful attempts. I am also grateful to those who worked on this problem before me and generously shared their approaches and insights. In particular, I have fond memories of discussions with Giovanni Alberti, Antonin Chambolle, Guy David, and Massimo Gobbino that also helped me get through my PhD.
Preliminaries
We first recall some basic notations and definitions we will use throughout the paper. We always denote by an open, bounded set of . Moreover, we denote by the dimensional Hausdorff measure of a given Borel set . We will work with functions with bounded variation defined on an open, bounded set in (in this paper or ) and denote them by . They are defined as functions in such that their distributional derivative is a bounded measure on . Given we denote by its singular set. Since is -rectifiable, its measure-theoretical normal is well-defined almost everywhere [4]. Moreover, for -a.e. the traces of , denoted by and , are well-defined as the approximate limits of at [4]. We use the convention that .
It is well-known, that the derivative of a function of bounded variation can be decomposed as
where is the Cantor part of the derivative [4]. The set of special functions of bounded variation, denoted by SBV(), are the functions such that .
Given we will denote by the indicator function of its subgraph, that is
Since , it holds that for every open, bounded interval .
The homogeneous Mumford-Shah functional is defined for as
The study of local and global minimizers of the Mumford-Shah functional has been an area of active research since the model was defined by Mumford and Shah. Here is the precise definition that is also relevant for this paper.
Definition 2.1 (Local and global minimizers). We say that is a local minimizer of the Mumford-Shah functional if and
for every such that is compactly contained in . We also say that is a global minimizer if its restriction to any open bounded set is a local minimizer.
In particular one of the most striking result concern proving the for the crack-tip defined in (1) is a global minimizer as stated in the next theorem due to Bonnet and David.
Theorem 2.2 (Bonnet, David). The crack-tip is a global minimizer of the Mumford-Shah functional
Due to the length of their proof, around 25 years ago, researchers have wondered if the crack-tip minimality can be proven by a calibration argument, considerably shortening it. Indeed, a calibration method was introduced by Alberti, Bouchitté and Dal Maso in 2001 [2] and thanks to that examples show that the construction of a calibration allowed to easily prove the local minimality of the triple junction and of harmonic functions under suitable assumptions. However, despite the effort in constructing such calibration all the attempts failed. We would like to summarize briefly the calibration method for the Mumford-Shah functional.
Definition 2.3. Given , a calibration for is a vector field in such that and with the following properties:
a) for a.e. and every ,
b) for -a.e. and every ,
c) and for a.e. ,
d) for -a.e. .
As shown in [2] the existence of a calibration of a given automatically implies its local minimality in . Moreover, it is worth to remark that the regularity of can be relaxed by essentially asking enough regularity to ensure the validity of the divergence theorem. For example, in [2], the class of approximately regular vector fields has been considered allowing for discontinuous calibrations.
The convex lifting for the Mumford-Shah functional and its gap
Due to the presence of the Mumford-Shah functional is naturally non-convex. However, the set of calibrations can be used to define a convex lifting. More precisely, for one can define the convex functional
where is the set of bounded Borel vector fields satisfying the properties:
It is easy to see that for every it holds that (Remark 3.3 [2]). However, a much deeper question is establishing if the convex lifting is sharp, meaning if it has the same minimum value as the Mumford-Shah functional under suitable boundary conditions. In more precise words, given a local minimizer of MS one asks if
where . In dimension one (), this was proven to be true by Chambolle in [14]. The goal of this paper is to show that this is false in dimension two.
The lifting is connected to the notion of calibration by the following simple observation. Given a local minimizer of the Mumford-Shah functional, if there exists a calibration for according to Definition 2.3, then
This can be easily seen by observing that if is a calibration for , then for all agreeing with outside a compact set contained in , it holds
In this paper we show that this is not the case when is the crack-tip.
Non-zero gap for the crack-tip
In this section, let be a parameter that will be chosen big enough and we consider the annulus
Note that for notational convenience we do not make the dependence on in explicit. Moreover, we set and we let be the crack-tip. Our goal is to show that for big enough it holds that
where
In particular, we aim to construct a competitor such that . By proving this statement we will show the non-existence of calibration for the crack-tip in and also in any set by a simple restriction argument. Also note that the set is useful to work with functions defined on compact cylinders. It is enough to choose any open interval containing the image of the crack-tip in . From now on we will work with functions defined in , replacing also with .
Remark 3.1. Note that in this paper we always work with the annulus as a domain. This choice is done to have a non-trivial result. Indeed, due to the condition in Definition 2.3 any calibrating vector field would have the singularity of the crack-tip at the origin. Therefore there is no hope to find calibrations according to Definition 2.3, or even approximately regular calibrations according to [2].
Our goal is to construct a family of functions and to show that for suitable choice of such belongs to and . We first define
and the cut-off function
The family of competitors is defined as:
It is easy to see that for the function is indeed an admissible competitor as next lemma shows.
Lemma 3.2. The function belongs to and, for , it holds that
if , or , and ,
for all ,
for all .
In particular .
Proof. First, let us prove that . Note that is bounded in and thus . Moreover, since the total variation of its distributional derivative can be computed as
since is Lipschitz. Since for , we have whenever or . This proves . Note also that for , and it holds
proving . can be proven similarly, implying that .
We also compute the Dirichlet energy of in .
Lemma 3.3. It holds that
Proof. We compute
Set now . This gives
as we wanted to show. □
Theorem 3.4. There exists a sufficiently large such that
Proof. Let and with almost everywhere. Then denoting by , we can compute
Applying the previous computation with it holds that
where in the last inequality we used that . Now note that
Moreover, using Jensen’s inequality and the fact that one has that
for all . Therefore defining the annulus
we note that in . Indeed, since , we get that . Therefore, using Lemma 3.3
Therefore, choosing big enough and since the right hand side does not depend on we immediately obtain that as we wanted to prove.
Remark 3.5. Our construction provides an explicit lower bound on the relaxation gap, although it does not determine its exact value. By considering and defined on we define
Set
The estimate in the proof of Theorem 3.4 thus gives
This lower bound is strictly positive whenever . So choosing we get . This is obviously a crude estimate; however, we believe that the real gap is also small. This could explain why a positive gap has never been convincingly detected using numerical methods.
References
- [1]G. Alberti, L. Ambrosio, and X. Cabré. On a long-standing conjecture of E. De Giorgi: symmetry in 3D for general nonlinearities and a local minimality property. Acta Applicandae Mathematica, 65(1-3):9–33, 2001.DOI
- [2]G. Alberti, G. Bouchitté, and G. Dal Maso. The calibration method for the Mumford-Shah functional and free-discontinuity problems. Calculus of Variations and Partial Differential Equations, 16(3):299–333, 2003.DOI
- [3]L. Ambrosio, N. Fusco, and J. E. Hutchinson. Higher integrability of the gradient and dimension of the singular set for minimisers of the mumford–shah functional. Calculus of Variations and Partial Differential Equations, 16(2):187–215, 2003.DOI
- [4]L. Ambrosio, N. Fusco, and D. Pallara. Functions of bounded variation and free discontinuity problems. Oxford university press, 2000.
- [5]A. Bonnet. On the regularity of edges in image segmentation. In Annales de l’Institut Henri Poincaré C, Analyse non linéaire, volume 13, pages 485–528. Elsevier, 1996.DOI
- [6]A. Bonnet and G. David. Cracktip is a global Mumford-Shah minimizer. Société mathématique de France, 2001.
- [7]G. Bouchitté. Convex analysis and duality. arXiv preprint arXiv:2004.09330, 2020.arxiv.org/abs/2004.09330
- [8]G. Bouchitté and I. Fragalà. Duality for non-convex variational problems. Comptes Rendus. Mathématique, 353(4):375–379, 2015.
- [9]G. Bouchitté and M. Phan. Calibration for minimal surfaces with free boundary and cheeger-type problems. arXiv preprint arXiv:2511.03322, 2025.arxiv.org/abs/2511.03322
- [10]M. Carioni. A discrete corea-type formula for the Mumford-Shah functional in dimension one. arXiv preprint arXiv:1610.01846, 2016.arxiv.org/abs/1610.01846
- [11]M. Carioni. Existence of calibrations for the mumford-shah functional and the reinitialization of the distance function in the framework of chan and vese algorithms. 2017.
- [12]M. Carioni and A. Pluda. Calibrations for minimal networks in a covering space setting. ESAIM: Control, Optimisation and Calculus of Variations, 26:40, 2020.arxiv.org/abs/1707.01448
- [13]M. Carioni and A. Pluda. On different notions of calibrations for minimal partitions and minimal networks in R2. Advances in Calculus of Variations, 14(3):401–417, 2021.
- [14]A. Chambolle. Convex representation for lower semicontinuous envelopes of functionals in L1. Journal of Convex Analysis, 8(1):149–170, 2001.
- [15]G. Dal Maso, M. G. Mora, and M. Morini. Local calibrations for minimizers of the mumford–shah functional with rectilinear discontinuity sets. Journal de mathématiques pures et appliquées, 79(2):141–162, 2000.
- [16]G. David. Singular sets of minimizers for the Mumford-Shah functional. Springer, 2005.
- [17]C. De Lellis and M. Focardi. Higher integrability of the gradient for minimizers of the 2d mumford–shah energy. Journal de Mathématiques Pures et Appliquées, 100(3):391–409, 2013.
- [18]C. De Lellis and M. Focardi. The regularity theory for the Mumford-Shah functional on the plane. EMS Press, 2025.arxiv.org/abs/2308.14660
- [19]G. De Philippis and A. Figalli. Higher integrability for minimizers of the mumford–shah functional. Archive for Rational Mechanics and Analysis, 213(2):491–502, 2014.
- [20]G. De Philippis and E. Paolini. A short proof of the minimality of simons cone. Rendiconti del Seminario Matematico della Università di Padova, 121:233–241, 2009.
- [21]F. Deangelis. Classification of boundary blow-ups for the Mumford-Shah functional with Dirichlet boundary conditions. arXiv preprint arXiv:2610.23513, 2026.arxiv.org/abs/2610.23513
- [22]F. Deangelis. Solution of the Mumford-Shah conjecture. arXiv preprint arXiv:2609.26732, 2026.arxiv.org/abs/2609.26732
- [23]H. Federer. Real flat chains, cochains and variational problems. Indiana University Mathematics Journal, 24(4):351–407, 1974.DOI
- [24]J. Fischer, S. Hensel, T. Laux, and T. M. Simon. Local minimizers of the interface length functional based on a concept of local paired calibrations. arXiv preprint arXiv:2212.11840, 2022.arxiv.org/abs/2212.11840
- [25]M. Giaquinta and S. Hildebrandt. Calculus of variations II. Springer Science & Business Media, 2013.
- [26]R. Harvey and H. B. Lawson. Calibrated geometries. 1982.DOI
- [27]F. Hélein. Isoperimetric inequalities and calibrations. PITMAN RESEARCH NOTES IN MATHEMATICS SERIES, pages 92–105, 1996.
- [28]G. Lawlor and F. Morgan. Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms. Pacific journal of Mathematics, 166(1):55–83, 1994.DOI
- [29]A. Lemenant. A selective review on mumford–shah minimizers. Bollettino dell’Unione Matematica Italiana, 9(1):69–113, 2016.DOI
- [30]M. G. Mora. Local calibrations for minimizers of the mumford–shah functional with a triple junction. Communications in Contemporary Mathematics, 4(02):297–326, 2002.DOI
- [31]M. G. Mora and M. Morini. Local calibrations for minimizers of the Mumford–Shah functional with a regular discontinuity set. In Annales de l’Institut Henri Poincaré C, Analyse non linéaire, volume 18, pages 403–436. Elsevier, 2001.DOI
- [32]D. Mumford and J. Shah. Boundary detection by minimizing functionals. In IEEE Conference on computer vision and pattern recognition, volume 17, pages 137–154. San Francisco, 1985.
- [33]D. Mumford and J. Shah. Optimal approximations by piecewise smooth functions and associated variational problems. 1989.DOI
- [34]V. Pagliari. Halfspaces minimise nonlocal perimeter: a proof via calibrations: V. pagliari. Annali di Matematica Pura ed Applicata (1923-), 199(4):1685–1696, 2020.DOI
- [35]A. Pluda and M. Pozzetta. Minimizing properties of networks via global and local calibrations. Bulletin of the London Mathematical Society, 55(6):3029–3052, 2023.DOI
- [36]T. Pock, A. Chambolle, D. Cremers, and H. Bischof. A convex relaxation approach for computing minimal partitions. In 2009 IEEE conference on computer vision and pattern recognition, pages 810–817. IEEE, 2009.