The $p$-Hardy-Rellich-Birman inequalities on the half-line

This paper generalizes the classical discrete $p$-Hardy inequality to arbitrary integer orders $\ell \geq 1$ to establish optimal discrete $p$-Rellich and $p$-Birman inequalities, utilizing a novel Copson inequality variant with a negative exponent and demonstrating how these results recover the continuous $p$-Birman inequality.

The Gist

Imagine you are trying to measure the "roughness" or "jaggedness" of a path. In mathematics, there's a famous rule called the Hardy Inequality. Think of it like a law of nature for paths: it says that if you have a path that starts at zero and eventually comes back to zero, the total amount of "jaggedness" (how much the path changes from step to step) must be at least a certain amount compared to how far the path wanders from the starting line.

For over a century, mathematicians have known this rule for simple, one-step changes. But what if the path is super complex, with many twists and turns, or if we are looking at changes that happen over multiple steps at once? That's where this new paper comes in.

Here is a simple breakdown of what František Štampach and Jakub Waclawek discovered:

1. The Big Idea: From Simple Steps to Complex Jumps

The authors took the classic "Hardy Rule" and upgraded it.

• The Old Rule: Measured the difference between one step and the next (like walking from step 1 to step 2).
• The New Rule: They figured out how to measure the difference between steps that are far apart, or how the "jaggedness" accumulates over many layers of change.

They call these new rules Rellich and Birman inequalities.

• Analogy: Imagine you are listening to a song.
  • The old rule measures how loud the volume changes from one second to the next.
  • The new rule measures how the tone changes, or how the melody shifts over a whole chorus. It's a much deeper, more complex measurement of the music's structure.

2. The Discrete vs. Continuous World

Mathematics often has two versions of the same story:

• The Continuous World: Like a smooth, flowing river. You can measure the water at any tiny point.
• The Discrete World: Like a staircase. You can only stand on specific steps (1, 2, 3...). You can't stand between steps.

For a long time, mathematicians had the "smooth river" version of these complex rules (for continuous functions) but were missing the "staircase" version (for sequences of numbers). This paper fills that gap. They built the staircase version of the rule and proved it works perfectly.

3. The Secret Ingredient: A "Negative" Trick

To prove their new rule, the authors had to solve a tricky puzzle. They needed a specific mathematical tool (an inequality called Copson's Inequality) but with a twist: they needed to use it with "negative weights."

• Analogy: Imagine you are trying to balance a scale. Usually, you add weights to one side to make it go down. But in this proof, they had to imagine "negative weights" (like lifting the scale up) to make the math work. This was a clever, unexpected move that might be useful for other mathematicians solving different puzzles later.

4. Why Does This Matter? (The "Perfect" Constant)

In math, when you say "X is at least Y," you want Y to be as big as possible. If Y is too small, the rule is weak. If Y is the biggest possible number that still holds true, it's called optimal or sharp.

The authors didn't just find a rule; they found the perfect rule.

• Analogy: Think of a speed limit sign. If the sign says "Speed limit: 100 mph," but the car can actually safely go 120 mph, the sign is weak. If the sign says "120 mph," that's the optimal limit.
• These authors proved that their numbers are the absolute maximum possible limits. You can't make the rule any stronger without breaking it.

5. The Bridge Between Worlds

One of the coolest parts of the paper is how they used their "staircase" (discrete) discovery to prove the "river" (continuous) version again.

• The Metaphor: Imagine you have a high-resolution digital photo (discrete) and a smooth painting (continuous). Usually, you use the painting to understand the photo. But here, they used the pixelated photo to reconstruct the painting and prove the painting's rules were correct. It's a fresh, alternative way to look at old problems.

Summary

In short, this paper is about generalizing a famous mathematical law of "roughness" to handle much more complex, multi-step changes. They did this for both smooth curves and stepped sequences, found the absolute best possible numbers for these rules, and used a clever new trick involving "negative weights" to get there. It's like upgrading a basic ruler to a laser scanner that can measure the most intricate details of a shape.

Technical Summary

Here is a detailed technical summary of the paper "The p-Hardy–Rellich–Birman Inequalities on the Half-Line" by František Štampach and Jakub Waclawek.

1. Problem Statement

The paper addresses the generalization of classical Hardy inequalities to higher-order derivatives and arbitrary $L^p$ norms ($p > 1$) in the discrete setting (sequences on the integer half-line $\mathbb{N}_0$).

• Context: The classical discrete Hardy inequality (1918) relates the $\ell^p$-norm of a sequence to the $\ell^p$-norm of its first discrete difference. The continuous analogue involves the derivative of a function.
• Gap: While higher-order continuous inequalities (Birman and Rellich inequalities) are well-established for $p=2$ and generally for $p>1$, their discrete counterparts for general $p > 1$ and arbitrary integer order $\ell \geq 1$ were largely unknown or incomplete.
• Objective: To establish the sharp discrete $p$-Birman inequality for any order $\ell \in \mathbb{N}$ and $p > 1$, determine the optimal constants, and demonstrate how these discrete results recover the continuous versions.

2. Methodology

The authors employ a combination of discrete analysis, induction, and asymptotic analysis to bridge the gap between discrete and continuous settings.

A. Discrete Operators and Notation

The paper defines discrete gradient ($\nabla$) and divergence ($\text{div}$) operators on sequences $u \in C_0(\mathbb{N}_0)$:

• $\nabla u_n = u_n - u_{n-1}$ (with $u_{-1}=0$).
• $\text{div} u_n = u_{n+1} - u_n$.
• Higher-order derivatives are defined via powers of the gradient: $\nabla^\ell$.
• The authors adopt a convention where sequences vanish for negative indices, ensuring commutativity between $\nabla$ and $\text{div}$.

B. Abstract Weighted Inequality (Lemma 4 & Proposition 5)

The core technical tool is an abstract weighted $p$-Hardy inequality derived from an auxiliary inequality involving complex numbers and parameters $t \in [0,1]$.

• Proposition 5 establishes a lower bound for $\sum V_n |\nabla u_n|^p$ in terms of a weighted sum of $|u_n|^p$, provided specific conditions on the weight sequences $V_n$ and an auxiliary sequence $g_n$ are met.
• This framework allows the authors to construct specific weights to prove new inequalities.

C. Proof of the Weighted Copson Inequality (Theorem 3)

A crucial intermediate step is proving a variant of the Copson inequality with a negative exponent ($\alpha < 0$).

• Standard Copson inequalities usually require non-negative weights. The authors prove that for $\alpha < 0$, the inequality holds with a specific optimal constant $C_p(\alpha) = \left(\frac{p-\alpha-1}{p}\right)^p$, provided the weight on the right-hand side is adjusted to $(n+1)^{\alpha-p}$.
• This is achieved by carefully choosing the sequence $g_n$ involving the Gamma function ratio in Proposition 5 and analyzing the convexity of an auxiliary function $H(x)$.

D. Inductive Proof of the Main Result (Theorem 1)

The main theorem (discrete $p$-Birman) is proven by mathematical induction on the order $\ell$:

1. Base Case ($\ell=1$): Reduces to the classical discrete $p$-Hardy inequality.
2. Inductive Step: Assuming the inequality holds for order $\ell-1$, the authors use the identity $\nabla^\ell = \nabla^{\ell-1} \circ \text{div}$ (or similar compositions) and apply the weighted Copson inequality (Theorem 3) with a specific negative exponent $\alpha = -(\ell-1)p$.
3. This iterative application yields the constant $B_p^{(\ell)} = \left(\frac{p-1}{p}\right)^{p\ell}$.

E. Discrete-to-Continuous Transition (Section 3)

To prove the optimality of the constants and recover continuous results, the authors use a sampling argument:

• They define a discrete sequence $v_n^{(N)} = \phi(n/N)$ from a smooth test function $\phi \in C_0^\infty(\mathbb{R}^+)$.
• Using Lemma 8, they show that the discrete derivative $\nabla^\ell v_n^{(N)}$ approximates the continuous derivative $\phi^{(\ell)}(n/N)$ scaled by $N^{-\ell}$ as $N \to \infty$.
• By applying the discrete inequality to these sequences and taking the limit $N \to \infty$, they recover the continuous $p$-Birman inequality.

F. Optimality Proof (Section 4)

The sharpness of the constants is proven by constructing approximating sequences of test functions (using cut-off functions $\xi_N$) that behave like $x^{\ell - 1/p}$ near the origin.

• The ratio of the numerator (derivative norm) to the denominator (weighted function norm) converges to the proposed constant $B_p^{(\ell)}$ as the support of the cut-off function expands.
• The authors note that proving sharpness in the continuous case is technically simpler and sufficient to imply sharpness in the discrete case due to the convergence established in Section 3.

3. Key Contributions and Results

Theorem 1: Discrete $p$-Birman Inequality

For any $\ell \in \mathbb{N}$ and $p > 1$, and for all sequences $u \in C_0(\mathbb{N}_0)$ with $u_n = 0$ for $n < \ell$:
$$\sum_{n=\ell}^\infty |\nabla^\ell u_n|^p \geq B_p^{(\ell)} \sum_{n=\ell}^\infty \frac{|u_n|^p}{n^{\ell p}}$$
where the optimal constant is:
$$B_p^{(\ell)} = \left( \frac{p-1}{p} \right)^{p\ell}$$

• Significance: This unifies the discrete Rellich inequality ($\ell=2, p=2$) and generalizes it to arbitrary orders and $L^p$ spaces. It completes the picture of $p$-Birman inequalities on the half-line.

Theorem 3: Discrete Copson Inequality with Negative Exponent

For $p > 1$, $\alpha < 0$, and $u \in C_0(\mathbb{N}_0)$ with $u_0=0$:
$$\sum_{n=1}^\infty n^\alpha |\nabla u_n|^p \geq C_p(\alpha) \sum_{n=1}^\infty (n+1)^{\alpha-p} |u_n|^p$$
where $C_p(\alpha) = \left( \frac{p-\alpha-1}{p} \right)^p$.

• Significance: This variant is of independent interest as it handles negative weights, a regime where standard Copson inequalities fail, and is essential for the inductive proof of the main theorem.

Recovery of Continuous Results

The paper provides an alternative proof of the continuous $p$-Birman inequality:
$$\int_0^\infty |\phi^{(\ell)}(x)|^p dx \geq B_p^{(\ell)} \int_0^\infty \frac{|\phi(x)|^p}{x^{\ell p}} dx$$
This is derived directly from the discrete version, offering a novel perspective on the classical continuous result.

4. Significance and Implications

1. Completeness of Theory: The paper fills a significant gap in the literature by providing the first complete formulation and proof of discrete $p$-Birman inequalities for general $p > 1$ and $\ell \geq 1$.
2. Optimality: All constants derived are proven to be sharp (optimal). This is crucial for applications in spectral theory, where these inequalities provide lower bounds for the spectrum of discrete Laplacians and higher-order operators.
3. Methodological Innovation: The use of a negative-exponent Copson inequality as a stepping stone for higher-order discrete inequalities is a novel technique.
4. Bridge Between Discrete and Continuous: The rigorous derivation of continuous inequalities from discrete ones via sampling limits reinforces the structural similarity between discrete and continuous analysis, providing a unified framework.
5. Future Directions: The authors briefly discuss "critical weights," noting that while the multiplicative constants are optimal, the weight functions themselves ($n^{-\ell p}$) may admit pointwise improvements in the discrete case (unlike the continuous case), pointing to future research in stronger forms of optimality.

In summary, this work establishes a fundamental set of inequalities for discrete analysis, generalizing classical results to higher orders and arbitrary $L^p$ spaces, with rigorous proofs of optimality and clear connections to continuous theory.