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: It's not good. People don't consistently get it right and it's annoying.
gollark: Yes, it's Turing-complete*, but that doesn't mean I want to write```cint32_t_iterator_of_some_kind thing = make_iterator();while (int32_t x = get_element(thing)) { // do thing with x}free_iterator(thing)```* not actually Turing-complete, due to weird spec quirks
gollark: It isn't. Its type system CANNOT correctly express generics, which you need for good iterators. Its insufficiently good memory management mechanisms would require manually freeing and allocing them, which is no. Its lack of good metaprogramming capabilities (the macros are not sufficient) means I couldn't make iterators which were actually *nice to use*.
gollark: No.
gollark: No. I don't know what GA is.

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.