In
mathematics, particularly 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 (e.g. inner product, norm, topology, etc.) and the linear functions defined ...
, a seminorm is a
vector space norm that need not be
positive definite. Seminorms are intimately connected with
convex set
In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex ...
s: every seminorm is the
Minkowski functional
In mathematics, in the field of functional analysis, a Minkowski functional (after Hermann Minkowski) or gauge function is a function that recovers a notion of distance on a linear space.
If K is a subset of a real or complex vector space X, then ...
of some
absorbing disk and, conversely, the Minkowski functional of any such set is a seminorm.
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 al ...
is locally convex if and only if its topology is induced by a family of seminorms.
Definition
Let
be a vector space over either the
real number
In mathematics, a real number is a number that can be used to measurement, measure a ''continuous'' one-dimensional quantity such as a distance, time, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small var ...
s
or the
complex numbers
A
real-valued function
In mathematics, a real-valued function is a function whose values are real numbers. In other words, it is a function that assigns a real number to each member of its domain.
Real-valued functions of a real variable (commonly called ''real ...
is called a if it satisfies the following two conditions:
#
Subadditivity In mathematics, subadditivity is a property of a function that states, roughly, that evaluating the function for the sum of two elements of the domain always returns something less than or equal to the sum of the function's values at each element. ...
/
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 degenerate triangles, bu ...
:
for all
#
Absolute homogeneity:
for all
and all scalars
These two conditions imply that
[If denotes the zero vector in while denote the zero scalar, then absolute homogeneity implies that ] and that every seminorm
also has the following property:
[Suppose is a seminorm and let Then absolute homogeneity implies The triangle inequality now implies Because was an arbitrary vector in it follows that which implies that (by subtracting from both sides). Thus which implies (by multiplying thru by ).]
- Nonnegativity: for all
Some authors include non-negativity as part of the definition of "seminorm" (and also sometimes of "norm"), although this is not necessary since it follows from the other two properties.
By definition, a
norm on
is a seminorm that also separates points, meaning that it has the following additional property:
- Positive definite/: for all if then
A is a pair
consisting of a vector space
and a seminorm
on
If the seminorm
is also a norm then the seminormed space
is called a .
Since absolute homogeneity implies positive homogeneity, every seminorm is a type of function called a
sublinear function. A map
is called a if it is subadditive and
positive homogeneous
In mathematics, a homogeneous function is a function of several variables such that, if all its arguments are multiplied by a scalar, then its value is multiplied by some power of this scalar, called the degree of homogeneity, or simply the ''deg ...
. Unlike a seminorm, a sublinear function is necessarily nonnegative. Sublinear functions are often encountered in the context of the
Hahn–Banach theorem
The Hahn–Banach theorem is a central tool in functional analysis.
It allows the extension of bounded linear functionals defined on a subspace of some vector space to the whole space, and it also shows that there are "enough" continuous linear f ...
.
A real-valued function
is a seminorm if and only if it is a
sublinear and
balanced function.
Examples
- The on which refers to the constant map on induces the
indiscrete topology In topology, a topological space with the trivial topology is one where the only open sets are the empty set and the entire space. Such spaces are commonly called indiscrete, anti-discrete, concrete or codiscrete. Intuitively, this has the conseque ...
on
- If is any
linear form
In mathematics, a linear form (also known as a linear functional, a one-form, or a covector) is a linear map from a vector space to its field of scalars (often, the real numbers or the complex numbers).
If is a vector space over a field , t ...
on a vector space then its absolute value defined by is a seminorm.
- A sublinear function on a real vector space is a seminorm if and only if it is a , meaning that for all
- Every real-valued sublinear function on a real vector space induces a seminorm defined by
- Any finite sum of seminorms is a seminorm. The restriction of a seminorm (respectively, norm) to a
vector subspace
In mathematics, and more specifically in linear algebra, a linear subspace, also known as a vector subspaceThe term ''linear subspace'' is sometimes used for referring to flats and affine subspaces. In the case of vector spaces over the reals, ...
is once again a seminorm (respectively, norm).
- If and are seminorms (respectively, norms) on and then the map defined by is a seminorm (respectively, a norm) on In particular, the maps on defined by and are both seminorms on
- If and are seminorms on then so are
where and
- The space of seminorms on is generally not a
distributive lattice
In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set ...
with respect to the above operations. For example, over , are such that
- If is a
linear map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that pr ...
and is a seminorm on then is a seminorm on The seminorm will be a norm on if and only if is injective and the restriction is a norm on
Minkowski functionals and seminorms
Seminorms on a vector space
are intimately tied, via Minkowski functionals, to subsets of
that are
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 ...
,
balanced, and
absorbing. Given such a subset
of
the Minkowski functional of
is a seminorm. Conversely, given a seminorm
on
the sets
and
are convex, balanced, and absorbing and furthermore, the Minkowski functional of these two sets (as well as of any set lying "in between them") is
Algebraic properties
Every seminorm is a
sublinear function, and thus satisfies all
properties of a sublinear function, including:
*
Convexity
*
Reverse triangle inequality:
* For any
,
* For any
,
is an
absorbing disk in
*
*
and
* If
is a sublinear function on a real vector space
then there exists a linear functional
on
such that
* If
is a real vector space,
is a linear functional on
and
is a sublinear function on
then
on
if and only if
Other properties of seminorms
Every seminorm is a
balanced function.
If
Every norm is a convex function and consequently, finding a global maximum of a norm-based objective function is sometimes tractable.
Relationship to other norm-like concepts
Let
p : X \to \R be a non-negative function. The following are equivalent:
- p is a seminorm.
- p is a
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 ...
F-seminorm.
- p is a convex balanced ''G''-seminorm.
If any of the above conditions hold, then the following are equivalent:
- p is a norm;
- \ does not contain a non-trivial vector subspace.
- There exists a norm on X, with respect to which, \ is bounded.
If
p is a sublinear function on a real vector space
X then the following are equivalent:
- p is a
linear functional
In mathematics, a linear form (also known as a linear functional, a one-form, or a covector) is a linear map from a vector space to its field of scalars (often, the real numbers or the complex numbers).
If is a vector space over a field , th ...
;
- p(x) + p(-x) \leq 0 \text x \in X;
- p(x) + p(-x) = 0 \text x \in X;
Inequalities involving seminorms
If
p, q : X \to [0, \infty) are seminorms on
X then:
- p \leq q if and only if q(x) \leq 1 implies p(x) \leq 1.
- If a > 0 and b > 0 are such that p(x) < a implies q(x) \leq b, then a q(x) \leq b p(x) for all x \in X.
- Suppose a and b are positive real numbers and q, p_1, \ldots, p_n are seminorms on X such that for every x \in X, if \max \ < a then q(x) < b. Then a q \leq b \left(p_1 + \cdots + p_n\right).
- If X is a vector space over the reals and f is a non-zero linear functional on X, then f \leq p if and only if \varnothing = f^(1) \cap \.
If
p is a seminorm on
X and
f is a linear functional on
X then:
- , f, \leq p on X if and only if \operatorname f \leq p on X (see footnote for proof).
[Obvious if X is a real vector space. For the non-trivial direction, assume that \operatorname f \leq p on X and let x \in X. Let r \geq 0 and t be real numbers such that f(x) = r e^. Then , f(x), = r = f\left(e^ x\right) = \operatorname\left(f\left(e^ x\right)\right) \leq p\left(e^ x\right) = p(x).]
- f \leq p on X if and only if f^(1) \cap \.
- If a > 0 and b > 0 are such that p(x) < a implies f(x) \neq b, then a , f(x), \leq b p(x) for all x \in X.
Hahn–Banach theorem for seminorms
Seminorms offer a particularly clean formulation of the
Hahn–Banach theorem
The Hahn–Banach theorem is a central tool in functional analysis.
It allows the extension of bounded linear functionals defined on a subspace of some vector space to the whole space, and it also shows that there are "enough" continuous linear f ...
:
:If
M is a vector subspace of a seminormed space
(X, p) and if
f is a continuous linear functional on
M, then
f may be extended to a continuous linear functional
F on
X that has the same norm as
f.
A similar extension property also holds for seminorms:
:Proof: Let
S be the convex hull of
\ \cup \. Then
S is an
absorbing disk in
X and so the
Minkowski functional
In mathematics, in the field of functional analysis, a Minkowski functional (after Hermann Minkowski) or gauge function is a function that recovers a notion of distance on a linear space.
If K is a subset of a real or complex vector space X, then ...
P of
S is a seminorm on
X. This seminorm satisfies
p = P on
M and
P \leq q on
X. \blacksquare
Topologies of seminormed spaces
Pseudometrics and the induced topology
A seminorm
p on
X induces a topology, called the , via the canonical
translation-invariant
In geometry, to translate a geometric figure is to move it from one place to another without rotating it. A translation "slides" a thing by .
In physics and mathematics, continuous translational symmetry is the invariance of a system of equatio ...
pseudometric d_p : X \times X \to \R;
d_p(x, y) := p(x - y) = p(y - x).
This topology is
Hausdorff if and only if
d_p is a metric, which occurs if and only if
p is a
norm.
This topology makes
X into 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 ...
pseudometrizable 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 al ...
that has a
bounded
Boundedness or bounded may refer to:
Economics
* Bounded rationality, the idea that human rationality in decision-making is bounded by the available information, the cognitive limitations, and the time available to make the decision
* Bounded e ...
neighborhood of the origin and a
neighborhood basis at the origin consisting of the following open balls (or the closed balls) centered at the origin:
\ \quad \text \quad \
as
r > 0 ranges over the positive reals.
Every seminormed space
(X, p) should be assumed to be endowed with this topology unless indicated otherwise. A topological vector space whose topology is induced by some seminorm is called .
Equivalently, every vector space
X with seminorm
p induces a
vector space quotient X / W, where
W is the subspace of
X consisting of all vectors
x \in X with
p(x) = 0. Then
X / W carries a norm defined by
p(x + W) = p(v). The resulting topology,
pulled back to
X, is precisely the topology induced by
p.
Any seminorm-induced topology makes
X 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 ...
, as follows. If
p is a seminorm on
X and
r \in \R, call the set
\ the ; likewise the closed ball of radius
r is
\. The set of all open (resp. closed)
p-balls at the origin forms a neighborhood basis of
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 ...
balanced sets that are open (resp. closed) in the
p-topology on
X.
Stronger, weaker, and equivalent seminorms
The notions of stronger and weaker seminorms are akin to the notions of stronger and weaker
norms. If
p and
q are seminorms on
X, then we say that
q is than
p and that
p is than
q if any of the following equivalent conditions holds:
# The topology on
X induced by
q is finer than the topology induced by
p.
# If
x_ = \left(x_i\right)_^ is a sequence in
X, then
q\left(x_\right) := \left(q\left(x_i\right)\right)_^ \to 0 in
\R implies
p\left(x_\right) \to 0 in
\R.
# If
x_ = \left(x_i\right)_ is a
net in
X, then
q\left(x_\right) := \left(q\left(x_i\right)\right)_ \to 0 in
\R implies
p\left(x_\right) \to 0 in
\R.
#
p is bounded on
\.
# If
\inf \ = 0 then
p(x) = 0 for all
x \in X.
# There exists a real
K > 0 such that
p \leq K q on
X.
The seminorms
p and
q are called if they are both weaker (or both stronger) than each other. This happens if they satisfy any of the following conditions:
- The topology on X induced by q is the same as the topology induced by p.
- q is stronger than p and p is stronger than q.
- If x_ = \left(x_i\right)_^ is a sequence in X then q\left(x_\right) := \left(q\left(x_i\right)\right)_^ \to 0 if and only if p\left(x_\right) \to 0.
- There exist positive real numbers r > 0 and R > 0 such that r q \leq p \leq R q.
Normability and seminormability
A topological vector space (TVS) is said to be a (respectively, a ) if its topology is induced by a single seminorm (resp. a single norm).
A TVS is normable if and only if it is seminormable and Hausdorff or equivalently, if and only if it is seminormable and
T1 (because a TVS is Hausdorff if and only if it is a
T1 space).
A is a topological vector space that possesses a bounded neighborhood of the origin.
Normability 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 al ...
s is characterized by
Kolmogorov's normability criterion.
A TVS is seminormable if and only if it has a convex bounded neighborhood of the origin.
Thus 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 ...
TVS is seminormable if and only if it has a non-empty bounded open set.
A TVS is normable if and only if it is a
T1 space and admits a bounded convex neighborhood of the origin.
If
X is a Hausdorff
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 ...
TVS then the following are equivalent:
- X is normable.
- X is seminormable.
- X has a bounded neighborhood of the origin.
- The strong dual X^_b of X is normable.
- The strong dual X^_b of X is
metrizable
In topology and related areas of mathematics, a metrizable space is a topological space that is homeomorphic to a metric space. That is, a topological space (X, \mathcal) is said to be metrizable if there is a metric d : X \times X \to , \inf ...
.
Furthermore,
X is finite dimensional if and only if
X^_ is normable (here
X^_ denotes
X^ endowed with the
weak-* topology).
The product of infinitely many seminormable space is again seminormable if and only if all but finitely many of these spaces trivial (that is, 0-dimensional).
Topological properties
- If X is a TVS and p is a continuous seminorm on X, then the closure of \ in X is equal to \.
- The closure of \ in a locally convex space X whose topology is defined by a family of continuous seminorms \mathcal is equal to \bigcap_ p^(0).
- A subset S in a seminormed space (X, p) is
bounded
Boundedness or bounded may refer to:
Economics
* Bounded rationality, the idea that human rationality in decision-making is bounded by the available information, the cognitive limitations, and the time available to make the decision
* Bounded e ...
if and only if p(S) is bounded.
- If (X, p) is a seminormed space then the locally convex topology that p induces on X makes X into a
pseudometrizable TVS
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 l ...
with a canonical pseudometric given by d(x, y) := p(x - y) for all x, y \in X.
- The product of infinitely many seminormable spaces is again seminormable if and only if all but finitely many of these spaces are trivial (that is, 0-dimensional).
Continuity of seminorms
If
p is a seminorm on a topological vector space
X, then the following are equivalent:
- p is continuous.
- p is continuous at 0;
- \ is open in X;
- \ is closed neighborhood of 0 in X;
- p is uniformly continuous on X;
- There exists a continuous seminorm q on X such that p \leq q.
In particular, if
(X, p) is a seminormed space then a seminorm
q on
X is continuous if and only if
q is dominated by a positive scalar multiple of
p.
If
X is a real TVS,
f is a linear functional on
X, and
p is a continuous seminorm (or more generally, a sublinear function) on
X, then
f \leq p on
X implies that
f is continuous.
Continuity of linear maps
If
F : (X, p) \to (Y, q) is a map between seminormed spaces then let
\, F\, _ := \sup \.
If
F : (X, p) \to (Y, q) is a linear map between seminormed spaces then the following are equivalent:
- F is continuous;
- \, F\, _ < \infty;
- There exists a real K \geq 0 such that p \leq K q;
* In this case, \, F\, _ \leq K.
If
F is continuous then
q(F(x)) \leq \, F\, _ p(x) for all
x \in X.
The space of all continuous linear maps
F : (X, p) \to (Y, q) between seminormed spaces is itself a seminormed space under the seminorm
\, F\, _.
This seminorm is a norm if
q is a norm.
Generalizations
The concept of in
composition algebra
In mathematics, a composition algebra over a field is a not necessarily associative algebra over together with a nondegenerate quadratic form that satisfies
:N(xy) = N(x)N(y)
for all and in .
A composition algebra includes an involuti ...
s does share the usual properties of a norm.
A composition algebra
(A, *, N) consists of an
algebra over a field
In mathematics, an algebra over a field (often simply called an algebra) is a vector space equipped with a bilinear product. Thus, an algebra is an algebraic structure consisting of a set together with operations of multiplication and additio ...
A, an
involution \,*, and a
quadratic form
In mathematics, a quadratic form is a polynomial with terms all of degree two ("form" is another name for a homogeneous polynomial). For example,
:4x^2 + 2xy - 3y^2
is a quadratic form in the variables and . The coefficients usually belong to ...
N, which is called the "norm". In several cases
N is an
isotropic quadratic form
In mathematics, a quadratic form over a field ''F'' is said to be isotropic if there is a non-zero vector on which the form evaluates to zero. Otherwise the quadratic form is anisotropic. More precisely, if ''q'' is a quadratic form on a vector s ...
so that
A has at least one
null vector, contrary to the separation of points required for the usual norm discussed in this article.
An or a is a seminorm
p : X \to \R that also satisfies
p(x + y) \leq \max \ \text x, y \in X.
Weakening subadditivity: Quasi-seminorms
A map
p : X \to \R is called a if it is (absolutely) homogeneous and there exists some
b \leq 1 such that
p(x + y) \leq b p(p(x) + p(y)) \text x, y \in X.
The smallest value of
b for which this holds is called the
A quasi-seminorm that separates points is called a on
X.
Weakening homogeneity -
k-seminorms
A map
p : X \to \R is called a if it is subadditive and there exists a
k such that
0 < k \leq 1 and for all
x \in X and scalars
s,p(s x) = , s, ^k p(x) A
k-seminorm that separates points is called a on
X.
We have the following relationship between quasi-seminorms and
k-seminorms:
See also
*
*
*
*
*
*
*
*
*
*
*
*
*
*
Notes
Proofs
References
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
External links
Sublinear functionsThe sandwich theorem for sublinear and super linear functionals
{{DEFAULTSORT:Norm (Mathematics)
Linear algebra