We construct the output presentation explicitly, using HNN extensions and an amalgamated free product. Throughout, also denotes the group given by the input finite group presentation, and . Every word introduced below is a literal computable word in the displayed generators; testing whether is never part of the construction.
First fix the auxiliary Higman group
We need two facts: is a free group of rank two, and the normal closure of is . The latter follows immediately from the relations: setting forces successively , , and , hence all three are .
Here is a normal-form verification of the first fact. The three-generator group
is an amalgamated free product of two Baumslag-Solitar groups along their infinite cyclic subgroups generated by . Their base cyclic groups embed by Britton's lemma, so this amalgamation is legitimate. Nonzero powers of in the first factor lie outside , as shown by the homomorphism recording the exponent of its stable letter . Nonzero powers of in the second factor also lie outside : the stable-letter exponent map first forces a putative equality to have , and then injectivity of the base cyclic group forces . The normal form theorem for an amalgamated free product therefore makes a rank-two free group in .
The same argument applies to , formed from the other two cyclic conjugation relations. The full is , so that rank-two free group embeds in as well. In particular has infinite order.
Now take the free product
and set
Introduce letters , and define the finite presentation
Finally impose the Higman relations and identify
Thus the algorithm outputs
The symbols in this display are abbreviations for the explicit words above, not extra generators. Renaming the finitely many new generators to avoid makes this a uniform effective construction.
A topological graph is a CW complex with only zero-dimensional and one-dimensional cells: its vertices form the zero-skeleton, and each edge is a copy of an open interval attached by its two endpoints to vertices, possibly the same vertex. It has the weak topology of a CW complex. A subgraph is a CW subcomplex, obtained by choosing vertices and edges and retaining the endpoints of every chosen edge. Loops and multiple edges are allowed.
A spanning tree is a connected spanning subgraph containing no cycle in a graph. To construct one in any connected topological graph , consider all acyclic spanning subgraphs, ordered by inclusion; the subgraph with every vertex and no edges is one. The union of a chain is still acyclic, since any cycle uses only finitely many edges and would already occur in a member of the chain. The Zorn lemma therefore gives a maximal such subgraph .
If were disconnected, a finite edge path in between vertices of two of its components would contain an edge joining different components. Adding that edge creates no cycle, contradicting maximality. Thus is a spanning tree. Fix a root vertex. Each point of has a unique finite path to the root; give every edge length one and move the point a fraction of the way along that path at time . This defines a contraction of a topological space of . On each closed edge times , the construction takes place in a finite tree and is continuous. Since the interval is a locally finite CW complex, the product with has the corresponding weak topology of a CW complex, so these restrictions establish continuity globally. Consequently
This argument includes infinite graphs and does not assume local finiteness of .
If is a covering map, take as the vertices upstairs. Each component of the inverse image of an open edge is an open interval mapping homeomorphically to that edge, because an interval is simply connected. Its parametrization lifts along the closed edge to attach its endpoints to lifted vertices, by path lifting theorem. Small star neighborhoods at vertices are lifted homeomorphically by the covering map, and give exactly the neighborhoods of the resulting topological graph. Thus the cell structure has the topology of the original covering space. The total space may be disconnected, but every component is a topological graph.
The Nielsen–Schreier formula is
For a proof, realize as the fundamental group of the wedge sum of circles. Construct its connected covering graph with vertices the right cosets , and an oriented edge labeled from to for each free generator . There is exactly one incoming and one outgoing edge of each label at every vertex, which establishes the local covering map property. Reading a word from ends at its coset, so the closed paths at give exactly the words in . The induced map of fundamental groups is injective by the homotopy lifting property of a covering map, and its image is .
For index , this covering graph has vertices and edges. A spanning tree in it has edges. The permitted rank formula for a finite connected graph now gives
In particular this proves both freeness and the index formula.
If and , then , so a proper finite-index subgroup cannot be isomorphic to . For , , and is a proper index- subgroup isomorphic to for every . Hence

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact