Barycentric subdivision explained

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.

Motivation

The barycentric subdivision is an operation on simplicial complexes. In algebraic topology it is sometimes useful to replace the original spaces with simplicial complexes via triangulations: The substitution allows to assign combinatorial invariants as the Euler characteristic to the spaces. One can ask if there is an analogous way to replace the continuous functions defined on the topological spaces by functions that are linear on the simplices and which are homotopic to the original maps (see also simplicial approximation). In general, such an assignment requires a refinement of the given complex, meaning, one replaces bigger simplices by a union of smaller simplices. A standard way to effectuate such a refinement is the barycentric subdivision. Moreover, barycentric subdivision induces maps on homology groups and is helpful for computational concerns, see Excision and Mayer–Vietoris sequence.

Definition

Subdivision of simplicial complexes

Let

l{S}\subset R ^{n} be a geometric simplicial complex. A complex l{S'} is said to be a subdivision of l{S} if

• each simplex of

l{S'} is contained in a simplex of l{S}

• each simplex of

l{S} is a finite union of simplices of l{S'}

These conditions imply that

l{S} and l{S'} equal as sets and as topological spaces, only the simplicial structure changes.

Barycentric subdivision of a simplex

For a simplex

\Delta spanned by points p _{0,...,p} _{n} , the barycenter is defined to be the point b _{\Delta} = (1)/(n +1) (p _{0+p} _{1+...+ p} _{n)} . To define the subdivision, we will consider a simplex as a simplicial complex that contains only one simplex of maximal dimension, namely the simplex itself. The barycentric subdivision of a simplex can be defined inductively by its dimension.

For points, i.e. simplices of dimension 0, the barycentric subdivision is defined as the point itself.

Suppose then for a simplex

\Delta of dimension n that its faces \Delta _{i} of dimension n -1 are already divided. Therefore, there exist simplices \Delta _{i,1} , \Delta _{i,2} ..., \Delta _{i,} covering \Delta _{i} . The barycentric subdivision is then defined to be the geometric simplicial complex whose maximal simplices of dimension n are each a convex hulls of \Delta _{i,j} \cup b _{\Delta} for one pair i,j for some i \in { 0 ,...,n}, j\in { 1 ,...,n!} , so there will be (n + 1 )! simplices covering \Delta .

One can generalize the subdivision for simplicial complexes whose simplices are not all contained in a single simplex of maximal dimension, i.e. simplicial complexes that do not correspond geometrically to one simplex. This can be done by effectuating the steps described above simultaneously for every simplex of maximal dimension. The induction will then be based on the

n -th skeleton of the simplicial complex. It allows effectuating the subdivision more than once.

Barycentric subdivision of a convex polytope

The operation of barycentric subdivision can be applied to any convex polytope of any dimension, producing another convex polytope of the same dimension. In this version of barycentric subdivision, it is not necessary for the polytope to form a simplicial complex: it can have faces that are not simplices. This is the dual operation to omnitruncation.^[1] The vertices of the barycentric subdivision correspond to the faces of all dimensions of the original polytope. Two vertices are adjacent in the barycentric subdivision when they correspond to two faces of different dimensions with the lower-dimensional face included in the higher-dimensional face. The facets of the barycentric subdivision are simplices, corresponding to the flags of the original polytope.

For instance, the barycentric subdivision of a cube, or of a regular octahedron, is the disdyakis dodecahedron. The degree-6, degree-4, and degree-8 vertices of the disdyakis dodecahedron correspond to the vertices, edges, and square facets of the cube, respectively.

Properties

Mesh

Let

\Delta \subset R ^{n} a simplex and define \operatorname{diam}(\Delta) = \operatorname{max} l \{ \|a - b\| _{R ^{n}} | a, b \in \Delta r \} . One way to measure the mesh of a geometric, simplicial complex is to take the maximal diameter of the simplices contained in the complex. Let \Delta' be an n - dimensional simplex that comes from the covering of \Delta obtained by the barycentric subdivision. Then, the following estimation holds:\operatorname{diam}(\Delta')\leq \left( (n)/(n +1) \right) \operatorname{diam}(\Delta) . Therefore, by applying barycentric subdivision sufficiently often, the largest edge can be made as small as desired.

Homology

For some statements in homology-theory one wishes to replace simplicial complexes by a subdivision. On the level of simplicial homology groups one requires a map from the homology-group of the original simplicial complex to the groups of the subdivided complex. Indeed it can be shown that for any subdivision

l{K'} of a finite simplicial complex l{K} there is a unique sequence of maps between the homology groups λ _{n:} C _{n(l{K}) → C} _{n(l{K'})} such that for each \Delta in l{K} the maps fulfills λ (\Delta)\subset \Delta and such that the maps induces endomorphisms of chain complexes. Moreover, the induced map is an isomorphism: Subdivision does not change the homology of the complex.

To compute the singular homology groups of a topological space

X one considers continuous functions \sigma: \Delta ^{n} → X where \Delta ^{n} denotes the n -dimensional-standard-simplex. In an analogous way as described for simplicial homology groups, barycentric subdivision can be interpreted as an endomorphism of singular chain complexes. Here again, there exists a subdivision operator λ _{n:} C _{n(X) →} C _{n(X)} sending a chain \sigma: \Delta → X to a linear combination \sum \varepsilon _{B _{\Delta}} \sigma\vert _{B _{\Delta}} where the sum runs over all simplices B _{\Delta} that appear in the covering of \Delta by barycentric subdivision, and \varepsilon _{B _{\Delta}} \in \{ 1 , -1 \} for all of such B _{\Delta} . This map also induces an automorphism of chain complexes.

Applications

The barycentric subdivision can be applied on whole simplicial complexes as in the simplicial approximation theorem or it can be used to subdivide geometric simplices. Therefore it is crucial for statements in singular homology theory, see Mayer–Vietoris sequence and excision.

Simplicial approximation

Let

l{K} , l{L} be abstract simplicial complexes above sets V _{K} , V _{L} . A simplicial map is a function f:V _{K} → V _{L} which maps each simplex in l{K} onto a simplex in l{L} . By affin-linear extension on the simplices, f induces a map between the geometric realizations of the complexes. Each point in a geometric complex lies in the inner of exactly one simplex, its support. Consider now a continuous map f: l{K} → l{L} . A simplicial map g: l{K} → l{L} is said to be a simplicial approximation of f if and only if each x \in l{K} is mapped by g onto the support of f(x) in l{L} . If such an approximation exists, one can construct a homotopy H transforming f into g by defining it on each simplex; there, it always exists, because simplices are contractible.

The simplicial approximation theorem guarantees for every continuous function

f:V _{K} → V _{L} the existence of a simplicial approximation at least after refinement of l{K} , for instance by replacing l{K} by its iterated barycentric subdivision. The theorem plays an important role for certain statements in algebraic topology in order to reduce the behavior of continuous maps on those of simplicial maps, as for instance in Lefschetz's fixed-point theorem.

Lefschetz's fixed-point theorem

The Lefschetz number is a useful tool to find out whether a continuous function admits fixed-points. This data is computed as follows: Suppose that

X and Y are topological spaces that admit finite triangulations. A continuous map f: X → Y induces homomorphisms f _{i:} H _{i(X,K) →} H _{i(Y,K)} between its simplicial homology groups with coefficients in a field K . These are linear maps between K - vectorspaces, so their trace tr _{i} can be determined and their alternating sumL _{K(f)=} \sum ^{itr} _{i(f)} \in K

is called the Lefschetz number of

f . If f = id , this number is the Euler characteristic of K . The fixpoint theorem states that whenever L _{K(f) ≠} 0 , f has a fixed-point. In the proof this is first shown only for simplicial maps and then generalized for any continuous functions via the approximation theorem.

Now, Brouwer's fixpoint theorem is a special case of this statement. Let

f: D ^{n} → D ^{n} is an endomorphism of the unit-ball. For k \geq 1 all its homology groups H ^{n)} _{k( D} vanish, and f _{0} is always the identity, so L _{K(f)} = tr _{0(f)} = 1 ≠ 0 , so f has a fixpoint.

Mayer–Vietoris sequence

The Mayer–Vietoris sequence is often used to compute singular homology groups and gives rise to inductive arguments in topology. The related statement can be formulated as follows:

Let

X = A \cup B an open cover of the topological space X .

There is an exact sequence

… \to H _{n+1} (X)\xrightarrow{\partial _{*}H} _{n} (A\cap B)\xrightarrow{(i _{*,j} _{*)}H} _{n} (A) ⊕ H _{n} (B) \xrightarrow{k _{*} - l _{*}} H _{n} (X) \xrightarrow{\partial _{*}} H _{n-1} (A\cap B)\to … … \to H _{0(A) ⊕} H _{0(B)\xrightarrow{k} _{*} - l _{*}H} _{0(X)\to} 0 .

where we consider singular homology groups,

i: A \cap B \hookrightarrow A, j: A \cap B \hookrightarrow B, k: A \hookrightarrow X, l: B \hookrightarrow X are embeddings and ⊕ denotes the direct sum of abelian groups.

For the construction of singular homology groups one considers continuous maps defined on the standard simplex

\sigma: \Delta → X . An obstacle in the proof of the theorem are maps \sigma such that their image is nor contained in A neither in B . This can be fixed using the subdivision operator: By considering the images of such maps as the sum of images of smaller simplices, lying in A or B one can show that the inclusion C _{n(A) ⊕} C _{n(B)\hookrightarrow} C _{n(X)} induces an isomorphism on homology which is needed to compare the homology groups.

Excision

Excision can be used to determine relative homology groups. It allows in certain cases to forget about subsets of topological spaces for their homology groups and therefore simplifies their computation:

Let

X be a topological space and let Z \subset A \subset X be subsets, where Z is closed such that Z \subset A ^{\circ} . Then the inclusion i:(X \setminus Z, A \setminus Z) \hookrightarrow (X, A) induces an isomorphism H _{k(X} \setminus Z, A \setminus Z) → H _{k(X,A)} for all k \geq 0 .

Again, in singular homology, maps

\sigma: \Delta → X may appear such that their image is not part of the subsets mentioned in the theorem. Analogously those can be understood as a sum of images of smaller simplices obtained by the barycentric subdivision.

Notes and References

1. See p. 22, where the omnitruncation is described as a "flag graph".