Overview

The Hardy inequality, first established by G. H. Hardy in the 1920s, provides a fundamental bound relating the norm of a function (or sequence) to the norm of its average. Originally motivated by attempts to simplify the proof of Hilbert’s inequality, it has since become a cornerstone of functional analysis and partial differential equations, particularly in the study of Sobolev spaces and boundary behavior. In this post, we explore the classical 1D forms, modern refinements involving logarithmic weights, and generalizations to multi-dimensional domains.

🏷️ Classical 1D Hardy Inequalities

The Hardy inequality exists in two primary forms: discrete and continuous. Both provide a sharp bound on the “averaging” operator.

1D Continuous Hardy Inequality

Let and be a non-negative function. Define . Then

The constant is sharp and is not achieved for any non-zero .

Discrete Hardy Inequality

For a non-negative sequence , the discrete form is:

This was famously proved by Elliott using an adaptation of Hardy’s integral proof [@kufnerPrehistoryHardyInequality2006].

☘️ Carleman’s Inequality as the Limit

An interesting “endpoint” case of the Hardy inequality occurs as . If we consider the discrete inequality and take the limit, we recover Carleman’s inequality for geometric means.

Carleman's Inequality

Let be a sequence of non-negative real numbers such that . Then

where is the best possible constant. This arises from the Hardy constant (Masmoudi, 2011).

🏷️ Modern Refinements and Optimality

The classical constant (for ) can be refined by adding lower-order terms that capture the “lack of achievement” of the inequality.

Refined 1D Hardy (Brezis-Marcus)

For with , we have:

Furthermore, using the logarithmic weight :

🏷️ Multi-dimensional Extensions

In , the distance to the boundary replaces the radial coordinate .

Hardy Inequality on Domains

Let be a smooth bounded domain. Then there exists a constant such that:

For convex domains, . For non-convex domains, can be strictly less than .

🌵 The Role of Convexity

If is convex, Brezis and Marcus showed that there exists a “remainder” term related to the norm:

They proved that for convex domains, . This indicates that the singularity at the boundary is robust enough to allow for a global improvement [@brezisHardyInequalitiesRevisited1997].

🏷️ Applications to PDEs

Hardy inequalities are indispensable tools for establishing the well-posedness of boundary value problems with singular coefficients.

Boundary Traces and Sobolev Spaces

In the theory of Sobolev spaces , the existence of the trace operator relies on estimates of the form:

which is a direct application of the Hardy inequality in the direction normal to the boundary (Masmoudi, 2011).

Degenerate Density in Euler Equations

When modeling compressible fluids near a vacuum boundary (e.g., a bubble of gas in space), the density often vanishes as near the boundary. The resulting singular terms in the Euler equations require weighted Hardy inequalities to control the kinetic energy and ensure the stability of the solution.

🔗 See Also

  • on interpolation theorems --- The Hardy inequality can be viewed as an endpoint case of the Hardy-Littlewood-Sobolev fractional integration, where the Riesz potential’s kernel aligns with the boundary singularity.
  • on Grönwall’s inequality --- Provides the integral stability framework used to extend local well-posedness to global solutions in systems where Hardy-type control is established.
  • on Moser iteration --- Leverages Sobolev embeddings (often initialized with Hardy estimates) to boot-strap bounds into regularity for elliptic and parabolic operators.

📚 References

🐻  Masmoudi, N. 2011. About the Hardy Inequality. An Invitation to Mathematics: From Competitions to Research, 165–180.