|
Alexandrov-discrete Space
In topology, an Alexandrov topology is a topology in which the intersection of any family of open sets is open. It is an axiom of topology that the intersection of any ''finite'' family of open sets is open; in Alexandrov topologies the finite restriction is dropped. A set together with an Alexandrov topology is known as an Alexandrov-discrete space or finitely generated space. Alexandrov topologies are uniquely determined by their specialization preorders. Indeed, given any preorder ≤ on a set ''X'', there is a unique Alexandrov topology on ''X'' for which the specialization preorder is ≤. The open sets are just the upper sets with respect to ≤. Thus, Alexandrov topologies on ''X'' are in one-to-one correspondence with preorders on ''X''. Alexandrov-discrete spaces are also called finitely generated spaces since their topology is uniquely determined by the family of all finite subspaces. Alexandrov-discrete spaces can thus be viewed as a generalization of finite topological ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology
In mathematics, topology (from the Greek language, Greek words , and ) is concerned with the properties of a mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such as Stretch factor, stretching, Twist (mathematics), twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a set (mathematics), set endowed with a structure, called a ''Topology (structure), topology'', which allows defining continuous deformation of subspaces, and, more generally, all kinds of continuity (mathematics), continuity. Euclidean spaces, and, more generally, metric spaces are examples of a topological space, as any distance or metric defines a topology. The deformations that are considered in topology are homeomorphisms and homotopy, homotopies. A property that is invariant under such deformations is a topological property. Basic exampl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neighbourhood Filter
In topology and related areas of mathematics, the neighbourhood system, complete system of neighbourhoods, or neighbourhood filter \mathcal(x) for a point x in a topological space is the collection of all neighbourhoods of x. Definitions Neighbourhood of a point or set An of a point (or subset) x in a topological space X is any open subset U of X that contains x. A is any subset N \subseteq X that contains open neighbourhood of x; explicitly, N is a neighbourhood of x in X if and only if there exists some open subset U with x \in U \subseteq N. Equivalently, a neighborhood of x is any set that contains x in its topological interior. Importantly, a "neighbourhood" does have to be an open set; those neighbourhoods that also happen to be open sets are known as "open neighbourhoods." Similarly, a neighbourhood that is also a closed (respectively, compact, connected, etc.) set is called a (respectively, , , etc.). There are many other types of neighbourhoods that are used in t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Topological Spaces
In mathematics, the category of topological spaces, often denoted Top, is the category whose objects are topological spaces and whose morphisms are continuous maps. This is a category because the composition of two continuous maps is again continuous, and the identity function is continuous. The study of Top and of properties of topological spaces using the techniques of category theory is known as categorical topology. N.B. Some authors use the name Top for the categories with topological manifolds, with compactly generated spaces as objects and continuous maps as morphisms or with the category of compactly generated weak Hausdorff spaces. As a concrete category Like many categories, the category Top is a concrete category, meaning its objects are sets with additional structure (i.e. topologies) and its morphisms are functions preserving this structure. There is a natural forgetful functor :''U'' : Top → Set to the category of sets which assigns to each topological spa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Map (mathematics)
In mathematics, a map or mapping is a function in its general sense. These terms may have originated as from the process of making a geographical map: ''mapping'' the Earth surface to a sheet of paper. The term ''map'' may be used to distinguish some special types of functions, such as homomorphisms. For example, a linear map is a homomorphism of vector spaces, while the term linear function may have this meaning or it may mean a linear polynomial. In category theory, a map may refer to a morphism. The term ''transformation'' can be used interchangeably, but ''transformation'' often refers to a function from a set to itself. There are also a few less common uses in logic and graph theory. Maps as functions In many branches of mathematics, the term ''map'' is used to mean a function, sometimes with a specific property of particular importance to that branch. For instance, a "map" is a " continuous function" in topology, a "linear transformation" in linear algebra, etc. Some ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Sets
In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the total functions from ''A'' to ''B'', and the composition of morphisms is the composition of functions. Many other categories (such as the category of groups, with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind. Properties of the category of sets The axioms of a category are satisfied by Set because composition of functions is associative, and because every set ''X'' has an identity function id''X'' : ''X'' → ''X'' which serves as identity element for function composition. The epimorphisms in Set are the surjective maps, the monomorphisms are the injective maps, and the isomorphisms are the bijective maps. The empty set serves as the initial object in Set with empty functions as morphisms. Every s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Function
Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, unchanged. That is, when is the identity function, the equality is true for all values of to which can be applied. Definition Formally, if is a set, the identity function on is defined to be a function with as its domain and codomain, satisfying In other words, the function value in the codomain is always the same as the input element in the domain . The identity function on is clearly an injective function as well as a surjective function, so it is bijective. The identity function on is often denoted by . In set theory, where a function is defined as a particular kind of binary relation, the identity function is given by the identity relation, or ''diagonal'' of . Algebraic properties If is any function, then we have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Map (topology)
In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in value, known as '' discontinuities''. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is . Up until the 19th century, mathematicians largely relied on intuitive notions of continuity, and considered only continuous functions. The epsilon–delta definition of a limit was introduced to formalize the definition of continuity. Continuity is one of the core concepts of calculus and mathematical analysis, where arguments and values of functions are real and complex numbers. The concept has been generalized to functions between metric spaces and between topological spaces. The latter are the mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monotone Function
In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order theory. In calculus and analysis In calculus, a function f defined on a subset of the real numbers with real values is called ''monotonic'' if and only if it is either entirely non-increasing, or entirely non-decreasing. That is, as per Fig. 1, a function that increases monotonically does not exclusively have to increase, it simply must not decrease. A function is called ''monotonically increasing'' (also ''increasing'' or ''non-decreasing'') if for all x and y such that x \leq y one has f\!\left(x\right) \leq f\!\left(y\right), so f preserves the order (see Figure 1). Likewise, a function is called ''monotonically decreasing'' (also ''decreasing'' or ''non-increasing'') if, whenever x \leq y, then f\!\left(x\right) \geq f\!\left(y\ri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lower Set
In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger than ''s'' (that is, if s \leq x), then ''x'' is in ''S''. In words, this means that any ''x'' element of ''X'' that is \,\geq\, to some element of ''S'' is necessarily also an element of ''S''. The term lower set (also called a downward closed set, down set, decreasing set, initial segment, or semi-ideal) is defined similarly as being a subset ''S'' of ''X'' with the property that any element ''x'' of ''X'' that is \,\leq\, to some element of ''S'' is necessarily also an element of ''S''. Definition Let (X, \leq) be a preordered set. An in X (also called an , an , or an set) is a subset U \subseteq X that is "closed under going up", in the sense that :for all u \in U and all x \in X, if u \leq x then x \in U. The dual notion is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preordered Set
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special cases of a preorder: an Antisymmetric relation, antisymmetric (or Skeleton (category theory), skeletal) preorder is a partial order, and a Symmetric relation, symmetric preorder is an equivalence relation. The name comes from the idea that preorders (that are not partial orders) are 'almost' (partial) orders, but not quite; they are neither necessarily antisymmetric nor Asymmetric relation, asymmetric. Because a preorder is a binary relation, the symbol \,\leq\, can be used as the notational device for the relation. However, because they are not necessarily antisymmetric, some of the ordinary intuition associated to the symbol \,\leq\, may not apply. On the other hand, a preorder can be used, in a st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Final Hull
Final, Finals or The Final may refer to: *Final (competition), the last or championship round of a sporting competition, match, game, or other contest which decides a winner for an event ** Another term for playoffs, describing a sequence of contests taking place after a regular season or round-robin tournament, culminating in a final by the first definition. *final (Java), a keyword in the Java programming language *Final case, a grammatical case *Final examination or finals, a test given at the end of a course of study or training *Part of a syllable *Final, a tone of the Gregorian mode Art and entertainment * ''Final'' (film), a science fiction film * ''The Final'' (film), a thriller film * ''Finals'' (film), a 2019 Malayalam sports drama film *Final (band), an English electronic musical group * ''Final'' (Vol. 1), album by Enrique Iglesias * ''The Final'' (album), by Wham! *"The Final", a song by Dir en grey on the album ''Withering to Death'' * ''Finals'' (comics), a four-is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Final Sink
Final, Finals or The Final may refer to: *Final (competition), the last or championship round of a sporting competition, match, game, or other contest which decides a winner for an event ** Another term for playoffs, describing a sequence of contests taking place after a regular season or round-robin tournament, culminating in a final by the first definition. *final (Java), a keyword in the Java programming language *Final case, a grammatical case *Final examination or finals, a test given at the end of a course of study or training *Part of a syllable *Final, a tone of the Gregorian mode Art and entertainment * ''Final'' (film), a science fiction film * ''The Final'' (film), a thriller film * ''Finals'' (film), a 2019 Malayalam sports drama film *Final (band), an English electronic musical group * ''Final'' (Vol. 1), album by Enrique Iglesias * ''The Final'' (album), by Wham! *"The Final", a song by Dir en grey on the album ''Withering to Death'' * ''Finals'' (comics), a four-is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
