Simplicial approximation theorem

In mathematics, the simplicial approximation theorem is a foundational result for algebraic topology, guaranteeing that continuous mappings can be (by a slight deformation) approximated by ones that are piecewise of the simplest kind. It applies to mappings between spaces that are built up from simplicesthat 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.

This theorem was first proved by L.E.J. Brouwer, by use of the Lebesgue covering theorem (a result based on compactness). It served to put the homology theory of the timethe first decade of the twentieth centuryon a rigorous basis, since it showed that the topological effect (on homology groups) of continuous mappings could in a given case be expressed in a finitary way. This must be seen against the background of a realisation at the time that continuity was in general compatible with the pathological, in some other areas. This initiated, one could say, the era of combinatorial topology.

There is a further simplicial approximation theorem for homotopies, stating that a homotopy between continuous mappings can likewise be approximated by a combinatorial version.

Formal statement of the theorem

Let and be two simplicial complexes. A simplicial mapping is called a simplicial approximation of a continuous function if for every point , belongs to the minimal closed simplex of containing the point . If is a simplicial approximation to a continuous map , then the geometric realization of , is necessarily homotopic to .

The simplicial approximation theorem states that given any continuous map there exists a natural number such that for all there exists a simplicial approximation to (where denotes the barycentric subdivision of , and denotes the result of applying barycentric subdivision times.)

gollark: There's also a base32 mode (padded with 8 instead of =) in case base64 proves unfathomably unusable for you.
gollark: Each component is limited to 63 chars, so you have to intersperse . too.
gollark: You'll get an A record back containing 255.255.255.255 on success and 0.0.0.something on failure.
gollark: Simply query `[DATA].d.osmarks.net`, where `[DATA]` is a base64-encoded bytestring consisting of the byte C0 and then the UTF-8 text of your comment, and it will appear on https://osmarks.net/test/.
gollark: Okay, osmarks.net now allows comment submission over DNS.

References

  • "Simplicial complex", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.