Lably
Skip to content

Lp space

Function spaces generalizing finite-dimensional p norm spaces

  • 22 min read
  • 6 chapters

Related on Lably

Through Mathematics, Real number and Physics

Lp spaces form an important class of Banach spaces in functional analysis, and of topological vector spaces. Because of their key role in the mathematical analysis of measure and probability spaces, Lebesgue spaces are used also in the theoretical discussion of problems in physics, statistics, economics, finance, engineering, and other disciplines.

Preliminaries

The p-norm in finite dimensions

The Euclidean length of a vector x=(x1,x2,…,xn) in the n-dimensional real vector space Rn is given by the Euclidean norm: ‖x‖2=(x12+x22+⋯+xn2)1/2.

The Euclidean distance between two points x and y is the length ‖x−y‖2 of the straight line between the two points. In many situations, the Euclidean distance is appropriate for capturing the actual distances in a given space. In contrast, consider taxi drivers in a grid street plan who should measure distance not in terms of the length of the straight line to their destination, but in terms of the rectilinear distance, which takes into account that streets are either orthogonal or parallel to each other. The class of p-norms generalizes these two examples and has an abundance of applications in many parts of mathematics, physics, and computer science.

For a real number p≥1, the p-norm or Lp-norm of x is defined by ‖x‖p=(|x1|p+|x2|p+⋯+|xn|p)1/p. The absolute value bars can be dropped when p is an even integer, and x is drawn from the set of real numbers, or one of its subsets.

The Euclidean norm from above falls into this class and is the 2-norm, and the 1-norm is the norm that corresponds to the rectilinear distance.

The L∞-norm or maximum norm (or uniform norm) is the limit of the Lp-norms for p→∞, given by: ‖x‖∞=max{|x1|,|x2|,…,|xn|}

For all p≥1, the p-norms and maximum norm satisfy the properties of a "length function" (or norm), that is:

  • only the zero vector has zero length,
  • the length of the vector is positive homogeneous with respect to multiplication by a scalar (positive homogeneity), and
  • the length of the sum of two vectors is no larger than the sum of lengths of the vectors (triangle inequality).

Abstractly speaking, this means that Rn together with the p-norm is a normed vector space. Moreover, it turns out that this space is complete, thus making it a Banach space.

Relations between p-norms

The grid distance or rectilinear distance (sometimes called the "Manhattan distance") between two points is never shorter than the length of the line segment between them (the Euclidean or "as the crow flies" distance). Formally, this means that the Euclidean norm of any vector is bounded by its 1-norm: ‖x‖2≤‖x‖1.

This fact generalizes to p-norms in that the p-norm ‖x‖p of any given vector x does not grow with p:

‖x‖p+a≤‖x‖p for any vector x and real numbers p≥1 and a≥0. (In fact this remains true for 0<p<1 and a≥0 .)

For the opposite direction, the following relation between the 1-norm and the 2-norm is known: ‖x‖1≤n‖x‖2.

This inequality depends on the dimension n of the underlying vector space and follows directly from the Cauchy–Schwarz inequality.

In general, for vectors in Cn where 0<r<p: ‖x‖p≤‖x‖r≤n1r−1p‖x‖p.

This is a consequence of Hölder's inequality.

When 0 < p < 1

In Rn for n>1, the formula ‖x‖p=(|x1|p+|x2|p+⋯+|xn|p)1/p defines an absolutely homogeneous function for 0<p<1; however, the resulting function does not define a norm, because it is not subadditive. On the other hand, the formula |x1|p+|x2|p+⋯+|xn|p defines a subadditive function at the cost of losing absolute homogeneity. It does define an F-norm, though, which is homogeneous of degree p.

Hence, the function dp(x,y)=∑i=1n|xi−yi|p defines a metric. The metric space (Rn,dp) is denoted by ℓnp.

Although the p-unit ball Bnp around the origin in this metric is "concave", the topology defined on Rn by the metric Bp is the usual vector space topology of Rn, hence ℓnp is a locally convex topological vector space. Beyond this qualitative statement, a quantitative way to measure the lack of convexity of ℓnp is to denote by Cp(n) the smallest constant C such that the scalar multiple CBnp of the p-unit ball contains the convex hull of Bnp, which is equal to Bn1. The fact that for fixed p<1 we have Cp(n)=n1p−1→∞,as n→∞ shows that the infinite-dimensional sequence space ℓp defined below, is no longer locally convex.

When p = 0

In the case p=0, no honest norm exists, and the replacement is an F-norm which is not locally convex. The F-norm can be given by (xn)↦‖x‖:=d(0,x)=∑n|xn|1+|xn|.

Sometimes a different "norm" is defined, but the topology it defines is not the usual one: ‖x‖=|{i|xi≠0}|. This is the limit of the dp F-norms (defined in the previous section) as p→0+. It gives the Hamming distance on the set.

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Calculus and analysis