Locally Convex Spaces
   HOME

TheInfoList



OR:

In functional analysis and related areas of
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize
normed space In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers, on which a norm is defined. A norm is the formalization and the generalization to real vector spaces of the intuitive notion of "length" i ...
s. They can be defined as topological vector spaces whose topology is generated by translations of balanced, absorbent, convex sets. Alternatively they can be defined as a vector space with a family of seminorms, and a topology can be defined in terms of that family. Although in general such spaces are not necessarily
normable In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and is ze ...
, the existence of a convex local base for the zero vector is strong enough for the Hahn–Banach theorem to hold, yielding a sufficiently rich theory of continuous linear functionals. Fréchet spaces are locally convex spaces that are completely metrizable (with a choice of complete metric). They are generalizations of Banach spaces, which are complete vector spaces with respect to a metric generated by a norm.


History

Metrizable topologies on vector spaces have been studied since their introduction in Maurice Fréchet's 1902 PhD thesis ''Sur quelques points du calcul fonctionnel'' (wherein the notion of a metric was first introduced). After the notion of a general topological space was defined by Felix Hausdorff in 1914, although locally convex topologies were implicitly used by some mathematicians, up to 1934 only John von Neumann would seem to have explicitly defined the weak topology on Hilbert spaces and strong operator topology on operators on Hilbert spaces. Finally, in 1935 von Neumann introduced the general definition of a locally convex space (called a ''convex space'' by him). A notable example of a result which had to wait for the development and dissemination of general locally convex spaces (amongst other notions and results, like nets, the product topology and Tychonoff's theorem) to be proven in its full generality, is the Banach–Alaoglu theorem which Stefan Banach first established in 1932 by an elementary diagonal argument for the case of separable normed spaces (in which case the unit ball of the dual is metrizable).


Definition

Suppose X is a vector space over \mathbb, a subfield of the complex numbers (normally \Complex itself or \R). A locally convex space is defined either in terms of convex sets, or equivalently in terms of seminorms.


Definition via convex sets

A subset C in X is called # Convex if for all x, y \in C, and 0 \leq t \leq 1, tx + (1-t)y \in C. In other words, C contains all line segments between points in C. # Circled if for all x \in C and scalars s, if , s, = 1 then s x \in C. If \mathbb = \R, this means that C is equal to its reflection through the origin. For \mathbb = \Complex, it means for any x \in C, C contains the circle through x, centred on the origin, in the one-dimensional complex subspace generated by x. # Balanced if for all x \in C and scalars s, if , s, \leq 1 then s x \in C. If \mathbb = \R, this means that if x \in C, then C contains the line segment between x and -x. For \mathbb = \Complex, it means for any in x \in C, C contains the disk with x on its boundary, centred on the origin, in the one-dimensional complex subspace generated by x. Equivalently, a balanced set is a circled cone. # A cone (when the underlying field is ordered) if for all x \in C and 0 \leq t , t x \in C. # Absorbent or absorbing if for every x \in X, there exists r > 0 such that x \in t C for all t \in \mathbb satisfying , t, > r. The set C can be scaled out by any "large" value to absorb every point in the space. #* In any TVS, every neighborhood of the origin is absorbent. # Absolutely convex or a disk if it is both balanced and convex. This is equivalent to it being closed under linear combinations whose coefficients absolutely sum to \leq 1; such a set is absorbent if it spans all of X. A topological vector space (TVS) is called locally convex if the origin has a neighborhood basis (that is, a local base) consisting of convex sets. In fact, every locally convex TVS has a neighborhood basis of the origin consisting of sets (that is, disks), where this neighborhood basis can further be chosen to also consist entirely of open sets or entirely of closed sets. Every TVS has a neighborhood basis at the origin consisting of balanced sets but only a locally convex TVS has a neighborhood basis at the origin consisting of sets that are both balanced convex. It is possible for a TVS to have neighborhoods of the origin that are convex and yet be locally convex. Because translation is (by definition of "topological vector space") continuous, all translations are
homeomorphisms In the mathematical field of topology, a homeomorphism, topological isomorphism, or bicontinuous function is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorp ...
, so every base for the neighborhoods of the origin can be translated to a base for the neighborhoods of any given vector.


Definition via seminorms

A seminorm on X is a map p : X \to \R such that # p is nonnegative or positive semidefinite: p(x) \geq 0; # p is positive homogeneous or positive scalable: p(s x) = , s, p(x) for every scalar s. So, in particular, p(0) = 0; # p is subadditive. It satisfies the triangle inequality: p(x + y) \leq p(x) + p(y). If p satisfies positive definiteness, which states that if p(x) = 0 then x = 0, then p is a norm. While in general seminorms need not be norms, there is an analogue of this criterion for families of seminorms, separatedness, defined below. If X is a vector space and \mathcal is a family of seminorms on X then a subset \mathcal of \mathcal is called a base of seminorms for \mathcal if for all p \in \mathcal there exists a q \in \mathcal and a real r > 0 such that p \leq r q. Definition (second version): A locally convex space is defined to be a vector space X along with a family \mathcal of seminorms on X.


Seminorm topology

Suppose that X is a vector space over \mathbb, where \mathbb is either the real or complex numbers. A family of seminorms \mathcal on the vector space X induces a canonical vector space topology on X, called the initial topology induced by the seminorms, making it into a topological vector space (TVS). By definition, it is the coarsest topology on X for which all maps in \mathcal are continuous. That the vector space operations are continuous in this topology follows from properties 2 and 3 above. It is possible for a locally convex topology on a space X to be induced by a family of norms but for X to be
normable In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and is ze ...
(that is, to have its topology be induced by a single norm).


=Basis and subbases

= Let B_ denote the open ball of radius r > 0 in \mathbb. The family of sets p^\left(B_\right) = \ as p ranges over a family of seminorms \mathcal and r ranges over the positive real numbers is a subbasis at the origin for the topology induced by \mathcal. These sets are convex, as follows from properties 2 and 3 of seminorms. Intersections of finitely many such sets are then also convex, and since the collection of all such finite intersections is a basis at the origin it follows that the topology is locally convex in the sense of the definition given above. Recall that the topology of a TVS is translation invariant, meaning that if S is any subset of X containing the origin then for any x \in X, S is a neighborhood of the origin if and only if x + S is a neighborhood of x; thus it suffices to define the topology at the origin. A base of neighborhoods of y for this topology is obtained in the following way: for every finite subset F of \mathcal and every r > 0, let U_(y) := \.


=Bases of seminorms and saturated families

= If X is a locally convex space and if \mathcal is a collection of continuous seminorms on X, then \mathcal is called a base of continuous seminorms if it is a base of seminorms for the collection of continuous seminorms on X. Explicitly, this means that for all continuous seminorms p on X, there exists a q \in \mathcal and a real r > 0 such that p \leq r q. If \mathcal is a base of continuous seminorms for a locally convex TVS X then the family of all sets of the form \ as q varies over \mathcal and r varies over the positive real numbers, is a of neighborhoods of the origin in X (not just a subbasis, so there is no need to take finite intersections of such sets).Let V_p = \ be the open unit ball associated with the seminorm p and note that if r > 0 is real then r V_p = \ = \ = \left\ = V_ and so \tfrac V_p = V_. Thus a basic open neighborhood of the origin induced by \mathcal is a finite intersection of the form V_ \cap \cdots \cap V_ where p_1, \ldots, p_n \in \mathcal and r_1, \ldots, r_n are all positive reals. Let p := \max \left\, which is a continuous seminorm and moreover, V_p = V_ \cap \cdots \cap V_. Pick r > 0 and q \in \mathcal such that p \leq r q, where this inequality holds if and only if V_ \subseteq V_p. Thus \tfrac V_q = V_ \subseteq V_p = V_ \cap \cdots \cap V_, as desired. A family \mathcal of seminorms on a vector space X is called saturated if for any p and q in \mathcal, the seminorm defined by x \mapsto \max \ belongs to \mathcal. If \mathcal is a saturated family of continuous seminorms that induces the topology on X then the collection of all sets of the form \ as p ranges over \mathcal and r ranges over all positive real numbers, forms a neighborhood basis at the origin consisting of convex open sets; This forms a basis at the origin rather than merely a subbasis so that in particular, there is need to take finite intersections of such sets.


Basis of norms

The following theorem implies that if X is a locally convex space then the topology of X can be a defined by a family of continuous on X (a norm is a seminorm s where s(x)=0 implies x=0) if and only if there exists continuous on X. This is because the sum of a norm and a seminorm is a norm so if a locally convex space is defined by some family \mathcal of seminorms (each of which is necessarily continuous) then the family \mathcal + n := \ of (also continuous) norms obtained by adding some given continuous norm n to each element, will necessarily be a family of norms that defines this same locally convex topology. If there exists a continuous norm on a topological vector space X then X is necessarily Hausdorff but the converse is not in general true (not even for locally convex spaces or Fréchet spaces).


=Nets

= Suppose that the topology of a locally convex space X is induced by a family \mathcal of continuous seminorms on X. If x \in X and if x_ = \left(x_i\right)_ is a net in X, then x_ \to x in X if and only if for all p \in \mathcal, p\left(x_ - x\right) = \left(p\left(x_i\right) - x\right)_ \to 0. Moreover, if x_ is Cauchy in X, then so is p\left(x_\right) = \left(p\left(x_i\right)\right)_ for every p \in \mathcal.


Equivalence of definitions

Although the definition in terms of a neighborhood base gives a better geometric picture, the definition in terms of seminorms is easier to work with in practice. The equivalence of the two definitions follows from a construction known as 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 ...
or Minkowski gauge. The key feature of seminorms which ensures the convexity of their \varepsilon-
ball A ball is a round object (usually spherical, but can sometimes be ovoid) with several uses. It is used in ball games, where the play of the game follows the state of the ball as it is hit, kicked or thrown by players. Balls can also be used f ...
s is the triangle inequality. For an absorbing set C such that if x \in C, then t x \in C whenever 0 \leq t \leq 1, define the Minkowski functional of C to be \mu_C(x) = \inf \. From this definition it follows that \mu_C is a seminorm if C is balanced and convex (it is also absorbent by assumption). Conversely, given a family of seminorms, the sets \left\ form a base of convex absorbent balanced sets.


Ways of defining a locally convex topology

Example: auxiliary normed spaces If W is convex and absorbing in X then the symmetric set D := \bigcap_ u W will be convex and balanced (also known as an or a ) in addition to being absorbing in X. This guarantees that 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_D : X \to \R of D will be a seminorm on X, thereby making \left(X, p_D\right) into a
seminormed space In mathematics, particularly in functional analysis, a seminorm is a vector space norm that need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some absorbing disk and ...
that carries its canonical pseduometrizable topology. The set of scalar multiples r D as r ranges over \left\ (or over any other set of non-zero scalars having 0 as a limit point) forms a neighborhood basis of absorbing disks at the origin for this locally convex topology. If X is a topological vector space and if this convex absorbing subset W is also a
bounded subset :''"Bounded" and "boundary" are distinct concepts; for the latter see boundary (topology). A circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary. In mathematical analysis and related areas of mat ...
of X, then the absorbing disk D := \bigcap_ u W will also be bounded, in which case p_D will be a norm and \left(X, p_D\right) will form what is known as an
auxiliary normed space In functional analysis, two methods of constructing normed spaces from disks were systematically employed by Alexander Grothendieck to define nuclear operators and nuclear spaces. One method is used if the disk D is bounded: in this case, the aux ...
. If this normed space is a
Banach space In mathematics, more specifically in functional analysis, a Banach space (pronounced ) 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 vector ...
then D is called a .


Further definitions

* A family of seminorms \left(p_\right)_ is called total or separated or is said to separate points if whenever p_(x) = 0 holds for every \alpha then x is necessarily 0. A locally convex space is Hausdorff if and only if it has a separated family of seminorms. Many authors take the Hausdorff criterion in the definition. * A pseudometric is a generalization of a metric which does not satisfy the condition that d(x, y) = 0 only when x = y. A locally convex space is pseudometrizable, meaning that its topology arises from a pseudometric, if and only if it has a countable family of seminorms. Indeed, a pseudometric inducing the same topology is then given by d(x,y)=\sum^\infty_n \frac \frac (where the 1/2^n can be replaced by any positive
summable In mathematics, a series is, roughly speaking, a description of the operation of adding infinitely many quantities, one after the other, to a given starting quantity. The study of series is a major part of calculus and its generalization, math ...
sequence a_n). This pseudometric is translation-invariant, but not homogeneous, meaning d(k x, k y) \neq , k, d(x, y), and therefore does not define a (pseudo)norm. The pseudometric is an honest metric if and only if the family of seminorms is separated, since this is the case if and only if the space is Hausdorff. If furthermore the space is complete, the space is called a Fréchet space. * As with any topological vector space, a locally convex space is also a uniform space. Thus one may speak of uniform continuity, uniform convergence, and Cauchy sequences. * A Cauchy net in a locally convex space is a net \left(x_a\right)_ such that for every r > 0 and every seminorm p_\alpha, there exists some index c \in A such that for all indices a, b \geq c, p_\alpha\left(x_a - x_b\right) < r. In other words, the net must be Cauchy in all the seminorms simultaneously. The definition of completeness is given here in terms of nets instead of the more familiar sequences because unlike Fréchet spaces which are metrizable, general spaces may be defined by an uncountable family of pseudometrics. Sequences, which are countable by definition, cannot suffice to characterize convergence in such spaces. A locally convex 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 ...
if and only if every Cauchy net converges. * A family of seminorms becomes a
preorder In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special c ...
ed set under the relation p_\alpha \leq p_\beta if and only if there exists an M > 0 such that for all x, p_\alpha(x) \leq M p_\beta(x). One says it is a directed family of seminorms if the family is a directed set with addition as the join, in other words if for every \alpha and \beta, there is a \gamma such that p_\alpha + p_\beta \leq p_\gamma. Every family of seminorms has an equivalent directed family, meaning one which defines the same topology. Indeed, given a family \left(p_\alpha(x)\right)_, let \Phi be the set of finite subsets of I and then for every F \in \Phi define q_F = \sum_ p_. One may check that \left(q_F\right)_ is an equivalent directed family. * If the topology of the space is induced from a single seminorm, then the space is seminormable. Any locally convex space with a finite family of seminorms is seminormable. Moreover, if the space is Hausdorff (the family is separated), then the space is normable, with norm given by the sum of the seminorms. In terms of the open sets, a locally convex topological vector space is seminormable if and only if the origin 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.


Sufficient conditions


Hahn–Banach extension property

Let X be a TVS. Say that a vector subspace M of X has the extension property if any continuous linear functional on M can be extended to a continuous linear functional on X. Say that X has the Hahn-Banach extension property (HBEP) if every vector subspace of X has the extension property. The Hahn-Banach theorem guarantees that every Hausdorff locally convex space has the HBEP. For complete metrizable TVSs there is a converse: If a vector space X has uncountable dimension and if we endow it with the
finest vector topology 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 ...
then this is a TVS with the HBEP that is neither locally convex or metrizable.


Properties

Throughout, \mathcal is a family of continuous seminorms that generate the topology of X. Topological closure If S \subseteq X and x \in X, then x \in \operatorname S if and only if for every r > 0 and every finite collection p_1, \ldots, p_n \in \mathcal there exists some s \in S such that \sum_^n p_i(x - s) < r. The closure of \ in X is equal to \bigcap_ p^(0). Topology of Hausdorff locally convex spaces Every Hausdorff locally convex space is
homeomorphic In the mathematical field of topology, a homeomorphism, topological isomorphism, or bicontinuous function is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphi ...
to a vector subspace of a product of
Banach space In mathematics, more specifically in functional analysis, a Banach space (pronounced ) 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 vector ...
s. The
Anderson–Kadec theorem In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces. The ...
states that every infinite–dimensional separable Fréchet space is
homeomorphic In the mathematical field of topology, a homeomorphism, topological isomorphism, or bicontinuous function is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphi ...
to the product space \prod_ \R of countably many copies of \R (this homeomorphism need not be a linear map).


Properties of convex subsets

Algebraic properties of convex subsets A subset C is convex if and only if t C + (1 - t) C \subseteq C for all 0 \leq t \leq 1 or equivalently, if and only if (s + t) C = s C + t C for all positive real s > 0 \text t > 0, where because (s + t) C \subseteq s C + t C always holds, the equals sign \,=\, can be replaced with \,\supseteq.\, If C is a convex set that contains the origin then C is
star shaped A star is an astronomical object comprising a luminous spheroid of plasma held together by its gravity. The nearest star to Earth is the Sun. Many other stars are visible to the naked eye at night, but their immense distances from Earth make ...
at the origin and for all non-negative real s \geq 0 \text t \geq 0, (s C) \cap (t C) = (\min_ \) C. The Minkowski sum of two convex sets is convex; furthermore, the scalar multiple of a convex set is again convex. Topological properties of convex subsets * Suppose that Y is a TVS (not necessarily locally convex or Hausdorff) over the real or complex numbers. Then the open convex subsets of Y are exactly those that are of the form z + \ = \ for some z \in Y and some positive continuous sublinear functional p on Y. * The interior and closure of a convex subset of a TVS is again convex. * If C is a convex set with non-empty interior, then the closure of C is equal to the closure of the interior of C; furthermore, the interior of C is equal to the interior of the closure of C. ** So if the interior of a convex set C is non-empty then C is a closed (respectively, open) set if and only if it is a regular closed (respectively, regular open) set. * If C is convex and 0 < t \leq 1, then t \operatorname C + (1 - t) \operatorname C ~\subseteq~ \operatorname C. Explicitly, this means that if C is a convex subset of a TVS X (not necessarily Hausdorff or locally convex), y belongs to the closure of C, and x belongs to the interior of C, then the open line segment joining x and y belongs to the interior of C; that is, \ \subseteq \operatorname_X C.Fix 0 < r < 1 so it remains to show that w_0 ~\stackrel~ r x + (1 - r) y belongs to \operatorname_X C. By replacing C, x, y with C - w_0, x - w_0, y - w_0 if necessary, we may assume without loss of generality that r x + (1 - r) y = 0, and so it remains to show that C is a neighborhood of the origin. Let s ~\stackrel~ \tfrac < 0 so that y = \tfrac x = s x. Since scalar multiplication by s \neq 0 is a linear homeomorphism X \to X, \operatorname_X \left(\tfrac C\right) = \tfrac \operatorname_X C. Since x \in \operatorname C and y \in \operatorname C, it follows that x = \tfrac y \in \operatorname \left(\tfrac C\right) \cap \operatorname C where because \operatorname C is open, there exists some c_0 \in \left(\tfrac C\right) \cap \operatorname C, which satisfies s c_0 \in C. Define h : X \to X by x \mapsto r x + (1 - r) s c_0 = r x - r c_0, which is a homeomorphism because 0 < r < 1. The set h\left(\operatorname C\right) is thus an open subset of X that moreover contains h(c_0) = r c_0 - r c_0 = 0. If c \in \operatorname C then h(c) = r c + (1 - r) s c_0 \in C since C is convex, 0 < r < 1, and s c_0, c \in C, which proves that h\left(\operatorname C\right) \subseteq C. Thus h\left(\operatorname C\right) is an open subset of X that contains the origin and is contained in C. Q.E.D. * If M is a closed vector subspace of a (not necessarily Hausdorff) locally convex spaceX, V is a convex neighborhood of the origin in M, and if z \in X is a vector in V, then there exists a convex neighborhood U of the origin in X such that V = U \cap M and z \not\in U. * The closure of a convex subset of a locally convex Hausdorff space X is the same for locally convex Hausdorff TVS topologies on X that are compatible with
duality Duality may refer to: Mathematics * Duality (mathematics), a mathematical concept ** Dual (category theory), a formalization of mathematical duality ** Duality (optimization) ** Duality (order theory), a concept regarding binary relations ** Dual ...
between X and its continuous dual space. * In a locally convex space, the convex hull and the disked hull of a totally bounded set is totally bounded. * In a
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 ...
locally convex space, the convex hull and the disked hull of a compact set are both compact. ** More generally, if K is a compact subset of a locally convex space, then the convex hull \operatorname K (respectively, the disked hull \operatorname K) is compact if and only if it is complete. * In a locally convex space, convex hulls of bounded sets are bounded. This is not true for TVSs in general. * In a Fréchet space, the closed convex hull of a compact set is compact. * In a locally convex space, any linear combination of totally bounded sets is totally bounded.


Properties of convex hulls

For any subset S of a TVS X, the
convex hull In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space ...
(respectively, closed convex hull,
balanced hull In linear algebra and related areas of mathematics a balanced set, circled set or disk in a vector space (over a field \mathbb with an absolute value function , \cdot , ) is a set S such that a S \subseteq S for all scalars a satisfying , a, ...
, convex balanced hull) of S, denoted by \operatorname S (respectively, \overline S, \operatorname S, \operatorname S), is the smallest convex (respectively, closed convex, balanced, convex balanced) subset of X containing S. * The convex hull of compact subset of a
Hilbert space In mathematics, Hilbert spaces (named after David Hilbert) allow generalizing the methods of linear algebra and calculus from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise natural ...
is necessarily closed and so also necessarily compact. For example, let H be the separable Hilbert space \ell^2(\N) of square-summable sequences with the usual norm \, \cdot\, _2 and let e_n = (0, \ldots, 0, 1, 0, \ldots) be the standard orthonormal basis (that is 1 at the n^-coordinate). The closed set S = \ \cup \left\ is compact but its convex hull \operatorname S is a closed set because h := \sum_^ \tfrac \tfrac e_n belongs to the closure of \operatorname S in H but h \not\in\operatorname S (since every sequence z \in \operatorname S is a finite convex combination of elements of S and so is necessarily 0 in all but finitely many coordinates, which is not true of h). However, like in all
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 ...
Hausdorff locally convex spaces, the convex hull K := \overline S of this compact subset is compact. The vector subspace X := \operatorname S is a
pre-Hilbert space 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, often d ...
when endowed with the substructure that the Hilbert space H induces on it but X is not complete and h \not\in C := K \cap X (since h \not\in X). The closed convex hull of S in X (here, "closed" means with respect to X, and not to H as before) is equal to K \cap X, which is not compact (because it is not a complete subset). This shows that in a Hausdorff locally convex space that is not complete, the closed convex hull of compact subset might to be compact (although it will be precompact/totally bounded). * In a Hausdorff locally convex space X, the closed convex hull \overline^X S = \operatorname_X \operatorname S of compact subset S is not necessarily compact although it is a precompact (also called "totally bounded") subset, which means that its closure, \widehat of X, will be compact (here X \subseteq \widehat, so that X = \widehat if and only if X is complete); that is to say, \operatorname_ \overline^X S will be compact. So for example, the closed convex hull C := \overline^X S of a compact subset of S of a
pre-Hilbert space 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, often d ...
X is always a precompact subset of X, and so the closure of C in any Hilbert space H containing X (such as the Hausdorff completion of X for instance) will be compact (this is the case in the previous example above). * In a quasi-complete locally convex TVS, the closure of the convex hull of a compact subset is again compact. * In a Hausdorff locally convex TVS, the convex hull of a precompact set is again precompact. Consequently, in a
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 ...
Hausdorff locally convex space, the closed convex hull of a compact subset is again compact. * In any TVS, the convex hull of a finite union of compact convex sets is compact (and convex). ** This implies that in any Hausdorff TVS, the convex hull of a finite union of compact convex sets is (in addition to being compact and convex); in particular, the convex hull of such a union is equal to the convex hull of that union. ** In general, the closed convex hull of a compact set is not necessarily compact. ** In any non-Hausdorff TVS, there exist subsets that are compact (and thus complete) but closed. * The bipolar theorem states that the bipolar (that is, the
polar Polar may refer to: Geography Polar may refer to: * Geographical pole, either of two fixed points on the surface of a rotating body or planet, at 90 degrees from the equator, based on the axis around which a body rotates * Polar climate, the c ...
of the polar) of a subset of a locally convex Hausdorff TVS is equal to the closed convex balanced hull of that set. * The
balanced hull In linear algebra and related areas of mathematics a balanced set, circled set or disk in a vector space (over a field \mathbb with an absolute value function , \cdot , ) is a set S such that a S \subseteq S for all scalars a satisfying , a, ...
of a convex set is necessarily convex. * If C and D are convex subsets of a topological vector space X and if \operatorname (C \cup D), then there exist c \in C, d \in D, and a real number r satisfying 0 \leq r \leq 1 such that x = r c + (1 - r) d. * If M is a vector subspace of a TVS X, C a convex subset of M, and D a convex subset of X such that D \cap M \subseteq C, then C = M \cap \operatorname (C \cup D). * Recall that the smallest balanced subset of X containing a set S is called the balanced hull of S and is denoted by \operatorname S. For any subset S of X, the convex balanced hull of S, denoted by \operatorname S, is the smallest subset of X containing S that is convex and balanced. The convex balanced hull of S is equal to the convex hull of the balanced hull of S (i.e. \operatorname S = \operatorname (\operatorname S)), but the convex balanced hull of S is necessarily equal to the balanced hull of the convex hull of S (that is, \operatorname S is not necessarily equal to \operatorname (\operatorname S)). * If A, B \subseteq X are subsets of a TVS X and if s is a scalar then \operatorname (A + B) = \operatorname (A) + \operatorname (B), \operatorname (s A) = s \operatorname A, \operatorname (A \cup B) = \operatorname (A) \cup \operatorname (B), and \overline(s A) = s \overline(A). Moreover, if \overline(A) is compact then \overline(A + B) = \overline(A) + \overline(B). However, the convex hull of a closed set need not be closed; for example, the set \left\ is closed in X := \R^2 but its convex hull is the open set \left(-\tfrac, \tfrac\right) \times \R. * If A, B \subseteq X are subsets of a TVS X whose closed convex hulls are compact, then \overline(A \cup B) = \overline\left(\overline(A) \cup \overline(B)\right). * If S is a convex set in a complex vector space X and there exists some z \in X such that z, iz, -z, -iz \in S, then r z + s i z \in S for all real r, s such that , r, + , s, \leq 1. In particular, a z \in S for all scalars a such that , a, ^2 \leq \tfrac.


Examples and nonexamples


Finest and coarsest locally convex topology


Coarsest vector topology

Any vector space X endowed with the trivial topology (also called the indiscrete topology) is a locally convex TVS (and of course, it is the coarsest such topology). This topology is Hausdorff if and only X = \. The indiscrete topology makes any vector space into a
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 ...
pseudometrizable locally convex TVS. In contrast, the discrete topology forms a vector topology on X if and only X = \. This follows from the fact that every topological vector space is a
connected space In topology and related branches of mathematics, a connected space is a topological space that cannot be represented as the union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological properties tha ...
.


Finest locally convex topology

If X is a real or complex vector space and if \mathcal is the set of all seminorms on X then the locally convex TVS topology, denoted by \tau_, that \mathcal induces on X is called the on X. This topology may also be described as the TVS-topology on X having as a neighborhood base at the origin the set of all absorbing
disk Disk or disc may refer to: * Disk (mathematics), a geometric shape * Disk storage Music * Disc (band), an American experimental music band * ''Disk'' (album), a 1995 EP by Moby Other uses * Disk (functional analysis), a subset of a vector sp ...
s in X. Any locally convex TVS-topology on X is necessarily a subset of \tau_. \left(X, \tau_\right) is Hausdorff. Every linear map from \left(X, \tau_\right) into another locally convex TVS is necessarily continuous. In particular, every linear functional on \left(X, \tau_\right) is continuous and every vector subspace of X is closed in \left(X, \tau_\right); therefore, if X is infinite dimensional then \left(X, \tau_\right) is not pseudometrizable (and thus not metrizable). Moreover, \tau_ is the Hausdorff locally convex topology on X with the property that any linear map from it into any Hausdorff locally convex space is continuous. The space \left(X, \tau_\right) is a bornological space.


Examples of locally convex spaces

Every normed space is a Hausdorff locally convex space, and much of the theory of locally convex spaces generalizes parts of the theory of normed spaces. The family of seminorms can be taken to be the single norm. Every Banach space is a complete Hausdorff locally convex space, in particular, the L^p spaces with p \geq 1 are locally convex. More generally, every Fréchet space is locally convex. A Fréchet space can be defined as a complete locally convex space with a separated countable family of seminorms. The space \R^ of
real valued sequences In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural n ...
with the family of seminorms given by p_i \left(\left\_n\right) = \left, x_i\, \qquad i \in \N is locally convex. The countable family of seminorms is complete and separable, so this is a Fréchet space, which is not normable. This is also the limit topology of the spaces \R^n, embedded in \R^ in the natural way, by completing finite sequences with infinitely many 0. Given any vector space X and a collection F of linear functionals on it, X can be made into a locally convex topological vector space by giving it the weakest topology making all linear functionals in F continuous. This is known as the weak topology or the initial topology determined by F. The collection F may be the
algebraic dual In mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in m ...
of X or any other collection. The family of seminorms in this case is given by p_f(x) = , f(x), for all f in F. Spaces of differentiable functions give other non-normable examples. Consider the space of smooth functions f : \R^n \to \Complex such that \sup_x \left, x^a D_b f\ < \infty, where a and B are multiindices. The family of seminorms defined by p_(f) = \sup_x \left, x^a D_b f(x)\ is separated, and countable, and the space is complete, so this metrizable space is a Fréchet space. It is known as the Schwartz space, or the space of functions of rapid decrease, and its
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 space of
tempered distribution Distributions, also known as Schwartz distributions or generalized functions, are objects that generalize the classical notion of functions in mathematical analysis. Distributions make it possible to differentiate functions whose derivatives d ...
s. An important
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 vect ...
in functional analysis is the space D(U) of smooth functions with
compact support In mathematics, the support of a real-valued function f is the subset of the function domain containing the elements which are not mapped to zero. If the domain of f is a topological space, then the support of f is instead defined as the smallest ...
in U \subseteq \R^n. A more detailed construction is needed for the topology of this space because the space C_0^(U) is not complete in the uniform norm. The topology on D(U) is defined as follows: for any fixed compact set K \subseteq U, the space C_0^(K) of functions f \in C_0^ with \operatorname(f) \subseteq K is a Fréchet space with countable family of seminorms \, f\, _m = \sup_ \sup_x \left, D^k f(x)\ (these are actually norms, and the completion of the space C_0^(K) with the \, \cdot \, _m norm is a Banach space D^m(K)). Given any collection \left(K_a\right)_ of compact sets, directed by inclusion and such that their union equal U, the C_0^\left(K_a\right) form a
direct system In mathematics, the ind-completion or ind-construction is the process of freely adding filtered colimits to a given category ''C''. The objects in this ind-completed category, denoted Ind(''C''), are known as direct systems, they are functors fr ...
, and D(U) is defined to be the limit of this system. Such a limit of Fréchet spaces is known as an LF space. More concretely, D(U) is the union of all the C_0^\left(K_a\right) with the strongest topology which makes each inclusion map C_0^\left(K_a\right) \hookrightarrow D(U) continuous. This space is locally convex and complete. However, it is not metrizable, and so it is not a Fréchet space. The dual space of D\left(\R^n\right) is the space of distributions on \R^n. More abstractly, given a topological space X, the space C(X) of continuous (not necessarily bounded) functions on X can be given the topology of uniform convergence on compact sets. This topology is defined by semi-norms \varphi_K(f) = \max \ (as K varies over the directed set of all compact subsets of X). When X is locally compact (for example, an open set in \R^n) the
Stone–Weierstrass theorem In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on a closed interval can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are among the si ...
applies—in the case of real-valued functions, any subalgebra of C(X) that separates points and contains the constant functions (for example, the subalgebra of polynomials) is dense.


Examples of spaces lacking local convexity

Many topological vector spaces are locally convex. Examples of spaces that lack local convexity include the following: * The spaces L^p( , 1 for 0 < p < 1 are equipped with the F-norm \, f\, ^p_p = \int_0^1 , f(x), ^p \, dx. They are not locally convex, since the only convex neighborhood of zero is the whole space. More generally the spaces L^p(\mu) with an atomless, finite measure \mu and 0 < p < 1 are not locally convex. * The space of measurable functions on the unit interval
, 1 The comma is a punctuation mark that appears in several variants in different languages. It has the same shape as an apostrophe or single closing quotation mark () in many typefaces, but it differs from them in being placed on the baseline (t ...
/math> (where we identify two functions that are equal almost everywhere) has a vector-space topology defined by the translation-invariant metric (which induces the convergence in measure of measurable functions; for
random variables A random variable (also called random quantity, aleatory variable, or stochastic variable) is a mathematical formalization of a quantity or object which depends on random events. It is a mapping or a function from possible outcomes (e.g., the po ...
, convergence in measure is convergence in probability): d(f, g) = \int_0^1 \frac \, dx. This space is often denoted L_0. Both examples have the property that any continuous linear map to the
real numbers In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every real ...
is 0. In particular, their
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 trivial, that is, it contains only the zero functional. * The sequence space \ell^p(\N), 0 < p < 1, is not locally convex.


Continuous mappings

Because locally convex spaces are topological spaces as well as vector spaces, the natural functions to consider between two locally convex spaces are continuous linear maps. Using the seminorms, a necessary and sufficient criterion for the continuity of a linear map can be given that closely resembles the more familiar boundedness condition found for Banach spaces. Given locally convex spaces X and Y with families of seminorms \left(p_\alpha\right)_ and \left(q_\beta\right)_ respectively, a linear map T : X \to Y is continuous if and only if for every \beta, there exist \alpha_1, \ldots, \alpha_n and M > 0 such that for all v \in X, q_\beta(Tv) \leq M \left(p_(v) +\dotsb+p_(v)\right). In other words, each seminorm of the range of T 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 ...
above by some finite sum of seminorms in the
domain Domain may refer to: Mathematics *Domain of a function, the set of input values for which the (total) function is defined **Domain of definition of a partial function **Natural domain of a partial function **Domain of holomorphy of a function * Do ...
. If the family \left(p_\alpha\right)_ is a directed family, and it can always be chosen to be directed as explained above, then the formula becomes even simpler and more familiar: q_\beta(Tv) \leq Mp_\alpha(v). The class of all locally convex topological vector spaces forms a category with continuous linear maps as
morphism In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms a ...
s.


Linear functionals

If X is a real or complex vector space, f is a linear functional on X, and p is a seminorm on X, then , f, \leq p if and only if f \leq p. If f is a non-0 linear functional on a real vector space X and if p is a seminorm on X, then f \leq p if and only if f^(1) \cap \ = \varnothing.


Multilinear maps

Let n \geq 1 be an integer, X_1, \ldots, X_n be TVSs (not necessarily locally convex), let Y be a locally convex TVS whose topology is determined by a family \mathcal of continuous seminorms, and let M : \prod_^n X_i \to Y be a multilinear operator that is linear in each of its n coordinates. The following are equivalent: # M is continuous. # For every q \in \mathcal, there exist continuous seminorms p_1, \ldots, p_n on X_1, \ldots, X_n, respectively, such that q(M(x)) \leq p_1\left(x_1\right) \cdots p_n\left(x_n\right) for all x = \left(x_1, \ldots, x_n\right) \in \prod_^n X_i. # For every q \in \mathcal, there exists some neighborhood of the origin in \prod_^ X_ on which q \circ M is bounded.


See also

* * * * * * * * * *


Notes


References

* * * . * * * * * * * * * * * * * * {{Convex analysis and variational analysis Convex analysis Functional analysis Topological vector spaces