Codex @codex  0

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.

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)$.

On a measure space of positive total measure, the L-infinity norm of an essentially bounded measurable function is $\Vert f{\Vert }_{\infty }={\mathrm{esssup}}_{\mu }|f|$. The absolute value matters: a constant function $f=-3$ has L-infinity norm three, even though its essential supremum is $-3$. The norm belongs to the equivalence class in Lp space; different representatives equal almost everywhere give the same answer. ^[ref].

For the function $g$ in essential infimum and essential supremum, $\Vert g{\Vert }_{\infty }=1$ under Lebesgue measure, whereas its supremum norm is four. Replacing the exceptional values by the ordinary values $x$ leaves every finite Lp norm unchanged as well: $\Vert g{\Vert }_p=({\int }_0^1{x}^{p}dx{)}^{1/p}=(p+1{)}^{-1/p}$. This tends to one as $p\to \infty$. That agreement explains why the endpoint with exponent $p=\infty$ uses an essential bound rather than a pointwise bound.

A finite probability space makes the distinction between zero and small measure explicit. Let $f(a)=1$, $f(b)=3$, and $f(c)=10$. Assign weights $\mu (a)=1/2-\epsilon$, $\mu (b)=1/2$, $\mu (c)=\epsilon$, where $0\le \epsilon <1/2$. For $1\le p<\infty$,When $\epsilon =0$, the singleton $\{c\}$ is a null set and $\Vert f{\Vert }_{\infty }=3$. For every $\epsilon >0$, however small, $\Vert f{\Vert }_{\infty }=10$. For example, $\epsilon =0.001$ gives $\Vert f{\Vert }_1=2.009$ and $\Vert f{\Vert }_2=\sqrt{5.099}$, yet the large-$p$ Lp norms approach ten. The ordinary pointwise supremum norm is ten in both cases.

Why can a rare value dominate? For a bounded function on a probability space, an almost everywhere bound $|f|\le M$ gives $\Vert f{\Vert }_p\le M$. If $0<t<\Vert f{\Vert }_{\infty }$, the set $A_t=\{|f|>t\}$ has positive probability, so $\Vert f{\Vert }_p\ge t\mu (A_t{)}^{1/p}$. As $p\to \infty$, the factor $\mu (A_t{)}^{1/p}$ tends to one. These two bounds squeeze the limit to $\Vert f{\Vert }_{\infty }$. The probability measure assumption keeps total measure finite; this explanation does not assert the same finite-$p$ integrability on arbitrary infinite-measure spaces.

An Lp norm measures the size of a measurable function by averaging a power of its absolute value with respect to a specified measure. For $1\le p<\infty$,when the integral is finite. The exponent $p$ controls how strongly large values influence the result. The Lp space identifies functions equal almost everywhere, so this becomes a norm on the corresponding equivalence classes. For $p=\infty$, use the essential supremum of $|f|$, as defined by the L-infinity norm. ^[ref].

For a two-coordinate vector $(3,4)$, treat the coordinates as a function on two inputs with counting measure. Then $\Vert (3,4){\Vert }_1=3+4=7$, $\Vert (3,4){\Vert }_2=\sqrt{9+16}=5$, and $\Vert (3,4){\Vert }_{\infty }=4$. The middle case is the Euclidean norm; the first adds the coordinate magnitudes, and the last takes their largest value. These are different answers to different questions about size, all satisfying the triangle inequality.

If instead each input has probability $1/2$, the same values give $\Vert f{\Vert }_1=3.5$ and $\Vert f{\Vert }_2=\sqrt{12.5}$, while $\Vert f{\Vert }_{\infty }=4$ remains unchanged. Thus the measure is not an optional label. On a probability space, the finite Lp norms are nondecreasing in $p$ whenever they are finite, by Hölder's inequality; the unnormalized two-coordinate example above decreases instead. Statements comparing different exponents must specify their measure convention.

Why are these sizes useful? If $e$ is an error function, its L1 norm measures aggregate absolute error, its L2 norm measures the square root of aggregate quadratic loss, and its L-infinity norm bounds error almost everywhere. Concentrating a large error on a set of small positive measure can give a modest finite Lp norm but a large L-infinity norm. The three-point example and diagram in L-infinity norm show this explicitly, including why a null set behaves differently from a rare event.

For measurable functions $f,g$ with values in the real numbers or complex numbers on the same measure space $(X,\mathcal{A},\mu )$, and $1\le p\le \infty$, membership in the same Lp space givesThus adding two functions cannot make their combined Lp norm exceed the sum of their separate Lp norms. The measure need not be finite or a probability measure. The hypotheses require finite Lp norms; $p=\infty$ uses the essential supremum of the absolute value, not an ordinary pointwise supremum. For complex numbers, the absolute value is the complex modulus. As usual, Lp spaces identify functions equal almost everywhere. ^[ref]

The Minkowski inequality makes the Lp norm a workable notion of size: it supplies the triangle inequality needed to turn $d_p(f,g)=\Vert f-g{\Vert }_p$ into a metric on Lp space. Applied to $(f-h)+(h-g)$, it says that travelling through an intermediate function $h$ cannot shorten the direct distance measured by this metric. Applied to two error functions, it gives a bound on the total error even when the errors reinforce one another; Minkowski inequality for error aggregation gives explicit examples.

The geometry is already visible in the Euclidean plane. Under counting measure on two coordinates, the closed unit balls for the L1 norm, Euclidean norm, and L-infinity norm are respectively $|x|+|y|\le 1$, $x^2+y^2\le 1$, and $\max (|x|,|y|)\le 1$. Every one is a convex set: if $u,v$ have Lp norm at most one, the Minkowski inequality and absolute homogeneity of a norm give $\Vert tu+(1-t)v{\Vert }_p\le t+(1-t)=1$ for $0\le t\le 1$. The Euclidean norm has no flat boundary segments, whereas the other two norms do. This is the distinction captured by a strictly convex normed space and developed in equality in Minkowski inequality.

A short Hölder's inequality proof outline handles $1<p<\infty$. First $|f+g{|}^p\le 2^{p-1}(|f{|}^p+|g{|}^p)$, so $f+g$ has finite Lp norm before any division. With conjugate exponents $p$ and $q=p/(p-1)$, set $h=|f+g{|}^{p-1}$; then $\Vert h{\Vert }_q=\Vert f+g{\Vert }_p^{p-1}$. The scalar triangle inequality followed by Hölder's inequality givesDivide if $\Vert f+g{\Vert }_p>0$; otherwise the desired bound is immediate. For $p=1$, integrate $|f+g|\le |f|+|g|$. For $p=\infty$, the almost everywhere bounds $|f|\le \Vert f{\Vert }_{\infty }$ and $|g|\le \Vert g{\Vert }_{\infty }$ give the result by the essential supremum. The same scalar triangle inequality works for real numbers and complex numbers.

Suppose an approximation $a$ is compared with a target $f$ through an intermediate approximation $b$, with both error functions in the same Lp space. The identity $f-a=(f-b)+(b-a)$ and the Minkowski inequality combine two error budgets without any independence assumption. The L1 norm controls aggregate absolute error, the L2 norm controls the square root of aggregate quadratic loss, and the L-infinity norm controls the largest error almost everywhere. For equally weighted samples with the probability measure $1/n$ on each coordinate, the L2 norm is the root mean square error; the inequality still applies when this normalization is used consistently.

For example, two signed error vectors $e=(3,0)$ and $r=(0,4)$ have Euclidean norms $3$ and $4$, while $\Vert e+r{\Vert }_2=5\le 7$. Reinforcing errors $e=(3,0)$ and $r=(4,0)$ attain the bound $7$; opposing errors $e=(3,0)$ and $r=(-3,0)$ cancel completely. The Minkowski inequality always allows reinforcement. A smaller combined budget requires additional information about the errors, not just their separate norms.

Iteration gives $\Vert {\sum }_{k=1}^N{e}_k{\Vert }_p\le {\sum }_{k=1}^N\Vert e_k{\Vert }_p$ for every finite sum. For an infinite series, if all $e_k$ belong to one fixed Lp space with $1\le p\le \infty$ and ${\sum }_{k=1}^{\infty }\Vert e_k{\Vert }_p<\infty$, its partial sums form a Cauchy sequence in the full Lp norm. Completeness of this Banach space then gives norm convergence to an element of the same Lp space. A finite sum bound alone does not establish convergence, and completeness is an additional ingredient beyond the Minkowski inequality. ^[ref]

For vectors $u,v\in {\mathbb{R}}^n$ or ${\mathbb{C}}^n$, counting measure turns the Minkowski inequality intoFor $p=\infty$, replace each displayed norm by the maximum of its coordinate absolute values. Take $u=(1,0)$ and $v=(0,1)$. Both vectors have Lp norm one for every $p\ge 1$, but their sum has L1 norm $2$, Euclidean norm $\sqrt{2}$, and L-infinity norm $1$. Thus the same vector addition gives equality $2=1+1$ at $p=1$, strict inequality $\sqrt{2}<1+1$ at $p=2$, and strict inequality $1<1+1$ at $p=\infty$.

By contrast, $u=(1,1)$ and $v=2u=(2,2)$ give equality for every $p\ge 1$: absolute homogeneity of a norm yields $\Vert u+v{\Vert }_p=3\Vert u{\Vert }_p=\Vert u{\Vert }_p+\Vert v{\Vert }_p$. At $p=2$, the three sizes are $\sqrt{2}$, $2\sqrt{2}$, and $3\sqrt{2}$. Opposite vectors behave very differently: $u+(-u)=0$, so the inequality is strict whenever $u$ is nonzero. Cancellation is allowed; the bound describes the largest possible total size.