|
Saturated Family
In mathematics, specifically in functional analysis, a family \mathcal of subsets a topological vector space (TVS) X is said to be saturated if \mathcal contains a non-empty subset of X and if for every G \in \mathcal, the following conditions all hold: # \mathcal contains every subset of G; # the union of any finite collection of elements of \mathcal is an element of \mathcal; # for every scalar a, \mathcal contains aG; # the closed convex balanced hull of G belongs to \mathcal. Definitions If \mathcal is any collection of subsets of X then the smallest saturated family containing \mathcal is called the of \mathcal. The family \mathcal is said to X if the union \bigcup_ G is equal to X; it is if the linear span of this set is a dense subset of X. Examples The intersection of an arbitrary family of saturated families is a saturated family. Since the power set of X is saturated, any given non-empty family \mathcal of subsets of X containing at least one non-empty set, the s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 on these spaces and respecting these structures in a suitable sense. The historical roots of functional analysis lie in the study of spaces of functions and the formulation of properties of transformations of functions such as the Fourier transform as transformations defining continuous, unitary etc. operators between function spaces. This point of view turned out to be particularly useful for the study of differential and integral equations. The usage of the word '' functional'' as a noun goes back to the calculus of variations, implying a function whose argument is a function. The term was first used in Hadamard's 1910 book on that subject. However, the general concept of a functional had previously been introduced in 1887 by the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Family Of Sets
In set theory and related branches of mathematics, a collection F of subsets of a given set S is called a family of subsets of S, or a family of sets over S. More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. The term "collection" is used here because, in some contexts, a family of sets may be allowed to contain repeated copies of any given member, and in other contexts it may form a proper class rather than a set. A finite family of subsets of a finite set S is also called a '' hypergraph''. The subject of extremal set theory concerns the largest and smallest examples of families of sets satisfying certain restrictions. Examples The set of all subsets of a given set S is called the power set of S and is denoted by \wp(S). The power set \wp(S) of a given set S is a family of sets over S. A subset of S having k elements is called a k-subset of S. The k-subsets S^ of a set S form a family of sets. Let S = \. An e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 also a topological space with the property that the vector space operations (vector addition and scalar multiplication) are also continuous functions. Such a topology is called a and every topological vector space has a uniform topological structure, allowing a notion of uniform convergence and completeness. Some authors also require that the space is a Hausdorff space (although this article does not). One of the most widely studied categories of TVSs are locally convex topological vector spaces. This article focuses on TVSs that are not necessarily locally convex. Banach spaces, Hilbert spaces and Sobolev spaces are other well-known examples of TVSs. Many topological vector spaces are spaces of functions, or linear operators acting on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Balanced Hull
In mathematics, a subset ''C'' of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. The disked hull or the absolute convex hull of a set is the intersection of all disks containing that set. Definition A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied: S is a convex and balanced set. for any scalar a and b, if , a, + , b, \leq 1 then a S + b S \subseteq S. for all scalars a, b, and c, if , a, + , b, \leq , c, , then a S + b S \subseteq c S. for any scalars a_1, \ldots, a_n and c, if , a_1, + \cdots + , a_n, \leq , c, then a_1 S + \cdots + a_n S \subseteq c S. for any scalars a_1, \ldots, a_n, if , a_1, + \cdots + , a_n, \leq 1 then a_1 S + \cdots + a_n S \subseteq S. The smallest convex (respectively, balanced) subset of X ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power Set
In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is postulated by the axiom of power set. The powerset of is variously denoted as , , , \mathbb(S), or . The notation , meaning the set of all functions from S to a given set of two elements (e.g., ), is used because the powerset of can be identified with, equivalent to, or bijective to the set of all the functions from to the given two elements set. Any subset of is called a '' family of sets'' over . Example If is the set , then all the subsets of are * (also denoted \varnothing or \empty, the empty set or the null set) * * * * * * * and hence the power set of is . Properties If is a finite set with the cardinality (i.e., the number of all elements in the set is ), then the number of all the subsets of is . This fact ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bornology
In mathematics, especially functional analysis, a bornology on a set ''X'' is a collection of subsets of ''X'' satisfying axioms that generalize the notion of boundedness. One of the key motivations behind bornologies and bornological analysis is the fact that bornological spaces provide a convenient setting for homological algebra in functional analysis. This is becausepg 9 the category of bornological spaces is additive, complete, cocomplete, and has a tensor product adjoint to an internal hom, all necessary components for homological algebra. History Bornology originates from functional analysis. There are two natural ways of studying the problems of functional analysis: one way is to study notions related to topologies ( vector topologies, continuous operators, open/compact subsets, etc.) and the other is to study notions related to boundedness ( vector bornologies, bounded operators, bounded subsets, etc.). For normed spaces, from which functional analysis arose, the dist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Von Neumann Bounded
In functional analysis and related areas of mathematics, a set in a topological vector space is called bounded or von Neumann bounded, if every neighborhood of the zero vector can be ''inflated'' to include the set. A set that is not bounded is called unbounded. Bounded sets are a natural way to define locally convex polar topologies on the vector spaces in a dual pair, as the polar set of a bounded set is an absolutely convex and absorbing set. The concept was first introduced by John von Neumann and Andrey Kolmogorov in 1935. Definition Suppose X is a topological vector space (TVS) over a field \mathbb. A subset B of X is called or just in X if any of the following equivalent conditions are satisfied: : For every neighborhood V of the origin there exists a real r > 0 such that B \subseteq s VFor any set A and scalar s, the notation s A is denotes the set s A := \. for all scalars s satisfying , s, \geq r. * This was the definition introduced by John von Neuma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
