HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, the spaces are
function space In mathematics, a function space is a set of functions between two fixed sets. Often, the domain and/or codomain will have additional structure which is inherited by the function space. For example, the set of functions from any set into a ve ...
s defined using a natural generalization of the -norm for finite-dimensional
vector space In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
s. They are sometimes called Lebesgue spaces, named after
Henri Lebesgue Henri Léon Lebesgue (; ; June 28, 1875 – July 26, 1941) was a French mathematician known for his Lebesgue integration, theory of integration, which was a generalization of the 17th-century concept of integration—summing the area between an ...
, although according to the
Bourbaki Bourbaki(s) may refer to : Persons and science * Charles-Denis Bourbaki (1816–1897), French general, son of Constantin Denis Bourbaki * Colonel Constantin Denis Bourbaki (1787–1827), officer in the Greek War of Independence and serving in the ...
group they were first introduced by
Frigyes Riesz Frigyes Riesz (, , sometimes known in English and French as Frederic Riesz; 22 January 1880 – 28 February 1956) was a HungarianEberhard Zeidler: Nonlinear Functional Analysis and Its Applications: Linear monotone operators. Springer, 199/ref> ...
. spaces form an important class of
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
s in
functional analysis Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, Inner product space#Definition, inner product, Norm (mathematics ...
, and of
topological vector space In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
s. 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 -norm in finite dimensions

The Euclidean length of a vector x = (x_1, x_2, \dots, x_n) in the n-dimensional real
vector space In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
\Reals^n is given by the
Euclidean norm Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces'' ...
: \, x\, _2 = \left(^2 + ^2 + \dotsb + ^2\right)^. 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 Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
,
physics Physics is the scientific study of matter, its Elementary particle, fundamental constituents, its motion and behavior through space and time, and the related entities of energy and force. "Physical science is that department of knowledge whi ...
, and
computer science Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...
. For a
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
p \geq 1, the p-norm or L^p-norm of x is defined by \, x\, _p = \left(, x_1, ^p + , x_2, ^p + \dotsb + , x_n, ^p\right)^. The absolute value bars can be dropped when p is a rational number with an even numerator in its reduced form, 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^\infty-norm or maximum norm (or uniform norm) is the limit of the L^p-norms for p \to \infty, given by: \, x\, _\infty = \max \left\ For all p \geq 1, the p-norms and maximum norm satisfy the properties of a "length function" (or
norm Norm, the Norm or NORM may refer to: In academic disciplines * Normativity, phenomenon of designating things as good or bad * Norm (geology), an estimate of the idealised mineral content of a rock * Norm (philosophy), a standard in normative e ...
), 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 In mathematics, a homogeneous function is a function of several variables such that the following holds: If each of the function's arguments is multiplied by the same scalar, then the function's value is multiplied by some power of this scalar; ...
), and *the length of the sum of two vectors is no larger than the sum of lengths of the vectors (
triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of Degeneracy (mathematics)#T ...
). Abstractly speaking, this means that \Reals^n together with the p-norm is a
normed vector space The Ateliers et Chantiers de France (ACF, Workshops and Shipyards of France) was a major shipyard that was established in Dunkirk, France, in 1898. The shipyard boomed in the period before World War I (1914–18), but struggled in the inter-war ...
. Moreover, it turns out that this space is
complete Complete may refer to: Logic * Completeness (logic) * Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable Mathematics * The completeness of the real numbers, which implies t ...
, thus making it a
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
.


Relations between -norms

The grid distance or rectilinear distance (sometimes called the "
Manhattan distance Taxicab geometry or Manhattan geometry is geometry where the familiar Euclidean distance is ignored, and the distance between two point (geometry), points is instead defined to be the sum of the absolute differences of their respective Cartesian ...
") 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 \leq \, 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: For the opposite direction, the following relation between the 1-norm and the 2-norm is known: \, x\, _1 \leq \sqrt \, x\, _2 ~. This inequality depends on the dimension n of the underlying vector space and follows directly from the
Cauchy–Schwarz inequality The Cauchy–Schwarz inequality (also called Cauchy–Bunyakovsky–Schwarz inequality) is an upper bound on the absolute value of the inner product between two vectors in an inner product space in terms of the product of the vector norms. It is ...
. In general, for vectors in \Complex^n where 0 < r < p: \, x\, _p \leq \, x\, _r \leq n^ \, x\, _p ~. This is a consequence of
Hölder's inequality In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
.


When

In \Reals^n for n > 1, the formula \, x\, _p = \left(, x_1, ^p + , x_2, ^p + \cdots + , x_n, ^p\right)^ defines an absolutely
homogeneous function In mathematics, a homogeneous function is a function of several variables such that the following holds: If each of the function's arguments is multiplied by the same scalar (mathematics), scalar, then the function's value is multiplied by some p ...
for 0 < p < 1; however, the resulting function does not define a norm, because it is not subadditive. On the other hand, the formula , x_1, ^p + , x_2, ^p + \dotsb + , x_n, ^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 d_p(x, y) = \sum_^n , x_i - y_i, ^p defines a
metric Metric or metrical may refer to: Measuring * Metric system, an internationally adopted decimal system of measurement * An adjective indicating relation to measurement in general, or a noun describing a specific type of measurement Mathematics ...
. The
metric space In mathematics, a metric space is a Set (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
(\Reals^n, d_p) is denoted by \ell_n^p. Although the p-unit ball B_n^p around the origin in this metric is "concave", the topology defined on \Reals^n by the metric B_p is the usual vector space topology of \Reals^n, hence \ell_n^p is a
locally convex In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vec ...
topological vector space. Beyond this qualitative statement, a quantitative way to measure the lack of convexity of \ell_n^p is to denote by C_p(n) the smallest constant C such that the scalar multiple C \, B_n^p of the p-unit ball contains the convex hull of B_n^p, which is equal to B_n^1. The fact that for fixed p < 1 we have C_p(n) = n^ \to \infty, \quad \text n \to \infty shows that the infinite-dimensional sequence space \ell^p defined below, is no longer locally convex.


When

There is one \ell_0 norm and another function called the \ell_0 "norm" (with quotation marks). The mathematical definition of the \ell_0 norm was established by Banach's '' Theory of Linear Operations''. The
space Space is a three-dimensional continuum containing positions and directions. In classical physics, physical space is often conceived in three linear dimensions. Modern physicists usually consider it, with time, to be part of a boundless ...
of sequences has a complete metric topology provided by the F-norm on the product metric: (x_n) \mapsto \, x\, :=d(0,x)=\sum_n 2^ \frac. The \ell_0-normed space is studied in functional analysis, probability theory, and harmonic analysis. Another function was called the \ell_0 "norm" by
David Donoho David Leigh Donoho (born March 5, 1957) is an American statistician. He is a professor of statistics at Stanford University, where he is also the Anne T. and Robert M. Bass Professor in the Humanities and Sciences. His work includes the developm ...
—whose quotation marks warn that this function is not a proper norm—is the number of non-zero entries of the vector x. Many authors abuse terminology by omitting the quotation marks. Defining 0^0 = 0, the zero "norm" of x is equal to , x_1, ^0 + , x_2, ^0 + \cdots + , x_n, ^0 . This is not a
norm Norm, the Norm or NORM may refer to: In academic disciplines * Normativity, phenomenon of designating things as good or bad * Norm (geology), an estimate of the idealised mineral content of a rock * Norm (philosophy), a standard in normative e ...
because it is not
homogeneous Homogeneity and heterogeneity are concepts relating to the uniformity of a substance, process or image. A homogeneous feature is uniform in composition or character (i.e., color, shape, size, weight, height, distribution, texture, language, i ...
. For example, scaling the vector x by a positive constant does not change the "norm". Despite these defects as a mathematical norm, the non-zero counting "norm" has uses in
scientific computing Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science, and more specifically the Computer Sciences, which uses advanced computing capabilities to understand and s ...
,
information theory Information theory is the mathematical study of the quantification (science), quantification, Data storage, storage, and telecommunications, communication of information. The field was established and formalized by Claude Shannon in the 1940s, ...
, and
statistics Statistics (from German language, German: ', "description of a State (polity), state, a country") is the discipline that concerns the collection, organization, analysis, interpretation, and presentation of data. In applying statistics to a s ...
–notably in
compressed sensing Compressed sensing (also known as compressive sensing, compressive sampling, or sparse sampling) is a signal processing technique for efficiently acquiring and reconstructing a Signal (electronics), signal by finding solutions to Underdetermined s ...
in
signal processing Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing ''signals'', such as audio signal processing, sound, image processing, images, Scalar potential, potential fields, Seismic tomograph ...
and computational
harmonic analysis Harmonic analysis is a branch of mathematics concerned with investigating the connections between a function and its representation in frequency. The frequency representation is found by using the Fourier transform for functions on unbounded do ...
. Despite not being a norm, the associated metric, known as
Hamming distance In information theory, the Hamming distance between two String (computer science), strings or vectors of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number ...
, is a valid distance, since homogeneity is not required for distances.


spaces and sequence spaces

The p-norm can be extended to vectors that have an infinite number of components (
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
s), which yields the space \ell^p. This contains as special cases: * \ell^1, the space of sequences whose series are
absolutely convergent In mathematics, an infinite series of numbers is said to converge absolutely (or to be absolutely convergent) if the sum of the absolute values of the summands is finite. More precisely, a real or complex series \textstyle\sum_^\infty a_n is said ...
, * \ell^2, the space of square-summable sequences, which is a
Hilbert space In mathematics, a Hilbert space is a real number, real or complex number, complex inner product space that is also a complete metric space with respect to the metric induced by the inner product. It generalizes the notion of Euclidean space. The ...
, and * \ell^\infty, the space of bounded sequences. The space of sequences has a natural vector space structure by applying scalar addition and multiplication. Explicitly, the vector sum and the scalar action for infinite
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
s of real (or
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
) numbers are given by: \begin & (x_1, x_2, \ldots, x_n, x_,\ldots)+(y_1, y_2, \ldots, y_n, y_,\ldots) \\ = & (x_1+y_1, x_2+y_2, \ldots, x_n+y_n, x_+y_,\ldots), \\ pt& \lambda \cdot \left (x_1, x_2, \ldots, x_n, x_,\ldots \right) \\ = & (\lambda x_1, \lambda x_2, \ldots, \lambda x_n, \lambda x_,\ldots). \end Define the p-norm: \, x\, _p = \left(, x_1, ^p + , x_2, ^p + \cdots +, x_n, ^p + , x_, ^p + \cdots\right)^ Here, a complication arises, namely that the
series Series may refer to: People with the name * Caroline Series (born 1951), English mathematician, daughter of George Series * George Series (1920–1995), English physicist Arts, entertainment, and media Music * Series, the ordered sets used i ...
on the right is not always convergent, so for example, the sequence made up of only ones, (1, 1, 1, \ldots), will have an infinite p-norm for 1 \leq p < \infty. The space \ell^p is then defined as the set of all infinite sequences of real (or complex) numbers such that the p-norm is finite. One can check that as p increases, the set \ell^p grows larger. For example, the sequence \left(1, \frac, \ldots, \frac, \frac, \ldots\right) is not in \ell^1, but it is in \ell^p for p > 1, as the series 1^p + \frac + \cdots + \frac + \frac + \cdots, diverges for p = 1 (the harmonic series), but is convergent for p > 1. One also defines the \infty-norm using the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
: \, x\, _\infty = \sup(, x_1, , , x_2, , \dotsc, , x_n, ,, x_, , \ldots) and the corresponding space \ell^\infty of all bounded sequences. It turns out that \, x\, _\infty = \lim_ \, x\, _p if the right-hand side is finite, or the left-hand side is infinite. Thus, we will consider \ell^p spaces for 1 \leq p \leq \infty. The p-norm thus defined on \ell^p is indeed a norm, and \ell^p together with this norm is a
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
.


General ℓ''p''-space

In complete analogy to the preceding definition one can define the space \ell^p(I) over a general
index set In mathematics, an index set is a set whose members label (or index) members of another set. For instance, if the elements of a set may be ''indexed'' or ''labeled'' by means of the elements of a set , then is an index set. The indexing consists ...
I (and 1 \leq p < \infty) as \ell^p(I) = \left\, where convergence on the right means that only countably many summands are nonzero (see also Unconditional convergence). With the norm \, x\, _p = \left(\sum_ , x_i, ^p\right)^ the space \ell^p(I) becomes a Banach space. In the case where I is finite with n elements, this construction yields \Reals^n with the p-norm defined above. If I is countably infinite, this is exactly the sequence space \ell^p defined above. For uncountable sets I this is a non- separable Banach space which can be seen as the
locally convex In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vec ...
direct limit In mathematics, a direct limit is a way to construct a (typically large) object from many (typically smaller) objects that are put together in a specific way. These objects may be groups, rings, vector spaces or in general objects from any cate ...
of \ell^p-sequence spaces. For p = 2, the \, \,\cdot\,\, _2-norm is even induced by a canonical
inner product In mathematics, an inner product space (or, rarely, a Hausdorff pre-Hilbert space) is a real vector space or a complex vector space with an operation called an inner product. The inner product of two vectors in the space is a scalar, ofte ...
\langle \,\cdot,\,\cdot\rangle, called the ', which means that \, \mathbf\, _2 = \sqrt holds for all vectors \mathbf. This inner product can expressed in terms of the norm by using the
polarization identity In linear algebra, a branch of mathematics, the polarization identity is any one of a family of formulas that express the inner product of two vectors in terms of the norm of a normed vector space. If a norm arises from an inner product t ...
. On \ell^2, it can be defined by \langle \left(x_i\right)_, \left(y_n\right)_ \rangle_ ~=~ \sum_i x_i \overline. Now consider the case p = \infty. Define \ell^\infty(I)=\, where for all x \, x\, _\infty\equiv\inf\ = \begin\sup\operatorname, x, &\text X\neq\varnothing,\\0&\text X=\varnothing.\end The index set I can be turned into a
measure space A measure space is a basic object of measure theory, a branch of mathematics that studies generalized notions of volumes. It contains an underlying set, the subsets of this set that are feasible for measuring (the -algebra) and the method that ...
by giving it the discrete σ-algebra and the
counting measure In mathematics, specifically measure theory, the counting measure is an intuitive way to put a measure on any set – the "size" of a subset is taken to be the number of elements in the subset if the subset has finitely many elements, and infinit ...
. Then the space \ell^p(I) is just a special case of the more general L^p-space (defined below).


''Lp'' spaces and Lebesgue integrals

An L^p space may be defined as a space of measurable functions for which the p-th power of the
absolute value In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if x is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), ...
is
Lebesgue integrable In mathematics, the integral of a non-negative Function (mathematics), function of a single variable can be regarded, in the simplest case, as the area between the Graph of a function, graph of that function and the axis. The Lebesgue integral, ...
, where functions which agree almost everywhere are identified. More generally, let (S, \Sigma, \mu) be a
measure space A measure space is a basic object of measure theory, a branch of mathematics that studies generalized notions of volumes. It contains an underlying set, the subsets of this set that are feasible for measuring (the -algebra) and the method that ...
and 1 \leq p \leq \infty.The definitions of \, \cdot\, _p, \mathcal^p(S,\, \mu), and L^p(S,\, \mu) can be extended to all 0 < p \leq \infty (rather than just 1 \leq p \leq \infty), but it is only when 1 \leq p \leq \infty that \, \cdot\, _p is guaranteed to be a norm (although \, \cdot\, _p is a quasi-seminorm for all 0 < p \leq \infty,). When p \neq \infty, consider the set \mathcal^p(S,\, \mu) of all
measurable function In mathematics, and in particular measure theory, a measurable function is a function between the underlying sets of two measurable spaces that preserves the structure of the spaces: the preimage of any measurable set is measurable. This is in ...
s f from S to \Complex or \Reals whose
absolute value In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if x is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), ...
raised to the p-th power has a finite integral, or in symbols: \, f\, _p ~\stackrel~ \left(\int_S , f, ^p\;\mathrm\mu\right)^ < \infty. To define the set for p = \infty, recall that two functions f and g defined on S are said to be , written , if the set \ is measurable and has measure zero. Similarly, a measurable function f (and its
absolute value In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if x is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), ...
) is (or ) by a real number C, written , if the (necessarily) measurable set \ has measure zero. The space \mathcal^\infty(S,\mu) is the set of all measurable functions f that are bounded almost everywhere (by some real C) and \, f\, _\infty is defined as the
infimum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique ...
of these bounds: \, f\, _\infty ~\stackrel~ \inf \. When \mu(S) \neq 0 then this is the same as the
essential supremum In mathematics, the concepts of essential infimum and essential supremum are related to the notions of infimum and supremum, but adapted to measure theory and functional analysis, where one often deals with statements that are not valid for ''all' ...
of the absolute value of f: \, f\, _\infty ~=~ \begin\operatorname, f, & \text \mu(S) > 0,\\ 0 & \text \mu(S) = 0.\end For example, if f is a measurable function that is equal to 0 almost everywhereFor example, if a non-empty measurable set N \neq \varnothing of measure \mu(N) = 0 exists then its
indicator function In mathematics, an indicator function or a characteristic function of a subset of a set is a function that maps elements of the subset to one, and all other elements to zero. That is, if is a subset of some set , then the indicator functio ...
\mathbf_N satisfies \, \mathbf_N\, _p = 0 although \mathbf_N \neq 0.
then \, f\, _p = 0 for every p and thus f \in \mathcal^p(S,\, \mu) for all p. For every positive p, the value under \, \,\cdot\,\, _p of a measurable function f and its absolute value , f, : S \to , \infty/math> are always the same (that is, \, f\, _p = \, , f, \, _p for all p) and so a measurable function belongs to \mathcal^p(S,\, \mu) if and only if its absolute value does. Because of this, many formulas involving p-norms are stated only for non-negative real-valued functions. Consider for example the identity \, f\, _p^r = \, f^r\, _, which holds whenever f \geq 0 is measurable, r > 0 is real, and 0 < p \leq \infty (here \infty / r \;\stackrel\; \infty when p = \infty). The non-negativity requirement f \geq 0 can be removed by substituting , f, in for f, which gives \, \,, f, \,\, _p^r = \, \,, f, ^r\,\, _. Note in particular that when p = r is finite then the formula \, f\, _p^p = \, , f, ^p\, _1 relates the p-norm to the 1-norm. Seminormed space of p-th power integrable functions Each set of functions \mathcal^p(S,\, \mu) forms a
vector space In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
when addition and scalar multiplication are defined pointwise.Explicitly, the vector space operations are defined by: \begin (f+g)(x) &= f(x)+g(x), \\ (s f)(x) &= s f(x) \end for all f, g \in \mathcal^p(S,\, \mu) and all scalars s. These operations make \mathcal^p(S,\, \mu) into a vector space because if s is any scalar and f, g \in \mathcal^p(S,\, \mu) then both s f and f + g also belong to \mathcal^p(S,\, \mu). That the sum of two p-th power integrable functions f and g is again p-th power integrable follows from \, f + g\, _p^p \leq 2^ \left(\, f\, _p^p + \, g\, _p^p\right),When 1 \leq p < \infty, the inequality \, f + g\, _p^p \leq 2^ \left(\, f\, _p^p + \, g\, _p^p\right) can be deduced from the fact that the function F :
convex Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
, which by definition means that F(t x + (1 - t) y) \leq t F(x) + (1 - t) F(y) for all 0 \leq t \leq 1 and all x, y in the domain of F. Substituting , f, , , g, , and \tfrac in for x, y, and t gives \left(\tfrac, f, + \tfrac, g, \right)^p \leq \tfrac , f, ^p + \tfrac , g, ^p, which proves that (, f, + , g, )^p \leq 2^ (, f, ^p + , g, ^p). The triangle inequality , f + g, \leq , f, + , g, now implies , f + g, ^p \leq 2^ (, f, ^p + , g, ^p). The desired inequality follows by integrating both sides. \blacksquare
although it is also a consequence of ''Minkowski inequality, Minkowski's inequality'' \, f + g\, _p \leq \, f\, _p + \, g\, _p which establishes that \, \cdot\, _p satisfies the
triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of Degeneracy (mathematics)#T ...
for 1 \leq p \leq \infty (the triangle inequality does not hold for 0 < p < 1). That \mathcal^p(S,\, \mu) is closed under scalar multiplication is due to \, \cdot\, _p being absolutely homogeneous, which means that \, s f\, _p = , s, \, f\, _p for every scalar s and every function f. Absolute homogeneity, the
triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of Degeneracy (mathematics)#T ...
, and non-negativity are the defining properties of a
seminorm In mathematics, particularly in functional analysis, a seminorm is like a Norm (mathematics), norm but need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some Absorbing ...
. Thus \, \cdot\, _p is a seminorm and the set \mathcal^p(S,\, \mu) of p-th power integrable functions together with the function \, \cdot\, _p defines a seminormed vector space. In general, the
seminorm In mathematics, particularly in functional analysis, a seminorm is like a Norm (mathematics), norm but need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some Absorbing ...
\, \cdot\, _p is not a
norm Norm, the Norm or NORM may refer to: In academic disciplines * Normativity, phenomenon of designating things as good or bad * Norm (geology), an estimate of the idealised mineral content of a rock * Norm (philosophy), a standard in normative e ...
because there might exist measurable functions f that satisfy \, f\, _p = 0 but are not equal to 0 (\, \cdot\, _p is a norm if and only if no such f exists). Zero sets of p-seminorms If f is measurable and equals 0 a.e. then \, f\, _p = 0 for all positive p \leq \infty. On the other hand, if f is a measurable function for which there exists some 0 < p \leq \infty such that \, f\, _p = 0 then f = 0 almost everywhere. When p is finite then this follows from the p = 1 case and the formula \, f\, _p^p = \, , f, ^p\, _1 mentioned above. Thus if p \leq \infty is positive and f is any measurable function, then \, f\, _p = 0 if and only if f = 0
almost everywhere In measure theory (a branch of mathematical analysis), a property holds almost everywhere if, in a technical sense, the set for which the property holds takes up nearly all possibilities. The notion of "almost everywhere" is a companion notion to ...
. Since the right hand side (f = 0 a.e.) does not mention p, it follows that all \, \cdot\, _p have the same
zero set In mathematics, a zero (also sometimes called a root) of a real-, complex-, or generally vector-valued function f, is a member x of the domain of f such that f(x) ''vanishes'' at x; that is, the function f attains the value of 0 at x, or eq ...
(it does not depend on p). So denote this common set by \mathcal \;\stackrel\; \ = \ \qquad \forall \ p. This set is a vector subspace of \mathcal^p(S,\, \mu) for every positive p \leq \infty. Quotient vector space Like every
seminorm In mathematics, particularly in functional analysis, a seminorm is like a Norm (mathematics), norm but need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some Absorbing ...
, the seminorm \, \cdot\, _p induces a
norm Norm, the Norm or NORM may refer to: In academic disciplines * Normativity, phenomenon of designating things as good or bad * Norm (geology), an estimate of the idealised mineral content of a rock * Norm (philosophy), a standard in normative e ...
(defined shortly) on the canonical quotient vector space of \mathcal^p(S,\, \mu) by its vector subspace \mathcal = \. This normed quotient space is called and it is the subject of this article. We begin by defining the quotient vector space. Given any f \in \mathcal^p(S,\, \mu), the
coset In mathematics, specifically group theory, a subgroup of a group may be used to decompose the underlying set of into disjoint, equal-size subsets called cosets. There are ''left cosets'' and ''right cosets''. Cosets (both left and right) ...
f + \mathcal \;\stackrel\; \ consists of all measurable functions g that are equal to f
almost everywhere In measure theory (a branch of mathematical analysis), a property holds almost everywhere if, in a technical sense, the set for which the property holds takes up nearly all possibilities. The notion of "almost everywhere" is a companion notion to ...
. The set of all cosets, typically denoted by \mathcal^p(S, \mu) / \mathcal ~~\stackrel~~ \, forms a vector space with origin 0 + \mathcal = \mathcal when vector addition and scalar multiplication are defined by (f + \mathcal) + (g + \mathcal) \;\stackrel\; (f + g) + \mathcal and s (f + \mathcal) \;\stackrel\; (s f) + \mathcal. This particular quotient vector space will be denoted by L^p(S,\, \mu) ~\stackrel~ \mathcal^p(S, \mu) / \mathcal. Two cosets are equal f + \mathcal = g + \mathcal if and only if g \in f + \mathcal (or equivalently, f - g \in \mathcal), which happens if and only if f = g almost everywhere; if this is the case then f and g are identified in the quotient space. Hence, strictly speaking L^p(S,\, \mu) consists of
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
es of functions. The p-norm on the quotient vector space Given any f \in \mathcal^p(S,\, \mu), the value of the seminorm \, \cdot\, _p on the
coset In mathematics, specifically group theory, a subgroup of a group may be used to decompose the underlying set of into disjoint, equal-size subsets called cosets. There are ''left cosets'' and ''right cosets''. Cosets (both left and right) ...
f + \mathcal = \ is constant and equal to \, f\, _p; denote this unique value by \, f + \mathcal\, _p, so that: \, f + \mathcal\, _p \;\stackrel\; \, f\, _p. This assignment f + \mathcal \mapsto \, f + \mathcal\, _p defines a map, which will also be denoted by \, \cdot\, _p, on the quotient vector space L^p(S, \mu) ~~\stackrel~~ \mathcal^p(S, \mu) / \mathcal ~=~ \. This map is a
norm Norm, the Norm or NORM may refer to: In academic disciplines * Normativity, phenomenon of designating things as good or bad * Norm (geology), an estimate of the idealised mineral content of a rock * Norm (philosophy), a standard in normative e ...
on L^p(S, \mu) called the . The value \, f + \mathcal\, _p of a coset f + \mathcal is independent of the particular function f that was chosen to represent the coset, meaning that if \mathcal \in L^p(S, \mu) is any coset then \, \mathcal\, _p = \, f\, _p for every f \in \mathcal (since \mathcal = f + \mathcal for every f \in \mathcal). The Lebesgue L^p space The
normed vector space The Ateliers et Chantiers de France (ACF, Workshops and Shipyards of France) was a major shipyard that was established in Dunkirk, France, in 1898. The shipyard boomed in the period before World War I (1914–18), but struggled in the inter-war ...
\left(L^p(S, \mu), \, \cdot\, _p\right) is called or the of p-th power integrable functions and it is a
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
for every 1 \leq p \leq \infty (meaning that it is a
complete metric space In mathematical analysis, a metric space is called complete (or a Cauchy space) if every Cauchy sequence of points in has a limit that is also in . Intuitively, a space is complete if there are no "points missing" from it (inside or at the bou ...
, a result that is sometimes called the Riesz–Fischer theorem). When the underlying measure space S is understood then L^p(S, \mu) is often abbreviated L^p(\mu), or even just L^p. Depending on the author, the subscript notation L_p might denote either L^p(S, \mu) or L^(S, \mu). If the seminorm \, \cdot\, _p on \mathcal^p(S,\, \mu) happens to be a norm (which happens if and only if \mathcal = \) then the normed space \left(\mathcal^p(S,\, \mu), \, \cdot\, _p\right) will be linearly
isometrically isomorphic In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' mea ...
to the normed quotient space \left(L^p(S, \mu), \, \cdot\, _p\right) via the canonical map g \in \mathcal^p(S,\, \mu) \mapsto \ (since g + \mathcal = \); in other words, they will be,
up to Two Mathematical object, mathematical objects and are called "equal up to an equivalence relation " * if and are related by , that is, * if holds, that is, * if the equivalence classes of and with respect to are equal. This figure of speech ...
a
linear isometry In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' mea ...
, the same normed space and so they may both be called "L^p space". The above definitions generalize to Bochner spaces. In general, this process cannot be reversed: there is no consistent way to define a "canonical" representative of each coset of \mathcal in L^p. For L^\infty, however, there is a theory of lifts enabling such recovery.


Special cases

For 1 \leq p \leq \infty the \ell^p spaces are a special case of L^p spaces; when S are the
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s \mathbb and \mu is the
counting measure In mathematics, specifically measure theory, the counting measure is an intuitive way to put a measure on any set – the "size" of a subset is taken to be the number of elements in the subset if the subset has finitely many elements, and infinit ...
. More generally, if one considers any set S with the counting measure, the resulting L^p space is denoted \ell^p(S). For example, \ell^p(\mathbb) is the space of all sequences indexed by the integers, and when defining the p-norm on such a space, one sums over all the integers. The space \ell^p(n), where n is the set with n elements, is \Reals^n with its p-norm as defined above. Similar to \ell^2 spaces, L^2 is the only
Hilbert space In mathematics, a Hilbert space is a real number, real or complex number, complex inner product space that is also a complete metric space with respect to the metric induced by the inner product. It generalizes the notion of Euclidean space. The ...
among L^p spaces. In the complex case, the inner product on L^2 is defined by \langle f, g \rangle = \int_S f(x) \overline \, \mathrm\mu(x). Functions in L^2 are sometimes called
square-integrable function In mathematics, a square-integrable function, also called a quadratically integrable function or L^2 function or square-summable function, is a real- or complex-valued measurable function for which the integral of the square of the absolute value ...
s, quadratically integrable functions or square-summable functions, but sometimes these terms are reserved for functions that are square-integrable in some other sense, such as in the sense of a
Riemann integral In the branch of mathematics known as real analysis, the Riemann integral, created by Bernhard Riemann, was the first rigorous definition of the integral of a function on an interval. It was presented to the faculty at the University of Gö ...
. As any Hilbert space, every space L^2 is linearly isometric to a suitable \ell^2(I), where the cardinality of the set I is the cardinality of an arbitrary basis for this particular L^2. If we use complex-valued functions, the space L^\infty is a
commutative In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Perhaps most familiar as a pr ...
C*-algebra In mathematics, specifically in functional analysis, a C∗-algebra (pronounced "C-star") is a Banach algebra together with an involution satisfying the properties of the adjoint. A particular case is that of a complex algebra ''A'' of contin ...
with pointwise multiplication and conjugation. For many measure spaces, including all sigma-finite ones, it is in fact a commutative
von Neumann algebra In mathematics, a von Neumann algebra or W*-algebra is a *-algebra of bounded operators on a Hilbert space that is closed in the weak operator topology and contains the identity operator. It is a special type of C*-algebra. Von Neumann al ...
. An element of L^\infty defines a
bounded operator In functional analysis and operator theory, a bounded linear operator is a linear transformation L : X \to Y between topological vector spaces (TVSs) X and Y that maps bounded subsets of X to bounded subsets of Y. If X and Y are normed vector ...
on any L^p space by
multiplication Multiplication is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division (mathematics), division. The result of a multiplication operation is called a ''Product (mathem ...
.


When

If 0 < p < 1, then L^p(\mu) can be defined as above, that is: N_p(f) = \int_S , f, ^p\, d\mu < \infty. In this case, however, the p-norm \, f\, _p = N_p(f)^ does not satisfy the triangle inequality and defines only a quasi-norm. The inequality (a + b)^p \leq a^p + b^p, valid for a, b \geq 0, implies that N_p(f + g) \leq N_p(f) + N_p(g) and so the function d_p(f ,g) = N_p(f - g) = \, f - g\, _p^p is a metric on L^p(\mu). The resulting metric space is
complete Complete may refer to: Logic * Completeness (logic) * Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable Mathematics * The completeness of the real numbers, which implies t ...
. In this setting L^p satisfies a ''reverse Minkowski inequality'', that is for u, v \in L^p \Big\, , u, + , v, \Big\, _p \geq \, u\, _p + \, v\, _p This result may be used to prove
Clarkson's inequalities In mathematics, Clarkson's inequalities, named after James A. Clarkson, are results in the theory of ''L'p'' spaces. They give bounds for the ''L'p''- norms of the sum and difference of two measurable functions in ''L'p'' in terms of th ...
, which are in turn used to establish the uniform convexity of the spaces L^p for 1 < p < \infty . The space L^p for 0 < p < 1 is an
F-space In functional analysis, an F-space is a vector space X over the real or complex numbers together with a metric d : X \times X \to \R such that # Scalar multiplication in X is continuous with respect to d and the standard metric on \R or \Complex ...
: it admits a complete translation-invariant metric with respect to which the vector space operations are continuous. It is the prototypical example of an
F-space In functional analysis, an F-space is a vector space X over the real or complex numbers together with a metric d : X \times X \to \R such that # Scalar multiplication in X is continuous with respect to d and the standard metric on \R or \Complex ...
that, for most reasonable measure spaces, is not
locally convex In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vec ...
: in \ell^p or L^p(
, 1 The comma is a punctuation mark that appears in several variants in different languages. Some typefaces render it as a small line, slightly curved or straight, but inclined from the vertical; others give it the appearance of a miniature fille ...
, every open convex set containing the 0 function is unbounded for the p-quasi-norm; therefore, the 0 vector does not possess a fundamental system of convex neighborhoods. Specifically, this is true if the measure space S contains an infinite family of disjoint measurable sets of finite positive measure. The only nonempty convex open set in L^p(
, 1 The comma is a punctuation mark that appears in several variants in different languages. Some typefaces render it as a small line, slightly curved or straight, but inclined from the vertical; others give it the appearance of a miniature fille ...
is the entire space. Consequently, there are no nonzero continuous linear functionals on L^p(
, 1 The comma is a punctuation mark that appears in several variants in different languages. Some typefaces render it as a small line, slightly curved or straight, but inclined from the vertical; others give it the appearance of a miniature fille ...
; the
continuous dual space In mathematics, any vector space ''V'' has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on ''V,'' together with the vector space structure of pointwise addition and scalar multiplication by const ...
is the zero space. In the case of the
counting measure In mathematics, specifically measure theory, the counting measure is an intuitive way to put a measure on any set – the "size" of a subset is taken to be the number of elements in the subset if the subset has finitely many elements, and infinit ...
on the natural numbers (i.e. L^p(\mu) = \ell^p), the bounded linear functionals on \ell^p are exactly those that are bounded on \ell^1, i.e., those given by sequences in \ell^\infty. Although \ell^p does contain non-trivial convex open sets, it fails to have enough of them to give a base for the topology. Having no linear functionals is highly undesirable for the purposes of doing analysis. In case of the Lebesgue measure on \Reals^n, rather than work with L^p for 0 < p < 1, it is common to work with the
Hardy space In complex analysis, the Hardy spaces (or Hardy classes) H^p are spaces of holomorphic functions on the unit disk or upper half plane. They were introduced by Frigyes Riesz , who named them after G. H. Hardy, because of the paper . In real anal ...
whenever possible, as this has quite a few linear functionals: enough to distinguish points from one another. However, the
Hahn–Banach theorem In functional analysis, the Hahn–Banach theorem is a central result that allows the extension of bounded linear functionals defined on a vector subspace of some vector space to the whole space. The theorem also shows that there are sufficient ...
still fails in for p < 1 .


Properties


Hölder's inequality

Suppose p, q, r \in , \infty/math> satisfy \tfrac + \tfrac = \tfrac. If f \in L^p(S, \mu) and g \in L^q(S, \mu) then f g \in L^r(S, \mu) and \, f g\, _r ~\leq~ \, f\, _p \, \, g\, _q. This inequality, called
Hölder's inequality In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, is in some sense optimal since if r = 1 and f is a measurable function such that \sup_ \, \int_S , f g, \, \mathrm \mu ~<~ \infty where the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
is taken over the closed unit ball of L^q(S, \mu), then f \in L^p(S, \mu) and \, f\, _p ~=~ \sup_ \, \int_S f g \, \mathrm \mu.


Generalized Minkowski inequality

Minkowski inequality, which states that \, \cdot\, _p satisfies the
triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of Degeneracy (mathematics)#T ...
, can be generalized: If the measurable function F : M \times N \to \Reals is non-negative (where (M, \mu) and (N, \nu) are measure spaces) then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, n)\right\, _\right\, _ ~\leq~ \left\, \left\, F(m, \cdot)\right\, _\right\, _ \ .


Atomic decomposition

If 1 \leq p < \infty then every non-negative f \in L^p(\mu) has an , meaning that there exist a sequence (r_n)_ of non-negative real numbers and a sequence of non-negative functions (f_n)_, called , whose supports \left(\operatorname f_n\right)_ are pairwise disjoint sets of measure \mu\left(\operatorname f_n\right) \leq 2^, such that f ~=~ \sum_ r_n \, f_n \, , and for every integer n \in \Z, \, f_n\, _\infty ~\leq~ 2^ \, , and \tfrac \, f\, _p^p ~\leq~ \sum_ r_n^p ~\leq~ 2 \, f\, ^p_p \, , and where moreover, the sequence of functions (r_n f_n)_ depends only on f (it is independent of p). These inequalities guarantee that \, f_n\, _p^p \leq 2 for all integers n while the supports of (f_n)_ being pairwise disjoint implies \, f\, _p^p ~=~ \sum_ r_n^p \, \, f_n\, ^p_p \, . An atomic decomposition can be explicitly given by first defining for every integer n \in \Z,This
infimum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique ...
is attained by t_n; that is, \mu(f > t_n) < 2^n holds.
t_n = \inf \ and then letting r_n ~=~ 2^ \, t_n ~ \text \quad f_n ~=~ \frac \, \mathbf_ where \mu(f > t) = \mu(\) denotes the measure of the set (f > t) := \ and \mathbf_ denotes the
indicator function In mathematics, an indicator function or a characteristic function of a subset of a set is a function that maps elements of the subset to one, and all other elements to zero. That is, if is a subset of some set , then the indicator functio ...
of the set (t_ < f \leq t_n) := \. The sequence (t_n)_ is decreasing and converges to 0 as n \to \infty. Consequently, if t_n = 0 then t_ = 0 and (t_ < f \leq t_n) = \varnothing so that f_n = \frac \, f \,\mathbf_ is identically equal to 0 (in particular, the division \tfrac by r_n = 0 causes no issues). The complementary cumulative distribution function t \in \Reals \mapsto \mu(, f, > t) of , f, = f that was used to define the t_n also appears in the definition of the weak L^p-norm (given below) and can be used to express the p-norm \, \cdot\, _p (for 1 \leq p < \infty) of f \in L^p(S, \mu) as the integral \, f\, _p^p ~=~ p \, \int_0^\infty t^ \mu(, f, > t) \, \mathrm t \, , where the integration is with respect to the usual Lebesgue measure on (0, \infty).


Dual spaces

The
dual space In mathematics, any vector space ''V'' has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on ''V,'' together with the vector space structure of pointwise addition and scalar multiplication by cons ...
of L^p(\mu) for 1 < p < \infty has a natural isomorphism with L^q(\mu), where q is such that \tfrac + \tfrac = 1. This isomorphism associates g \in L^q(\mu) with the functional \kappa_p(g) \in L^p(\mu)^* defined by f \mapsto \kappa_p(g)(f) = \int f g \, \mathrm\mu for every f \in L^p(\mu). \kappa_p : L^q(\mu) \to L^p(\mu)^* is a well defined continuous linear mapping which is an
isometry In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' me ...
by the extremal case of Hölder's inequality. If (S,\Sigma,\mu) is a \sigma-finite measure space one can use the
Radon–Nikodym theorem In mathematics, the Radon–Nikodym theorem is a result in measure theory that expresses the relationship between two measures defined on the same measurable space. A ''measure'' is a set function that assigns a consistent magnitude to the measurab ...
to show that any G \in L^p(\mu)^* can be expressed this way, i.e., \kappa_p is an isometric isomorphism of
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
s. Hence, it is usual to say simply that L^q(\mu) is the
continuous dual space In mathematics, any vector space ''V'' has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on ''V,'' together with the vector space structure of pointwise addition and scalar multiplication by const ...
of L^p(\mu). For 1 < p < \infty, the space L^p(\mu) is reflexive. Let \kappa_p be as above and let \kappa_q : L^p(\mu) \to L^q(\mu)^* be the corresponding linear isometry. Consider the map from L^p(\mu) to L^p(\mu)^, obtained by composing \kappa_q with the
transpose In linear algebra, the transpose of a Matrix (mathematics), matrix is an operator which flips a matrix over its diagonal; that is, it switches the row and column indices of the matrix by producing another matrix, often denoted by (among other ...
(or adjoint) of the inverse of \kappa_p: j_p : L^p(\mu) \mathrel L^q(\mu)^* \mathrel L^p(\mu)^ This map coincides with the canonical embedding J of L^p(\mu) into its bidual. Moreover, the map j_p is onto, as composition of two onto isometries, and this proves reflexivity. If the measure \mu on S is sigma-finite, then the dual of L^1(\mu) is isometrically isomorphic to L^\infty(\mu) (more precisely, the map \kappa_1 corresponding to p = 1 is an isometry from L^\infty(\mu) onto L^1(\mu)^*. The dual of L^\infty(\mu) is subtler. Elements of L^\infty(\mu)^* can be identified with bounded signed ''finitely'' additive measures on S that are
absolutely continuous In calculus and real analysis, absolute continuity is a smoothness property of functions that is stronger than continuity and uniform continuity. The notion of absolute continuity allows one to obtain generalizations of the relationship betwe ...
with respect to \mu. See ba space for more details. If we assume the axiom of choice, this space is much bigger than L^1(\mu) except in some trivial cases. However,
Saharon Shelah Saharon Shelah (; , ; born July 3, 1945) is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and Rutgers University in New Jersey. Biography Shelah was born in Jerusalem on July 3, 1945. He is th ...
proved that there are relatively consistent extensions of
Zermelo–Fraenkel set theory In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes suc ...
(ZF + DC + "Every subset of the real numbers has the Baire property") in which the dual of \ell^\infty is \ell^1.


Embeddings

Colloquially, if 1 \leq p < q \leq \infty, then L^p(S, \mu) contains functions that are more locally singular, while elements of L^q(S, \mu) can be more spread out. Consider the
Lebesgue measure In measure theory, a branch of mathematics, the Lebesgue measure, named after French mathematician Henri Lebesgue, is the standard way of assigning a measure to subsets of higher dimensional Euclidean '-spaces. For lower dimensions or , it c ...
on the half line (0, \infty). A continuous function in L^1 might blow up near 0 but must decay sufficiently fast toward infinity. On the other hand, continuous functions in L^\infty need not decay at all but no blow-up is allowed. More formally: #If 0: L^q(S, \mu) \subseteq L^p(S, \mu) if and only if S does not contain sets of finite but arbitrarily large measure (e.g. any finite measure). #If 0: L^p(S, \mu) \subseteq L^q(S, \mu) if and only if S does not contain sets of non-zero but arbitrarily small measure (e.g. the
counting measure In mathematics, specifically measure theory, the counting measure is an intuitive way to put a measure on any set – the "size" of a subset is taken to be the number of elements in the subset if the subset has finitely many elements, and infinit ...
). Neither condition holds for the Lebesgue measure on the real line while both conditions holds for the
counting measure In mathematics, specifically measure theory, the counting measure is an intuitive way to put a measure on any set – the "size" of a subset is taken to be the number of elements in the subset if the subset has finitely many elements, and infinit ...
on any finite set. As a consequence of the closed graph theorem, the embedding is continuous, i.e., the
identity operator Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, unc ...
is a bounded linear map from L^q to L^p in the first case and L^p to L^q in the second. Indeed, if the domain S has finite measure, one can make the following explicit calculation using
Hölder's inequality In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
\ \, \mathbff^p\, _1 \leq \, \mathbf\, _ \, f^p\, _ leading to \ \, f\, _p \leq \mu(S)^ \, f\, _q . The constant appearing in the above inequality is optimal, in the sense that the
operator norm In mathematics, the operator norm measures the "size" of certain linear operators by assigning each a real number called its . Formally, it is a norm defined on the space of bounded linear operators between two given normed vector spaces. Inform ...
of the identity I : L^q(S, \mu) \to L^p(S, \mu) is precisely \, I\, _ = \mu(S)^ the case of equality being achieved exactly when f = 1 \mu-almost-everywhere.


Dense subspaces

Let 1 \leq p < \infty and (S, \Sigma, \mu) be a measure space and consider an integrable
simple function In the mathematical field of real analysis, a simple function is a real (or complex)-valued function over a subset of the real line, similar to a step function. Simple functions are sufficiently "nice" that using them makes mathematical reas ...
f on S given by f = \sum_^n a_j \mathbf_, where a_j are scalars, A_j \in \Sigma has finite measure and _ is the
indicator function In mathematics, an indicator function or a characteristic function of a subset of a set is a function that maps elements of the subset to one, and all other elements to zero. That is, if is a subset of some set , then the indicator functio ...
of the set A_j, for j = 1, \dots, n. By construction of the
integral In mathematics, an integral is the continuous analog of a Summation, sum, which is used to calculate area, areas, volume, volumes, and their generalizations. Integration, the process of computing an integral, is one of the two fundamental oper ...
, the vector space of integrable simple functions is
dense Density (volumetric mass density or specific mass) is the ratio of a substance's mass to its volume. The symbol most often used for density is ''ρ'' (the lower case Greek letter rho), although the Latin letter ''D'' (or ''d'') can also be use ...
in L^p(S, \Sigma, \mu). More can be said when S is a normal
topological space In mathematics, a topological space is, roughly speaking, a Geometry, geometrical space in which Closeness (mathematics), closeness is defined but cannot necessarily be measured by a numeric Distance (mathematics), distance. More specifically, a to ...
and \Sigma its Borel –algebra. Suppose V \subseteq S is an open set with \mu(V) < \infty. Then for every Borel set A \in \Sigma contained in V there exist a closed set F and an open set U such that F \subseteq A \subseteq U \subseteq V \quad \text \quad \mu(U \setminus F)= \mu(U) - \mu(F) < \varepsilon, for every \varepsilon > 0. Subsequently, there exists a Urysohn function 0 \leq \varphi \leq 1 on S that is 1 on F and 0 on S \setminus U, with \int_S , \mathbf_A - \varphi, \, \mathrm\mu < \varepsilon \, . If S can be covered by an increasing sequence (V_n) of open sets that have finite measure, then the space of p–integrable continuous functions is dense in L^p(S, \Sigma, \mu). More precisely, one can use bounded continuous functions that vanish outside one of the open sets V_n. This applies in particular when S = \Reals^d and when \mu is the Lebesgue measure. For example, the space of continuous and compactly supported functions as well as the space of integrable
step function In mathematics, a function on the real numbers is called a step function if it can be written as a finite linear combination of indicator functions of intervals. Informally speaking, a step function is a piecewise constant function having on ...
s are dense in L^p(\Reals^d).


Closed subspaces

If 0 < p < \infty is any positive real number, \mu is a
probability measure In mathematics, a probability measure is a real-valued function defined on a set of events in a σ-algebra that satisfies Measure (mathematics), measure properties such as ''countable additivity''. The difference between a probability measure an ...
on a measurable space (S, \Sigma) (so that L^\infty(\mu) \subseteq L^p(\mu)), and V \subseteq L^\infty(\mu) is a vector subspace, then V is a closed subspace of L^p(\mu) if and only if V is finite-dimensional (V was chosen independent of p). In this theorem, which is due to
Alexander Grothendieck Alexander Grothendieck, later Alexandre Grothendieck in French (; ; ; 28 March 1928 – 13 November 2014), was a German-born French mathematician who became the leading figure in the creation of modern algebraic geometry. His research ext ...
, it is crucial that the vector space V be a subset of L^\infty since it is possible to construct an infinite-dimensional closed vector subspace of L^1\left(S^1, \tfrac\lambda\right) (which is even a subset of L^4), where \lambda is
Lebesgue measure In measure theory, a branch of mathematics, the Lebesgue measure, named after French mathematician Henri Lebesgue, is the standard way of assigning a measure to subsets of higher dimensional Euclidean '-spaces. For lower dimensions or , it c ...
on the
unit circle In mathematics, a unit circle is a circle of unit radius—that is, a radius of 1. Frequently, especially in trigonometry, the unit circle is the circle of radius 1 centered at the origin (0, 0) in the Cartesian coordinate system in the Eucli ...
S^1 and \tfrac \lambda is the probability measure that results from dividing it by its mass \lambda(S^1) = 2 \pi.


Applications


Statistics

In statistics, measures of
central tendency In statistics, a central tendency (or measure of central tendency) is a central or typical value for a probability distribution.Weisberg H.F (1992) ''Central Tendency and Variability'', Sage University Paper Series on Quantitative Applications in ...
and
statistical dispersion In statistics, dispersion (also called variability, scatter, or spread) is the extent to which a distribution is stretched or squeezed. Common examples of measures of statistical dispersion are the variance, standard deviation, and interquartil ...
, such as the
mean A mean is a quantity representing the "center" of a collection of numbers and is intermediate to the extreme values of the set of numbers. There are several kinds of means (or "measures of central tendency") in mathematics, especially in statist ...
,
median The median of a set of numbers is the value separating the higher half from the lower half of a Sample (statistics), data sample, a statistical population, population, or a probability distribution. For a data set, it may be thought of as the “ ...
, and
standard deviation In statistics, the standard deviation is a measure of the amount of variation of the values of a variable about its Expected value, mean. A low standard Deviation (statistics), deviation indicates that the values tend to be close to the mean ( ...
, can be defined in terms of L^p metrics, and measures of central tendency can be characterized as solutions to variational problems. In penalized regression, "L1 penalty" and "L2 penalty" refer to penalizing either the L^1 norm of a solution's vector of parameter values (i.e. the sum of its absolute values), or its squared L^2 norm (its Euclidean length). Techniques which use an L1 penalty, like
LASSO A lasso or lazo ( or ), also called reata or la reata in Mexico, and in the United States riata or lariat (from Mexican Spanish lasso for roping cattle), is a loop of rope designed as a restraint to be thrown around a target and tightened when ...
, encourage sparse solutions (where the many parameters are zero). Elastic net regularization uses a penalty term that is a combination of the L^1 norm and the squared L^2 norm of the parameter vector.


Hausdorff–Young inequality

The
Fourier transform In mathematics, the Fourier transform (FT) is an integral transform that takes a function as input then outputs another function that describes the extent to which various frequencies are present in the original function. The output of the tr ...
for the real line (or, for
periodic functions A periodic function, also called a periodic waveform (or simply periodic wave), is a function that repeats its values at regular intervals or periods. The repeatable part of the function or waveform is called a ''cycle''. For example, the tr ...
, see
Fourier series A Fourier series () is an Series expansion, expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series. By expressing a function as a sum of sines and cosines, many problems ...
), maps L^p(\Reals) to L^q(\Reals) (or L^p(\mathbf) to \ell^q) respectively, where 1 \leq p \leq 2 and \tfrac + \tfrac = 1. This is a consequence of the Riesz–Thorin interpolation theorem, and is made precise with the
Hausdorff–Young inequality The Hausdorff−Young inequality is a foundational result in the mathematical field of Fourier analysis In mathematics, Fourier analysis () is the study of the way general functions may be represented or approximated by sums of simpler trig ...
. By contrast, if p > 2, the Fourier transform does not map into L^q.


Hilbert spaces

Hilbert space In mathematics, a Hilbert space is a real number, real or complex number, complex inner product space that is also a complete metric space with respect to the metric induced by the inner product. It generalizes the notion of Euclidean space. The ...
s are central to many applications, from
quantum mechanics Quantum mechanics is the fundamental physical Scientific theory, theory that describes the behavior of matter and of light; its unusual characteristics typically occur at and below the scale of atoms. Reprinted, Addison-Wesley, 1989, It is ...
to
stochastic calculus Stochastic calculus is a branch of mathematics that operates on stochastic processes. It allows a consistent theory of integration to be defined for integrals of stochastic processes with respect to stochastic processes. This field was created an ...
. The spaces L^2 and \ell^2 are both Hilbert spaces. In fact, by choosing a Hilbert basis E, i.e., a maximal orthonormal subset of L^2 or any Hilbert space, one sees that every Hilbert space is isometrically isomorphic to \ell^2(E) (same E as above), i.e., a Hilbert space of type \ell^2.


Generalizations and extensions


Weak

Let (S, \Sigma, \mu) be a measure space, and f a
measurable function In mathematics, and in particular measure theory, a measurable function is a function between the underlying sets of two measurable spaces that preserves the structure of the spaces: the preimage of any measurable set is measurable. This is in ...
with real or complex values on S. The distribution function of f is defined for t \geq 0 by \lambda_f(t) = \mu\. If f is in L^p(S, \mu) for some p with 1 \leq p < \infty, then by
Markov's inequality In probability theory, Markov's inequality gives an upper bound on the probability that a non-negative random variable is greater than or equal to some positive Constant (mathematics), constant. Markov's inequality is tight in the sense that for e ...
, \lambda_f(t) \leq \frac A function f is said to be in the space weak L^p(S, \mu), or L^(S, \mu), if there is a constant C > 0 such that, for all t > 0, \lambda_f(t) \leq \frac The best constant C for this inequality is the L^-norm of f, and is denoted by \, f\, _ = \sup_ ~ t \lambda_f^(t). The weak L^p coincide with the Lorentz spaces L^, so this notation is also used to denote them. The L^-norm is not a true norm, since the
triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of Degeneracy (mathematics)#T ...
fails to hold. Nevertheless, for f in L^p(S, \mu), \, f\, _ \leq \, f\, _p and in particular L^p(S, \mu) \subset L^(S, \mu). In fact, one has \, f\, ^p_ = \int , f(x), ^p d\mu(x) \geq \int_ t^p + \int_ , f, ^p \geq t^p \mu(\), and raising to power 1/p and taking the supremum in t one has \, f\, _ \geq \sup_ t \; \mu(\)^ = \, f\, _. Under the convention that two functions are equal if they are equal \mu almost everywhere, then the spaces L^ are complete . For any 0 < r < p the expression \, , f , \, _ = \sup_ \mu(E)^ \left(\int_E , f, ^r\, d\mu\right)^ is comparable to the L^-norm. Further in the case p > 1, this expression defines a norm if r = 1. Hence for p > 1 the weak L^p spaces are
Banach space In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
s . A major result that uses the L^-spaces is the Marcinkiewicz interpolation theorem, which has broad applications to
harmonic analysis Harmonic analysis is a branch of mathematics concerned with investigating the connections between a function and its representation in frequency. The frequency representation is found by using the Fourier transform for functions on unbounded do ...
and the study of singular integrals.


Weighted spaces

As before, consider a
measure space A measure space is a basic object of measure theory, a branch of mathematics that studies generalized notions of volumes. It contains an underlying set, the subsets of this set that are feasible for measuring (the -algebra) and the method that ...
(S, \Sigma, \mu). Let w : S \to \nu(A) \equiv \int_A w(x) \, \mathrm \mu (x), \qquad A \in \Sigma, or, in terms of the Radon–Nikodym theorem">Radon–Nikodym derivative, w = \tfrac the
norm Norm, the Norm or NORM may refer to: In academic disciplines * Normativity, phenomenon of designating things as good or bad * Norm (geology), an estimate of the idealised mineral content of a rock * Norm (philosophy), a standard in normative e ...
for L^p(S, w \, \mathrm \mu) is explicitly \, u\, _ \equiv \left(\int_S w(x) , u(x), ^p \, \mathrm \mu(x)\right)^ As L^p-spaces, the weighted spaces have nothing special, since L^p(S, w \, \mathrm \mu) is equal to L^p(S, \mathrm \nu). But they are the natural framework for several results in harmonic analysis ; they appear for example in the Muckenhoupt weights, Muckenhoupt theorem: for 1 < p < \infty, the classical Hilbert transform is defined on L^p(\mathbf, \lambda) where \mathbf denotes the
unit circle In mathematics, a unit circle is a circle of unit radius—that is, a radius of 1. Frequently, especially in trigonometry, the unit circle is the circle of radius 1 centered at the origin (0, 0) in the Cartesian coordinate system in the Eucli ...
and \lambda the Lebesgue measure; the (nonlinear) Hardy–Littlewood maximal operator is bounded on L^p(\Reals^n, \lambda). Muckenhoupt's theorem describes weights w such that the Hilbert transform remains bounded on L^p(\mathbf, w \, \mathrm \lambda) and the maximal operator on L^p(\Reals^n, w \, \mathrm \lambda).


spaces on manifolds

One may also define spaces L^p(M) on a manifold, called the intrinsic L^p spaces of the manifold, using densities.


Vector-valued spaces

Given a measure space (\Omega, \Sigma, \mu) and a
locally convex space In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vec ...
E (here assumed to be
complete Complete may refer to: Logic * Completeness (logic) * Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable Mathematics * The completeness of the real numbers, which implies t ...
), it is possible to define spaces of p-integrable E-valued functions on \Omega in a number of ways. One way is to define the spaces of Bochner integrable and Pettis integrable functions, and then endow them with
locally convex In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vec ...
TVS-topologies that are (each in their own way) a natural generalization of the usual L^p topology. Another way involves topological tensor products of L^p(\Omega, \Sigma, \mu) with E. Element of the vector space L^p(\Omega, \Sigma, \mu) \otimes E are finite sums of simple tensors f_1 \otimes e_1 + \cdots + f_n \otimes e_n, where each simple tensor f \times e may be identified with the function \Omega \to E that sends x \mapsto e f(x). This
tensor product In mathematics, the tensor product V \otimes W of two vector spaces V and W (over the same field) is a vector space to which is associated a bilinear map V\times W \rightarrow V\otimes W that maps a pair (v,w),\ v\in V, w\in W to an element of ...
L^p(\Omega, \Sigma, \mu) \otimes E is then endowed with a locally convex topology that turns it into a topological tensor product, the most common of which are the
projective tensor product In functional analysis, an area of mathematics, the projective tensor product of two locally convex topological vector spaces is a natural topological vector space structure on their tensor product. Namely, given locally convex topological vector s ...
, denoted by L^p(\Omega, \Sigma, \mu) \otimes_\pi E, and the injective tensor product, denoted by L^p(\Omega, \Sigma, \mu) \otimes_\varepsilon E. In general, neither of these space are complete so their completions are constructed, which are respectively denoted by L^p(\Omega, \Sigma, \mu) \widehat_\pi E and L^p(\Omega, \Sigma, \mu) \widehat_\varepsilon E (this is analogous to how the space of scalar-valued
simple function In the mathematical field of real analysis, a simple function is a real (or complex)-valued function over a subset of the real line, similar to a step function. Simple functions are sufficiently "nice" that using them makes mathematical reas ...
s on \Omega, when seminormed by any \, \cdot\, _p, is not complete so a completion is constructed which, after being quotiented by \ker \, \cdot\, _p, is isometrically isomorphic to the Banach space L^p(\Omega, \mu)).
Alexander Grothendieck Alexander Grothendieck, later Alexandre Grothendieck in French (; ; ; 28 March 1928 – 13 November 2014), was a German-born French mathematician who became the leading figure in the creation of modern algebraic geometry. His research ext ...
showed that when E is a
nuclear space In mathematics, nuclear spaces are topological vector spaces that can be viewed as a generalization of finite-dimensional Euclidean spaces and share many of their desirable properties. Nuclear spaces are however quite different from Hilbert spaces, ...
(a concept he introduced), then these two constructions are, respectively, canonically TVS-isomorphic with the spaces of Bochner and Pettis integral functions mentioned earlier; in short, they are indistinguishable.


space of measurable functions

The vector space of (
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
es of) measurable functions on (S, \Sigma, \mu) is denoted L^0(S, \Sigma, \mu) . By definition, it contains all the L^p, and is equipped with the topology of ''
convergence in measure Convergence in measure is either of two distinct mathematical concepts both of which generalize the concept of convergence in probability. Definitions Let f, f_n\ (n \in \mathbb N): X \to \mathbb R be measurable functions on a measure space (X, ...
''. When \mu is a probability measure (i.e., \mu(S) = 1), this mode of convergence is named ''
convergence in probability In probability theory, there exist several different notions of convergence of sequences of random variables, including ''convergence in probability'', ''convergence in distribution'', and ''almost sure convergence''. The different notions of conve ...
''. The space L^0 is always a
topological abelian group In mathematics, a topological abelian group, or TAG, is a topological group that is also an abelian group. That is, a TAG is both a Group (algebra), group and a topological space, the group operations are Continuous (topology), continuous, and the g ...
but is only a
topological vector space In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
if \mu(S)<\infty. This is because scalar multiplication is continuous if and only if \mu(S)<\infty. If (S,\Sigma,\mu) is \sigma-finite then the weaker topology of local convergence in measure is an
F-space In functional analysis, an F-space is a vector space X over the real or complex numbers together with a metric d : X \times X \to \R such that # Scalar multiplication in X is continuous with respect to d and the standard metric on \R or \Complex ...
, i.e. a completely
metrizable topological vector space In functional analysis and related areas of mathematics, a metrizable (resp. pseudometrizable) topological vector space (TVS) is a TVS whose topology is induced by a metric (resp. pseudometric). An LM-space is an inductive limit of a sequence of ...
. Moreover, this topology is isometric to global convergence in measure (S,\Sigma,\nu) for a suitable choice of
probability measure In mathematics, a probability measure is a real-valued function defined on a set of events in a σ-algebra that satisfies Measure (mathematics), measure properties such as ''countable additivity''. The difference between a probability measure an ...
\nu. The description is easier when \mu is finite. If \mu is a finite measure on (S, \Sigma), the 0 function admits for the convergence in measure the following fundamental system of neighborhoods V_\varepsilon = \Bigl\, \qquad \varepsilon > 0. The topology can be defined by any metric d of the form d(f, g) = \int_S \varphi \bigl(, f(x) - g(x), \bigr)\, \mathrm\mu(x) where \varphi is bounded continuous concave and non-decreasing on Lévy-metric for L^0. Under this metric the space L^0 is complete. However, as mentioned above, scalar multiplication is continuous with respect to this metric only if \mu(S)<\infty. To see this, consider the Lebesgue measurable function f:\mathbb R\rightarrow \mathbb R defined by f(x)=x. Then clearly \lim_d(cf,0)=\infty. The space L^0 is in general not locally bounded, and not locally convex. For the infinite Lebesgue measure \lambda on \Reals^n, the definition of the fundamental system of neighborhoods could be modified as follows W_\varepsilon = \left\ The resulting space L^0(\Reals^n, \lambda), with the topology of local convergence in measure, is isomorphic to the space L^0(\Reals^n, g \, \lambda), for any positive \lambda–integrable density g.


See also

* * * * * * * * * * \left( L^1_\right) * * * * * * *


Notes


References

* . * * . * . * . * * . * . * * * * * *


External links

*
Proof that ''L''''p'' spaces are complete
{{DEFAULTSORT:Lp Space Banach spaces Function spaces Series (mathematics) Measure theory Normed spaces Lp spaces