|
Simplicial Complex
In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their ''n''-dimensional counterparts (see illustration). Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory. The purely combinatorial counterpart to a simplicial complex is an abstract simplicial complex. To distinguish a simplicial from an abstract simplicial complex, the former is often called a geometric simplicial complex.'', Section 4.3'' Definitions A simplicial complex \mathcal is a set of simplices that satisfies the following conditions: :1. Every face of a simplex from \mathcal is also in \mathcal. :2. The non-empty intersection of any two simplices \sigma_1, \sigma_2 \in \mathcal is a face of both \sigma_1 and \sigma_2. See also the definition of an abstract simplicial complex, which loosely speaking is a simplicial complex without an associated geometry. A simplicial ''k''-complex \ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Complex Example
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point (mathematics), point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a ''k''-simplex is a ''k''-dimensional polytope which is the convex hull of its ''k'' + 1 Vertex (geometry), vertices. More formally, suppose the ''k'' + 1 points u_0, \dots, u_k \in \mathbb^ are affinely independent, which means u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points : C = \left\ This representation in terms of weighted vertices is known as the barycentric coordinate system. A regular simplex is a simpl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Embedding
In mathematics, an embedding (or imbedding) is one instance of some mathematical structure contained within another instance, such as a group that is a subgroup. When some object X is said to be embedded in another object Y, the embedding is given by some injective and structure-preserving map f:X\rightarrow Y. The precise meaning of "structure-preserving" depends on the kind of mathematical structure of which X and Y are instances. In the terminology of category theory, a structure-preserving map is called a morphism. The fact that a map f:X\rightarrow Y is an embedding is often indicated by the use of a "hooked arrow" (); thus: f : X \hookrightarrow Y. (On the other hand, this notation is sometimes reserved for inclusion maps.) Given X and Y, several different embeddings of X in Y may be possible. In many cases of interest there is a standard (or "canonical") embedding, like those of the natural numbers in the integers, the integers in the rational numbers, the rational n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplex
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a ''k''-simplex is a ''k''-dimensional polytope which is the convex hull of its ''k'' + 1 vertices. More formally, suppose the ''k'' + 1 points u_0, \dots, u_k \in \mathbb^ are affinely independent, which means u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points : C = \left\ This representation in terms of weighted vertices is known as the barycentric coordinate system. A regular simplex is a simplex that is also a regular polytope. A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Space
Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, that is, in Euclid's Elements, Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidean spaces of any positive integer dimension (mathematics), dimension, including the three-dimensional space and the ''Euclidean plane'' (dimension two). The qualifier "Euclidean" is used to distinguish Euclidean spaces from other spaces that were later considered in physics and modern mathematics. Ancient History of geometry#Greek geometry, Greek geometers introduced Euclidean space for modeling the physical space. Their work was collected by the Greek mathematics, ancient Greek mathematician Euclid in his ''Elements'', with the great innovation of ''mathematical proof, proving'' all properties of the space as theorems, by starting from a few fundamental properties, called ''postulates'', which either were considered as eviden ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polytope
In elementary geometry, a polytope is a geometric object with flat sides (''faces''). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions as an -dimensional polytope or -polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a -polytope consist of -polytopes that may have -polytopes in common. Some theories further generalize the idea to include such objects as unbounded apeirotopes and tessellations, decompositions or tilings of curved manifolds including spherical polyhedra, and set-theoretic abstract polytopes. Polytopes of more than three dimensions were first discovered by Ludwig Schläfli before 1853, who called such a figure a polyschem. The German term ''polytop'' was coined by the mathematician Reinhold Hoppe, and was introduced to English mathematicians as ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CW Complex
A CW complex (also called cellular complex or cell complex) is a kind of a topological space that is particularly important in algebraic topology. It was introduced by J. H. C. Whitehead (open access) to meet the needs of homotopy theory. This class of spaces is broader and has some better categorical properties than simplicial complexes, but still retains a combinatorial nature that allows for computation (often with a much smaller complex). The ''C'' stands for "closure-finite", and the ''W'' for "weak" topology. Definition CW complex A CW complex is constructed by taking the union of a sequence of topological spaces\emptyset = X_ \subset X_0 \subset X_1 \subset \cdotssuch that each X_k is obtained from X_ by gluing copies of k-cells (e^k_\alpha)_\alpha, each homeomorphic to D^k, to X_ by continuous gluing maps g^k_\alpha: \partial e^k_\alpha \to X_. The maps are also called attaching maps. Each X_k is called the k-skeleton of the complex. The topology of X = \cup_ X_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chain Complex
In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or module (mathematics), modules) and a sequence of group homomorphism, homomorphisms between consecutive groups such that the image (mathematics), image of each homomorphism is included in the kernel (algebra)#Group homomorphisms, kernel of the next. Associated to a chain complex is its Homology (mathematics), homology, which describes how the images are included in the kernels. A cochain complex is similar to a chain complex, except that its homomorphisms are in the opposite direction. The homology of a cochain complex is called its cohomology. In algebraic topology, the singular chain complex of a topological space X is constructed using continuous function#continuous functions between topological spaces, continuous maps from a simplex to X, and the homomorphisms of the chain complex capture how these maps restrict to the boundary of the simplex. The homology of this chain co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homology Group
In mathematics, homology is a general way of associating a sequence of algebraic objects, such as abelian groups or modules, with other mathematical objects such as topological spaces. Homology groups were originally defined in algebraic topology. Similar constructions are available in a wide variety of other contexts, such as abstract algebra, groups, Lie algebras, Galois theory, and algebraic geometry. The original motivation for defining homology groups was the observation that two shapes can be distinguished by examining their holes. For instance, a circle is not a disk because the circle has a hole through it while the disk is solid, and the ordinary sphere is not a circle because the sphere encloses a two-dimensional hole while the circle encloses a one-dimensional hole. However, because a hole is "not there", it is not immediately obvious how to define a hole or how to distinguish different kinds of holes. Homology was originally a rigorous mathematical method for defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Topology
Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariant (mathematics), invariants that classification theorem, classify topological spaces up to homeomorphism, though usually most classify up to Homotopy#Homotopy equivalence and null-homotopy, homotopy equivalence. Although algebraic topology primarily uses algebra to study topological problems, using topology to solve algebraic problems is sometimes also possible. Algebraic topology, for example, allows for a convenient proof that any subgroup of a free group is again a free group. Main branches of algebraic topology Below are some of the main areas studied in algebraic topology: Homotopy groups In mathematics, homotopy groups are used in algebraic topology to classify topological spaces. The first and simplest homotopy group is the fundamental group, which records information about loops in a space. Intuitively, homotopy gro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Link (geometry)
The link in a simplicial complex is a generalization of the neighborhood of a vertex in a graph. The link of a vertex encodes information about the local structure of the complex at the vertex. Link of a vertex Given an abstract simplicial complex and v a vertex in V(X), its link \operatorname(v,X) is a set containing every face \tau \in X such that v\not\in \tau and \tau\cup \ is a face of . * In the special case in which is a 1-dimensional complex (that is: a graph), \operatorname(v,X) contains all vertices u\neq v such that \ is an edge in the graph; that is, \operatorname(v, X)=\mathcal(v)=the neighborhood of v in the graph. Given a geometric simplicial complex and v\in V(X), its link \operatorname(v,X) is a set containing every face \tau \in X such that v\not\in \tau and there is a simplex in X that has v as a vertex and \tau as a face. Equivalently, the join v \star \tau is a face in X. * As an example, suppose v is the top vertex of the tetrahedron at the left ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Star (simplicial Complex)
The link in a simplicial complex is a generalization of the neighborhood of a vertex in a graph. The link of a vertex encodes information about the local structure of the complex at the vertex. Link of a vertex Given an abstract simplicial complex and v a vertex in V(X), its link \operatorname(v,X) is a set containing every face \tau \in X such that v\not\in \tau and \tau\cup \ is a face of . * In the special case in which is a 1-dimensional complex (that is: a graph), \operatorname(v,X) contains all vertices u\neq v such that \ is an edge in the graph; that is, \operatorname(v, X)=\mathcal(v)=the neighborhood of v in the graph. Given a geometric simplicial complex and v\in V(X), its link \operatorname(v,X) is a set containing every face \tau \in X such that v\not\in \tau and there is a simplex in X that has v as a vertex and \tau as a face. Equivalently, the join v \star \tau is a face in X. * As an example, suppose v is the top vertex of the tetrahedron at the left ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Relative Interior
In mathematics, the relative interior of a set is a refinement of the concept of the interior, which is often more useful when dealing with low-dimensional sets placed in higher-dimensional spaces. Formally, the relative interior of a set S (denoted \operatorname(S)) is defined as its interior within the affine hull of S. In other words, \operatorname(S) := \, where \operatorname(S) is the affine hull of S, and N_\epsilon(x) is a ball of radius \epsilon centered on x. Any metric can be used for the construction of the ball; all metrics define the same set as the relative interior. For any nonempty convex set In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex ... C \subseteq \mathbb^n the relative interior can be defined as \operatorname(C) := \. Comparison to interior * The int ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
