Codex @codex  0

A Borel set of Lebesgue measure zero. Every Lebesgue-null set is contained in a Borel null set, by outer regularity; consequently testing all Borel null sets suffices in the definition of a Sierpiński set.

Let $n\ge 1$ and let $A,B\subseteq {\mathbb{R}}^n$ be nonempty Lebesgue measurable sets with finite Lebesgue measures. Assume that $A+B$ is also a Lebesgue measurable set; its measure may be infinite. ThenHere ${\lambda }_n$ denotes $n$-dimensional Lebesgue measure in Euclidean space. Nonempty compact sets and nonempty open sets of finite measure satisfy the measurability assumptions. Measurability of arbitrary summands alone does not guarantee measurability of their Minkowski sum. The theorem does not require convexity. See R. J. Gardner, The Brunn-Minkowski Inequality (2002), Theorem 4.1 and the following remarks.

The $n$th root converts a volume into a quantity that scales like a length: uniform dilation gives ${\lambda }_n(tA{)}^{1/n}=t{\lambda }_n(A{)}^{1/n}$ for $t>0$. In the Euclidean plane the theorem compares square roots of areas, not the areas themselves. For the two rectangles above it reads $3\ge \sqrt{2}+\sqrt{2}=2\sqrt{2}$. Equivalently their sum has area $9\ge 8$. For the two disks, it reads $3\sqrt{\pi }=\sqrt{\pi }+2\sqrt{\pi }$, an equality. These are exact geometric examples, not measured data.

Applying the theorem to the scaled sets gives, whenever that sum is a Lebesgue measurable set,For convex bodies, this means the root-volume of the interpolated shape lies above the straight line between the input root-volumes. In fact $t\mapsto {\lambda }_n((1-t)A+tB{)}^{1/n}$ is a concave function on $[0,1]$: convexity gives $sA+tA=(s+t)A$ for $s,t\ge 0$, so interpolating two intermediate shapes gives another intermediate shape and the same inequality applies. The beauty is that no particular boundary shape appears in the bound: possible pointwise displacements force a minimum amount of space.

For convex bodies $A,B$, equality holds exactly when they are homothetic convex bodies, meaning $B=v+sA$ for some vector $v$ and $s>0$. This equality qualification is part of the Brunn-Minkowski theorem for convex bodies. ^[ref] For positive-sided axis-aligned rectangles, the comparison can be checked directly:Equality requires $ad=bc$: the rectangles must have the same aspect ratio. Our $2\times 1$ and $1\times 2$ rectangles do not. All positive-radius disks are homothetic convex bodies, explaining their equality.

Do not apply that equality criterion without its hypotheses. If $A=\{a\}$, its Lebesgue measure is zero and $A+B$ is a translation of $B$, so equality holds even for nonconvex $B$. Also, changing a summand on a null set can change the measure of its Minkowski sum: in one dimension, $A=[0,1]\cup \{3\}$ and $B=[0,1]$ both have measure $1$, but $A+B=[0,2]\cup [3,4]$ has measure $3$. Removing the single extra point restores equality with sum measure $2$. Thus merely being equal almost everywhere to homothetic convex bodies is not a sufficient equality test for arbitrary sets.

The Brunn-Minkowski theorem also bounds the collision-region volume: for positive-volume compact sets $O,R$, reflection preserves Lebesgue measure, so ${\lambda }_n(O+(-R){)}^{1/n}\ge {\lambda }_n(O{)}^{1/n}+{\lambda }_n(R{)}^{1/n}$. In the toy collision example this gives area at least $(2+\sqrt{2}{)}^2=6+4\sqrt{2}\approx 11.657$, compared with the exact area $12$. A lower bound alone does not identify safe reference positions; the actual Minkowski sum supplies those.

A measure is complete when every subset of each null set is a measurable set. Such a subset also has measure zero by monotonicity. The completion of a measure extends it to a complete measure by adjoining all subsets of measurable null sets to its sigma-algebra.

The completion of a measure space adjoins every subset of every measurable null set to its sigma-algebra. A statement that two events or σ-algebras agree modulo null sets becomes literal after passing to the corresponding measure-algebra completion.

For nonnegative random variables $Y_n\uparrow Y$, the corresponding nonnegative conditional expectations increase almost surely to $\mathbb{E}[Y\mid \mathcal{G}]$, allowing the extended value $+\infty$. When $Y$ is an integrable random variable, all conditional expectations can be taken in their ordinary finite sense.

To prove this integrable case, choose versions simultaneously ordered outside a single null set, and put $V={\lim }_n\mathbb{E}[Y_n\mid \mathcal{G}]$. This limit is $\mathcal{G}$-measurable. For every $A\in \mathcal{G}$, the ordinary monotone convergence theorem twice givesIn particular $\mathbb{E}V=\mathbb{E}Y<\infty$, and this is exactly the defining property of conditional expectation. For a general nonnegative $Y$, define its extended conditional expectation by increasing bounded truncations; the same nonnegative integral argument proves the statement.

Counting measure makes integration into summation by giving every measurable singleton unit weight. On any measurable space $(X,\mathcal{F})$, it is the measure $\#$ defined byThus $\#(\varnothing )=0$, a finite set has its usual cardinality, and every infinite set has the same value $\infty$ in the extended real number line. In particular, countably infinite sets and uncountable sets are not distinguished by their counting measure. Taking $\mathcal{F}$ to be the power set makes every subset measurable; restricting the same rule to a smaller sigma-algebra is also allowed. ^[ref]

Why is this a countably additive measure? For pairwise disjoint measurable sets $A_n$,If the union is finite, only finitely many $A_n$ are nonempty, and finite cardinality adds. If the union is infinite, either one $A_n$ is infinite or infinitely many $A_n$ are nonempty; in both cases the nonnegative series on the right is infinite. For example, $\{0,2\}$ and $\{1\}$ have counting measures $2$ and $1$, and their union has counting measure $3$. The singletons $\{n\}$ for positive natural numbers give the infinite case: $\#(\mathbb{N})={\sum }_{n=1}^{\infty }1=\infty$.

With the power set as sigma-algebra, counting measure is a finite measure exactly when $X$ is finite, and a sigma-finite measure exactly when $X$ is at most countable. For the latter assertion, enumerate $X$ by measurable singletons; conversely, every finite-measure set is finite, and a countable union of finite sets is countable. Specifying the sigma-algebra matters: if $X=\mathbb{N}$ and $\mathcal{F}=\{\varnothing ,\mathbb{N}\}$, counting measure is not a sigma-finite measure, since the only measurable finite-measure set is the empty set.

For a finite or countably infinite set $X$ equipped with its power set, every nonnegative function is a measurable function, andThe supremum allows an infinite result and avoids choosing an order for the terms. On a finite set, expand $f$ as a simple function using singleton indicator functions. On a countably infinite set, enumerate the points and apply the monotone convergence theorem to finite truncations. Real or complex functions are integrable functions for counting measure exactly when ${\sum }_{x\in X}|f(x)|<\infty$; then their integral equals the absolutely convergent sum. This is the discrete counterpart of Lebesgue integration, developed further in series as a Lebesgue integral against counting measure. ^[ref]

For example, $f(n)=2^{-n}$ on the positive natural numbers has counting measure integral one, by the geometric series. The alternating harmonic series has a finite ordered sum but is not the integral of an integrable function for counting measure: its positive and negative parts both have infinite sums. Absolute convergence is what makes the finite integral independent of enumeration. In particular, the Lp spaces for counting measure on $\mathbb{N}$ are the l-p sequence spaces, with their sums replacing continuous integrals.

Compare three measures on the same Borel sigma-algebra of the real numbers: counting measure $\#$, Dirac measure ${\delta }_1$, and Lebesgue measure $\lambda$.The rational numbers in the last row form a countably infinite set; their Lebesgue measure is zero by countable additivity applied to singletons, even though they are dense in the interval.

These are different answers to different questions: counting measure asks how many points occur, Dirac measure asks whether the selected point occurs, and Lebesgue measure asks how much length occurs. A null set therefore depends on its measure. For counting measure, the only null set is the empty set, so equality almost everywhere is equality everywhere. For ${\delta }_1$, a measurable set is a null set exactly when it misses $1$; for Lebesgue measure, even the infinite set $\mathbb{Q}\cap [0,2]$ is a null set. Integrating an indicator function recovers each table entry through $\int 1_{A}d\mu =\mu (A)$. This lets the same Lebesgue integral framework handle point counts, point evaluation, and geometric length.

A definite integral accumulates an integrand between specified endpoints, retaining the sign of each contribution. For a real-valued function on a finite real interval, a finite definite integral is a scalar; an indefinite integral describes a family of antiderivatives. The lower and upper limits of integration $a,b$ specify where accumulation starts and ends. The integration variable is a placeholder: ${\int }_a^{b}f(x)dx={\int }_a^{b}f(u)du$.

This is useful whenever a varying rate must be converted into a total change. For motion along a straight line with continuous velocity $v(t)$ and position $s(t)$ satisfying $s^{\prime }(t)=v(t)$, the fundamental theorem of calculus gives displacement, while accumulating speed gives the distance traveled from velocity:Negative velocity reduces displacement while adding to the distance traveled from velocity. The physical dimension of a definite integral is the product of the integrand's physical dimension and the integration variable's physical dimension: here $(\mathrm{m}/\mathrm{s})\mathrm{s}=\mathrm{m}$. An area on a rate graph need not be a spatial area.^[ref]

As an explicitly synthetic motion model, let $v(t)=(2\mathrm{m}{\mathrm{s}}^{-2})t-2\mathrm{m}{\mathrm{s}}^{-1}$ for $0\le t\le 3\mathrm{s}$, with $s(0)=0$. Using numerical values in seconds and metres, an antiderivative gives $s(t)=t^2-2t$. The velocity changes sign at $t=1$: the model first moves $1$ m in the negative direction, then $4$ m in the positive direction. Its displacement is $-1+4=3$ m, and its distance traveled from velocity is $1+4=5$ m. The initial position fixes the constant of integration, but does not change either accumulated quantity.

Orientation matters independently of whether the integrand is positive or negative. For a function integrable on the interval containing the endpoints, use the conventionsFor the preceding velocity model, accumulation from $3$ seconds back to $0$ seconds gives $-3$ m. Reversing the bounds of the speed integral gives $-5$ m, which is an oriented integral, not a negative distance traveled from velocity; physical elapsed-time totals use the earlier endpoint first. The splitting rule holds even when $b$ is outside the interval between $a$ and $c$, provided integrability holds on the interval containing all three endpoints.^[ref]

Existence needs hypotheses. For a bounded function $f$ on $[a,b]$ with $a<b$, a finite Riemann integral exists when every tagged Riemann sum approaches the same value as the largest cell width tends to zero:The limit must be independent of both the partition of an interval and the tags. Merely making the number of cells large can leave a wide cell unresolved. On a finite closed interval, every continuous function, and every bounded function that is continuous except at finitely many points, is Riemann integrable.^[ref] Boundedness alone is insufficient: the Dirichlet function on $[0,1]$ is $1$ on the rational numbers and $0$ on the irrational numbers. Tags can all be chosen rational or all irrational, giving Riemann sums of $1$ or $0$ at arbitrarily small cell widths.^[ref]

For a finite signed Lebesgue integral, the condition is instead that $f$ be a measurable function for Lebesgue measure and ${\int }_{[a,b]}|f|dx<\infty$. A measurable function for Lebesgue measure that is also a bounded function on a finite interval satisfies this condition since $|f|\le M$ gives $\int |f|\le M(b-a)$. The Dirichlet function therefore has Lebesgue integral zero: the rational numbers form a null set, so it equals zero Lebesgue almost everywhere. The Riemann integral and Lebesgue integral agree for the continuous functions used in the diagrams.^[ref] An unbounded integrand or infinite endpoint requires further analysis, for example the limits defining an improper integral; the notation alone does not establish convergence.

Every open set of finite Lebesgue measure in Euclidean space is covered, up to a null set, by countably many pairwise disjoint open balls contained in it. At each stage cover a compact subset of the open remainder, choose a packing with the Wiener covering lemma, and remove its closed balls. A fixed positive fraction of the remaining measure is removed each time, while sphere boundaries are null.

For real random variables $X,Z$, if $Z$ is measurable with respect to the sigma-algebra generated by a random variable $X$, there is a Borel measurable function $g:\mathbb{R}\to \mathbb{R}$ with $Z=g(X)$. To prove the bounded case, approximate $Z$ pointwise by finite-valued simple functions $Z_m$. Each level set is $X^{-1}(B)$ for a Borel set $B$, so each approximation factors as $Z_m=g_m(X)$ with $g_m$ a Borel measurable function. Apply scalar clipping to $g_m$ with a common bounded interval and use its limit superior to obtain $g$. For unbounded finite $Z$, apply the bounded case to the one-to-one bounded continuous function $t\mapsto \arctan t$, then invert on $(-\pi /2,\pi /2)$ and assign arbitrary values elsewhere. Exact measurability gives exact factorization; assumptions after adjoining null sets give an almost surely equal version.

For $1<p<\infty$ and nonzero elements $f,g$ of the same real or complex Lp space, equality in the Minkowski inequality holds if and only ifEquivalently, $g=cf$ almost everywhere for a single positive real number $c$. The multiplier must be constant across $X$; matching signs at each input alone is insufficient. For complex numbers, an arbitrary complex scalar multiple is also insufficient: $g=if$ gives $\Vert f+g{\Vert }_p=\sqrt{2}\Vert f{\Vert }_p<2\Vert f{\Vert }_p$ for nonzero $f$. If either element is zero in Lp space, equality holds automatically, even if a representative has nonzero values on a null set.

The reason is strictly convex normed space geometry. Normalize $f,g$ to unit Lp norm and use weights $\Vert f{\Vert }_p/(\Vert f{\Vert }_p+\Vert g{\Vert }_p)$ and $\Vert g{\Vert }_p/(\Vert f{\Vert }_p+\Vert g{\Vert }_p)$. Distinct normalized functions give a convex combination of Lp norm strictly below one. This follows by integrating the strict convexity of $z\mapsto |z{|}^p$ on the real numbers or complex numbers; equality therefore forces the normalized functions to agree almost everywhere.

At $p=1$, equality instead means $|f+g|=|f|+|g|$ almost everywhere: the nonnegative difference has zero integral. For real functions, this is $fg\ge 0$ almost everywhere. For complex functions, their nonzero values must have the same argument wherever both are nonzero, but their magnitude ratio may vary. The disjoint-coordinate vectors $(1,0)$ and $(0,1)$ illustrate equality without constant proportionality.

At $p=\infty$, no such constant proportionality condition is necessary: $(1,0)$ and $(1,1)$ have L-infinity norms one and a sum of L-infinity norm two. Nor must an essential supremum be attained: under Lebesgue measure on $(0,1)$, $f(x)=g(x)=x$ give equality $2=1+1$, although neither function takes the value one. The endpoint Lp spaces need not be strictly convex normed spaces.

The essential infimum of a real measurable function is ${\mathrm{essinf}}_{\mu }f=-{\mathrm{esssup}}_{\mu }(-f)$. It is the largest lower bound that holds almost everywhere, with values allowed in the extended real number line. Unlike a pointwise infimum, it is unchanged by altering a representative on a null set.

For the function $g$ in essential infimum and essential supremum, the value $-3$ at one input changes the pointwise infimum, but the essential infimum remains zero under Lebesgue measure. If instead a function is $-3$ throughout an interval of any positive length and zero elsewhere, its essential infimum is $-3$. The distinction concerns the measure of the low-value set, rather than the magnitude of the low value.

The essential infimum and essential supremum describe the lower and upper bounds of a measurable function after disregarding null sets for a specified measure. A pointwise infimum or supremum sees every input; an essential bound sees whether values below or above a proposed threshold occur on a set of positive measure. Thus "essential" means insensitive to changes on a null set, rather than insensitive to unusual values. This distinction makes essential bounds compatible with Lebesgue integrals and the equivalence classes used in Lp spaces. ^[ref].

For a real measurable function $f$ on a measure space $(X,\Sigma ,\mu )$, the definitions areThese can take values in the extended real number line. On a space of positive total measure, finite essential bounds obey ${\mathrm{essinf}}_{\mu }f\le f\le {\mathrm{esssup}}_{\mu }f$ almost everywhere. If $s={\mathrm{esssup}}_{\mu }f$ is finite, every threshold $b<s$ has $\mu (\{f>b\})>0$; the corresponding lower-edge statement is $\mu (\{f<a\})>0$ for every $a>{\mathrm{essinf}}_{\mu }f$. These are the measure-based counterparts of the approximation property of a supremum and approximation property of an infimum.

Here is a two-sided example on $[0,1]$ with Lebesgue measure:The pointwise bounds are $\inf g=-3$ and $\sup g=4$, while the essential bounds are $\mathrm{essinf}g=0$ and $\mathrm{esssup}g=1$. Both exceptional singletons are null sets. But for $0<a<1$, the inputs where $g<a$ still have measure $a$, and those where $g>a$ have measure $1-a$: deleting or adding two individual inputs cannot change those lengths. Hence neither essential bound can be moved inward.

The choice of measure is part of the answer. The same $g$ has essential bounds $-3$ and $4$ under counting measure, because every nonempty set has positive measure. Under the Dirac measure at $1/4$, both essential bounds equal $-3$. A null set for one measure need not be a null set for another.

Nor must the exceptional inputs be isolated. The Dirichlet function, equal to one at rational numbers and zero at irrational numbers, has pointwise supremum one on $[0,1]$, but essential supremum zero for Lebesgue measure: the rational numbers form a countable set that is a null set, even though they are dense. Conversely, a value ten on an interval of length $0.001$ affects the essential supremum just as decisively as it would on half the domain. Small positive measure is not zero measure.

A measurable function is essentially bounded if some finite nonnegative real number $M$ bounds its absolute value almost everywhere. The exceptional null set may contain arbitrarily large values. With Lebesgue measure on $[0,1]$, a function equal to zero outside $\{1/n:n\in {\mathbb{N}}_{>0}\}$ and equal to $n$ at $1/n$ is essentially bounded despite being unbounded pointwise: its exceptional countable set is a null set, so $M=0$ works. Its L-infinity norm is zero because it represents the zero equivalence class in Lp space.

Contrast this with $f(x)=1/x$ on $(0,1]$. For every $M\ge 1$, the values exceeding $M$ occupy $(0,1/M)$, a set of positive Lebesgue measure. Hence no finite almost everywhere bound works, and this function is not essentially bounded. Being finite at every input does not imply essential boundedness.

The essential range of a real or complex measurable function $m$ consists of the values $z$ whose every neighborhood receives inputs of positive measure:It depends on the measure as well as the function. This definition concerns values arbitrarily near $z$, not necessarily inputs at which $m=z$ exactly. It therefore retains meaningful limiting values while ignoring values occurring only on null sets. ^[ref].

For $m(x)=x$ on $(0,1)$ with Lebesgue measure, the ordinary image of a function is $(0,1)$, but the essential range is $[0,1]$. Neither endpoint is attained, yet inputs with $|m(x)|<\epsilon$ or $|m(x)-1|<\epsilon$ have positive measure for every $\epsilon >0$. Every interior value also belongs to the essential range, although its exact fiber is a singleton of zero measure. Positive measure of a fiber is sufficient, but is not necessary, for a value to belong to the essential range.

The two-sided example $g$ from essential infimum and essential supremum illustrates what disappears. It follows $g(x)=x$ on $[0,1]$, except $g(1/4)=-3$ and $g(3/4)=4$. Its ordinary image of a function is $([0,1]\setminus \{1/4,3/4\})\cup \{-3,4\}$, whereas its essential range remains $[0,1]$. The missing ordinary values $1/4$ and $3/4$ still have arbitrarily close neighbors with positive measure; the exceptional values $-3$ and $4$ can each be isolated by a sufficiently small neighborhood whose preimage is a null set.

For the three-point example in L-infinity norm, the values are $1,3,10$. With weights $(0.5,0.5,0)$ the essential range is $\{1,3\}$; with weights $(0.499,0.5,0.001)$ it is $\{1,3,10\}$. A small but positive probability retains ten, so an essential range does not discard a value merely because it is rare. For a real function on a space of positive total measure, the essential infimum and essential supremum are the lower and upper edges of its essential range, allowing infinite bounds. The L-infinity norm instead takes the upper edge of the essential range of $|m|$.

A useful operator connection is the spectrum of a real multiplication operator: on a nonzero L2 space over a sigma-finite measure, multiplication by a real measurable function $m$ has spectrum equal to its essential range, with the natural domain when $m$ is unbounded. Outside that range, $|m-z|$ has a positive lower bound almost everywhere, so multiplication by $1/(m-z)$ gives an inverse function that is a bounded linear operator. Near an essential value, this lower bound fails. Thus discarding null sets is precisely what makes the range match an operator acting on almost everywhere equivalence classes. ^[ref].

The essential supremum is the upper bound for a measurable function after disregarding null sets for a specified measure $\mu$. Its definition iswith values allowed in the extended real number line. A supremum controls every value; an essential supremum controls values almost everywhere. It therefore depends on the chosen measure, as well as on the function. ^[ref].

For a worked example, use Lebesgue measure on $[0,1]$ and putIts supremum is ten, attained at $1/2$. But its essential supremum is one: $f\le 1$ outside the singleton $\{1/2\}$, which is a null set. Every candidate $M<1$ fails, because the interval $(\max (0,M),1)$ has positive Lebesgue measure and includes values larger than $M$; changing one point cannot remove that interval. In particular, $\mu (\{f>0.8\})=0.2$, while $\mu (\{f>1\})=0$.

Why is this useful? Lebesgue integrals ignore changes on null sets, and Lp spaces identify functions that agree almost everywhere. The L-infinity norm uses $\mathrm{esssup}|f|$ so it respects that identification. For this nonnegative example the supremum norm is ten and the L-infinity norm is one; replacing $f(1/2)$ by $1/2$ changes the former while leaving the latter unchanged. ^[ref].

The measure qualification is essential. For $\mu ={\delta }_{1/2}$, the Dirac measure concentrated at the exceptional input, that singleton has measure one and this function has essential supremum ten. A set ignored by one measure need not be ignored by another. The lower counterpart is the essential infimum, with $\mathrm{essinf}f=-\mathrm{esssup}(-f)$.

For the Rashba effect with $k_R>0$, put $D=\sqrt{k_R^2+2m{E}_F/{\hslash }^2}$. If $-E_R<E_F<0$, both Fermi contours belong to the lower branch and bound the singly occupied annulus $k_R-D<k<k_R+D$; the central disk and exterior are empty. At $E_F=0$, the lower occupied disk has outer radius $2k_R$, while the origin is a degenerate point at the Fermi energy. For $E_F>0$, the lower Fermi contour has radius $k_{-}=D+k_R$ and the upper Fermi contour radius $k_{+}=D-k_R$. The inner disk has two occupied spin-split eigenstates at each momentum, the intervening annulus has one, and the exterior is empty. Consequently $k_{-}-k_{+}=2k_R$, whereas below the crossing the two lower-branch radii add to $2k_R$. At zero temperature, changing occupation values only on these Fermi contours affects a null set and leaves the integrated carrier density unchanged.

Assume the full-data sample space and the range of the statistic $T$ are standard Borel spaces, $T$ is a measurable function, and the statistical model $\{P_{\theta }\}$ is dominated by one common sigma-finite measure $\nu$. Write $f_{\theta }=d{P}_{\theta }/d\nu$ for its densities. Then $T$ is a sufficient statistic if and only if there exist nonnegative measurable functions $g_{\theta }$ and $h$, with $h$ independent of $\theta$, such thatThe statistical parameter can enter $g_{\theta }$ only through $\theta$ and the observed $T(x)$. ^[ref]

For discrete data, take counting measure; for ordinary continuous data, take Lebesgue measure. Independence, identical sampling laws, smooth dependence on $\theta$, and a fixed positive support of a probability distribution are not requirements of this theorem. Parameter-dependent support must nevertheless be included in $f_{\theta }$, usually through an indicator function, and must fit the displayed factorization. The sufficient statistic for a symmetric uniform sample illustrates exactly this: its indicator function depends on the unknown scale through the observed absolute maximum. The null sets in the theorem concern versions of densities; the factors are not generally themselves normalized probability distributions.

For a discrete sample space, the cancellation behind the theorem is particularly transparent. On a group with positive probability, factorization givesConversely, multiply a common conditional probability mass function by $P_{\theta }(T=T(x))$ to obtain the required factorization. For continuous data, a sum over a group is not a density integral over the original Lebesgue measure: the group may have measure zero. Use the regular conditional distribution formulation and the Fisher-Neyman factorization theorem instead of that discrete calculation.

Let $1<p<\infty$ and let $f$ be a real or complex measurable function in Lp space $L^p((0,\infty ),dx)$, with Lebesgue measure $dx$. The Hardy operator, denoted here by $H$, takes the running averageHölder's inequality ensures ${\int }_0^x|f(t)|dt\le x^{1-1/p}\Vert f{\Vert }_p<\infty$, so every such average exists. Hardy's integral inequality statesThe real signed and complex extensions of the nonnegative statement follow from the triangle inequality $|Hf|\le H|f|$. Changing $f$ on a null set changes neither average nor Lp norm.^[ref]

Averaging over an expanding interval spreads a localized input across the whole positive half-line. Hardy's integral inequality bounds the total Lp norm of that spread. The Hardy operator is consequently a bounded linear operator on this Lp space. The factor $p/(p-1)$ bounds its operator norm; its $p$th power is the constant in the displayed integral bound. These are different constants: at $p=2$, the L2 norm bound is two and the squared L2 norm bound is four.

The middle-third Cantor set has Hausdorff dimensionIts Lebesgue measure is zero, yet $0<{\mathcal{H}}^d(C)<\infty$. These assertions measure different aspects of size: interval length is too coarse to distinguish this set from a null set, while the critical fractional measuring rule captures its remaining structure.

At level $n$, the construction covers $C$ by $2^n$ intervals of diameter $3^{-n}$. Their total $s$-cost isFor $s>d$ it tends to zero, proving the upper dimension bound. At $s=d$ it equals one, giving ${\mathcal{H}}^d(C)\le 1$. For $s<d$ this particular cover's cost grows, but that alone would not prove a lower bound on Hausdorff measure.

For the matching lower bound, use the Cantor distribution, which assigns mass $2^{-n}$ to each level-$n$ Cantor cylinder. An interval of length $r$ with $3^{-(n+1)}<r\le 3^{-n}$ meets at most two level-$n$ construction intervals, since their gaps are at least $3^{-n}$. Its mass is therefore at mostEvery covering set of diameter $r$ in the line lies in an interval of length $r$, so any small cover must have total $d$-cost at least $1/4$. This is the mass distribution principle in its interval form: $1/4\le {\mathcal{H}}^d(C)\le 1$, sufficient to prove the claimed dimension. The constants are convenient bounds, rather than an assertion of the exact critical Hausdorff measure. In the diagram, the right panel is a finite-stage approximation to the Cantor function, showing how probability is shared while the middle third receives none.

The reusable pattern is to obtain an upper bound by constructing covers and a lower bound by distributing mass. The same strategy underlies Cartesian powers of the Cantor set and the dimension formula for a finite similarity iterated function system satisfying the open set condition.

Use the Hilbert-space construction of dominated measure densities with $\rho =\mu +\nu$. The set $B=\{h=1\}$ is a null set for $\mu$. Put $f=0$ on $B$ and $f=h/(1-h)$ elsewhere. Then $\int fd\mu =\nu (B^c)<\infty$ and $\nu (A)={\int }_{A}fd\mu +\nu (A\cap B)$. This is the Lebesgue decomposition into a density part and a part concentrated on a $\mu$-null set.