Edge-loop group 2026-10-31
Two based edge loops are equivalent under insertion or deletion of stationary steps, cancellation or insertion of a backtracking spur, and replacement of two sides of a triangle by its third side. The edge-loop group consists of the resulting classes, with concatenation as product and reversal as inverse. Each elementary move can be performed inside a longer concatenation, so multiplication is well defined. Associativity follows from concatenation, the stationary loop is the identity, and a loop followed by its reversal cancels by spurs.
Realization induces a homomorphism to the fundamental group of the geometric realization, because each move is a homotopy in an edge or a triangle. The relative Simplicial approximation theorem applied to based circles makes this map surjective. The full edge-path theorem additionally proves injectivity by approximating homotopies; that stronger assertion is not needed for the group construction or the surjectivity argument.
Past exam of the mathematics course of the University of Cambridge 2006 ii Paper 2 21H Solution Created 2026-09-24 Updated 2026-10-14
The Simplicial approximation theorem states that a continuous map between realizations of finite simplicial complexes becomes homotopic to a simplicial map after sufficiently many barycentric subdivisions of the domain. More precisely, a vertex assignment is a simplicial approximation when the image of each open star is contained in the open star of its assigned vertex; sufficiently fine subdivision permits such an assignment. The resulting straight-line homotopy stays in the appropriate target simplices.
The vertices of a barycentric subdivision are the barycentres of nonempty faces. An -simplex has such faces. A top-dimensional subdivided simplex corresponds to a full flag of faces of sizes , equivalently to an ordering of the original vertices. ThusTriangulate both copies of the sphere using finite complexes. For each fixed subdivision level there are only finitely many vertex maps to the finite target vertex set, hence only finitely many simplicial maps. Every continuous map is homotopic to one of them at some finite level. A countable union of finite sets is countable, proving at most countably many homotopy classes without needing their classification by degree.
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 3 17H Solution Created 2026-09-24 Updated 2026-10-06
A simplicial approximation to is a simplicial map satisfying the open-star conditionfor every vertex . Equivalently, whenever lies in the interior of a simplex of , lies in that simplex. In particular and are joined by the simplexwise straight-line homotopy.
The Simplicial approximation theorem says that, for finite , every continuous has such an approximation after sufficiently many barycentric subdivisions of . For general complexes one uses a subdivision adapted to the open-star cover; a single uniform number of barycentric subdivisions is the compact-domain version.
Given triangulations , , choose a simplicial approximation on a suitable subdivision . Its chain map sends an oriented simplex to , with repeated-vertex simplices sent to zero. It commutes with the boundary operator and induces . Compose this with the subdivision isomorphism and the triangulation identifications to define .
For , a positively oriented fundamental loop winds times around the target circle. With integer coefficients,All higher homology groups vanish. The result can also be read from a subdivision into copies of a target fundamental cycle.
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 2 21H d Solution Created 2026-09-24 Updated 2026-10-03
The Simplicial approximation theorem states that if is a finite simplicial complex, is a simplicial complex, and is continuous, then for some there is a simplicial approximation to .
The target open stars form an open cover of , so their inverse images under form an open cover of the compact metric space . The Lebesgue number lemma supplies such that every subset of diameter below lies in one inverse image. Choose so large that every vertex star in has diameter below ; this is possible because its diameter is at most twice and the mesh tends to zero.
For each vertex choose a vertex of such thatIf span a simplex, a point in its relative interior belongs to all their open stars. Its image belongs to all the open stars of , so these target vertices span a simplex. Thus extends to a simplicial map , and its defining inclusion says exactly that approximates . This proves the theorem.
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 2 21H e Solution Created 2026-09-24 Updated 2026-10-03
Triangulate and . By the Simplicial approximation theorem, after subdividing the domain, a continuous map is homotopic to the realization of a simplicial map . Since , the image of lies in the -skeleton of the target triangulation and therefore misses an interior point of every -simplex. A sphere with one point removed is homeomorphic to the Euclidean space , which is contractible. Hence , and therefore , is homotopic to a constant map. Thus
Past exam of the mathematics course of the University of Cambridge 2021 iii Paper 127 1 Solution 2026-09-28
For a based space , the homotopy groupis the set of based homotopy classes, with its usual concatenation operation. A map is a weak homotopy equivalence when it induces a bijection on path components and an isomorphismfor every and every basepoint . It is an n-connected map when it is bijective on for and surjective on ; equivalently, every homotopy fiber is -connected.
A CW complex is built from a discrete set of zero-cells by successively attaching -discs along maps from their boundary spheres, with the weak topology and closure-finiteness conditions. Its filtration by skeleta is the CW filtration.
For any space , form its singular simplicial set . Its geometric realization of a simplicial set is a CW complex, with one cell for each nondegenerate singular simplex, and evaluation givesThe Simplicial approximation theorem identifies based maps and homotopies from finite simplicial spheres into with singular simplices in . Consequently induces a bijection on components and isomorphisms on all homotopy groups. Thus every space admits a CW approximation.
The vanishing assumptions do not permit removal of all -cells. Take andThen , and homology of a finite cyclic group gives . If a connected CW complex had no two-cells, attaching cells of dimension at least three would not change the fundamental group of its one-skeleton. Hence would be a free group. A weak equivalence would instead give , which is nontrivial and finite and therefore not free. No such exists.
An edge loop is a finite sequence of vertices , starting and ending at , in which consecutive distinct vertices span an edge. Two such sequences are equivalent when related by finitely many elementary edge homotopies, with endpoints fixed: insert or delete a repeated vertex, cancel or insert a spur , and replace by or conversely when the vertices lie in one simplex. Repetitions are allowed in this last convention; a nondegenerate move uses a triangle.
The edge-loop group consists of these equivalence classes, with product given by concatenating the sequences at . Elementary moves remain valid inside a longer concatenation, so this product is well defined. Concatenation is associative after the harmless repeated base vertex is removed; the constant edge loop is the identity. Reversing a sequence gives its inverse, because a sequence followed by its reverse cancels by successive spurs. Thus these operations do form a group.
Realize an edge loop as a piecewise linear path in the geometric realization . A spur contracts in an edge, and a triangle move is a homotopy across that triangle, always fixing endpoints. Hence realization gives a well-defined map to the fundamental group. Realization respects concatenation up to endpoint-preserving reparametrization, so is a homomorphism.
The relative Simplicial approximation theorem says that a continuous map from a finite complex to a geometric realization is homotopic, after sufficiently fine subdivision of its domain, to a simplicial map, with a chosen already simplicial subcomplex kept fixed. Apply its based-circle version to a loop, keeping its marked vertex at . The resulting subdivided simplicial circle traverses edges, so every based homotopy class has an edge-loop representative. Thus is surjective.
For the full two-skeleton, use the triangles through to replace each edge of a loop by . Degenerate cases use repeated-vertex or spur moves. The resulting path contracts by spurs, so its edge-loop group, and therefore its fundamental group, is trivial. This also covers one or two vertices, when only repeated vertices and spurs are needed.
If the deleted triangle has vertices , choose a fourth vertex . Its boundary is filled by the three present triangles , and : their union is the cone from on that boundary. Every elementary homotopy that formerly crossed the missing triangle can therefore be replaced by a homotopy through these three triangles, staying in . Since the one-skeleton has not changed, the same contraction of any edge loop is available in . Surjectivity of its realization map gives
Simplicial approximation Created 2026-10-03 Updated 2026-10-14
A map satisfying this condition is the object whose existence after subdivision is guaranteed by the Simplicial approximation theorem.