On a Problem Posed by Brezis and Mironescu

This paper provides an affirmative solution to an open problem posed by Brezis and Mironescu in their book *Sobolev Maps to the Circle*, demonstrating that the least mass of area-minimizing integral rectifiable currents with a smooth boundary equals the infimum of areas among smoothly immersed submanifolds sharing that boundary.

Fanghua Lin, Malkeil Shoshan, Changyou Wang

Published Tue, 10 Ma
📖 5 min read🧠 Deep dive

Here is an explanation of the paper, translated from the language of advanced mathematics into a story about shapes, holes, and the perfect fit.

The Big Question: Can We Always Find the "Perfect" Smooth Shape?

Imagine you have a piece of string (a loop) floating in space. You want to stretch a soap film across it to create a surface. In the real world, nature loves efficiency: the soap film will naturally settle into the shape that uses the least amount of surface area possible.

Mathematicians have been studying this for a long time. They know that if you allow the surface to be a bit "rough" or have sharp corners (mathematicians call these currents), you can always find a perfect, minimal shape that uses the absolute minimum amount of material.

The Problem:
Brezis and Mironescu (two famous mathematicians) asked a tricky question: If the boundary (the string) is perfectly smooth, does the "perfect" minimal surface also have to be perfectly smooth?

Or, could it be that the absolute smallest area is only achieved by a shape that is slightly crumpled or has a hidden singularity (a "kink"), and that any attempt to smooth it out makes it slightly bigger?

This paper says: No, you don't need to settle for a crumpled shape. Even if the mathematically perfect shape has a kink, you can get arbitrarily close to that perfect size using a perfectly smooth, shiny surface.

The Analogy: The Crumpled Paper vs. The Smooth Sheet

Think of the "Area Minimizing Current" as a crumpled piece of paper that has been folded down to the smallest possible size to fit inside a box. It has sharp creases and kinks. It is the mathematical champion of efficiency.

Now, imagine you want a smooth sheet of silk that covers the same boundary.

  • The Skeptic's View: "You can't get a smooth sheet to be as small as the crumpled paper. If you smooth out the kinks, you have to add extra fabric, making it bigger."
  • The Authors' View (Lin, Shoshan, and Wang): "Actually, you can. You can take that crumpled paper, cut out the tiny, messy kinks, and sew in a tiny, smooth patch that fits so perfectly that the total size is almost identical to the crumpled version. You can get as close to the 'perfect' size as you want, even if you can't hit it exactly with a smooth sheet."

How They Did It: The "Cut, Invert, and Paste" Trick

The authors developed a clever three-step construction to prove this. Imagine you are a surgeon operating on a shape:

  1. Identify the "Kinks" (The Singular Set):
    First, they look at the crumpled paper (the minimal current). They know from previous math (Almgren's theorem) that the "kinks" or sharp points are very rare. They are so small that if you zoom out, they barely take up any space. Think of them as tiny, microscopic wrinkles.

  2. Cut Out the Mess:
    They take a tiny scalpel and cut out a small tube around these wrinkles. Now, the shape has a hole in it. The area they removed is tiny.

  3. The Magic Mirror (Spherical Inversion):
    This is the most creative part. They take the remaining smooth part of the shape and look at it through a special "funhouse mirror" (mathematically called spherical inversion).

    • This mirror shrinks the shape down. If the original shape was big, the reflection is tiny.
    • Because the mirror shrinks things, the "hole" left by the cut is now covered by a tiny, shrunken version of the original shape.
  4. Sew It Back Together (The Cone):
    Now they have two pieces: the original shape with a hole, and a tiny, shrunken version of the shape floating nearby. They connect them with a cone (like a party hat or a funnel).

    • Because the shrunken piece is so small, the cone connecting them is also very small.
    • The total area added by this new "patch" (the shrunken piece + the cone) is so tiny that it doesn't matter.

The Result: They have created a brand new shape that is perfectly smooth, has no kinks, and has an area that is almost exactly the same as the original crumpled paper.

The Twist: Why "Almost" is the Best We Can Do

The paper ends with a fascinating example (Section 7) to show why we can't always find the exact minimum with a smooth shape.

Imagine you have two separate loops of string, far apart from each other.

  • The "crumpled paper" solution might be two separate, disconnected pieces of soap film, one for each loop. This is the most efficient way.
  • However, if you demand the smooth sheet be one single connected piece (like a single sheet of silk connecting both loops), you are forced to stretch a bridge between them.
  • That bridge adds extra area. The "perfect" smooth shape (the connected one) will always be slightly larger than the "perfect" disconnected shape.

So, the paper proves that while you can get infinitely close to the perfect area using smooth shapes, sometimes you can never quite reach it if the smooth shape is forced to be connected.

Summary for the General Audience

  • The Goal: Prove that smooth shapes can be just as efficient as "rough" mathematical shapes.
  • The Method: Cut out the tiny, messy parts of the rough shape, shrink a copy of the rest using a mathematical mirror, and sew it back together with a tiny cone.
  • The Conclusion: You can approximate the "perfect" minimal area with a smooth surface as closely as you like. However, sometimes the "perfect" smooth surface doesn't exist at all (you can get close, but never hit the target exactly), depending on the shape of the boundary.

This work resolves a long-standing question in geometry, showing that the world of smooth surfaces is rich and flexible enough to mimic the efficiency of the most complex, crumpled mathematical objects.