A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Minkowski's Inequality for L^p Spaces

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
437prerequisites beneath it
See this on the map →
L^p Norm and Metric StructureHölder's Inequality→→Completeness of L^p Spaces (Riesz-Fischer Theorem)
lp-spaces triangle-inequality

Core Idea

Minkowski's inequality asserts ‖f + g‖_p ≤ ‖f‖_p + ‖g‖_p for all f, g ∈ Lp. This is the triangle inequality, establishing that Lp is a normed space. It follows from Hölder's inequality.

Explainer

From your study of the Lᵖ norm, you know that ‖f‖_p = (∫|f|ᵖ dμ)1/p measures the size of a function in a way that generalizes the Euclidean norm on Rⁿ. For a collection of functions to form a normed vector space, the most demanding axiom to verify — after checking linearity of the space and positivity of the norm — is the triangle inequality: the norm of a sum cannot exceed the sum of the norms. Minkowski's inequality asserts exactly this holds for Lᵖ: ‖f + g‖_p ≤ ‖f‖_p + ‖g‖_p for all 1 ≤ p ≤ ∞.

For p = 1 and p = ∞ the inequality follows directly. When p = 1: ‖f + g‖₁ = ∫|f + g| dμ ≤ ∫(|f| + |g|) dμ = ‖f‖₁ + ‖g‖₁, using the pointwise triangle inequality |f(x) + g(x)| ≤ |f(x)| + |g(x)| and linearity of integration. When p = ∞: ‖f + g‖_∞ = ess sup|f + g| ≤ ess sup(|f| + |g|) ≤ ess sup|f| + ess sup|g|. The nontrivial case is 1 < p < ∞, where the pth power is nonlinear and pointwise bounds must be integrated in a more indirect way.

The proof for 1 < p < ∞ uses Hölder's inequality as its engine. Factor |f + g|ᵖ = |f + g| · |f + g|^(p−1), then bound |f + g| ≤ |f| + |g| to get ‖f + g‖_pᵖ ≤ ∫|f||f+g|^(p-1) dμ + ∫|g||f+g|^(p-1) dμ. Apply Hölder to each integral with exponent pair (p, q) where 1/p + 1/q = 1: each term bounds to ‖f‖_p · ‖|f+g|^(p-1)‖_q and ‖g‖_p · ‖|f+g|^(p-1)‖_q. Since (p−1)q = p, the factor ‖|f+g|^(p-1)‖_q = ‖f+g‖_pp-1. Dividing both sides by that factor yields the inequality. The Hölder conjugate relationship makes the algebra close cleanly.

The consequence is conceptual as much as computational: Minkowski's inequality is what certifies Lᵖ as a normed vector space. Without it, Lᵖ would be a set with a notion of size but no guarantee that sums behave consistently. With it, Lᵖ has the full structure of a normed vector space — and since it is also complete (the Riesz-Fischer theorem), it is a Banach space. The entire functional-analytic theory of Lᵖ spaces — dual spaces, bounded operators, spectral theory — rests on Minkowski supplying the triangle inequality.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Cardinality and Countability → Sigma-Algebras and Measurable Sets → Measurable Sets and σ-Algebra Properties → Measure Spaces → Measurable Functions → Simple Functions and Approximation → Lebesgue Integral for Simple Functions → Lebesgue Integral for Non-Negative Functions → Lebesgue Integral: General Definition → Lebesgue Integral (Full Construction) → Lᵖ Spaces → L^p Norm and Metric Structure → Hölder's Inequality → Minkowski's Inequality for L^p Spaces

Longest path: 88 steps · 437 total prerequisite topics

Prerequisites (2)

Leads To (1)