|
Initial Topology
In general topology and related areas of mathematics, the initial topology (or induced topology or weak topology or limit topology or projective topology) on a set X, with respect to a family of functions on X, is the coarsest topology on ''X'' that makes those functions continuous. The subspace topology and product topology constructions are both special cases of initial topologies. Indeed, the initial topology construction can be viewed as a generalization of these. The dual notion is the final topology, which for a given family of functions mapping to a set X is the finest topology on X that makes those functions continuous. Definition Given a set X and an indexed family \left(Y_i\right)_ of topological spaces with functions f_i : X \to Y_i, the initial topology \tau on X is the coarsest topology on X such that each f_i : (X, \tau) \to Y_i is continuous. Definition in terms of open sets If \left(\tau_i\right)_ is a family of topologies X indexed by I \neq \varnothing, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
General Topology
In mathematics, general topology is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometric topology, and algebraic topology. Another name for general topology is point-set topology. The fundamental concepts in point-set topology are ''continuity'', ''compactness'', and ''connectedness'': * Continuous functions, intuitively, take nearby points to nearby points. * Compact sets are those that can be covered by finitely many sets of arbitrarily small size. * Connected sets are sets that cannot be divided into two pieces that are far apart. The terms 'nearby', 'arbitrarily small', and 'far apart' can all be made precise by using the concept of open sets. If we change the definition of 'open set', we change what continuous functions, compact sets, and connected sets are. Each choice of definition for 'open set' is called a ''top ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singleton Set
In mathematics, a singleton, also known as a unit set or one-point set, is a set with exactly one element. For example, the set \ is a singleton whose single element is 0. Properties Within the framework of Zermelo–Fraenkel set theory, the axiom of regularity guarantees that no set is an element of itself. This implies that a singleton is necessarily distinct from the element it contains, thus 1 and are not the same thing, and the empty set is distinct from the set containing only the empty set. A set such as \ is a singleton as it contains a single element (which itself is a set, however, not a singleton). A set is a singleton if and only if its cardinality is . In von Neumann's set-theoretic construction of the natural numbers, the number 1 is ''defined'' as the singleton \. In axiomatic set theory, the existence of singletons is a consequence of the axiom of pairing: for any set ''A'', the axiom applied to ''A'' and ''A'' asserts the existence of \, which is the same a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bounded Function
In mathematics, a function ''f'' defined on some set ''X'' with real or complex values is called bounded if the set of its values is bounded. In other words, there exists a real number ''M'' such that :, f(x), \le M for all ''x'' in ''X''. A function that is ''not'' bounded is said to be unbounded. If ''f'' is real-valued and ''f''(''x'') ≤ ''A'' for all ''x'' in ''X'', then the function is said to be bounded (from) above by ''A''. If ''f''(''x'') ≥ ''B'' for all ''x'' in ''X'', then the function is said to be bounded (from) below by ''B''. A real-valued function is bounded if and only if it is bounded from above and below. An important special case is a bounded sequence, where ''X'' is taken to be the set N of natural numbers. Thus a sequence ''f'' = (''a''0, ''a''1, ''a''2, ...) is bounded if there exists a real number ''M'' such that :, a_n, \le M for every natural number ''n''. The set of all bounded sequences forms the sequence space l^\infty. The definition of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Completely Regular
In topology and related branches of mathematics, Tychonoff spaces and completely regular spaces are kinds of topological spaces. These conditions are examples of separation axioms. A Tychonoff space refers to any completely regular space that is also a Hausdorff space; there exist completely regular spaces that are not Tychonoff (i.e. not Hausdorff). Tychonoff spaces are named after Andrey Nikolayevich Tychonoff, whose Russian name (Тихонов) is variously rendered as "Tychonov", "Tikhonov", "Tihonov", "Tichonov", etc. who introduced them in 1930 in order to avoid the pathological situation of Hausdorff spaces whose only continuous real-valued functions are constant maps. Definitions A topological space X is called if points can be separated from closed sets via (bounded) continuous real-valued functions. In technical terms this means: for any closed set A \subseteq X and any point x \in X \setminus A, there exists a real-valued continuous function f : X \to \R such ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Union (set Theory)
In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection. It is one of the fundamental operations through which sets can be combined and related to each other. A refers to a union of zero (0) sets and it is by definition equal to the empty set. For explanation of the symbols used in this article, refer to the table of mathematical symbols. Union of two sets The union of two sets ''A'' and ''B'' is the set of elements which are in ''A'', in ''B'', or in both ''A'' and ''B''. In set-builder notation, :A \cup B = \. For example, if ''A'' = and ''B'' = then ''A'' ∪ ''B'' = . A more elaborate example (involving two infinite sets) is: : ''A'' = : ''B'' = : A \cup B = \ As another example, the number 9 is ''not'' contained in the union of the set of prime numbers and the set of even numbers , because 9 is neither prime nor even. Sets cannot have duplicate elements, so the union of the sets and is . Multiple ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice Of Topologies
In topology and related areas of mathematics, the set of all possible topologies on a given set forms a partially ordered set. This order relation can be used for comparison of the topologies. Definition A topology on a set may be defined as the collection of subsets which are considered to be "open". An alternative definition is that it is the collection of subsets which are considered "closed". These two ways of defining the topology are essentially equivalent because the complement of an open set is closed and vice versa. In the following, it doesn't matter which definition is used. Let ''τ''1 and ''τ''2 be two topologies on a set ''X'' such that ''τ''1 is contained in ''τ''2: :\tau_1 \subseteq \tau_2. That is, every element of ''τ''1 is also an element of ''τ''2. Then the topology ''τ''1 is said to be a coarser (weaker or smaller) topology than ''τ''2, and ''τ''2 is said to be a finer (stronger or larger) topology than ''τ''1. There are some authors, especially ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supremum
In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set P is a greatest element in P that is less than or equal to each element of S, if such an element exists. Consequently, the term ''greatest lower bound'' (abbreviated as ) is also commonly used. The supremum (abbreviated sup; plural suprema) of a subset S of a partially ordered set P is the least element in P that is greater than or equal to each element of S, if such an element exists. Consequently, the supremum is also referred to as the ''least upper bound'' (or ). The infimum is in a precise sense dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in analysis, and especially in Lebesgue integration. However, the general definitions remain valid in the more abstract setting of order theory where arbitrary partially ordered sets are considered. The concepts of infimum and supremum are close to minimum ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 constants. The dual space as defined above is defined for all vector spaces, and to avoid ambiguity may also be called the . When defined for a topological vector space, there is a subspace of the dual space, corresponding to continuous linear functionals, called the ''continuous dual space''. Dual vector spaces find application in many branches of mathematics that use vector spaces, such as in tensor analysis with finite-dimensional vector spaces. When applied to vector spaces of functions (which are typically infinite-dimensional), dual spaces are used to describe measures, distributions, and Hilbert spaces. Consequently, the dual space is an important concept in functional analysis. Early terms for ''dual'' include ''polarer Raum'' ah ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Linear Form
In functional analysis and related areas of mathematics, a continuous linear operator or continuous linear mapping is a continuous linear transformation between topological vector spaces. An operator between two normed spaces is a bounded linear operator if and only if it is a continuous linear operator. Continuous linear operators Characterizations of continuity Suppose that F : X \to Y is a linear operator between two topological vector spaces (TVSs). The following are equivalent: F is continuous. F is continuous at some point x \in X. F is continuous at the origin in X. if Y is locally convex then this list may be extended to include: for every continuous seminorm q on Y, there exists a continuous seminorm p on X such that q \circ F \leq p. if X and Y are both Hausdorff locally convex spaces then this list may be extended to include: F is weakly continuous and its transpose ^t F : Y^ \to X^ maps equicontinuous subsets of Y^ to equicontinuous subsets of X^ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Locally Convex Space
In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological 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, 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weak Topology
In mathematics, weak topology is an alternative term for certain initial topologies, often on topological vector spaces or spaces of linear operators, for instance on a Hilbert space. The term is most commonly used for the initial topology of a topological vector space (such as a normed vector space) with respect to its continuous dual. The remainder of this article will deal with this case, which is one of the concepts of functional analysis. One may call subsets of a topological vector space weakly closed (respectively, weakly compact, etc.) if they are closed (respectively, compact, etc.) with respect to the weak topology. Likewise, functions are sometimes called weakly continuous (respectively, weakly differentiable, weakly analytic, etc.) if they are continuous (respectively, differentiable, analytic, etc.) with respect to the weak topology. History Starting in the early 1900s, David Hilbert and Marcel Riesz made extensive use of weak convergence. The early pioneer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inverse System
In mathematics, the inverse limit (also called the projective limit) is a construction that allows one to "glue together" several related objects, the precise gluing process being specified by morphisms between the objects. Thus, inverse limits can be defined in any category although their existence depends on the category that is considered. They are a special case of the concept of limit in category theory. By working in the dual category, that is by reverting the arrows, an inverse limit becomes a direct limit or ''inductive limit'', and a ''limit'' becomes a colimit. Formal definition Algebraic objects We start with the definition of an inverse system (or projective system) of groups and homomorphisms. Let (I, \leq) be a directed poset (not all authors require ''I'' to be directed). Let (''A''''i'')''i''∈''I'' be a family of groups and suppose we have a family of homomorphisms f_: A_j \to A_i for all i \leq j (note the order) with the following properties: # f_ is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
