🔢 mathematics

Approximation of solutions of the sinh-Gordon equation $\Delta u -\sinh(2u)=0$ by hyperbolic orthogonal ring patterns

This paper proves that hyperbolic orthogonal ring patterns, characterized by uniformizing variables on square grid lattices, converge to smooth solutions of the sinh-Gordon equation with $C^\infty$ accuracy of order $\varepsilon^2$ and subsequently to harmonic maps to the hyperbolic plane.

Original authors: Ulrike Bücking

Published 2026-07-17

📖 6 min read🧠 Deep dive

CC0 1.0

Original authors: Ulrike Bücking

Original paper dedicated to the public domain under CC0 1.0 (http://creativecommons.org/publicdomain/zero/1.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 the universe as a giant, stretchy fabric. In some places, this fabric is flat like a sheet of paper; in others, it curves like the surface of a sphere or a saddle. Mathematicians and physicists spend a lot of time trying to understand how things move and settle on these curved surfaces. One of the most famous rules for how things behave on a flat sheet is called the "Laplace equation," which describes how heat spreads out or how a soap film finds its smoothest shape. But when the fabric is curved in a specific, wavy way, the rules get much more complicated. There is a special, tricky equation called the "sinh-Gordon equation" that acts like a master key for these curved, wavy surfaces. It doesn't just describe a single shape; it describes a whole family of surfaces that have a constant "curvature" everywhere, which is a big deal for understanding the geometry of space and time.

Now, imagine trying to solve this tricky equation. It's like trying to predict the exact shape of a crumpled piece of paper that wants to be a perfect sphere. Doing this with pure math on a computer is hard because the numbers get messy. So, scientists often use a trick: they break the smooth surface into a grid of tiny squares, like a pixelated image. They solve the problem on this grid and hope that as the squares get smaller and smaller, the pixelated answer becomes the smooth, perfect answer. This paper is about proving that this "pixelation" trick actually works for a very specific and beautiful type of grid pattern found in hyperbolic geometry (a type of curved space that looks like a saddle). The researchers are showing that if you build these patterns correctly, they don't just look like the solution; they become the solution as the grid gets infinitely fine.

The Paper's Story: Pixelating the Curved Universe

In this paper, the author, Ulrike Bücking, tackles a problem that sounds like a puzzle from a fantasy geometry book: how to build a perfect, smooth surface out of tiny, interlocking rings.

The Setup: Rings that Hug and Kiss
Imagine you are in a hyperbolic world, a place where space expands faster than you can walk. In this world, the author looks at "hyperbolic orthogonal ring patterns." Picture two concentric circles (like a target) forming a ring. Now, imagine a whole neighborhood of these rings. The rule is that neighboring rings must "kiss" each other at a perfect 90-degree angle. It's like a dance where every partner touches the next one at a right angle, creating a grid that looks like a square lattice but lives on a curved surface.

These rings aren't just random; they are characterized by numbers called "uniformizing variables" (let's call them $u$ ) located at the center of each ring. The paper starts with a known, smooth solution to the sinh-Gordon equation—a perfect, mathematical description of a curved surface. The goal is to see if we can recreate this perfect surface using a grid of these rings.

The Experiment: Zooming In with a Grid
The author takes a smooth, perfect solution and covers a small, compact piece of it with a square grid. The size of the grid squares is a tiny number called $\epsilon$ (epsilon). Think of $\epsilon$ as the resolution of a camera. If $\epsilon$ is large, the image is blocky and pixelated. If $\epsilon$ is tiny, the image is sharp.

The author then sets up the rings on this grid. The rings on the edge of the grid are forced to match the values of the perfect solution (this is called a "Dirichlet boundary condition"). Then, the math is used to figure out what the rings in the middle must be to satisfy the 90-degree kissing rule. This gives us a set of discrete numbers, $u_\epsilon$ , which represent the "pixelated" version of the smooth solution.

The Big Discovery: The Pixelated Becomes Perfect
The main finding of the paper is a proof of convergence. The author proves that as the grid size $\epsilon$ gets smaller and smaller, the discrete ring pattern $u_\epsilon$ gets closer and closer to the original smooth solution $u$ .

But it's not just "close." The paper proves two very specific things:

The Error Shrinks Fast: The difference between the pixelated answer and the perfect answer is proportional to $\epsilon^2$ . This means if you cut the grid size in half, the error doesn't just get half as big; it gets four times smaller. It's a very efficient way to approximate the truth.
Smoothness is Preserved: Not only do the values get closer, but the "smoothness" of the pattern is preserved. The paper shows that the convergence happens in a "C-infinity" sense. In plain English, this means that not only do the positions of the rings match up, but their slopes, curves, and every possible derivative (how fast the curve is changing) also match up perfectly as the grid gets finer.

Why This Matters: From Rings to Real Surfaces
The paper doesn't stop at just the numbers. It connects these ring patterns to something called "harmonic maps" to the hyperbolic plane. Think of a harmonic map as the most efficient, tension-free way to stretch a rubber sheet onto a curved surface. The author shows that as the ring patterns converge to the solution of the sinh-Gordon equation, the actual geometric shapes formed by these rings converge to a harmonic map.

This is a big deal because these harmonic maps are related to "CMC-surfaces" (Constant Mean Curvature surfaces) in a specific type of space called Lorentz space. In the world of physics and geometry, these surfaces are like the building blocks for understanding spacetime and the shapes of the universe. The paper suggests that by using these hyperbolic ring patterns, we can build discrete (pixelated) versions of these complex surfaces that get better and better as we refine our grid.

What the Paper Does Not Say
It is important to note what this paper does not claim. It does not say that these patterns work for any shape or any equation. It specifically focuses on the sinh-Gordon equation and square grid lattices. It does not claim to have solved the entire mystery of curved spaces, but rather has proven that this specific "ring pattern" method is a mathematically sound way to approximate a specific type of solution. The paper relies on rigorous mathematical proofs, not just computer simulations, to show that the error is indeed of order $\epsilon^2$ .

The Takeaway
In the end, this paper is a bridge between the discrete and the continuous. It takes a beautiful, abstract equation (sinh-Gordon) and shows that you can build it out of simple, interlocking rings on a grid. As you make the grid finer, the rings stop looking like a jigsaw puzzle and start looking like a smooth, flowing surface. It's a confirmation that sometimes, the best way to understand the infinite smoothness of the universe is to start with a grid of tiny, perfectly kissing rings.

Technical Summary: Approximation of Solutions of the Sinh-Gordon Equation by Hyperbolic Orthogonal Ring Patterns

Problem Statement
The paper addresses the convergence and approximation problem for hyperbolic orthogonal ring patterns, a discrete geometric structure introduced by Bobenko. Specifically, the work investigates whether these patterns, defined on square grid lattices, converge to smooth solutions of the sinh-Gordon equation, $\Delta u - \sinh(2u) = 0$ , as the lattice spacing $\varepsilon$ tends to zero. The study focuses on the "uniformizing variables" $u_\varepsilon$ associated with the centers of the rings, which characterize the patterns. The central question is whether prescribing Dirichlet boundary conditions derived from a smooth solution $u$ of the sinh-Gordon equation yields a discrete solution $u_\varepsilon$ that converges to $u$ with a specific error order and regularity.

Methodology
The author employs a variational approach grounded in the discrete integrable systems theory established in prior work (specifically [Bob]). The methodology proceeds as follows:

Discretization and Characterization: The domain is discretized using a square grid lattice $Z^2$ with edge length $\varepsilon$ . The hyperbolic orthogonal ring patterns are characterized by variables $U$ (denoted as $u_\varepsilon$ in the limit context) associated with the ring centers. These variables are linked to the radii of the inner ( $r$ ) and outer ( $R$ ) circles of the rings via Jacobi elliptic functions with modulus $q = \sqrt{1-\varepsilon^2}$ .
Variational Formulation: The existence and uniqueness of the discrete pattern for given boundary values are guaranteed by the convexity of a specific functional $S(U)$ . The critical points of this functional correspond to the discrete ring patterns satisfying the orthogonality and touching conditions.
Consistency Analysis: The proof relies on demonstrating that the smooth solution $u$ of the sinh-Gordon equation nearly satisfies the discrete closing condition (the discrete analog of the sinh-Gordon equation) at interior vertices. Using Taylor expansions and the symmetric structure of the $Z^2$ lattice, the author shows that the residual error is of order $O(\varepsilon^4)$ .
Comparison Principle: To establish the convergence rate, the author constructs "super-solutions" ( $w^+$ ) and "sub-solutions" ( $w^-$ ) by perturbing the restriction of the smooth solution $u$ to the lattice by terms of order $\varepsilon^2$ . By analyzing the gradient of the convex functional $S$ , it is shown that the true discrete minimizer $u_\varepsilon$ is trapped between these super- and sub-solutions.
Regularity and Higher-Order Convergence: To prove $C^\infty$ convergence, the paper adapts techniques from the theory of circle packings (specifically [HS98] and [Bü08]). This involves defining discrete directional derivatives and a discrete Laplacian. An inductive argument is used, leveraging a Regularity Lemma, to show that all discrete partial derivatives of $u_\varepsilon$ are uniformly bounded and converge to the corresponding derivatives of $u$ .

Key Contributions and Results
The primary results of the paper are summarized in Theorem 4.1 and Theorem 5.1:

$O(\varepsilon^2)$ Convergence: For a smooth solution $u$ of the sinh-Gordon equation on a compact domain, the discrete uniformizing variables $u_\varepsilon$ (obtained by solving the discrete problem with boundary values $u|_{\partial}$ ) converge uniformly to $u$ with an error bound of $|u_\varepsilon(v) - u(v)| \leq C\varepsilon^2$ .
$C^\infty$ Convergence: Due to the regular structure of the square grid, the convergence is not merely uniform but holds in the $C^\infty$ topology on the interior of the domain. All discrete derivatives of $u_\varepsilon$ converge to the derivatives of $u$ .
Geometric Convergence: As a consequence of the convergence of the parameters $u_\varepsilon$ , the hyperbolic ring patterns themselves (viewed as mappings to the hyperbolic plane $\mathbb{H}^2$ ) converge to a harmonic map to $\mathbb{H}^2$ . The limit map $h$ satisfies the relation $\partial_{\bar{z}}h / \partial_z h = e^{-2u}$ , linking the discrete geometry directly to the smooth conformal metric defined by $u$ .

Significance and Claims
The paper claims to rigorously establish the convergence of hyperbolic orthogonal ring patterns to solutions of the sinh-Gordon equation, filling a gap in the theory of discrete conformal mappings and discrete integrable systems.

Theoretical Bridge: The work provides a rigorous link between discrete geometric structures (ring patterns) and continuous nonlinear PDEs (sinh-Gordon), analogous to how orthogonal circle patterns relate to conformal maps.
Connection to CMC Surfaces: The author notes that harmonic maps to $\mathbb{H}^2$ serve as Gauss maps for constant mean curvature (CMC) surfaces in Lorentz space $\mathbb{R}^{2,1}$ . Since discrete CMC surfaces can be constructed from hyperbolic ring patterns, this convergence result implies that the family of discrete CMC surfaces associated with these patterns converges to the smooth CMC surface corresponding to the solution $u$ .
Modest Scope: The paper limits its claims to the convergence of the uniformizing variables and the associated geometric mappings under the assumption of a smooth background solution and suitable boundary conditions. It does not propose new numerical algorithms or experimental applications beyond the theoretical confirmation of the approximation properties.

In summary, the paper demonstrates that hyperbolic orthogonal ring patterns are a valid discrete model for the sinh-Gordon equation, converging with second-order accuracy in the lattice spacing and preserving smoothness in the limit.

The Paper's Story: Pixelating the Curved Universe

More like this