🔢 mathematics

Two-sided homological properties of special and one-relator monoids

This paper establishes that the two-sided homological finiteness properties and Hochschild cohomological dimension of special and certain one-relator monoids are determined by their groups of units, proving that such monoids are of type bi- $\mathrm{FP}_\infty$ and have cohomological dimension at most 2 (or infinite if the relation is a proper power).

Original authors: Robert D. Gray, Benjamin Steinberg

Published 2026-03-24

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Robert D. Gray, Benjamin Steinberg

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to understand a giant, chaotic city. This city is a Monoid. In math terms, a monoid is a collection of things (like words or numbers) that you can combine together using a specific rule.

In this city, there are "laws" (called relations) that tell you when two different-looking paths actually lead to the same destination. For example, a law might say, "If you walk 'A' then 'B', it's the same as just standing still."

The paper you asked about is like a detective story. The detectives (the authors, Robert Gray and Benjamin Steinberg) are trying to figure out the shape and complexity of this city. Specifically, they want to know: Is this city simple enough to navigate easily, or is it a labyrinth that goes on forever?

Here is the breakdown of their discovery, using simple analogies.

1. The Special Case: The "Magic Door" City

Most cities in this math world are messy. But the authors focused on a special type of city called a Special Monoid.

The Analogy: Imagine a city where every single law says, "If you do X, you instantly teleport back to the starting square (Home)."
The Math: In these monoids, every rule looks like Word = 1 (where 1 is the "Home" or identity).
Why it matters: Because everything eventually leads back to "Home," these cities have a hidden structure. The authors realized that inside this chaotic city, there is a smaller, perfectly organized Club (called the Group of Units). This Club consists of the people who can walk forward and backward perfectly without getting stuck.

2. The Big Discovery: The "Shadow" Connection

The main breakthrough of the paper is a bridge between the messy city and the organized Club.

The Metaphor: Think of the messy city as a giant, tangled ball of yarn. The organized Club is a neat, small spool of thread hidden inside the ball.
The Finding: The authors proved that if the small spool (the Club) is well-organized, then the whole giant ball of yarn (the Monoid) is also well-organized.
The Result: They showed that if the Club has a certain level of "finiteness" (meaning it's not infinitely complex), then the whole Monoid shares that same property. They call this property bi-FPn.
- Simple translation: If the "core" of the system is manageable, the "whole system" is manageable, even if it looks huge.

3. Measuring the "Height" of the City

The authors also measured the Cohomological Dimension.

The Analogy: Imagine trying to build a 3D model of the city using blocks.
- If you can build a perfect model using only flat sheets (2D), the city has a "dimension" of 2.
- If you need to build it with cubes, it's 3D.
- If the city is so weird that you need infinite layers of blocks to describe it, it has "infinite dimension."
The Finding:
- If the "Club" inside is simple (no loops that twist back on themselves), the whole city can be described with a maximum of 2 layers (it's very flat and simple).
- If the "Club" has loops (torsion), the whole city becomes infinitely complex and requires infinite layers.

4. The "One-Rule" Mystery

The paper applies this to a famous class of cities called One-Relator Monoids. These are cities built with only one single law (e.g., "The word 'ABBA' equals Home").

For decades, mathematicians wondered: Are these cities always manageable?

The Answer: Yes!
The Proof: The authors used their "Special City" bridge to prove that if the law is Word = Home, the city is always perfectly manageable (bi-FP8).
The Twist: They also figured out exactly how complex it is.
- If the word in the law isn't a repeated pattern (like "ABAB"), the city is simple (Dimension 2).
- If the word is a repeated pattern (like "ABAB"), the city is infinitely complex.

5. Why This Matters (The "So What?")

You might ask, "Why do we care about these imaginary cities?"

The Word Problem: In computer science and logic, we often need to know if two different instructions do the same thing. This is called the "Word Problem."
The Connection: If a city (monoid) has a "finite complete rewriting system," it means a computer can easily solve the Word Problem for it.
The Implication: The authors proved that these "Special Cities" are so well-structured that they should have a finite rewriting system. This brings us one giant step closer to solving the Word Problem for these types of mathematical structures.

Summary in a Nutshell

The authors built a magnifying glass that lets us look at a messy, complicated mathematical structure (a Special Monoid) and see a smaller, simpler structure inside it (the Group of Units).

They proved that the complexity of the whole is dictated by the complexity of the part.

If the part is simple, the whole is simple.
If the part is twisted, the whole is twisted.

This helps mathematicians predict the behavior of complex systems without having to map every single street in the city. It's a powerful tool for understanding the "shape" of mathematics.

1. Problem Statement and Context

The paper addresses fundamental questions regarding the homological finiteness properties of monoids, specifically focusing on one-relator monoids (monoids defined by a single relation $u = v$ ).

The Word Problem: While the word problem for one-relator groups is decidable (Magnus, 1930s), the decidability of the word problem for general one-relator monoids remains a major open problem.
Rewriting Systems: A key approach to solving the word problem is determining if a monoid admits a finite complete rewriting system. The Anick-Groves-Squier theorem establishes that such monoids must satisfy strong homological finiteness properties.
The Gap in Knowledge: Previous work by the authors and others (Kobayashi, Otto) established that one-relator monoids are of type left- $FP_\infty$ and right- $FP_\infty$ (one-sided homological finiteness). However, the stronger two-sided property, bi- $FP_\infty$ , was unknown for the general case.
Specific Focus: The authors focus on special monoids (where all defining relations are of the form $w_i = 1$ ) and one-relator monoids of the form $\langle A \mid r = 1 \rangle$ . They aim to prove these are of type bi- $FP_\infty$ and determine their Hochschild cohomological dimension.

2. Methodology

The paper develops a novel two-sided theory extending the classical Adjan–Makanin–Zhang theory of special monoids. The methodology relies heavily on geometric group theory and homological algebra.

A. Structural Analysis of Special Monoids

The Monoid $N$ : The authors define a specific submonoid $N \subseteq M \times M^{op}$ $N \subseteq M \times M^{o p}$ consisting of pairs $(u, v)$ $(u, v)$ of right and left units such that $uv=1$.
- Key Result: They prove that $N$ is isomorphic to a free product $G * C^*$ , where $G$ is the group of units of $M$ and $C^*$ is a free monoid of finite rank. This generalizes the known result that the monoid of right units is a free product of $G$ and a free monoid.
Ping Pong Lemma: They utilize a variant of the Ping Pong Lemma to establish the free product structure of $N$ .

B. Two-Sided Cayley Graphs

Graph Construction: They analyze the two-sided Cayley graph $\vec{\Gamma}$ of the monoid $M$ , which is a directed graph with vertex set $M \times M$ and edges corresponding to left and right multiplication by generators.
Group Action: The graph admits a natural action by $M \times M^{op}$ .
Quotient by $N$ : They construct the quotient graph $\vec{\Gamma}/N$ $Γ / N$ by collapsing weak orbits of the action of $N$ $N$ .
- Key Result: They prove that $\vec{\Gamma}/N$ is a forest (a disjoint union of trees). This structural result is crucial for constructing classifying spaces.

C. Homological Construction

Resolution Construction: Using the forest structure of $\vec{\Gamma}/N$ , they construct a cellular chain complex that serves as a resolution for the trivial bimodule $\mathbb{Z}M$ .
Projective Dimension: By analyzing the projective dimensions of the modules involved in this resolution (specifically the chain groups $C_0$ and $C_1$ ), they bound the Hochschild cohomological dimension of $M$ .

3. Key Contributions and Results

Theorem A: General Special Monoids

Let $M = \langle A \mid w_1=1, \dots, w_k=1 \rangle$ be a finitely presented special monoid with group of units $G$ .

Finiteness Transfer: If $G$ is of type $FP_n$ (for $1 \le n \le \infty$ ), then $M$ is of type bi- $FP_n$ .
Dimension Bounds: The Hochschild cohomological dimension of $M$ , denoted $\text{dim}(M)$ , satisfies:
$\text{cd}(G) \le \text{dim}(M) \le \max\{2, \text{cd}(G)\}$
where $\text{cd}(G)$ is the cohomological dimension of the group of units.

Theorem B: One-Relator Special Monoids (Lyndon's Identity Type Theorem)

For a one-relator monoid $M = \langle A \mid r = 1 \rangle$ :

Bi- $FP_\infty$ : $M$ is of type bi- $FP_\infty$ . This resolves the open question for this infinite family, implying they satisfy all previous one-sided finiteness properties.
Dimension Dichotomy:
- If $r$ is not a proper power, $M$ has Hochschild cohomological dimension at most 2.
- If $r$ is a proper power, $M$ has infinite Hochschild cohomological dimension.

Theorem 8.1: Non-Special One-Relator Monoids

The authors extend their scope to non-special one-relator monoids $M = \langle A \mid u = v \rangle$ that are incompressible (i.e., no non-empty word $r$ exists such that $u, v \in A^*r \cap rA^*$ ).

If $M$ is incompressible, it is of type bi- $FP_\infty$ and has Hochschild cohomological dimension at most 2.
This covers the "strictly aspherical" case, where the Squier complex is simply connected.

4. Significance and Impact

Resolution of a Major Open Problem: The paper proves that all one-relator monoids of the form $\langle A \mid r=1 \rangle$ are bi- $FP_\infty$ . This is the strongest possible homological finiteness result one could hope for in this context, as it implies all one-sided properties and the existence of finite complete rewriting systems (under certain conditions).
New Two-Sided Theory: The development of the two-sided theory for special monoids (specifically the structure of $N$ and the forest property of $\vec{\Gamma}/N$ ) is a significant theoretical advancement. It overcomes the limitations of previous one-sided approaches which could not establish bi- $FP_n$ properties.
Lyndon's Identity for Monoids: The results provide a monoid-theoretic analogue of Lyndon's Identity Theorem for groups, linking the homological properties of the monoid directly to its group of units.
Pathway to the General Case: The paper outlines a strategy for proving that all one-relator monoids (even non-special ones) are bi- $FP_\infty$ . By using compression techniques, any one-relator monoid reduces to either a special one-relator monoid (covered by Theorem B) or a strictly aspherical non-special monoid (covered by Theorem 8.1). The authors argue that understanding how bi- $FP_\infty$ behaves under compression is the remaining key step to solving the general problem.
Hochschild Dimension: The precise bounds on Hochschild cohomological dimension provide new insights into the complexity of the monoid's ring structure, distinguishing between torsion-free cases (dim $\le 2$ ) and torsion cases (infinite dim).

In summary, this paper bridges the gap between the well-understood homological theory of one-relator groups and the more complex theory of one-relator monoids, establishing a robust two-sided framework that proves the strongest known finiteness properties for a large and important class of monoids.