Simplicial approximation theorem

From HandWiki
Short description: Continuous mappings can be approximated by ones that are piecewise simple


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 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.

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 time—the first decade of the twentieth century—on 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.

Statement

The basic form of the theorem is the following:

Theorem — [1] Let K,L be two simplicial complexes. If f:|K||L| is a continuous map, then there are a subdivision K of K and a simplicial mapping s:KL whose geometric realization |s| is homotopic to f.

Also, if f is a based map between pointed spaces, then s and the homotopy f|s| can be taken to be based as well.

In short, the theorem says any continuous map between simplicial complexes is the geometric realization of a simplicial mapping up to homotopy and subdivision.

Here is a more precise formulation. A simplicial mapping s:KL is called a simplicial approximation of f:|K||L| if for every point x in |K|, |s|(x) belongs to the minimal closed simplex of L containing f(x).[2]

If s is a simplicial approximation to a map f, then the geometric realization g=|s| of s is necessarily homotopic to f; in fact, the homotpy is given by ht=(1t)f+tg.[3]

The simplicial approximation theorem states that given a map f:|K||L|, there exists a natural number n0 such that for all nn0, there exists a simplicial approximation

s:BdnKL,

to f where BdK denotes the barycentric subdivision of K, and BdnK denotes the result of applying barycentric subdivision n times. In fact, the proof of the theorem shows there is a real number δ>0 depending on f and L (not just |L|) such that if each simplex in K has diameter less than δ, then there exists a simplicial approximation to f.

Moreover, if ϵ:|L| is a positive continuous map, then there are subdivisions K,L of K,L and a simplicial map s:KL such that g=|s| is ϵ-homotopic to f; that is, there is a homotopy H:|K|×[0,1]|L| from f to g such that diam(H(x×[0,1]))<ϵ(f(x)) for all x|K|.[citation needed] So, we may consider the simplicial approximation theorem as a piecewise linear analog of Whitney approximation theorem.

Applications

Here are some typical applications.

πkSn=0,k<n.

Indeed, given a map f:SkSn, it is homotopic to a simplicial map g:SkSn. Now, for dimension reason, g cannot map onto an n-simplex; i.e., g is not surjective and thus the image lies in a contractible subset and g is homotpic to a constant map. (Strictly speaking, here the based version of the simplicial approximation theorem is used.)

Here is another more substantial but typical application.

(Lefschetz fixed point theorem) For a compact manifold or a finite CW complex X, if the trace of a map f:XX (see below) is nonzero, then f admits a fixed point.

Here, for a field Λ, the trace of the map f is the number (an element in Λ)

tr(f)=i(1)itr(f*|Hi(X;Λ)),

which is a finite number since X has finite dimension.

Sketch of proof:[4] We assume f does not have a fixed point and shall show the trace of it is zero.

Step 1: reduces to the case when X is the geometric realization of a simplicial complex; i.e., X=|K|.

Indeed, X here is known to be an ENR, a Euclidean neighborhood retract. Thus, there is a retract r:KX from a simplicial complex and fr:KXXK has exactly the same set of fixed points as f does; so we can replace f by fr.

Step 2: tr(f*|H*(X;Λ))=tr(f*|C*(X;Λ)).

This is a linear algebra calculation.

Step 3: subdivide K to K so that a simplicial approximation g:KK to f exists and note it doesn’t intersect a simplex in the sense below. (We shall write g for both g and the geometric realization of it |g|.)

Since f doesn’t have a fixed point and X is compact, we have δ=inf|xf(x)|>0. Replacing K by a refinement without loss of generality, we shall assume the diameter of each simplex in K is <δ/2; note this is not about simplicial approximation.

Let KK be a subdivision so that the simplicial approximation g:KK exists. Then, by the definition of a simplicial approximation, for each x in X=|K|, f(x),g(x) belong to the same closed simplex; thus, by the early assumption,

|f(x)g(x)|<δ/2.

It follows:

|xg(x)||xf(x)||f(x)g(x)|>δδ/2=δ/2.

Thus, for each (closed) simplex σ in K,

g(σ)σ=.

Final step.

Assuming Λ is algebraically closed without loss of generality, the diagonal of the Jordan canonical form of g*|C*(X;Λ) consists of all zeros. In particular, the trace of it is zero. Then by Step 2 applied to g, we are done since tr(f)=tr(g) by the homotopy invariance of homology.

Proof

Source:[5]

The idea of the proof is quite intuitive; if there are sufficiently many and sufficiently randomly located vertices, then on each simplex, a continuous map can be approximated by a piecewise-linear map; thus globally so.

Precisely, let St0(w) denote the open star of w; i.e., the union of all relatively-open simplexes containing w in the closure. Note St0(w) is the complement of the union of all simplexes disjoint from St0(w); in particular, is an open subset and thus Uw:=f1(St0(w)), w vertices, form an open cover of |K|. Let δ be the Lebesgue number of this open cover; i.e., a positive real number such that if A|K| is a subset of diameter <δ, then A is contained in some open set in the cover.

Now, let K be some refinement of K with the property that the diameter of each simplex in K is less then δ/2 (see below for how to find such a refinement). Then the diameter of St0(v) is less than δ, since |xy||xv|+|vy|<δ for each x,y in St0(v). Thus, for each vertex v, we have St0(v)f1(St0(w)) or

f(St0(v))St0(w)

for some vertex w. Let s(v) denote some such w. Then s is a map between the sets of the vertices. We note that s extends by linearity to s:KL; i.e., it maps simplexes to simplexes for each set of the vertices vi of a simplex in K, the convex hull s(v1),,s(vr) is a (closed) simplex in L for each set of the vertices vi of a simplex in K, there is a relatively-open simplex in L whose closure contains all s(vi)’s as vertices, possibly with repetition.

Now, the last condition in the above holds since given a set of the vertices vi of a simplex in K, we have:

f(iSt0(vi))if(St0(vi))iSt0(s(vi)).

And then we get the (necessary continuous) map g=|s|:|K||L|. Next, for each x in |K|, f(x) belongs to a unique relatively-open simplex τ in L. Let x=λivi be a convex combination with nonzero coefficients for some vertices vi in K. Then g(x)=λig(vi). Let wi=g(vi). For each i, we have xSt0(vi) and so

f(x)f(St0(vi))St0(wi).

Thus, f(x) belongs to some τ whose closure contains wi and by uniqueness, τ=τ. Then we have

g(x)λiττ.

Hence, f(x),g(x) belongs to the same simplex τ. So, if we let ht=(1t)f+g, then ht is a homotopy fg.

Here, we shall give some rigorous argument on how to find a refinement in which the diameter of each simplex is arbitrarily small (of course, this is intuitively entirely obvious.) The argument is by estimating the diameter of a simplex in a barycentric subdivision as follows.

Lemma — Let σ be a p-simplex. Then each simplex in the barycentric subdivision of σ has diameter pp+1diam(σ). Moreover, the estimate is sharp.

Since p/(p+1) is less than 1, we can make the maximal diameter of a simplex arbitrary small by iterating barycentric subdivisions.

Proof:[6] By construction, each simplex in the barycentric subdivision has the vertices of the form b(F0), for a chain of faces

σ=FpF0

where F<G means F is a proper face of G, and, thinking F consisting of vertices, the barycenter b(F) of F is

b(F)=1#FvFv.

Now, given faces F<G, with g:=#G,f:=#F, we have:

b(F)b(G)=gfg(1fvFv1gfvGFv).

Then the expression after gfg is in

vvG+vvGvwv,wG

where the bracket means convex hull. Thus, since (gf)/g(g1)/gp/(p+1),

|b(F)b(G)|pp+1maxv,wG|vw|.

This implies the diameter of b(Fi)i is bounded by the claimed bound.

Finally, to see the estimate cannot be improved, first note: for the vertices vi of σ,

b(σ)v0=1p+1i1(viv0).

Thus, for example, if σ is the 2-simplex with vertices v0=(0,0),v1=(1,0),v2=(1,ϵ), then the ratio |b(σ)v0|/diam(σ) approaches 23 as ϵ goes to zero. A similar argument works in higher dimension.

References

  1. Hatcher, Allen (2002). Algebraic topology. Cambridge ; New York: Cambridge University Press. ISBN 978-0521795401. https://pi.math.cornell.edu/~hatcher/AT/ATpage.html. : Theorem 2C.1 
  2. Bredon 2013, Definition 22.3.
  3. Spanier, Edwin H. (2012). Algebraic Topology. Springer-Verlag. ISBN 9781468493221. : Section 3.4, Theorem 3 
  4. Bredon 2013, Proof of Theorem 23.4.
  5. Bredon 2013, Proof of Theorem 22.10.
  6. Bredon 2013, Proof of Lemma 17.3.

Further reading