Result 366, Partial differential equations

The planar Mumford–Shah regularity conjecture and local weak-L4 gradient bounds

Resolves the interior regularity conjecture for reduced absolute planar Mumford–Shah minimizers with bounded fidelity data. Locally, the closed discontinuity set is a C1,αC^{1,\alpha} arc, a regular crack tip, or three arcs meeting at 120∘120^\circ; only finitely many global connected components meet any compact interior region.

Proof

The bigger picture

Why it matters

A discontinuity set records where a function jumps, like a network of cracks. This unreviewed manuscript claims that, for a specific class of optimal two-dimensional configurations, the network has only smooth arcs, regular endpoints and three-way junctions.

What changes?

The manuscript reports the classification for reduced absolute minimizers of the planar Mumford-Shah energy, which optimizes a function together with its discontinuities, assuming bounded data in its fidelity term. At every interior discontinuity point, the closed discontinuity set locally consists of a C1,alpha arc, a regular crack tip where an arc ends, or three such arcs meeting at 120 degrees. Only finitely many global connected components meet any compact interior region. Here, C1,alpha means the tangent varies with a Hölder bound.

What does that help mathematicians do?

For these minimizers, researchers can rule out an interior four-way crossing or a triple junction with unequal angles. The finiteness assertion separately prevents infinitely many distinct global components from entering one compact interior region. Together, these claims restrict both local junction geometry and how different components can crowd the interior. They do not assert that the entire discontinuity set has finitely many components or classify behavior at the domain boundary.

Are there practical applications?

Its immediate value is foundational: it gives a precise geometric framework for studying planar Mumford-Shah minimizers. Further interior analysis can focus on three specified local configurations rather than arbitrary discontinuity networks. The supplied claims establish a structural classification, not a computational method, a practical performance improvement or a gradient estimate.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

Manuscript

Interior regularity of planar Mumford–Shah minimizers

September 24, 2026 20 pages

We prove the interior regularity assertion of the planar Mumford–Shah conjecture for reduced absolute minimizers with bounded fidelity data. Every interior point of the closed discontinuity set has a neighborhood consisting of a C1,αC^{1,\alpha} arc, an arc ending at that point, or three such arcs meeting at 120 degrees. Only finitely many global connected components meet any relatively compact open set.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:Interior-regularity-of-planar-Mumford-Shah-minimizers-September-24-2026,
  author = {{OpenAI}},
  title = {{Interior regularity of planar Mumford--Shah minimizers}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Interior-regularity-of-planar-Mumford-Shah-minimizers-September-24-2026/Interior-regularity-of-planar-Mumford-Shah-minimizers-September-24-2026.pdf}{OAI:Interior-regularity-of-planar-Mumford-Shah-minimizers-September-24-2026}},
  year = {2026}
}

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 7 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.