|
Quotient Space (topology)
In topology and related areas of mathematics, the quotient space of a topological space under a given equivalence relation is a new topological space constructed by endowing the quotient set of the original topological space with the quotient topology, that is, with the finest topology that makes continuous the canonical projection map (the function that maps points to their equivalence classes). In other words, a subset of a quotient space is open if and only if its preimage under the canonical projection map is open in the original topological space. Intuitively speaking, the points of each equivalence class are or "glued together" for forming a new topological space. For example, identifying the points of a sphere that belong to the same diameter produces the projective plane as a quotient space. Definition Let \left(X, \tau_X\right) be a topological space, and let \,\sim\, be an equivalence relation on X. The quotient set, Y = X / \sim\, is the set of equivalence clas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Disk To Sphere Using Quotient Space
Disk or disc may refer to: * Disk (mathematics), a geometric shape * Disk storage Music * Disc (band), an American experimental music band * ''Disk'' (album), a 1995 EP by Moby Other uses * Disk (functional analysis), a subset of a vector space * Disc (galaxy), a disc-shaped group of stars * ''Disc'' (magazine), a British music magazine * Disc harrow, a farm implement * DISC assessment, a group of psychometric tests * Death-inducing signaling complex * Defence Intelligence and Security Centre or Joint Intelligence Training Group, the headquarters of the Defence College of Intelligence and the British Army Intelligence Corps * Delaware Independent School Conference, a high-school sports conference * , a Turkish trade union centre * Domestic international sales corporation, a provision in U.S. tax law * Dundee International Sports Centre, a sports centre in Scotland * International Symposium on Distributed Computing, an academic conference * Intervertebral disc, a cartilage bet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subset
In mathematics, set ''A'' is a subset of a set ''B'' if all elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ''B''. The relationship of one set being a subset of another is called inclusion (or sometimes containment). ''A'' is a subset of ''B'' may also be expressed as ''B'' includes (or contains) ''A'' or ''A'' is included (or contained) in ''B''. A ''k''-subset is a subset with ''k'' elements. The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra under the subset relation, in which the join and meet are given by intersection and union, and the subset relation itself is the Boolean inclusion relation. Definition If ''A'' and ''B'' are sets and every element of ''A'' is also an element of ''B'', then: :*''A'' is a subset of ''B'', denoted by A \subseteq B, or equivalently, :* ''B'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homeomorphic
In the mathematical field of topology, a homeomorphism, topological isomorphism, or bicontinuous function is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphisms in the category of topological spaces—that is, they are the mappings that preserve all the topological properties of a given space. Two spaces with a homeomorphism between them are called homeomorphic, and from a topological viewpoint they are the same. The word ''homeomorphism'' comes from the Greek words '' ὅμοιος'' (''homoios'') = similar or same and '' μορφή'' (''morphē'') = shape or form, introduced to mathematics by Henri Poincaré in 1895. Very roughly speaking, a topological space is a geometric object, and the homeomorphism is a continuous stretching and bending of the object into a new shape. Thus, a square and a circle are homeomorphic to each other, but a sphere and a torus are not. However, this ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite se ... [...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] |
Homeomorphism
In the mathematical field of topology, a homeomorphism, topological isomorphism, or bicontinuous function is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphisms in the category of topological spaces—that is, they are the mappings that preserve all the topological properties of a given space. Two spaces with a homeomorphism between them are called homeomorphic, and from a topological viewpoint they are the same. The word ''homeomorphism'' comes from the Greek words '' ὅμοιος'' (''homoios'') = similar or same and '' μορφή'' (''morphē'') = shape or form, introduced to mathematics by Henri Poincaré in 1895. Very roughly speaking, a topological space is a geometric object, and the homeomorphism is a continuous stretching and bending of the object into a new shape. Thus, a square and a circle are homeomorphic to each other, but a sphere and a torus are not. However, thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Up To
Two mathematical objects ''a'' and ''b'' are called equal up to an equivalence relation ''R'' * if ''a'' and ''b'' are related by ''R'', that is, * if ''aRb'' holds, that is, * if the equivalence classes of ''a'' and ''b'' with respect to ''R'' are equal. This figure of speech is mostly used in connection with expressions derived from equality, such as uniqueness or count. For example, ''x'' is unique up to ''R'' means that all objects ''x'' under consideration are in the same equivalence class with respect to the relation ''R''. Moreover, the equivalence relation ''R'' is often designated rather implicitly by a generating condition or transformation. For example, the statement "an integer's prime factorization is unique up to ordering" is a concise way to say that any two lists of prime factors of a given integer are equivalent with respect to the relation ''R'' that relates two lists if one can be obtained by reordering (permutation) from the other. As another example, the sta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surjective Map
In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element of its domain. It is not required that be unique; the function may map one or more elements of to the same element of . The term ''surjective'' and the related terms ''injective'' and ''bijective'' were introduced by Nicolas Bourbaki, a group of mainly French 20th-century mathematicians who, under this pseudonym, wrote a series of books presenting an exposition of modern advanced mathematics, beginning in 1935. The French word '' sur'' means ''over'' or ''above'', and relates to the fact that the image of the domain of a surjective function completely covers the function's codomain. Any function induces a surjection by restricting its codomain to the image of its domain. Every surjective function has a right inverse assuming the axiom o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology (structure)
In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called points, along with an additional structure called a topology, which can be defined as a set of neighbourhoods for each point that satisfy some axioms formalizing the concept of closeness. There are several equivalent definitions of a topology, the most commonly used of which is the definition through open sets, which is easier than the others to manipulate. A topological space is the most general type of a mathematical space that allows for the definition of limits, continuity, and connectedness. Common types of topological spaces include Euclidean spaces, metric spaces and manifolds. Although very general, the concept of topological spaces is fundamental, and used in virtually every branch of modern mathematics. The study of topologic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Saturated Set
In mathematics, particularly in the subfields of set theory and topology, a set C is said to be saturated with respect to a function f : X \to Y if C is a subset of f's domain X and if whenever f sends two points c \in C and x \in X to the same value then x belongs to C (that is, if f(x) = f(c) then x \in C). Said more succinctly, the set C is called saturated if C = f^(f(C)). In topology, a subset of a topological space (X, \tau) is saturated if it is equal to an intersection of open subsets of X. In a T1 space every set is saturated. Definition Preliminaries Let f : X \to Y be a map. Given any subset S\subseteq X, define its under f to be the set: f(S) := \ and define its or under f to be the set: f^(S) := \. Given y \in Y, is defined to be the preimage: f^(y) := f^(\) = \. Any preimage of a single point in f's codomain Y is referred to as Saturated sets A set C is called and is said to be if C is a subset of f's domain X and if any of the following equivalent c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
