🔢 mathematics

Discrete Quantitative Isocapacitary Inequality: Fluctuation Estimates

This paper establishes quantitative fluctuation estimates for the discrete isocapacitary problem on subsets of $\mathbb{Z}^d$ as their cardinality diverges by extending the variational problem to the continuum setting and applying sharp continuum inequalities to address the failure of unique minimization in the discrete case.

Original authors: Marco Cicalese, Leonard Kreutz, Imteyaz Mansoor

Published 2026-03-31

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Marco Cicalese, Leonard Kreutz, Imteyaz Mansoor

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a city planner trying to build the most efficient neighborhood possible. You have a fixed number of houses (let's say 1,000 houses) and you want to arrange them in a grid so that the "energy" required to connect them to the outside world is as low as possible.

In the smooth, continuous world of mathematics (like drawing on a piece of paper), the answer is obvious: a perfect circle (or a ball in 3D) is the best shape. It minimizes the "friction" or "capacity" needed to interact with the surroundings. This is a famous rule called the Isocapacitary Inequality.

However, this paper tackles a much trickier problem: What happens if your city is built on a strict grid of streets and blocks (like a chessboard)?

Here is the breakdown of the paper's findings using simple analogies:

1. The Grid Problem: Why a Circle is Impossible

On a smooth surface, you can make a perfect circle. But on a grid (like the integer lattice $Z^d$ ), you can't. You can only build shapes made of square blocks.

The Issue: If you try to build a "ball" out of blocks, it looks like a pixelated circle. The problem is that there isn't just one way to make the best pixelated circle. You could shift a few blocks here or there, and you might get a shape that is just as efficient as the first one.
The Consequence: In the smooth world, the ball is the unique winner. In the grid world, there are many "tied" winners. This lack of a single perfect shape is called a lack of rigidity.

2. The Big Question: How "Wobbly" are the Winners?

The authors ask: "If we find two different shapes that are both the 'best' (or nearly the best) on the grid, how different can they actually be?"

Imagine you have two teams building the best possible fortress out of 1,000 bricks.

Team A builds a fortress that looks like a slightly squashed cube.
Team B builds a fortress that looks like a slightly stretched cube.
Both are equally efficient.

The paper proves that even though there are many different "best" shapes, they are all very close to being a perfect ball. They aren't random messes. If you take the bricks from Team A's fortress and Team B's fortress, the number of bricks that are in different spots is surprisingly small.

3. The "Fluctuation Estimate": The $N^{3/4}$ Rule

The authors calculated a specific rule for how much these shapes can wiggle.

If you have $N$ blocks (houses), the number of blocks that differ between two "best" shapes grows roughly as $N^{3/4}$ .
The Analogy: Imagine $N$ is a million. The "perfect" ball would use all 1 million blocks. The "wobbly" version might differ by about 100,000 blocks. While 100,000 sounds like a lot, it's actually a tiny fraction (10%) compared to the total size. As the city gets bigger (more blocks), the percentage of difference gets smaller and smaller. The shapes become more and more rigidly "ball-like."

4. How Did They Solve It? (The Magic Trick)

The authors used a clever two-step strategy to solve this grid puzzle:

The "Blur" Trick (Discrete to Continuous): They imagined taking the pixelated grid city and blurring it until it looked like a smooth, continuous shape again.
The "Sharp" Rule (Continuum to Discrete): They used a known, powerful mathematical rule that says "In the smooth world, the ball is the unique winner."
The Translation: They proved that if the blurred version is close to a ball, then the original pixelated version must also be close to a ball. They calculated exactly how much "blur" (error) was introduced by the grid and showed it wasn't enough to ruin the shape.

5. Why Does This Matter?

You might wonder, "Who cares about pixelated balls?"

Real-World Applications: This math helps scientists understand how materials form at the atomic level (since atoms sit on a grid).
Probability & Traffic: It helps model how "rare events" happen in complex networks, like how a traffic jam forms or how a virus spreads through a city grid. If you know the shape of the "bottleneck" (the capacity), you can predict how likely a rare event is to happen.
Stability: It tells us that even in a messy, discrete world, nature still prefers order and symmetry. The "ball" is still the king, even if it has to wear a pixelated suit.

Summary

In short, this paper proves that even on a rigid grid where perfect circles are impossible, the most efficient shapes are still incredibly close to being perfect balls. They might wiggle a little bit, but they don't wander far. The authors figured out exactly how much they can wiggle, proving that the "ball" is the ultimate shape, even in a pixelated universe.

1. Problem Statement

The paper addresses the discrete isocapacitary problem on the integer lattice $\mathbb{Z}^d$ ( $d \geq 3$ ).

Classical Context: In the continuum setting ( $\mathbb{R}^d$ ), the isocapacitary inequality states that among all sets of fixed volume, the Euclidean ball uniquely minimizes the Newtonian capacity. This is a rigidity result: the minimizer is unique (up to translation).
Discrete Challenge: In the discrete setting, the minimizer of the capacity for a fixed cardinality $N$ is not unique. There exist distinct subsets $X, Y \subset \mathbb{Z}^d$ with $|X|=|Y|=N$ that minimize the discrete capacity but cannot be mapped onto each other via discrete isometries.
Objective: The authors aim to establish quantitative fluctuation estimates. Specifically, they seek to quantify how close any minimizer (or "almost minimizer") of the discrete capacity is to a discrete Euclidean ball, measured by the cardinality of their symmetric difference.

2. Mathematical Framework and Definitions

The authors define the discrete capacity for a finite set $X \subset \mathbb{Z}^d$ with $|X|=N$ as:
$\text{cap}_N(X) := \inf \left\{ N^{\frac{2-d}{d}} \sum_{|i-j|=1} |u(i) - u(j)|^2 : u: \mathbb{Z}^d \to \mathbb{R}, \text{supp}(u) < \infty, u \geq 1 \text{ on } X \right\}$
They also define a relative capacity within a large ball $B_{RN^{1/d}}$ .

The central quantity of interest is the fluctuation, defined as:
$\inf_{z \in \mathbb{Z}^d} \#(X \Delta (z + B_{r_N} \cap \mathbb{Z}^d))$
where $B_{r_N}$ is a Euclidean ball with volume $N$ , and $\Delta$ denotes the symmetric difference.

3. Methodology

The proof strategy relies on a discrete-to-continuum approach, bridging lattice optimization with continuum geometric inequalities. The methodology consists of three main pillars:

A. Discrete-to-Continuum Embedding

The authors construct a mapping $\zeta: \mathcal{P}(\mathbb{Z}^d) \to \mathcal{P}(\mathbb{R}^d)$ that embeds a discrete set $X$ into a continuum set $\zeta(X)$ .

Kuhn Decomposition: They utilize the Kuhn decomposition of $\mathbb{R}^d$ into $d!$ simplices.
Interpolation: For a discrete set $X$ , $\zeta(X)$ is defined as the interior of the union of simplices whose lattice points are entirely contained in $X$ .
Capacity Approximation: They prove that the discrete capacity $\text{cap}_N(X)$ is well-approximated by the continuum capacity $\text{cap}(\zeta(X))$ , with explicit error bounds depending on $N$ and the scaled perimeter of $X$ .

B. Quantitative Continuum Inequalities

The analysis leverages sharp quantitative isocapacitary inequalities in the continuum (established in prior works [10, 21]). These inequalities state that if a set $\Omega$ has a capacity close to the minimal value, its Fraenkel asymmetry (distance to a ball) is controlled by the square root of the capacity deficit.

The authors transfer this stability from the continuum set $\zeta(X)$ back to the discrete set $X$ .

C. Discrete Rearrangements and Geometric Structure

To close the estimates, the authors must control the geometry of the discrete sets, specifically their perimeter and diameter.

Discrete Rearrangements: They introduce a discrete analogue of Schwarz symmetrization (rearrangement) on $\mathbb{Z}^d$ . They prove that these rearrangements decrease the Dirichlet energy (capacity).
Convexity and Diameter: Using these rearrangements, they prove that optimal sets are "convex" in every coordinate direction and satisfy a uniform diameter bound of order $O(N^{1/d})$ .
Perimeter Control: The diameter bound implies a uniform bound on the scaled perimeter $P_N(X)$ , which is crucial for the error terms in the fluctuation estimates.

4. Key Results

Main Theorem (Fluctuation Estimates)

The paper establishes that for a set $X$ with $|X|=N$ that is an "almost minimizer" (i.e., $\text{cap}_N(X) \leq m_N + \alpha_N$ where $\sup \alpha_N < \infty$ ), the deviation from a discrete ball is controlled by:
$\inf_{z \in \mathbb{Z}^d} \#(X \Delta (z + B_{r_N} \cap \mathbb{Z}^d)) \leq C_d N \left( \alpha_N^{1/2} + N^{-\frac{1}{2d}} P_N(X)^{1/2} \right)$
where $P_N(X)$ is the scaled edge perimeter.

Consequence for Exact Minimizers:
For exact minimizers ( $\alpha_N = 0$ ), the authors prove that the scaled perimeter is uniformly bounded ( $P_N(X) \leq C$ ). This leads to the sharp fluctuation estimate:
$\inf_{z \in \mathbb{Z}^d} \#(X \Delta (z + B_{r_N} \cap \mathbb{Z}^d)) \leq C_d N^{1 - \frac{1}{2d}}$
This exponent $1 - \frac{1}{2d}$ matches the fluctuation exponent found in the discrete isoperimetric problem and the discrete Faber-Krahn inequality.

Structural Properties of Optimal Sets

Convexity: Optimal sets are convex in every coordinate direction $e_k$ .
Diameter Bound: The diameter of any optimal set $X$ satisfies $\text{diam}(X) \leq C_d N^{1/d}$ .
Perimeter Bound: The scaled perimeter of optimal sets is uniformly bounded, independent of $N$ .

5. Significance and Applications

Rigidity in Discrete Settings: The paper resolves the lack of uniqueness in discrete minimizers by showing that while multiple minimizers exist, they are all "close" to each other and to the Euclidean ball in a quantitative sense.
Universality of Fluctuation Exponents: It demonstrates that the $N^{1 - 1/2d}$ fluctuation law is a universal feature of discrete variational problems involving capacity, eigenvalues, and perimeter.
Probabilistic Applications: The authors highlight the relevance of these results for probabilistic models with long-range correlations, such as random interlacements. In these models, capacity governs the energetic cost of creating macroscopic vacant regions. Quantitative stability results provide deterministic control over the geometry of rare events and bottlenecks in first-passage percolation.
Methodological Contribution: The work provides a robust framework for extending continuum quantitative stability results to discrete lattices via $\Gamma$ -convergence and discrete rearrangement techniques.

Conclusion

Cicalese, Kreutz, and Mansoor successfully extend the classical isocapacitary inequality to the discrete lattice $\mathbb{Z}^d$ . By combining discrete-to-continuum embeddings with sharp continuum stability estimates and novel discrete rearrangement arguments, they prove that discrete minimizers of capacity are quantitatively close to discrete balls, with a fluctuation error scaling as $N^{1 - 1/2d}$ . This bridges a gap between discrete combinatorial optimization and continuum geometric analysis.