Multipoint Schwarz-Pick Lemma for the quaternionic case

This paper extends the complex multipoint Schwarz-Pick Lemma to the quaternionic setting of slice regular functions using iterated hyperbolic difference quotients, thereby deriving new estimates and providing an algorithm for constructing interpolating functions with real nodes.

The Gist

Imagine the mathematical world of Complex Numbers (numbers with a real part and an imaginary part, like $3 + 4i$) as a flat, two-dimensional sheet of paper. Mathematicians have spent over a century studying how shapes and maps behave on this sheet, especially when they are squashed or stretched but never torn. A famous rule called the Schwarz–Pick Lemma acts like a "speed limit" or a "rubber band tension" on this sheet. It says: If you have a function that maps the inside of a circle to itself, it can never stretch distances more than a specific amount defined by the geometry of the circle.

Now, imagine taking that flat sheet and rolling it up into a 3D sphere, but with a twist: the numbers living here are Quaternions. Quaternions are like complex numbers on steroids. Instead of just one imaginary direction (like $i$), they have three ($i, j, k$). This makes the space "wilder" and much harder to navigate because, unlike normal numbers, the order in which you multiply them matters ($A \times B$ is not always the same as $B \times A$).

This paper is about taking that famous "speed limit" rule from the flat 2D world and successfully applying it to this wild, 3D Quaternion world.

Here is the breakdown of their journey, using some everyday analogies:

1. The Problem: Navigating a Non-Commutative Maze

In the 2D world, if you want to check if a map is "safe" (doesn't stretch too much), you can look at two points. In the Quaternion world, things are messy. Because multiplication order matters, you can't just plug in any two points and expect the math to work smoothly.

The authors realized that to make the math work, they had to pick their "checkpoints" carefully. Specifically, they had to choose points that lie on the Real Line (the straight line running through the center of the sphere). Think of this as navigating a 3D maze by only walking along the central hallway; if you try to wander off into the side rooms (the imaginary directions), the rules get too complicated to solve with their current tools.

2. The Tool: The "Hyperbolic Difference Quotient"

To measure how much a function stretches or squashes space, the authors use a tool called the Hyperbolic Difference Quotient.

• The Analogy: Imagine you are a photographer taking a picture of a rubber sheet. You want to know how much the sheet stretched between Point A and Point B.
• In the complex world, you just compare the distance between the original points and the new points.
• In the Quaternion world, because the "rubber" twists and turns in 3D, you need a more sophisticated camera. The authors use an "iterated" camera. They don't just take one photo; they take a photo of the photo, then a photo of that photo, and so on.
• This "iterative" process allows them to peel back the layers of complexity, checking the stretch factor step-by-step.

3. The Main Discovery: The Multi-Point Rule

The paper proves a Multipoint Schwarz–Pick Lemma.

• The Old Rule: "If you map the circle to itself, the distance between two points can't stretch too much."
• The New Rule: "If you map the quaternionic ball to itself, the relationship between many points (3, 4, or even $N$ points) is strictly controlled."

They show that if you have a list of points (nodes) and you want to map them to specific target values, there is a strict "checklist" you must pass.

• The Checklist: You calculate a series of values (let's call them $Q$ values) by comparing your starting points to your target points using the special Quaternion math.
• The Verdict:
  • If the final $Q$ value is less than 1: You have infinite ways to draw the map. It's like having a blank canvas and infinite colors; you can paint the picture however you like, as long as you stay within the borders.
  • If the final $Q$ value is exactly 1: There is only one perfect way to draw the map. It's like a rigid mold; the shape is fixed.
  • If the final $Q$ value is greater than 1: It is impossible. No map exists that can connect these points without tearing the fabric of the universe.

4. The "Real Node" Restriction

The paper admits a limitation: This specific algorithm only works if your starting points (the nodes) are on the Real Line.

• The Metaphor: Imagine trying to solve a puzzle where the pieces are 3D cubes. The authors found a magic formula that works perfectly if all the cubes are lined up in a straight row. But if you scatter the cubes randomly in 3D space, the formula breaks down because the "twist" of the Quaternion world gets too tangled.
• However, they show that if all the points happen to lie on a single flat slice (like a 2D slice of the 3D ball), the old 2D rules apply again, and the solution is unique.

5. Why Does This Matter? (The Applications)

Why do we care about these abstract rules?

• Distortion Estimates: The authors use their new rule to calculate exactly how much a function can "squish" or "stretch" space. This is crucial for engineers and physicists who model 3D rotations and movements (like in robotics or computer graphics).
• Interpolation: This is the art of connecting the dots. If you have a set of data points and want to create a smooth curve (or surface) that passes through all of them without breaking the rules of the Quaternion world, this paper gives you the algorithm to build that curve. It tells you if it's possible and how to build it.

Summary

Think of this paper as a construction manual for 3D maps.

1. The Challenge: The 3D Quaternion world is twisted and non-commutative (order matters).
2. The Solution: The authors built a "step-by-step" measuring tool (iterated quotients) that works if you stick to the central "Real Line" highway.
3. The Result: They proved a strict rule for connecting multiple points in this 3D space. If the points pass the "distance test," you can build the map. If they fail, the map is impossible. If they hit the limit exactly, the map is unique.

They have successfully taken a classic 2D mathematical law and upgraded it to handle the complex, twisting geometry of the 3D Quaternion universe.

Technical Summary

Here is a detailed technical summary of the paper "Multipoint Schwarz–Pick Lemma for the Quaternionic Case" by Cinzia Bisi and Davide Cordella.

1. Problem Statement

The paper addresses the extension of the classical Schwarz–Pick Lemma and the Nevanlinna–Pick interpolation problem from complex analysis to the realm of quaternionic analysis.

• Context: In complex analysis, the Schwarz–Pick Lemma describes how holomorphic self-maps of the unit disk contract the Poincaré metric. It serves as the foundation for the Nevanlinna–Pick theorem, which provides necessary and sufficient conditions for the existence of a holomorphic function interpolating specific points.
• Challenge: In the quaternionic setting ($\mathbb{H}$), the notion of holomorphicity is replaced by slice regularity (introduced by Gentili and Struppa). However, the non-commutativity of quaternions and the lack of a standard composition product for slice regular functions prevent the direct application of complex analytic techniques (e.g., standard composition of functions does not preserve slice regularity).
• Goal: The authors aim to:
  1. Prove a multipoint Schwarz–Pick Lemma for slice regular functions using iterated hyperbolic difference quotients.
  2. Derive quaternionic versions of classical derivative estimates (Dieudonné and Goluzin).
  3. Provide a constructive algorithm for solving the Nevanlinna–Pick interpolation problem, specifically for real nodes.

2. Methodology

The authors employ a framework based on slice regular functions and hyperbolic difference quotients, adapting techniques from Beardon, Minda, Baribeau, Rivard, and Wegert (who worked in the complex case).

• Slice Regularity: Functions $f: \Omega \to \mathbb{H}$ are defined as slice regular if their restriction to any complex slice $C_I = \mathbb{R} + I\mathbb{R}$ is holomorphic. The paper utilizes the $\ast$-product (a non-commutative product preserving slice regularity) and $\ast$-inversion to define regular Möbius transformations.
• Hyperbolic Difference Quotients: The core tool is the definition of the hyperbolic difference quotient $f^\star_p$ for a slice regular function $f$ at a point $p$:
  $$f^\star_p(q) = (1 - qp) \ast R_{f,p} \ast (1 - f(p) \ast f(q))^{-\ast}$$
  where $R_{f,p}$ is the regular difference quotient. This allows the authors to "iterate" the Schwarz–Pick process.
• Iterated Quotients: They define higher-order quotients $f^{\{n\}}_{p_1, \dots, p_n}$ recursively. If $f$ is a Blaschke product of degree $k$, the $n$-th iteration becomes a constant if $n \ge k$.
• Restriction to Real Nodes: Due to the non-commutative nature of $\mathbb{H}$, the authors restrict the interpolation nodes $r_1, \dots, r_n$ to the real line ($(-1, 1)$). This is crucial because it ensures that the evaluation of the difference quotients does not depend on the unknown conjugate function $f^c$, which would otherwise make the algorithm non-constructive.

3. Key Contributions and Results

A. The Multipoint Schwarz–Pick Lemma

The paper establishes a generalization of the Schwarz–Pick Lemma involving $n+1$ points.

• Three-Point Lemma: For a slice regular function $f: B \to B$ (where $B$ is the unit ball) that is not a Möbius transformation, and for distinct points $p, s \in B$:
  $$|(M_{f^\star_p(s)} \bullet f^\star_p)(q)| \le |M_s(q)|$$
  Equality holds for some $q \neq s$ if and only if $f$ is a regular Blaschke product of degree 2.
• General $n$-Point Lemma: By iterating the difference quotient, they prove that for any $n$ points, the magnitude of the $n$-th iterated quotient is bounded by 1. Specifically, if $f$ is not a Blaschke product of degree $\le n$, the inequality is strict.

B. Derivative Estimates

Using the multipoint lemma and restricting to the case where $f(0)=0$, the authors derive quaternionic analogues of classical estimates:

• Dieudonné Estimates: Bounds on the hyperbolic derivative $f^h(q)$ in terms of the Euclidean distance to the boundary.
• Goluzin Estimates: A bound relating the hyperbolic derivative at a point $q_0$ to the Cullen derivative at the origin $\partial_C f(0)$.
• Distortion Theorems: Estimates for the class $B_\alpha$ (functions with $f(0)=0$ and $\partial_C f(0) = \alpha$), providing bounds on the real part and modulus of the hyperbolic derivative.

C. Nevanlinna–Pick Interpolation Algorithm

The paper provides a constructive solution to the interpolation problem $f(r_m) = s_m$ for distinct real nodes $r_m \in (-1, 1)$ and values $s_m \in B$.

• Algorithm: The authors define a sequence of quantities $Q^\ell_\kappa$ iteratively:
  $$Q^\ell_1 = M_{r_1}(r_\ell)^{-1} M_{s_1}(s_\ell)$$
  $$Q^\ell_\kappa = M_{r_\kappa}(r_\ell)^{-1} M_{Q^{\kappa-1}_{\kappa-1}}(Q^\ell_{\kappa-1})$$
• Existence Criterion: A solution exists if and only if the final term $Q^n_{n-1}$ satisfies $|Q^n_{n-1}| \le 1$.
  • If $|Q^n_{n-1}| < 1$: There exists an infinite family of solutions parameterized by an arbitrary slice regular function $h \in SR(B, B) \cup \partial B$.
  • If $|Q^n_{n-1}| = 1$: There exists a unique solution, which is a regular Blaschke product of degree $\kappa_0 \le n-1$.
• Explicit Formulas: The paper provides explicit formulas for the solutions using the $\ast$-product and Möbius actions, generalizing the Schur algorithm to the quaternionic case.

D. Limitations and Partial Results

• Non-Real Nodes: The authors demonstrate that the algorithm fails if the nodes are not real. In the general case, the evaluation of the difference quotient depends on the unknown conjugate function $f^c$, making the construction impossible without further constraints.
• Slice-Preserving Case: A partial result is offered for the case where all nodes and values lie within a single complex slice $C_I$. In this scenario, the problem reduces to the complex case, and the solution can be extended to the whole quaternionic ball.

4. Significance

• Theoretical Advancement: This work bridges a significant gap in quaternionic analysis by establishing a robust multipoint Schwarz–Pick theory, which was previously lacking due to the difficulties of non-commutativity.
• Constructive Power: Unlike previous general existence theorems (e.g., by Alpay et al., which rely on Pick matrices and functional analysis), this paper provides explicit, constructive algorithms for finding interpolating functions, provided the nodes are real.
• Geometric Insight: The results clarify the geometric behavior of slice regular functions, showing how they contract the Poincaré metric and characterizing the extremal functions (Blaschke products) that preserve this metric.
• Foundation for Future Work: By defining iterated hyperbolic difference quotients in the quaternionic setting, the paper opens the door for further studies on higher-order derivatives, Julia's Lemma, and more complex interpolation problems in non-commutative settings.

In summary, Bisi and Cordella successfully adapt the powerful machinery of iterated hyperbolic difference quotients to the quaternionic world, overcoming non-commutativity through the restriction to real nodes, and delivering a complete, constructive theory for multipoint interpolation and derivative estimates.