[Paper Review] The fundamental group of a locally finite graph with ends

Reinhard Diestel, Philipp Sprüssel|ArXiv.org|Oct 29, 2009

Finite Group Theory Research9 references3 citations

TL;DR

This paper provides a combinatorial characterization of the fundamental group of a locally finite graph with ends by representing it as a group of reduced infinite words of chords, embedded canonically into an inverse limit of free groups. The key contribution is a homotopy theory for infinite loops that allows reduction via arbitrary countable order types, generalizing finite graph fundamental groups to infinite, ends-compactified graphs.

ABSTRACT

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental groups of the finite subgraphs of G.

Motivation & Objective

• To provide a combinatorial description of the fundamental group π₁(|G|) for a locally finite graph G with its Freudenthal compactification |G|, which includes the graph's ends.
• To extend the classical finite-graph result (π₁(G) is free on chord edges) to infinite graphs where π₁(|G|) is no longer free, but embeddable into a limit of free groups.
• To formalize homotopy of loops in |G| using infinite words and reductions with arbitrary countable order types, overcoming the failure of well-ordering in infinite reductions.
• To establish a canonical embedding of π₁(|G|) into an inverse limit F* of free groups on finite chord sets, using reductions of infinite words.
• To resolve the open question of whether the topological cycle space C(G) coincides with the first singular homology H₁(|G|), by showing they differ fundamentally.

Proposed method

• Represent loops in |G| as infinite words over oriented chords of a topological spanning tree T, where words are reduced sequences of chords with cancellations.
• Define F∞ as the group of reduced infinite words with arbitrary countable order types (e.g., rational order), capturing traces of loops in |G|.
• Construct a canonical embedding F∞ → F*, where F* is the inverse limit of free groups π₁(G') for all finite subgraphs G' ⊆ G.
• Use a synchronization technique to align passes of two loops σ′ and τ′ with identical word traces, reparametrizing them to share domain intervals for homotopy construction.
• Apply a segment-wise homotopy lemma (Lemma 2) to combine local homotopies between corresponding passes into a global homotopy, ensuring continuity across uncountably many segments.
• Leverage the fact that reduction of infinite words is determined by the reductions of all their finite subwords, enabling the embedding F∞ → F*.

Experimental results

Research questions

• RQ1 How can the fundamental group of a locally finite graph with ends be characterized combinatorially, given that it is not free in the infinite case?
• RQ2 Can homotopy classes of loops in the Freudenthal compactification |G| be generated using only elementary homotopies that cancel one chord pair at a time, even in the infinite setting?
• RQ3 What is the precise relationship between the fundamental group π₁(|G|) and the inverse limit of free groups on finite chord sets?
• RQ4 Does the topological cycle space C(G) of a locally finite graph coincide with its first singular homology H₁(|G|), or do they differ?
• RQ5 How can infinite reductions of words (with arbitrary countable order types) be formalized in a way that preserves the group structure and homotopy equivalence?

Key findings

• The fundamental group π₁(|G|) is isomorphic to a subgroup F∞ of reduced infinite words formed from chords of a topological spanning tree T, where words have arbitrary countable order types.
• The group F∞ embeds canonically into the inverse limit F* of free groups π₁(G') for all finite subgraphs G' ⊆ G, providing a complete combinatorial model.
• Homotopy between loops in |G| can be realized through sequences of elementary cancellations of chord pairs, even when the reduction order is not well-ordered (e.g., rational order).
• The reduction process is fully determined by the reductions of all finite subwords, enabling a well-defined group structure on F∞.
• When G has only one non-trivial end, the characterization recovers the known combinatorial description of the Hawaiian Earring’s fundamental group, confirming consistency with prior results.
• The characterization resolves the open question: the topological cycle space C(G) differs essentially from the first singular homology H₁(|G|), as shown in a follow-up application.