The Minkowski inequality states that the \(L^p\) norm of a sum is at most the sum of the norms for \(1\le p\le\infty\).
23 keywords6 linked from1 not yet writtenWritten by AI
The Minkowski inequality is the triangle inequality for Lp spaces: when 1≤p≤∞, the size of a sum, measured by its p-norm, does not exceed the sum of the sizes of its terms. Named after Hermann Minkowski, it applies to finite vectors, infinite sequences, and measurable functions. It is a foundational result in mathematical analysis, establishing that p-norms satisfy one of the defining properties of a norm.
Finite-dimensional form
Let x=(x1,…,xn) and y=(y1,…,yn) have real or complex coordinates. For 1≤p<∞, the inequality states that
Functions that agree almost everywhere represent the same element of Lp. This identification is necessary because a function can have norm zero without being zero at every point.
Using counting measure on the positive integers gives the sequence version:
If ∥h∥p=0, the result is immediate. Otherwise, division by ∥h∥pp−1 proves the inequality.
The cases p=1 and p=∞ follow directly from the pointwise triangle inequality. For p=2, an alternative proof uses the Cauchy–Schwarz inequality to estimate the cross term in the squared norm.
Equality conditions
The case 1<p<∞
If neither f nor g is zero as an Lp element, equality holds precisely when
f=cgalmost everywhere
for a constant c>0. Equality also holds if either function is zero almost everywhere.
For finite vectors, this means that the two nonzero vectors point in the same direction: one is a positive real multiple of the other. For complex-valued functions, positive proportionality requires both proportional magnitudes and matching complex phases wherever the functions are nonzero.
These conditions express the strict convexity of the Lp norm for 1<p<∞: distinct unit vectors have a midpoint of norm strictly less than one.
The case p=1
Equality holds exactly when
∣f+g∣=∣f∣+∣g∣almost everywhere.
For real-valued functions, this is equivalent to
f(x)g(x)≥0almost everywhere.
The functions need not be proportional; they need only avoid cancellation at almost every point.
For p=∞, equality does not generally imply proportionality, and it need not involve a point at which either essential supremum is attained.
Consequences and applications
Normed spaces and distances
Minkowski’s inequality establishes the triangle axiom needed to make Lp, for 1≤p≤∞, a normed vector space. These spaces are also complete and therefore are Banach spaces, although completeness requires a separate proof.
The formula
d(f,g)=∥f−g∥p
defines a metric on Lp. In particular, Minkowski’s inequality gives
d(f,h)≤d(f,g)+d(g,h).
It also implies the reverse triangle inequality,
∥f∥p−∥g∥p≤∥f−g∥p,
so convergence in norm implies convergence of the norms themselves.
Sums and approximation errors
Repeated application gives, for any finite collection f1,…,fm,
k=1∑mfkp≤k=1∑m∥fk∥p.
This provides a basic estimate in approximation theory: if an error is decomposed into several terms, its total norm is bounded by the sum of their norms. Unlike squared-norm identities involving orthogonality, this bound requires no cancellation or independence assumptions.