|
Connectedness Dimension
In mathematics, connectedness is used to refer to various properties meaning, in some sense, "all one piece". When a mathematical object has such a property, we say it is connected; otherwise it is disconnected. When a disconnected object can be split naturally into connected pieces, each piece is usually called a ''component'' (or ''connected component''). Connectedness in topology A topological space is said to be ''connected'' if it is not the union of two disjoint nonempty open sets. A set is open if it contains no point lying on its boundary; thus, in an informal, intuitive sense, the fact that a space can be partitioned into disjoint open sets suggests that the boundary between the two sets is not part of the space, and thus splits it into two separate pieces. Other notions of connectedness Fields of mathematics are typically concerned with special kinds of objects. Often such an object is said to be ''connected'' if, when it is considered as a topological space, it is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Connected Category
In category theory, a branch of mathematics, a connected category is a category in which, for every two objects ''X'' and ''Y'' there is a finite sequence of objects :X = X_0, X_1, \ldots, X_, X_n = Y with morphisms :f_i : X_i \to X_ or :f_i : X_ \to X_i for each 0 ≤ ''i'' < ''n'' (both directions are allowed in the same sequence). Equivalently, a category ''J'' is connected if each functor from ''J'' to a discrete category is constant. In some cases it is convenient to not consider the empty category to be connected. A stronger notion of connectivity would be to require at least one morphism ''f'' between any pair of objects ''X'' and ''Y''. Any category with this property is connected in the above sense. A small category is connected if and only if its underlying graph is weakly connected, meaning that it is connected if one disregard the direction of the arrows. Each category ''J'' can be written as a disjoint union (or coproduct) of a collection of connected categories ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Totally Disconnected
In topology and related branches of mathematics, a totally disconnected space is a topological space that has only singletons as connected subsets. In every topological space, the singletons (and, when it is considered connected, the empty set) are connected; in a totally disconnected space, these are the ''only'' connected proper subsets. An important example of a totally disconnected space is the Cantor set, which is homeomorphic to the set of ''p''-adic integers. Another example, playing a key role in algebraic number theory, is the field of ''p''-adic numbers. Definition A topological space X is totally disconnected if the connected components in X are the one-point sets. Analogously, a topological space X is totally path-disconnected if all path-components in X are the one-point sets. Another closely related notion is that of a totally separated space, i.e. a space where quasicomponents are singletons. That is, a topological space X is totally separated space if ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Path
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipathGraph Structure Theory: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, Held June 22 to July 5, 1991p.205/ref>) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. Bondy and Murty (1976), Gibbons (1985), or Diestel (2005). Korte et al. (1990) cover more advanced algorithmic topics concerning paths in graphs. Definitions Walk, trail, and path * A walk is a finite or infinite sequence of edges which joins a sequence of vertices. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ordered Pair
In mathematics, an ordered pair (''a'', ''b'') is a pair of objects. The order in which the objects appear in the pair is significant: the ordered pair (''a'', ''b'') is different from the ordered pair (''b'', ''a'') unless ''a'' = ''b''. (In contrast, the unordered pair equals the unordered pair .) Ordered pairs are also called 2-tuples, or sequences (sometimes, lists in a computer science context) of length 2. Ordered pairs of scalars are sometimes called 2-dimensional vectors. (Technically, this is an abuse of terminology since an ordered pair need not be an element of a vector space.) The entries of an ordered pair can be other ordered pairs, enabling the recursive definition of ordered ''n''-tuples (ordered lists of ''n'' objects). For example, the ordered triple (''a'',''b'',''c'') can be defined as (''a'', (''b'',''c'')), i.e., as one pair nested in another. In the ordered pair (''a'', ''b''), the object ''a'' is called the ''first entry'', and the object ''b'' the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Strongly Connected Component
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time (that is, Θ(''V'' + ''E'')). Definitions A directed graph is called strongly connected if there is a path in each direction between each pair of vertices of the graph. That is, a path exists from the first vertex in the pair to the second, and another path exists from the second vertex to the first. In a directed graph ''G'' that may not itself be strongly connected, a pair of vertices ''u'' and ''v'' are said to be strongly connected to each other if there is a path in each direction between them. The binary relation of being strongly connected is an equivalence relation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Definition In formal terms, a directed graph is an ordered pair where * ''V'' is a set whose elements are called '' vertices'', ''nodes'', or ''points''; * ''A'' is a set of ordered pairs of vertices, called ''arcs'', ''directed edges'' (sometimes simply ''edges'' with the corresponding set named ''E'' instead of ''A''), ''arrows'', or ''directed lines''. It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called ''edges'', ''links'' or ''lines''. The aforementioned definition does not allow a directed graph to have multiple arrows with the same source and target nodes, but some authors consider a broader definition that allows directed graphs to have such multiple arcs (namely, they allow the arc set to be a m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Torus
In geometry, a torus (plural tori, colloquially donut or doughnut) is a surface of revolution generated by revolving a circle in three-dimensional space about an axis that is coplanar with the circle. If the axis of revolution does not touch the circle, the surface has a ring shape and is called a torus of revolution. If the axis of revolution is tangent to the circle, the surface is a horn torus. If the axis of revolution passes twice through the circle, the surface is a spindle torus. If the axis of revolution passes through the center of the circle, the surface is a degenerate torus, a double-covered sphere. If the revolved curve is not a circle, the surface is called a ''toroid'', as in a square toroid. Real-world objects that approximate a torus of revolution include swim rings, inner tubes and ringette rings. Eyeglass lenses that combine spherical and cylindrical correction are toric lenses. A torus should not be confused with a '' solid torus'', which is formed by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Disk (mathematics)
In geometry, a disk (also spelled disc). is the region in a plane bounded by a circle. A disk is said to be ''closed'' if it contains the circle that constitutes its boundary, and ''open'' if it does not. For a radius, r, an open disk is usually denoted as D_r and a closed disk is \overline. However in the field of topology the closed disk is usually denoted as D^2 while the open disk is \operatorname D^2. Formulas In Cartesian coordinates, the ''open disk'' of center (a, b) and radius ''R'' is given by the formula :D=\ while the ''closed disk'' of the same center and radius is given by :\overline=\. The area of a closed or open disk of radius ''R'' is π''R''2 (see area of a disk). Properties The disk has circular symmetry. The open disk and the closed disk are not topologically equivalent (that is, they are not homeomorphic), as they have different topological properties from each other. For instance, every closed disk is compact whereas every open disk is not compac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sphere
A sphere () is a geometrical object that is a three-dimensional analogue to a two-dimensional circle. A sphere is the set of points that are all at the same distance from a given point in three-dimensional space.. That given point is the centre of the sphere, and is the sphere's radius. The earliest known mentions of spheres appear in the work of the ancient Greek mathematicians. The sphere is a fundamental object in many fields of mathematics. Spheres and nearly-spherical shapes also appear in nature and industry. Bubbles such as soap bubbles take a spherical shape in equilibrium. The Earth is often approximated as a sphere in geography, and the celestial sphere is an important concept in astronomy. Manufactured items including pressure vessels and most curved mirrors and lenses are based on spheres. Spheres roll smoothly in any direction, so most balls used in sports and toys are spherical, as are ball bearings. Basic terminology As mentioned earlier is th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Contractible
In mathematics, a topological space ''X'' is contractible if the identity map on ''X'' is null-homotopic, i.e. if it is homotopic to some constant map. Intuitively, a contractible space is one that can be continuously shrunk to a point within that space. Properties A contractible space is precisely one with the homotopy type of a point. It follows that all the homotopy groups of a contractible space are trivial. Therefore any space with a nontrivial homotopy group cannot be contractible. Similarly, since singular homology is a homotopy invariant, the reduced homology groups of a contractible space are all trivial. For a topological space ''X'' the following are all equivalent: *''X'' is contractible (i.e. the identity map is null-homotopic). *''X'' is homotopy equivalent to a one-point space. *''X'' deformation retracts onto a point. (However, there exist contractible spaces which do not ''strongly'' deformation retract to a point.) *For any space ''Y'', any two maps ''f'','' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simply Connected Space
In topology, a topological space is called simply connected (or 1-connected, or 1-simply connected) if it is path-connected and every path between two points can be continuously transformed (intuitively for embedded spaces, staying within the space) into any other such path while preserving the two endpoints in question. The fundamental group of a topological space is an indicator of the failure for the space to be simply connected: a path-connected topological space is simply connected if and only if its fundamental group is trivial. Definition and equivalent formulations A topological space X is called if it is path-connected and any loop in X defined by f : S^1 \to X can be contracted to a point: there exists a continuous map F : D^2 \to X such that F restricted to S^1 is f. Here, S^1 and D^2 denotes the unit circle and closed unit disk in the Euclidean plane respectively. An equivalent formulation is this: X is simply connected if and only if it is path-connected, and wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
