If w∈G′ is an element of the commutator subgroup of a group, we can define cl(w) as its minimal length with respect to the generating set of G′ consisting of all commutators. It is not hard to see that the quantity
scl(w)=n→∞limncl(wn)=ninfncl(wn)
is also well-defined. It is called the stable commutator length of w.
It turns out that scl is closely related to another class of objects: quasimorphisms on the group. We say that a function f:G→R is a quasimorphism if
D(f)=g,h∈Gsup∣f(gh)−f(g)−f(h)∣<∞.
Every quasimorphism is, in a certain sense, equivalent to a homogeneous one—that is, one satisfying f(xn)=nf(x). Denote the space of homogeneous quasimorphisms by Qh.
Here are a few non-obvious facts about scl(w) that we use:
If G is a free group, then the scl of every nontrivial element is at least 1/2.
If w=[x,y] is a single commutator, then scl(w)≤1/2.
The problem of computing scl(g) in a free group is decidable: there is an algorithm called scallop, based on linear programming.
Bavard duality says that
scl(g)=21f∈QhsupD(f)∣f(g)∣.
Brooks quasimorphisms (reference) are a family of functions parametrized by an element v∈F. They are defined as follows:
fv(g)=(number of occurrences of v in g)−(number of occurrences of v in g−1).
It is claimed that if v is cyclically minimal, then fv is a homogeneous quasimorphism.
All of this can be put to use in group theory. For example, one can ask: how are the properties of a one-relator group ⟨S∣r⟩, with its relator in the commutator subgroup, related to scl(r)? This is studied to some extent in this beautiful paper.
Let me also recall that the general isomorphism problem for one-relator groups is still open (there is a survey of the theory here). Using a computer search (and Claude), I recently found a counterexample to this conjecture (paper).
A counterexample
Let me recall the statement: suppose that r∈F(S)′ and r′∈F(S′)′, and
⟨S∣r⟩≅⟨S′∣r′⟩.
Must we then have scl(r)=scl(r′)?
Here is a counterexample. Take S=S′={a,b}, and let
r=aabABabABBAbaabABBAb,r′=aabABabABabABBAbaBAb.
It came out of a search for the first potential counterexample. The search was fairly simple.
First, observe that if ⟨S∣r⟩≅⟨S′∣r′⟩, then
⟨S∣r⟩ab≅Z∣S∣≅⟨S′∣r′⟩ab≅Z∣S′∣.
Thus, for our counterexample we need to take S=S′. We choose the first nontrivial case, S={a,b}, so we work with the group F=F(a,b).
Next, observe that if φ:F→F is an automorphism, then scl(φ(r))=scl(r). Therefore, we need to look for r and r′ in different orbits of the tautological action of Aut(F).
Then, with Claude's help, we construct unique representatives of the Aut(F)-orbits of elements of F′. For each representative we compute various invariants—also with Claude in my case—such as the number of homomorphisms to certain finite groups. If a pair r,r′ cannot be distinguished by our tests, we try to construct an isomorphism. This turns out not to be too difficult to do on a computer. Finally, for pairs r,r′ that we managed to prove define isomorphic groups, we compute scl(r) and scl(r′) using scallop—and victory: we have found a counterexample!
All that remains is to see, at least a little more humanly, that the scl values of these words really are different. For this example, that turns out not to be difficult:
By Bavard duality,
scl(r)≥2D(f)f(r)
for every homogeneous quasimorphism f. Take f=fv, the Brooks quasimorphism associated with v=bA. It turns out that D(fv)=2 and fv(r)=3, so the formula gives scl(r)≥3/4.
For r′, everything is simpler: it turns out that r′ is conjugate to a commutator:
r′=a[ab,ABabABabA]A.
Therefore, scl(r′)≤1/2 by the observation from the previous part. To be precise, we can also use the first observation from that part, which gives scl(r′)≥1/2. Thus scl(r′)=1/2.