Simplicial map

Last updated

A simplicial map (also called simplicial mapping) is a function between two simplicial complexes, with the property that the images of the vertices of a simplex always span a simplex. [1] Simplicial maps can be used to approximate continuous functions between topological spaces that can be triangulated; this is formalized by the simplicial approximation theorem.

Contents

A simplicial isomorphism is a bijective simplicial map such that both it and its inverse are simplicial.

Definitions

A simplicial map is defined in slightly different ways in different contexts.

Abstract simplicial complexes

Let K and L be two abstract simplicial complexes (ASC). A simplicial mapof K into L is a function from the vertices of K to the vertices of L,, that maps every simplex in K to a simplex in L. That is, for any , . [2] :14,Def.1.5.2 As an example, let K be ASC containing the sets {1,2},{2,3},{3,1} and their subsets, and let L be the ASC containing the set {4,5,6} and its subsets. Define a mapping f by: f(1)=f(2)=4, f(3)=5. Then f is a simplicial mapping, since f({1,2})={4} which is a simplex in L, f({2,3})=f({3,1})={4,5} which is also a simplex in L, etc.

If is not bijective, it may map k-dimensional simplices in K to l-dimensional simplices in L, for any lk. In the above example, f maps the one-dimensional simplex {1,2} to the zero-dimensional simplex {4}.

If is bijective, and its inverse is a simplicial map of L into K, then is called a simplicial isomorphism. Isomorphic simplicial complexes are essentially "the same", up ro a renaming of the vertices. The existence of an isomorphism between L and K is usually denoted by . [2] :14 The function f defined above is not an isomorphism since it is not bijective. If we modify the definition to f(1)=4, f(2)=5, f(3)=6, then f is bijective but it is still not an isomorphism, since is not simplicial: , which is not a simplex in K. If we modify L by removing {4,5,6}, that is, L is the ASC containing only the sets {4,5},{5,6},{6,4} and their subsets, then f is an isomorphism.

Geometric simplicial complexes

Let K and L be two geometric simplicial complex es (GSC). A simplicial mapof K into L is a function such that the images of the vertices of a simplex in K span a simplex in L. That is, for any simplex , . Note that this implies that vertices of K are mapped to vertices of L. [1]

Equivalently, one can define a simplicial map as a function from the underlying space of K (the union of simplices in K) to the underlying space of L, , that maps every simplex in K linearly to a simplex in L. That is, for any simplex , , and in addition, (the restriction of to ) is a linear function. [3] :16 [4] :3 Every simplicial map is continuous.

Simplicial maps are determined by their effects on vertices. In particular, there are a finite number of simplicial maps between two given finite simplicial complexes.

A simplicial map between two ASCs induces a simplicial map between their geometric realizations (their underlying polyhedra) using barycentric coordinates. This can be defined precisely. [2] :15,Def.1.5.3 Let K, L be two ASCs, and let be a simplicial map. The affine extension of is a mapping defined as follows. For any point , let be its support (the unique simplex containing x in its interior), and denote the vertices of by . The point has a unique representation as a convex combination of the vertices, with and (the are the barycentric coordinates of ). We define . This |f| is a simplicial map of |K| into |L|; it is a continuous function. If f is injective, then |f| is injective; if f is an isomorphism between K and L, then |f| is a homeomorphism between |K| and |L|. [2] :15,Prop.1.5.4

Simplicial approximation

Let be a continuous map between the underlying polyhedra of simplicial complexes and let us write for the star of a vertex. A simplicial map such that , is called a simplicial approximation to .

A simplicial approximation is homotopic to the map it approximates. See simplicial approximation theorem for more details.

Piecewise-linear maps

Let K and L be two GSCs. A function is called piecewise-linear(PL) if there exist a subdivision K' of K, and a subdivision L' of L, such that is a simplicial map of K' into L'. Every simplicial map is PL, but the opposite is not true. For example, suppose |K| and |L| are two triangles, and let be a non-linear function that maps the leftmost half of |K| linearly into the leftmost half of |L|, and maps the rightmost half of |K| linearly into the rightmostt half of |L|. Then f is PL, since it is a simplicial map between a subdivision of |K| into two triangles and a subdivision of |L| into two triangles. This notion is an adaptation of the general notion of a piecewise-linear function to simplicial complexes.

A PL homeomorphism between two polyhedra |K| and |L| is a PL mapping such that the simplicial mapping between the subdivisions, , is a homeomorphism.

Related Research Articles

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the Ancient Greek language: ὁμός meaning "same" and μορφή meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).

<span class="mw-page-title-main">Simplex</span> Multi-dimensional generalization of triangle

In geometry, a simplex 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,

<span class="mw-page-title-main">Simplicial complex</span> Mathematical set composed of points, line segments, triangles, and their n-dimensional counterparts

In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their n-dimensional counterparts. 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 complex from an abstract simplicial complex, the former is often called a geometric simplicial complex.

In mathematics, a building is a combinatorial and geometric structure which simultaneously generalizes certain aspects of flag manifolds, finite projective planes, and Riemannian symmetric spaces. Buildings were initially introduced by Jacques Tits as a means to understand the structure of isotropic reductive linear algebraic groups over arbitrary fields. The more specialized theory of Bruhat–Tits buildings plays a role in the study of p-adic Lie groups analogous to that of the theory of symmetric spaces in the theory of Lie groups.

In the mathematical disciplines of topology and geometry, an orbifold is a generalization of a manifold. Roughly speaking, an orbifold is a topological space which is locally a finite group quotient of a Euclidean space.

In algebraic topology, singular homology refers to the study of a certain set of algebraic invariants of a topological space X, the so-called homology groups Intuitively, singular homology counts, for each dimension n, the n-dimensional holes of a space. Singular homology is a particular example of a homology theory, which has now grown to be a rather broad collection of theories. Of the various theories, it is perhaps one of the simpler ones to understand, being built on fairly concrete constructions.

In mathematics, the simplicial approximation theorem is a foundational result for algebraic topology, guaranteeing that continuous mappings can be approximated by ones that are piecewise of the simplest kind. It applies to mappings between spaces that are built up from simplices—that is, finite simplicial complexes. The general continuous mapping between such spaces can be represented approximately by the type of mapping that is (affine-) linear on each simplex into another simplex, at the cost (i) of sufficient barycentric subdivision of the simplices of the domain, and (ii) replacement of the actual mapping by a homotopic one.

<span class="mw-page-title-main">Barycentric subdivision</span>

In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones. Its extension on simplicial complexes is a canonical method to refine them. Therefore, the barycentric subdivision is an important tool in algebraic topology.

<span class="mw-page-title-main">Abstract simplicial complex</span> Mathematical object

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. For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles, their edges, and their vertices.

In mathematics, a simplicial set is an object composed of simplices in a specific way. Simplicial sets are higher-dimensional generalizations of directed graphs, partially ordered sets and categories. Formally, a simplicial set may be defined as a contravariant functor from the simplex category to the category of sets. Simplicial sets were introduced in 1950 by Samuel Eilenberg and Joseph A. Zilber.

In algebraic topology, simplicial homology is the sequence of homology groups of a simplicial complex. It formalizes the idea of the number of holes of a given dimension in the complex. This generalizes the number of connected components.

<span class="mw-page-title-main">Triangulation (topology)</span>

In mathematics, triangulation describes the replacement of topological spaces by piecewise linear spaces, i.e. the choice of a homeomorphism in a suitable simplicial complex. Spaces being homeomorphic to a simplicial complex are called triangulable. Triangulation has various uses in different branches of mathematics, for instance in algebraic topology, in complex analysis or in modeling.

In mathematics, obstruction theory is a name given to two different mathematical theories, both of which yield cohomological invariants.

<span class="mw-page-title-main">Link (simplicial complex)</span>

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.

In category theory, a discipline within mathematics, the nerveN(C) of a small category C is a simplicial set constructed from the objects and morphisms of C. The geometric realization of this simplicial set is a topological space, called the classifying space of the categoryC. These closely related objects can provide information about some familiar and useful categories using algebraic topology, most often homotopy theory.

Simplicial continuation, or piecewise linear continuation, is a one-parameter continuation method which is well suited to small to medium embedding spaces. The algorithm has been generalized to compute higher-dimensional manifolds by and.

This is a glossary of properties and concepts in algebraic topology in mathematics.

Discrete calculus or the calculus of discrete functions, is the mathematical study of incremental change, in the same way that geometry is the study of shape and algebra is the study of generalizations of arithmetic operations. The word calculus is a Latin word, meaning originally "small pebble"; as such pebbles were used for calculation, the meaning of the word has evolved and today usually means a method of computation. Meanwhile, calculus, originally called infinitesimal calculus or "the calculus of infinitesimals", is the study of continuous change.

<span class="mw-page-title-main">Simplex tree</span> Topological data

In topological data analysis, a simplex tree is a type of trie used to represent efficiently any general simplicial complex. Through its nodes, this data structure notably explicitly represents all the simplices. Its flexible structure allows implementation of many basic operations useful to computing persistent homology. This data structure was invented by Jean-Daniel Boissonnat and Clément Maria in 2014, in the article The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. This data structure offers efficient operations on sparse simplicial complexes. For dense or maximal simplices, Skeleton-Blocker representations or Toplex Map representations are used.

A subdivision of a simplicial complex is another simplicial complex in which, intuitively, one or more simplices of the original complex have been partitioned into smaller simplices. The most commonly used subdivision is the barycentric subdivision, but the term is more general. The subdivision is defined in slightly different ways in different contexts.

References

  1. 1 2 Munkres, James R. (1995). Elements of Algebraic Topology. Westview Press. ISBN   978-0-201-62728-2.
  2. 1 2 3 4 Matoušek, Jiří (2007). Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2nd ed.). Berlin-Heidelberg: Springer-Verlag. ISBN   978-3-540-00362-5. Written in cooperation with Anders Björner and Günter M. Ziegler , Section 4.3
  3. Colin P. Rourke and Brian J. Sanderson (1982). Introduction to Piecewise-Linear Topology. New York: Springer-Verlag. doi:10.1007/978-3-642-81735-9. ISBN   978-3-540-11102-3.
  4. Bryant, John L. (2001-01-01), Daverman, R. J.; Sher, R. B. (eds.), "Chapter 5 - Piecewise Linear Topology", Handbook of Geometric Topology, Amsterdam: North-Holland, pp. 219–259, ISBN   978-0-444-82432-5 , retrieved 2022-11-15