|
Topological Join
In topology, a field of mathematics, the join of two topological spaces A and B, often denoted by A\ast B or A\star B, is a topological space formed by taking the disjoint union of the two spaces, and attaching line segments joining every point in A to every point in B. The join of a space A with itself is denoted by A^ := A\star A. The join is defined in slightly different ways in different contexts Geometric sets If A and B are subsets of the Euclidean space \mathbb^n, then: A\star B\ :=\ \,that is, the set of all line-segments between a point in A and a point in B. Some authors restrict the definition to subsets that are ''joinable'': any two different line-segments, connecting a point of A to a point of B, meet in at most a common endpoint (that is, they do not intersect in their interior). Every two subsets can be made "joinable". For example, if A is in \mathbb^n and B is in \mathbb^m, then A\times\\times\ and \\times B\times\ are joinable in \mathbb^. The figure above show ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Join
Join may refer to: * Join (law), to include additional counts or additional defendants on an indictment *In mathematics: ** Join (mathematics), a least upper bound of sets orders in lattice theory ** Join (topology), an operation combining two topological spaces ** Join (category theory), an operation combining two categories ** Join (simplicial sets), an operation combining two simplicial sets ** Join (sigma algebra), a refinement of sigma algebras ** Join (algebraic geometry), a union of lines between two varieties *In computing: ** Join (relational algebra), a binary operation on tuples corresponding to the relation join of SQL *** Join (SQL), relational join, a binary operation on SQL and relational database tables *** join (Unix), a Unix command similar to relational join ** Join-calculus, a process calculus developed at INRIA for the design of distributed programming languages *** Join-pattern, generalization of Join-calculus *** Joins (concurrency library), a concurrent comput ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle
A circle is a shape consisting of all point (geometry), points in a plane (mathematics), plane that are at a given distance from a given point, the Centre (geometry), centre. The distance between any point of the circle and the centre is called the radius. The length of a line segment connecting two points on the circle and passing through the centre is called the diameter. A circle bounds a region of the plane called a Disk (mathematics), disc. The circle has been known since before the beginning of recorded history. Natural circles are common, such as the full moon or a slice of round fruit. The circle is the basis for the wheel, which, with related inventions such as gears, makes much of modern machinery possible. In mathematics, the study of the circle has helped inspire the development of geometry, astronomy and calculus. Terminology * Annulus (mathematics), Annulus: a ring-shaped object, the region bounded by two concentric circles. * Circular arc, Arc: any Connected ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Up To
Two Mathematical object, mathematical objects and are called "equal up to an equivalence relation " * if and are related by , that is, * if holds, that is, * if the equivalence classes of and with respect to are equal. This figure of speech is mostly used in connection with expressions derived from equality, such as uniqueness or count. For example, " is unique up to " means that all objects under consideration are in the same equivalence class with respect to the relation . Moreover, the equivalence relation 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 that relates two lists if one can be obtained by reordering (permutation, permuting) the other. As another example, the statement "the solution to an indefinite integral is , up ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Space
In topology, a discrete space is a particularly simple example of a topological space or similar structure, one in which the points form a , meaning they are '' isolated'' from each other in a certain sense. The discrete topology is the finest topology that can be given on a set. Every subset is open in the discrete topology so that in particular, every singleton subset is an open set in the discrete topology. Definitions Given a set X: A metric space (E,d) is said to be '' uniformly discrete'' if there exists a ' r > 0 such that, for any x,y \in E, one has either x = y or d(x,y) > r. The topology underlying a metric space can be discrete, without the metric being uniformly discrete: for example the usual metric on the set \left\. Properties The underlying uniformity on a discrete metric space is the discrete uniformity, and the underlying topology on a discrete uniform space is the discrete topology. Thus, the different notions of discrete space are compatible with on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Suspension (topology)
In topology, a branch of mathematics, the suspension of a topological space ''X'' is intuitively obtained by stretching ''X'' into a cylinder and then collapsing both end faces to points. One views ''X'' as "suspended" between these end points. The suspension of ''X'' is denoted by ''SX'' or susp(''X''). There is a variant of the suspension for a pointed space, which is called the reduced suspension and denoted by Σ''X''. The "usual" suspension ''SX'' is sometimes called the unreduced suspension, unbased suspension, or free suspension of ''X'', to distinguish it from Σ''X.'' Free suspension The (free) suspension SX of a topological space X can be defined in several ways. 1. SX is the quotient space (X \times ,1/(X\times \)\big/ ( X\times \). In other words, it can be constructed as follows: * Construct the cylinder X \times ,1/math>. * Consider the entire set X\times \ as a single point ("glue" all its points together). * Consider the entire set X\times \ as a single p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cone (topology)
In topology, especially algebraic topology, the cone of a topological space X is intuitively obtained by stretching ''X'' into a cylinder and then collapsing one of its end faces to a point. The cone of X is denoted by CX or by \operatorname(X). Definitions Formally, the cone of ''X'' is defined as: :CX = (X \times ,1\cup_p v\ =\ \varinjlim \bigl( (X \times ,1 \hookleftarrow (X\times \) \xrightarrow v\bigr), where v is a point (called the vertex of the cone) and p is the projection to that point. In other words, it is the result of attaching the cylinder X \times ,1/math> by its face X\times\ to a point v along the projection p: \bigl( X\times\ \bigr)\to v. If X is a non-empty compact subspace of Euclidean space, the cone on X is homeomorphic to the union of segments from X to any fixed point v \not\in X such that these segments intersect only in v itself. That is, the topological cone agrees with the geometric cone for compact spaces when the latter is defined. H ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Disjoint Union
In mathematics, the disjoint union (or discriminated union) A \sqcup B of the sets and is the set formed from the elements of and labelled (indexed) with the name of the set from which they come. So, an element belonging to both and appears twice in the disjoint union, with two different labels. A disjoint union of an indexed family of sets (A_i : i\in I) is a set A, often denoted by \bigsqcup_ A_i, with an injective function, injection of each A_i into A, such that the image (mathematics), images of these injections form a Partition (set theory), partition of A (that is, each element of A belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their Union (set theory), union. In category theory, the disjoint union is the coproduct of the category of sets, and thus defined up to a bijection. In this context, the notation \coprod_ A_i is often used. The disjoint union of two sets A and B is written with infix notation as A \sq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Simplicial Complex
In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. Lee, John M., Introduction to Topological Manifolds, Springer 2011, , p153 For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1). In the context of matroids and greedoids, abstract simplicial complexes are also called independence systems. An abstract simplex can be studied algebraically by forming its Stanley–Reisner ring; this sets up a powerful relation between combinatorics and commutative algebra. Definitions A collection of non-empty finite subsets of a set ''S'' is called a set-family. A set-family is called an abstract simplicial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affine Hull
In mathematics, the affine hull or affine span of a set ''S'' in Euclidean space R''n'' is the smallest affine set containing ''S'', or equivalently, the intersection of all affine sets containing ''S''. Here, an ''affine set'' may be defined as the translation of a vector subspace. The affine hull of ''S'' is what \operatorname S would be if the origin was moved to ''S''. The affine hull aff(''S'') of ''S'' is the set of all affine combinations of elements of ''S'', that is, :\operatorname (S)=\left\. Examples *The affine hull of the empty set is the empty set. *The affine hull of a singleton (a set made of one single element) is the singleton itself. *The affine hull of a set of two different points is the line through them. *The affine hull of a set of three points not on one line is the plane going through them. *The affine hull of a set of four points not in a plane in R''3'' is the entire space R''3''. Properties For any subsets S, T \subseteq X * \operatorname(\o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equivalence Relation
In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equality. Any number a is equal to itself (reflexive). If a = b, then b = a (symmetric). If a = b and b = c, then a = c (transitive). Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class. Notation Various notations are used in the literature to denote that two elements a and b of a set are equivalent with respect to an equivalence relation R; the most common are "a \sim b" and "", which are used when R is implicit, and variations of "a \sim_R b", "", or "" to specify R explicitly. Non-equivalence may be written "" or "a \not\equiv b". Definitions A binary relation \,\si ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 X be a topological space, and let \sim be an equivalence relation on X. The quotient set Y = X/ is the set of equivalence classes of elements of X. The e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjunction Space
In mathematics, an adjunction space (or attaching space) is a common construction in topology where one topological space is attached or "glued" onto another. Specifically, let X and Y be topological spaces, and let A be a subspace of Y. Let f : A \rightarrow X be a continuous map (called the attaching map). One forms the adjunction space X \cup_f Y (sometimes also written as X +_f Y) by taking the disjoint union of X and Y and identifying a with f(a) for all a in A. Formally, :X\cup_f Y = (X\sqcup Y) / \sim where the equivalence relation \sim is generated by a\sim f(a) for all a in A, and the quotient is given the quotient topology. As a set, X \cup_f Y consists of the disjoint union of X and ( Y-A). The topology, however, is specified by the quotient construction. Intuitively, one may think of Y as being glued onto X via the map f. Examples *A common example of an adjunction space is given when ''Y'' is a closed ''n''-ball (or ''cell'') and ''A'' is the boundary of the ball ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
