Skip to content

Hardy–Littlewood maximal function

The pointwise supremum of local absolute-value averages of a function over all balls or cubes containing the evaluation point.

Version
v2 · 2026-09-19 · History
Domain-specific #
4824
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Harmonic Analysis → Mathematics
Aliases
Hardy–Littlewood maximal operator

Core Idea

Centered and uncentered variants and ball-versus-cube conventions are comparable but not identical; the maximal inequality gives weak type one-one and strong Lp bounds for p greater than one. A family of neighborhoods expands and contracts around each point, each supplies an average magnitude and the supremum records the largest local concentration across scales. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Biggest Circle Average

Imagine sprinkled sugar on a table. For each spot, you draw circles around it, tiny ones and big ones, and figure out how sugary each circle is on average. Then you write down the most sugary circle you found for that spot. That biggest number, for every spot, is what this tool makes.

Biggest Average Around Here

The Hardy–Littlewood maximal function is a tool for finding where something is most bunched up. Take any spot and look at all the circles (or squares) around it, from small to large. For each one, average how much 'stuff' is inside, counting amounts as positive. The maximal function at that spot is the biggest average over all those sizes. A famous fact is that this 'biggest average' can't get wildly bigger than the original amounts overall, which makes it very useful.

Supremum of Local Averages

Given a function on space, the Hardy–Littlewood maximal function assigns to each point the supremum, over all balls around that point, of the average of the function's absolute value on the ball. It measures the largest local concentration across every scale. There are versions: centered (balls centered at the point) and uncentered (any ball containing the point), and using balls versus cubes; these are comparable in size but not identical. The key result, the maximal inequality, says the operator is bounded on Lp for p greater than 1 and satisfies a weaker 'weak type (1,1)' bound at p = 1. You must state which version and conventions you mean.

 

The Hardy–Littlewood maximal function is defined on a Euclidean or metric measure space for a locally integrable function f: Mf(x) is the supremum, over neighborhoods in a chosen family around x, of the normalized average of |f| over the neighborhood. A family of balls or cubes expands and contracts around each point, each giving an average magnitude, and the supremum captures the largest concentration across scales. Centered (balls centered at x) and uncentered (any ball containing x) variants, and ball-versus-cube conventions, are pointwise comparable but not identical. The maximal inequality states that M is of weak type (1,1) and strongly bounded on Lp for p > 1. Using it correctly requires specifying the measure and normalization, the radius range, measurability, and the precise boundedness hypotheses. It is a specific operator within harmonic analysis, not the topic itself, and its estimates should not be transferred to settings where these hypotheses fail.

Scope of Application

Hardy–Littlewood maximal function belongs to harmonic analysis and is useful where the analyst can specify the typed harmonic analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the Euclidean or metric measure space, locally integrable function, centered or uncentered neighborhood family, measure and normalization, absolute value, radius range, supremum, measurability and weak and strong boundedness hypotheses are explicit. The scope is broad within that domain but bounded by the need for the Euclidean or metric measure space, locally integrable function, centered or uncentered neighborhood family, measure and normalization, absolute value, radius range, supremum, measurability and weak and strong boundedness hypotheses are explicit.

Clarity

The abstraction clarifies a crowded vocabulary by making the Euclidean or metric measure space, locally integrable function, centered or uncentered neighborhood family, measure and normalization, absolute value, radius range, supremum, measurability and weak and strong boundedness hypotheses are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Hardy–Littlewood maximal function. Hardy–Littlewood maximal function compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: the typed harmonic analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the Euclidean or metric measure space, locally integrable function, centered or uncentered neighborhood family, measure and normalization, absolute value, radius range, supremum, measurability and weak and strong boundedness hypotheses are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of harmonic analysis because they reuse the typed harmonic analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, A family of neighborhoods expands and contracts around each point, each supplies an average magnitude and the supremum records the largest local concentration across scales., and type the carrier, state every parameter and convention in the definition, test that the Euclidean or metric measure space, locally integrable function, centered or uncentered neighborhood family, measure and normalization, absolute value, radius range, supremum, measurability and weak and strong boundedness hypotheses are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Hardy–Littlewood maximal functionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Hardy–Littlewoodmaximal functionDOMAINPrime abstraction: Scale — is a kind ofScalePRIME

Current abstraction Hardy–Littlewood maximal function Domain-specific

Parents (1) — outgoing typed relations

  • Hardy–Littlewood maximal function is a kind of Scale Prime

    It remains its own entry because its identity is fixed by the Euclidean or metric measure space, locally integrable function, centered or uncentered neighborhood family, measure and normalization, absolute value, radius range, supremum, measurability and weak and strong boundedness hypotheses.

Hierarchy path (1) — routes to 1 parentless root

  • Hardy–Littlewood maximal function → is a kind of Scale

Neighborhood in Abstraction Space

Hardy–Littlewood maximal function sits in a crowded region of the domain-specific corpus (12th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Harmonic Analysis & Time-Frequency Functions (12 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25