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).[citation needed] 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— Let K , L {\displaystyle K,L} be two simplicial complexes. If f : | K | → | L | {\displaystyle f:|K|\to |L|} is a continuous map, then there are a subdivision K ′ {\displaystyle K'} of K {\displaystyle K} and a simplicial mapping s : K ′ → L {\displaystyle s:K'\to L} whose geometric realization | s | {\displaystyle |s|} is homotopic to f {\displaystyle f}.

Also, if f {\displaystyle f} is a based map between pointed spaces, then s {\displaystyle s} and the homotopy f ∼ | s | {\displaystyle f\sim |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 : K → L {\displaystyle s:K\to L} is called a simplicial approximation of f : | K | → | L | {\displaystyle f:|K|\to |L|} if for every point x {\displaystyle x} in | K | {\displaystyle |K|}, | s | ( x ) {\displaystyle |s|(x)} belongs to the minimal closed simplex of L {\displaystyle L} containing f ( x ) {\displaystyle f(x)}.

If s {\displaystyle s} is a simplicial approximation to a map f {\displaystyle f}, then the geometric realization g = | s | {\displaystyle g=|s|} of s {\displaystyle s} is necessarily homotopic to f {\displaystyle f}; in fact, the homotpy is given by h t = ( 1 − t ) f + t g {\displaystyle h_{t}=(1-t)f+tg}.

The simplicial approximation theorem states that given a map f : | K | → | L | {\displaystyle f:|K|\to |L|}, there exists a natural number n 0 {\displaystyle n_{0}} such that for all n ≥ n 0 {\displaystyle n\geq n_{0}}, there exists a simplicial approximation

s : B d n K → L , {\displaystyle s:\mathrm {Bd} ^{n}K\to L,}

to f {\displaystyle f} where B d K {\displaystyle \mathrm {Bd} \;K} denotes the barycentric subdivision of K {\displaystyle K}, and B d n K {\displaystyle \mathrm {Bd} ^{n}K} denotes the result of applying barycentric subdivision n {\displaystyle n} times. In fact, the proof of the theorem shows there is a real number δ > 0 {\displaystyle \delta >0} depending on f {\displaystyle f} and L {\displaystyle L} (not just | L | {\displaystyle |L|}) such that if each simplex in K {\displaystyle K} has diameter less than δ {\displaystyle \delta }, then there exists a simplicial approximation to f {\displaystyle f}.

Moreover, if ϵ : | L | → R {\displaystyle \epsilon :|L|\to {\mathbb {R}}} is a positive continuous map, then there are subdivisions K ′ , L ′ {\displaystyle K',L'} of K , L {\displaystyle K,L} and a simplicial map s : K ′ → L ′ {\displaystyle s:K'\to L'} such that g = | s | {\displaystyle g=|s|} is ϵ {\displaystyle \epsilon }-homotopic to f {\displaystyle f}; that is, there is a homotopy H : | K | × [ 0 , 1 ] → | L | {\displaystyle H:|K|\times [0,1]\to |L|} from f {\displaystyle f} to g {\displaystyle g} such that d i a m ( H ( x × [ 0 , 1 ] ) ) < ϵ ( f ( x ) ) {\displaystyle \mathrm {diam} (H(x\times [0,1]))<\epsilon (f(x))} for all x ∈ | K | {\displaystyle x\in |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.

π k S n = 0 , k < n . {\displaystyle \pi _{k}S^{n}=0,\,k<n.}

Indeed, given a map f : S k → S n {\displaystyle f:S^{k}\to S^{n}}, it is homotopic to a simplicial map g : S k → S n {\displaystyle g:S^{k}\to S^{n}}. Now, for dimension reason, g {\displaystyle g} cannot map onto an n-simplex; i.e., g {\displaystyle g} is not surjective and thus the image lies in a contractible subset and g {\displaystyle 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 {\displaystyle X}, if the trace of a map f : X → X {\displaystyle f:X\to X} (see below) is nonzero, then f {\displaystyle f} admits a fixed point.

Here, for a field Λ {\displaystyle \Lambda }, the trace of the map f {\displaystyle f} is the number (an element in Λ {\displaystyle \Lambda })

tr ⁡ ( f ) = ∑ i ( − 1 ) i tr ⁡ ( f ∗ | H i ⁡ ( X ; Λ ) ) , {\displaystyle \operatorname {tr} (f)=\sum _{i}(-1)^{i}\operatorname {tr} (f_{*}|\operatorname {H} _{i}(X;\Lambda )),}

which is a finite number since X has finite dimension.

Sketch of proof: We assume f {\displaystyle 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 | {\displaystyle X=|K|}.

Indeed, X here is known to be an ENR, a Euclidean neighborhood retract. Thus, there is a retract r : K → X {\displaystyle r:K\to X} from a simplicial complex and f ∘ r : K → X → X ↪ K {\displaystyle f\circ r:K\to X\to X\hookrightarrow K} has exactly the same set of fixed points as f {\displaystyle f} does; so we can replace f {\displaystyle f} by f ∘ r {\displaystyle f\circ r}.

Step 2: tr ⁡ ( f ∗ | H ∗ ⁡ ( X ; Λ ) ) = tr ⁡ ( f ∗ | C ∗ ( X ; Λ ) ) . {\displaystyle \operatorname {tr} (f_{*}|\operatorname {H} _{*}(X;\Lambda ))=\operatorname {tr} (f_{*}|C_{*}(X;\Lambda )).}

This is a linear algebra calculation.

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

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

Let K ′ ⊂ K {\displaystyle K'\subset K} be a subdivision so that the simplicial approximation g : K ′ → K {\displaystyle g:K'\to K} exists. Then, by the definition of a simplicial approximation, for each x {\displaystyle x} in X = | K ′ | {\displaystyle X=|K'|}, f ( x ) , g ( x ) {\displaystyle f(x),g(x)} belong to the same closed simplex; thus, by the early assumption,

| f ( x ) − g ( x ) | < δ / 2. {\displaystyle |f(x)-g(x)|<\delta /2.}

It follows:

| x − g ( x ) | ≥ | x − f ( x ) | − | f ( x ) − g ( x ) | > δ − δ / 2 = δ / 2. {\displaystyle |x-g(x)|\geq |x-f(x)|-|f(x)-g(x)|>\delta -\delta /2=\delta /2.}

Thus, for each (closed) simplex σ {\displaystyle \sigma } in K {\displaystyle K},

g ( σ ) ∩ σ = ∅ . {\displaystyle g(\sigma )\cap \sigma =\emptyset .}

Final step.

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

Proof

Source:

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 St 0 ⁡ ( w ) {\displaystyle \operatorname {St} ^{0}(w)} denote the open star of w {\displaystyle w}; i.e., the union of all relatively-open simplexes containing w {\displaystyle w} in the closure. Note St 0 ⁡ ( w ) {\displaystyle \operatorname {St} ^{0}(w)} is the complement of the union of all simplexes disjoint from St 0 ⁡ ( w ) {\displaystyle \operatorname {St} ^{0}(w)}; in particular, is an open subset and thus U w := f − 1 ( St 0 ⁡ ( w ) ) {\displaystyle U_{w}:=f^{-1}(\operatorname {St} ^{0}(w))}, w {\displaystyle w} vertices, form an open cover of | K | {\displaystyle |K|}. Let δ {\displaystyle \delta } be the Lebesgue number of this open cover; i.e., a positive real number such that if A ⊂ | K | {\displaystyle A\subset |K|} is a subset of diameter < δ {\displaystyle <\delta }, then A {\displaystyle A} is contained in some open set in the cover.

Now, let K ′ {\displaystyle K'} be some refinement of K {\displaystyle K} with the property that the diameter of each simplex in K ′ {\displaystyle K'} is less then δ / 2 {\displaystyle \delta /2} (see below for how to find such a refinement). Then the diameter of St 0 ⁡ ( v ) {\displaystyle \operatorname {St} ^{0}(v)} is less than δ {\displaystyle \delta }, since | x − y | ≤ | x − v | + | v − y | < δ {\displaystyle |x-y|\leq |x-v|+|v-y|<\delta } for each x , y {\displaystyle x,y} in St 0 ⁡ ( v ) {\displaystyle \operatorname {St} ^{0}(v)}. Thus, for each vertex v {\displaystyle v}, we have St 0 ⁡ ( v ) ⊂ f − 1 ( St 0 ⁡ ( w ) ) {\displaystyle \operatorname {St} ^{0}(v)\subset f^{-1}(\operatorname {St} ^{0}(w))} or

f ( St 0 ⁡ ( v ) ) ⊂ St 0 ⁡ ( w ) {\displaystyle f(\operatorname {St} ^{0}(v))\subset \operatorname {St} ^{0}(w)}

for some vertex w {\displaystyle w}. Let s ( v ) {\displaystyle s(v)} denote some such w {\displaystyle w}. Then s {\displaystyle s} is a map between the sets of the vertices. We note that s {\displaystyle s} extends by linearity to s : K → L {\displaystyle s:K\to L}; i.e., it maps simplexes to simplexes ⇔ {\displaystyle \Leftrightarrow } for each set of the vertices v i {\displaystyle v_{i}} of a simplex in K {\displaystyle K}, the convex hull ⟨ s ( v 1 ) , ⋯ , s ( v r ) ⟩ {\displaystyle \langle s(v_{1}),\cdots ,s(v_{r})\rangle } is a (closed) simplex in L {\displaystyle L} ⇔ {\displaystyle \Leftrightarrow } for each set of the vertices v i {\displaystyle v_{i}} of a simplex in K {\displaystyle K}, there is a relatively-open simplex in L {\displaystyle L} whose closure contains all s ( v i ) {\displaystyle s(v_{i})}’s as vertices, possibly with repetition.

Now, the last condition in the above holds since given a set of the vertices v i {\displaystyle v_{i}} of a simplex in K {\displaystyle K}, we have:

∅ ≠ f ( ∩ i St 0 ⁡ ( v i ) ) ⊂ ∩ i f ( St 0 ⁡ ( v i ) ) ⊂ ∩ i St 0 ⁡ ( s ( v i ) ) . {\displaystyle \emptyset \neq f(\cap _{i}\operatorname {St} ^{0}(v_{i}))\subset \cap _{i}f(\operatorname {St} ^{0}(v_{i}))\subset \cap _{i}\operatorname {St} ^{0}(s(v_{i})).}

And then we get the (necessary continuous) map g = | s | : | K | → | L | {\displaystyle g=|s|:|K|\to |L|}. Next, for each x {\displaystyle x} in | K | {\displaystyle |K|}, f ( x ) {\displaystyle f(x)} belongs to a unique relatively-open simplex τ {\displaystyle \tau } in L {\displaystyle L}. Let x = ∑ λ i v i {\displaystyle x=\sum \lambda _{i}v_{i}} be a convex combination with nonzero coefficients for some vertices v i {\displaystyle v_{i}} in K . {\displaystyle K.} Then g ( x ) = ∑ λ i g ( v i ) {\displaystyle g(x)=\sum \lambda _{i}g(v_{i})}. Let w i = g ( v i ) {\displaystyle w_{i}=g(v_{i})}. For each i {\displaystyle i}, we have x ∈ St 0 ⁡ ( v i ) {\displaystyle x\in \operatorname {St} ^{0}(v_{i})} and so

f ( x ) ∈ f ( St 0 ⁡ ( v i ) ) ⊂ St 0 ⁡ ( w i ) . {\displaystyle f(x)\in f(\operatorname {St} ^{0}(v_{i}))\subset \operatorname {St} ^{0}(w_{i}).}

Thus, f ( x ) {\displaystyle f(x)} belongs to some τ ′ {\displaystyle \tau '} whose closure contains w i {\displaystyle w_{i}} and by uniqueness, τ ′ = τ {\displaystyle \tau '=\tau }. Then we have

g ( x ) ∈ ∑ λ i τ ¯ ⊂ τ ¯ . {\displaystyle g(x)\in \sum \lambda _{i}{\overline {\tau }}\subset {\overline {\tau }}.}

Hence, f ( x ) , g ( x ) {\displaystyle f(x),g(x)} belongs to the same simplex τ ¯ {\displaystyle {\overline {\tau }}}. So, if we let h t = ( 1 − t ) f + g {\displaystyle h_{t}=(1-t)f+g}, then h t {\displaystyle h_{t}} is a homotopy f ∼ g {\displaystyle f\sim g}. ◻ {\displaystyle \square }

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 σ {\displaystyle \sigma } be a p {\displaystyle p}-simplex. Then each simplex in the barycentric subdivision of σ {\displaystyle \sigma } has diameter ≤ p p + 1 diam ⁡ ( σ ) {\displaystyle \leq {\frac {p}{p+1}}\operatorname {diam} (\sigma )}. Moreover, the estimate is sharp.

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

Proof: By construction, each simplex in the barycentric subdivision has the vertices of the form b ( F 0 ) , ⋯ {\displaystyle b(F_{0}),\cdots } for a chain of faces

σ = F p ⊃ ⋯ ⊃ F 0 {\displaystyle \sigma =F_{p}\supset \cdots \supset F_{0}}

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

b ( F ) = 1 # F ∑ v ∈ F v . {\displaystyle b(F)={\frac {1}{\#F}}\sum _{v\in F}v.}

Now, given faces F < G {\displaystyle F<G}, with g := # G , f := # F {\displaystyle g:=\#G,f:=\#F}, we have:

b ( F ) − b ( G ) = g − f g ( 1 f ∑ v ∈ F v − 1 g − f ∑ v ∈ G − F v ) . {\displaystyle b(F)-b(G)={\frac {g-f}{g}}\left({\frac {1}{f}}\sum _{v\in F}v-{\frac {1}{g-f}}\sum _{v\in G-F}v\right).}

Then the expression after g − f g {\displaystyle {\frac {g-f}{g}}} is in

⟨ v ∣ v ∈ G ⟩ + ⟨ − v ∣ v ∈ G ⟩ ⊂ ⟨ v − w ∣ v , w ∈ G ⟩ {\displaystyle \langle v\mid v\in G\rangle +\langle -v\mid v\in G\rangle \subset \langle v-w\mid v,w\in G\rangle }

where the bracket means convex hull. Thus, since ( g − f ) / g ≤ ( g − 1 ) / g ≤ p / ( p + 1 ) {\displaystyle (g-f)/g\leq (g-1)/g\leq p/(p+1)},

| b ( F ) − b ( G ) | ≤ p p + 1 max v , w ∈ G | v − w | . {\displaystyle |b(F)-b(G)|\leq {\frac {p}{p+1}}\max _{v,w\in G}|v-w|.}

This implies the diameter of ⟨ b ( F i ) ∣ i ⟩ {\displaystyle \langle b(F_{i})\mid i\rangle } is bounded by the claimed bound.

Finally, to see the estimate cannot be improved, first note: for the vertices v i {\displaystyle v_{i}} of σ {\displaystyle \sigma },

b ( σ ) − v 0 = 1 p + 1 ∑ i ≥ 1 ( v i − v 0 ) . {\displaystyle b(\sigma )-v_{0}={\frac {1}{p+1}}\sum _{i\geq 1}(v_{i}-v_{0}).}

Thus, for example, if σ {\displaystyle \sigma } is the 2-simplex with vertices v 0 = ( 0 , 0 ) , v 1 = ( 1 , 0 ) , v 2 = ( 1 , ϵ ) {\displaystyle v_{0}=(0,0),v_{1}=(1,0),v_{2}=(1,\epsilon )}, then the ratio | b ( σ ) − v 0 | / diam ⁡ ( σ ) {\displaystyle |b(\sigma )-v_{0}|/\operatorname {diam} (\sigma )} approaches 2 3 {\displaystyle {\frac {2}{3}}} as ϵ {\displaystyle \epsilon } goes to zero. A similar argument works in higher dimension. ◻ {\displaystyle \square }

Further reading

  • Raphaël Tinarrage, Simplicial approximation to CW complexes in practice,