This post talks about of inverse limits on groups. Inverse limits are subsets of families of algebraic objects (like groups) where nice properties of the building blocks (like groups) continue to hold for the limit object, making it possible to construct quite fiddly structures. We focus on groups for simplicity, but this works for many other structures (compact groups, topological spaces). There is a powerful application in algebraic topology: construction of Cech homology. Itβs one of the first generalizations of simplicial homology; it strays a bit from Eilenberg-Steenrod axioms (exactness breaks), but it has stronger properties of continuity w.r.t. inverse systems, which make it useful in e.g. fancy game theory.
Definition. Directed sets. Start with a transitive and reflexive relation on some set and require that for all there is with . A subset is said to be cofinal in if for every there is with .
Definition. Inverse system. Let be a collection of groups indexed by a directed set . For let be a homomorphism such that is identity and if then . We usually suppress notation to and specify the directed set. Also works for things with βmore structureβ such as topological spaces or continuous groups e.g. .
Definition. Inverse map. Let and be inverse systems over and respectively. Define to consist of a set map and a collection of group homomorphisms for all such that if in . We can prove that following diagram commutes
Definition. Inverse limits. Let be an inverse system over . Let denote the infinite Cartesian product of groups . The inverse limit of is defined as
We can prove this set is non-empty and also forms a group. Informally, an element of the inverse limit is a sequence of βvalid choicesβ of elements of .
For example, consider finite sets indexed by such that . Let be such that it maps two unique elements from to one unique element in . This forms an inverse system. If we interpret it as an infinite complete binary tree, its limit is the set of all infinite paths starting at the singleton . In the picture below, the path, or the βthreadβ of choices, is valid because it does not βjumpβ to βillegalβ subsets. In fact, with the subspace topology, this construction results in the Cantor set!

We can also βrecoverβ a particular choice of an element of . Define the projection by such that if then . One can prove this exists and is a group homomorphism.
Lemma. If component homomorphisms are isomorphic, then so is the projection. Let be an inverse system over . Suppose for each such that the is an isomorphism. Then for each the projection is an isomorphism.
Now, we would like to relate the limits of systems related by an inverse map.
Definition. Limit maps. Let be an inverse map. There is a such that
Lemma. Limit maps of cofinal systems are isomorphic. Let and be inverse systems over and respectively. Let be cofinal in . Let be an inverse map. Let be its limit. Then is an isomorphism.
Next, I think Iβll write up how this fits in with simplicial homology. There is a nice proof of the fact that on finite polytopes, Cech and simplicial homology groups coincide. This easily leads to topological invariance of simplicial homology, a result that is (in my opinion) a bit trickier to prove using the more classical way of simplicial maps. Of course, simplicial maps are still preferable since they work on infinite polytopes, but oh well hehe.