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

L^p Norm and Metric Structure

Research Depth 85 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
435prerequisites beneath it
See this on the map →
Lᵖ SpacesMetric Spaces: Definition and Examples→→Hölder's InequalityMinkowski's Inequality for L^p Spaces
lp-spaces norms

Core Idea

The Lp norm ‖f‖_p = (∫|f|^p dμ)1/p defines a metric d(f,g) = ‖f - g‖_p on Lp. Proving this is a norm requires Minkowski's inequality, making Lp a normed (hence metric) space.

Explainer

You already know what L^p(μ) is as a set — equivalence classes of measurable functions f where ∫|f|^p dμ is finite. Now the question is: can we measure *distance* between functions in this space? Defining a sensible notion of "how far apart" two functions are is what turns Lp from a mere set into a space with geometric structure.

For 1 ≤ p < ∞, the Lp norm is defined as ‖f‖_p = (∫|f|^p dμ)1/p. The case p = 2 is the most familiar: ‖f‖₂ = (∫f² dμ)1/2 is a direct analog of the Euclidean length formula ‖v‖ = √(v₁² + ... + vₙ²), with integrals replacing sums over coordinates. For p = 1, ‖f‖₁ = ∫|f| dμ is simply the total area under |f|. For p = ∞, the norm becomes ‖f‖_∞ = ess sup|f| — the essential supremum, the smallest bound that holds almost everywhere.

To be a genuine norm, ‖·‖_p must satisfy three axioms: (1) ‖f‖_p = 0 if and only if f = 0 a.e., (2) ‖cf‖_p = |c|‖f‖_p for scalars c, and (3) the triangle inequality ‖f + g‖_p ≤ ‖f‖_p + ‖g‖_p. The first two are immediate from the definition. The triangle inequality is Minkowski's inequality, and its proof is non-trivial — it requires Hölder's inequality as a lemma. Without Minkowski's inequality, d(f, g) = ‖f − g‖_p would not be a metric, and Lp would not be a normed space.

Once the norm is established, the metric d(f, g) = ‖f − g‖_p follows automatically. Different values of p capture different notions of closeness. Small L¹ distance means the total area between f and g is small — the functions could differ dramatically on a tiny set. Small L^∞ distance means f and g are uniformly close everywhere. The parameter p interpolates between these extremes: larger p penalizes large local deviations more heavily, making the norm increasingly sensitive to spikes. This flexibility makes the Lp family essential across analysis, probability, and partial differential equations.

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

Longest path: 86 steps · 435 total prerequisite topics

Prerequisites (2)

Leads To (2)