|
Stone–Čech Compactification
In the mathematical discipline of general topology, Stone–Čech compactification (or Čech–Stone compactification) is a technique for constructing a Universal property, universal map from a topological space ''X'' to a Compact space, compact Hausdorff space ''βX''. The Stone–Čech compactification ''βX'' of a topological space ''X'' is the largest, most general compact Hausdorff space "generated" by ''X'', in the sense that any continuous map from ''X'' to a compact Hausdorff space List of mathematical jargon#factor through, factors through ''βX'' (in a unique way). If ''X'' is a Tychonoff space then the map from ''X'' to its image (mathematics), image in ''βX'' is a homeomorphism, so ''X'' can be thought of as a (Dense (topology), dense) subspace of ''βX''; every other compact Hausdorff space that densely contains ''X'' is a Quotient space (topology), quotient of ''βX''. For general topological spaces ''X'', the map from ''X'' to ''βX'' need not be Injective functi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
General Topology
In mathematics, general topology (or point set 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. 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 ''topology''. A set with a topology is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Property
In mathematics, more specifically in category theory, a universal property is a property that characterizes up to an isomorphism the result of some constructions. Thus, universal properties can be used for defining some objects independently from the method chosen for constructing them. For example, the definitions of the integers from the natural numbers, of the rational numbers from the integers, of the real numbers from the rational numbers, and of polynomial rings from the field (mathematics), field of their coefficients can all be done in terms of universal properties. In particular, the concept of universal property allows a simple proof that all constructions of real numbers are equivalent: it suffices to prove that they satisfy the same universal property. Technically, a universal property is defined in terms of category (mathematics), categories and functors by means of a universal morphism (see , below). Universal morphisms can also be thought more abstractly as Initia ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order Topology
In mathematics, an order topology is a specific topology that can be defined on any totally ordered set. It is a natural generalization of the topology of the real numbers to arbitrary totally ordered sets. If ''X'' is a totally ordered set, the order topology on ''X'' is generated by the subbase of "open rays" :\ :\ for all ''a, b'' in ''X''. Provided ''X'' has at least two elements, this is equivalent to saying that the open intervals :(a,b) = \ together with the above rays form a base for the order topology. The open sets in ''X'' are the sets that are a union of (possibly infinitely many) such open intervals and rays. A topological space ''X'' is called orderable or linearly orderable if there exists a total order on its elements such that the order topology induced by that order and the given topology on ''X'' coincide. The order topology makes ''X'' into a completely normal Hausdorff space. The standard topologies on R, Q, Z, and N are the order topologies. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First Uncountable Ordinal
In mathematics, the first uncountable ordinal, traditionally denoted by \omega_1 or sometimes by \Omega, is the smallest ordinal number that, considered as a set, is uncountable. It is the supremum (least upper bound) of all countable ordinals. When considered as a set, the elements of \omega_1 are the countable ordinals (including finite ordinals), of which there are uncountably many. Like any ordinal number (in von Neumann's approach), \omega_1 is a well-ordered set, with set membership serving as the order relation. \omega_1 is a limit ordinal, i.e. there is no ordinal \alpha such that \omega_1 = \alpha+1. The cardinality of the set \omega_1 is the first uncountable cardinal number, \aleph_1 ( aleph-one). The ordinal \omega_1 is thus the initial ordinal of \aleph_1. Under the continuum hypothesis, the cardinality of \omega_1 is \beth_1, the same as that of \mathbb—the set of real numbers. In most constructions, \omega_1 and \aleph_1 are considered equal as sets. To general ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reflective Subcategory
In mathematics, a full subcategory ''A'' of a category ''B'' is said to be reflective in ''B'' when the inclusion functor from ''A'' to ''B'' has a left adjoint. This adjoint is sometimes called a ''reflector'', or ''localization''. Dually, ''A'' is said to be coreflective in ''B'' when the inclusion functor has a right adjoint. Informally, a reflector acts as a kind of completion operation. It adds in any "missing" pieces of the structure in such a way that reflecting it again has no further effect. Definition A full subcategory A of a category B is said to be reflective in B if for each B- object ''B'' there exists an A-object A_B and a B-morphism r_B \colon B \to A_B such that for each B-morphism f\colon B\to A to an A-object A there exists a unique A-morphism \overline f \colon A_B \to A with \overline f\circ r_B=f. : The pair (A_B,r_B) is called the A-reflection of ''B''. The morphism r_B is called the A-reflection arrow. (Although often, for the sake of brevity, we speak ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjoint Functor
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e., constructions of objects having a certain universal property), such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology. By definition, an adjunction between categories \mathcal and \mathcal is a pair of functors (assumed to be covariant) :F: \mathcal \rightarrow \mathcal and G: \mathcal \rightarrow \mathcal and, for all objects c in \mathcal and d in \mathcal, a bijection between the respective morphism sets :\ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Restriction (mathematics)
In mathematics, the restriction of a function f is a new function, denoted f\vert_A or f , obtained by choosing a smaller domain A for the original function f. The function f is then said to extend f\vert_A. Formal definition Let f : E \to F be a function from a set E to a set F. If a set A is a subset of E, then the restriction of f to A is the function _A : A \to F given by _A(x) = f(x) for x \in A. Informally, the restriction of f to A is the same function as f, but is only defined on A. If the function f is thought of as a relation (x,f(x)) on the Cartesian product E \times F, then the restriction of f to A can be represented by its graph, :G(_A) = \ = G(f)\cap (A\times F), where the pairs (x,f(x)) represent ordered pairs in the graph G. Extensions A function F is said to be an ' of another function f if whenever x is in the domain of f then x is also in the domain of F and f(x) = F(x). That is, if \operatorname f \subseteq \operatorname F and F\big\vert_ = f. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mappe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inclusion Functor
In mathematics, specifically category theory, a subcategory of a category ''C'' is a category ''S'' whose objects are objects in ''C'' and whose morphisms are morphisms in ''C'' with the same identities and composition of morphisms. Intuitively, a subcategory of ''C'' is a category obtained from ''C'' by "removing" some of its objects and arrows. Formal definition Let ''C'' be a category. A subcategory ''S'' of ''C'' is given by *a subcollection of objects of ''C'', denoted ob(''S''), *a subcollection of morphisms of ''C'', denoted hom(''S''). such that *for every ''X'' in ob(''S''), the identity morphism id''X'' is in hom(''S''), *for every morphism ''f'' : ''X'' → ''Y'' in hom(''S''), both the source ''X'' and the target ''Y'' are in ob(''S''), *for every pair of morphisms ''f'' and ''g'' in hom(''S'') the composite ''f'' o ''g'' is in hom(''S'') whenever it is defined. These conditions ensure that ''S'' is a category in its own right: its collection of objects is ob(''S'' ... [...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 to the category of sets which assigns to each topological space the underlyin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functor
In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous function, continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied. The words ''category'' and ''functor'' were borrowed by mathematicians from the philosophers Aristotle and Rudolf Carnap, respectively. The latter used ''functor'' in a Linguistics, linguistic context; see function word. Definition Let ''C'' and ''D'' be category (mathematics), categories. A functor ''F'' from ''C'' to ''D'' is a mapping that * associates each Mathematical object, object X in ''C'' to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Locally Compact
In topology and related branches of mathematics, a topological space is called locally compact if, roughly speaking, each small portion of the space looks like a small portion of a compact space. More precisely, it is a topological space in which every point has a compact neighborhood. When locally compact spaces are Hausdorff they are called locally compact Hausdorff, which are of particular interest in mathematical analysis. Formal definition Let ''X'' be a topological space. Most commonly ''X'' is called locally compact if every point ''x'' of ''X'' has a compact neighbourhood, i.e., there exists an open set ''U'' and a compact set ''K'', such that x\in U\subseteq K. There are other common definitions: They are all equivalent if ''X'' is a Hausdorff space (or preregular). But they are not equivalent in general: :1. every point of ''X'' has a compact neighbourhood. :2. every point of ''X'' has a closed compact neighbourhood. :2′. every point of ''X'' has a relatively compa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
