Skip to content
AI360Xpert
Beta

Lp Spaces

Families of functions with finite p-th power integrals, the home of norms, errors and convergence that ML optimizes.

Lp spaces sort functions by tail weight: larger p punishes spikes harder and shrinks the unit ball corners
Lp spaces sort functions by tail weight: larger p punishes spikes harder and shrinks the unit ball corners

Why Does This Exist?

Errors need sizes: mean absolute error, root mean square error, worst-case error. Each is an LpL^p norm with different spike tolerance. Theory needs the same sizes to state convergence, generalization and stability without redefining distance each time.

LpL^p spaces collect measurable functions with ∫∣f∣p<∞\int |f|^p < \infty, normed by ∥f∥p=(∫∣f∣p)1/p\|f\|_p = (\int |f|^p)^{1/p}. For p≥1p \ge 1 these are Banach spaces; L2L^2 is Hilbert with an inner product.

This page defines the family and its two workhorse inequalities. Vector norms are in norms and probabilistic moments in expectation, variance and covariance.

The one idea you need first

A norm measures size with triangle inequality: ∥f+g∥≤∥f∥+∥g∥\|f + g\| \le \|f\| + \|g\|. LpL^p norms apply this to functions via integrals instead of sums.

Think of It Like This

Fines for speeding

L1L^1 fines every mile-per-hour over the limit equally. L2L^2 fines the square, so a brief 3030-over spike costs far more than long 55-over cruising. L∞L^\infty fines only the peak speed.

Error norms choose the fine schedule. Robust losses pick L1L^1 to forgive spikes; least squares picks L2L^2 to punish them. Where the analogy stops: fines are one-sided, while norms treat positive and negative deviations symmetrically.

How It Actually Works

∥f∥p=(∫∣f∣p dm)1/p\|f\|_p = (\int |f|^p \, dm)^{1/p} for 1≤p<∞1 \le p < \infty, and ∥f∥∞=ess sup ∣f∣\|f\|_\infty = \text{ess sup } |f|. Holder: ∫∣fg∣≤∥f∥p∥g∥q\int |fg| \le \|f\|_p \|g\|_q with 1/p+1/q=11/p + 1/q = 1. Minkowski: ∥f+g∥p≤∥f∥p+∥g∥p\|f + g\|_p \le \|f\|_p + \|g\|_p. Both need p≥1p \ge 1.

For vectors (3,4)(3,4): L1L^1 norm 77, L2L^2 norm 55, L∞L^\infty norm 44. The ordering ∥⋅∥∞≤∥⋅∥2≤∥⋅∥1\|\cdot\|_\infty \le \|\cdot\|_2 \le \|\cdot\|_1 holds in finite dimensions up to constants; on infinite measure spaces inclusions reverse or fail.

Worked example

On [0,1][0,1], f(x)=x−0.4f(x) = x^{-0.4}. Then ∣f∣2=x−0.8|f|^2 = x^{-0.8} integrates to [x0.2/0.2]01=5[x^{0.2}/0.2]_0^1 = 5, so ∥f∥2=5≈2.236\|f\|_2 = \sqrt{5} \approx 2.236. For p=3p = 3, ∣f∣3=x−1.2|f|^3 = x^{-1.2} diverges at 00, so f∉L3f \notin L^3. Same function lives in L1L^1 and L2L^2 but not L3L^3: higher pp is stricter about spikes.

Watch Out For

Using triangle inequality below p equals 1

Symptom: ∥f+g∥0.5≤∥f∥0.5+∥g∥0.5\|f + g\|_{0.5} \le \|f\|_{0.5} + \|g\|_{0.5} assumed, then sparsity penalties violate it and proofs collapse. Fix: for p<1p < 1 only a quasi-triangle holds with a constant; state it or stay at p≥1p \ge 1.

Assuming norm equivalence in infinite dimensions

Symptom: "all norms are equivalent" quoted for function spaces, so L1L^1 convergence is read as L∞L^\infty convergence. Fix: equivalence holds only in finite dimensions; in function spaces exhibit the mode of convergence explicitly.

The Quick Version

  • LpL^p collects functions with finite ∫∣f∣p\int |f|^p; p=1,2,∞p = 1, 2, \infty give MAE, RMSE and worst-case sizes.
  • Holder controls products and Minkowski controls sums for p≥1p \ge 1.
  • Larger pp punishes spikes harder: x−0.4x^{-0.4} is in L2L^2 with norm 2.2362.236 but outside L3L^3.
  • L2L^2 alone has an inner product; all LpL^p with p≥1p \ge 1 are complete.
  • Name pp whenever an error or risk bound is stated.