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, conversely, the Minkowski functional of any such set is a seminorm. A topological vector space is locally convex if and only if its topology is induced by a family of seminorms. Definition Let X be a vector space over either the real numbers \R or the complex numbers \Complex. A real-valued function p : X \to \R is called a if it satisfies the following two conditions: # Subadditivity/Triangle inequality: p(x + y) \leq p(x) + p(y) for all x, y \in X. # Absolute homogeneity: p(s x) =, s, p(x) for all x \in X and all scalars s. These two conditions imply that p(0) = 0If z \in X denotes the zero vector in X while 0 denote the zero scalar, then absolute homogeneity implies that p(z) = p(0 z) = , 0, p(z) = 0 p(z) = 0. \blacksquare a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting poin ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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" in the real (physical) world. A norm is a real-valued function defined on the vector space that is commonly denoted x\mapsto \, x\, , and has the following properties: #It is nonnegative, meaning that \, x\, \geq 0 for every vector x. #It is positive on nonzero vectors, that is, \, x\, = 0 \text x = 0. # For every vector x, and every scalar \alpha, \, \alpha x\, = , \alpha, \, \, x\, . # The triangle inequality holds; that is, for every vectors x and y, \, x+y\, \leq \, x\, + \, y\, . A norm induces a distance, called its , by the formula d(x,y) = \, y-x\, . which makes any normed vector space into a metric space and a topological vector space. If this metric space is complete then the normed space is a Banach space. Every n ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Balanced Set
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, \leq 1. The balanced hull or balanced envelope of a set S is the smallest balanced set containing S. The balanced core of a subset S is the largest balanced set contained in S. Balanced sets are ubiquitous in functional analysis because every neighborhood of the origin in every topological vector space (TVS) contains a balanced neighborhood of the origin and every convex neighborhood of the origin contains a balanced convex neighborhood of the origin (even if the TVS is not locally convex). This neighborhood can also be chosen to be an open set or, alternatively, a closed set. Definition Let X be a vector space over the field \mathbb of real or complex numbers. Notation If S is a set, a is a scalar, and B \subseteq \mathbb t ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a . In the case where V = W, a linear map is called a (linear) '' endomorphism''. Sometimes the term refers to this case, but the term "linear operator" can have different meanings for different conventions: for example, it can be used to emphasize that V and W are real vector spaces (not necessarily with V = W), or it can be used to emphasize that V is a function space, which is a common convention in functional analysis. Sometimes the term ''linear function'' has the same meaning as ''lin ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 union and intersection. Indeed, these lattices of sets describe the scenery completely: every distributive lattice is—up to isomorphism—given as such a lattice of sets. Definition As in the case of arbitrary lattices, one can choose to consider a distributive lattice ''L'' either as a structure of order theory or of universal algebra. Both views and their mutual correspondence are discussed in the article on lattices. In the present situation, the algebraic description appears to be more convenient. A lattice (''L'',∨,∧) is distributive if the following additional identity holds for all ''x'', ''y'', and ''z'' in ''L'': : ''x'' ∧ (''y'' ∨ ''z'') = (''x'' ∧ ''y'') ∨ (''x'' ∧ ''z''). Viewing lattices as part ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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, linear subspaces, flats, and affine subspaces are also called ''linear manifolds'' for emphasizing that there are also manifolds. is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called a ''subspace'' when the context serves to distinguish it from other types of subspaces. Definition If ''V'' is a vector space over a field ''K'' and if ''W'' is a subset of ''V'', then ''W'' is a linear subspace of ''V'' if under the operations of ''V'', ''W'' is a vector space over ''K''. Equivalently, a nonempty subset ''W'' is a subspace of ''V'' if, whenever are elements of ''W'' and are elements of ''K'', it follows that is in ''W''. As a corollary, all vector spaces are equipped with at least ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), and For example, the absolute value of 3 and the absolute value of −3 is The absolute value of a number may be thought of as its distance from zero. Generalisations of the absolute value for real numbers occur in a wide variety of mathematical settings. For example, an absolute value is also defined for the complex numbers, the quaternions, ordered rings, fields and vector spaces. The absolute value is closely related to the notions of magnitude, distance, and norm in various mathematical and physical contexts. Terminology and notation In 1806, Jean-Robert Argand introduced the term ''module'', meaning ''unit of measure'' in French, specifically for the ''complex'' absolute value, Oxford English Dictionary, Draft Revision, Ju ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 , the set of all linear functionals from to is itself a vector space over with addition and scalar multiplication defined pointwise. This space is called the dual space of , or sometimes the algebraic dual space, when a topological dual space is also considered. It is often denoted , p. 19, §3.1 or, when the field is understood, V^*; other notations are also used, such as V', V^ or V^. When vectors are represented by column vectors (as is common when a basis is fixed), then linear functionals are represented as row vectors, and their values on specific vectors are given by matrix products (with the row vector on the left). Examples * The constant zero function, mapping every vector to zero, is trivially a linear functional. * Ind ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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 consequence that all points of the space are "lumped together" and cannot be distinguished by topological means. Every indiscrete space is a pseudometric space in which the distance between any two points is zero. Details The trivial topology is the topology with the least possible number of open sets, namely the empty set and the entire space, since the definition of a topology requires these two sets to be open. Despite its simplicity, a space ''X'' with more than one element and the trivial topology lacks a key desirable property: it is not a T0 space. Other properties of an indiscrete space ''X''—many of which are quite unusual—include: * The only closed sets are the empty set and ''X''. * The only possible basis of ''X'' is . ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Balanced Function
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, \leq 1. The balanced hull or balanced envelope of a set S is the smallest balanced set containing S. The balanced core of a subset S is the largest balanced set contained in S. Balanced sets are ubiquitous in functional analysis because every neighborhood of the origin in every topological vector space (TVS) contains a balanced neighborhood of the origin and every convex neighborhood of the origin contains a balanced convex neighborhood of the origin (even if the TVS is not locally convex). This neighborhood can also be chosen to be an open set or, alternatively, a closed set. Definition Let X be a vector space over the field \mathbb of real or complex numbers. Notation If S is a set, a is a scalar, and B \subseteq \mathbb then ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Sublinear Function
In linear algebra, a sublinear function (or functional as is more often used in functional analysis), also called a quasi-seminorm or a Banach functional, on a vector space X is a real-valued function with only some of the properties of a seminorm. Unlike seminorms, a sublinear function does not have to be nonnegative-valued and also does not have to be absolutely homogeneous. Seminorms are themselves abstractions of the more well known notion of norms, where a seminorm has all the defining properties of a norm that it is not required to map non-zero vectors to non-zero values. In functional analysis the name Banach functional is sometimes used, reflecting that they are most commonly used when applying a general formulation of the Hahn–Banach theorem. The notion of a sublinear function was introduced by Stefan Banach when he proved his version of the Hahn-Banach theorem. There is also a different notion in computer science, described below, that also goes by the name "su ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |