Twisted conjugacy and separability

This paper investigates the behavior of twisted and completely twisted conjugacy separability under subgroups, quotients, and finite extensions, ultimately proving that for polycyclic-by-nilpotent-by-finite groups, complete twisted conjugacy separability is equivalent to all quotients being residually finite.

The Gist

Imagine a group of people (a Group) where everyone has a specific way of interacting with one another. In mathematics, this is called a "group," and the interactions are like rules for mixing and matching elements.

This paper is about a concept called Separability. Think of separability as a way to tell people apart using a series of smaller, simpler "snapshots" (finite quotients). If you can take any two distinct people and find a snapshot where they look different, the group is "separable."

The author, Sam Tertoooy, is exploring a very specific, high-tech version of this: Twisted Conjugacy Separability.

Here is the breakdown using simple analogies:

1. The Basic Game: "Twisted" Conjugacy

In a normal group, two people are considered "the same" (conjugate) if you can swap them around using a third person.

• Normal Conjugacy: $A$ and $B$ are the same if $B = X \cdot A \cdot X^{-1}$. It's like rotating a shape; it's still the same shape, just turned.

Twisted Conjugacy adds a "glitch" or a "filter" (an automorphism $\phi$).

• Twisted Conjugacy: $A$ and $B$ are the same if $B = X \cdot A \cdot \phi(X)^{-1}$.
• The Analogy: Imagine you are trying to match two socks. In a normal world, you just look at them. In a "twisted" world, before you compare the second sock, you have to run it through a specific washing machine (the automorphism $\phi$) that changes its color slightly. If they still don't match after the wash, they are truly different.

Separability in this context means: If two socks look different even after the washing machine, can we prove it by showing them to a smaller, simpler committee (a finite quotient)? If the committee can always tell them apart, the group is Twisted Conjugacy Separable.

2. The Big Upgrade: "Complete" Separability

The paper introduces a new, super-powerful version called Complete Twisted Conjugacy Separability (CTCS).

• Standard Separability: We only check if the group can tell apart socks when the "washing machine" is a standard rule of the group itself.
• Complete Separability: We check if the group can tell apart socks no matter who brings the washing machine. It doesn't matter if the machine comes from inside the group or from a completely different group (any homomorphism $\phi, \psi$).

The Metaphor:
Imagine a security guard (the Group) at a club.

• Normal Separability: The guard checks IDs against the club's own database.
• Twisted Separability: The guard checks IDs, but the ID photos might have been slightly altered by the club's own photo editor.
• Complete Separability: The guard must be able to verify IDs even if the photos were altered by any external artist, from a different city, using a different style. If the guard can always spot the fakes, the club is "Completely Separable."

3. The "Nest" Connection

The paper connects this to a concept called Nests.

• What is a Nest? Imagine a set of nested Russian dolls, or a set of boxes inside boxes. In math, a "nest" is a specific collection of elements that behave nicely together (like subgroups or products of subgroups).
• The Discovery: The author proves a "Holy Grail" theorem: A group is "Completely Separable" if and only if it can separate all these "Nests."
• Why it matters: It's like finding a universal key. Instead of checking every single twisted sock scenario, you just need to check if the group can separate these specific "Nest" structures. If it can, it can do everything else too.

4. The Rules of the Game (Subgroups and Quotients)

The paper investigates how these properties behave when you break the group down:

• Subgroups (Taking a piece): If the whole club is secure, is a small VIP section also secure?
  • Result: For "Twisted" separability, No. A big secure group can have a small insecure section.
  • Result: For "Complete" separability, Yes. If the whole club is "Completely Separable," every piece of it is too.
• Quotients (Making a summary): If you summarize the club's rules into a smaller handbook, does the security hold?
  • Result: For "Twisted" separability, No.
  • Result: For "Complete" separability, Yes.

5. The Main Characters: Polycyclic-by-Nilpotent-by-Finite

The paper focuses on a specific, complex family of groups (think of them as "well-behaved" but slightly complicated groups).

• The Big Conclusion (Theorem B): For this specific family of groups, four different "superpowers" are actually the same thing. If a group has one, it has all of them:
  1. Strong Residual Finiteness: You can separate any normal subgroup.
  2. Extended Residual Finiteness: You can separate any subgroup.
  3. Nest Separability: You can separate all "Nests."
  4. Complete Twisted Conjugacy Separability: You can separate socks from any external washing machine.

Summary in One Sentence

This paper proves that for a certain class of complex mathematical groups, the ability to distinguish between elements using any possible "twisted" rule is exactly the same as being able to distinguish between any possible structural "nest" within the group, and this property is incredibly robust, surviving even when you break the group into smaller pieces or summarize it.

Why should you care?
In the real world, this kind of math helps us understand how complex systems (like encryption algorithms or crystal structures) hold together. If a system is "separable," it means we can always find a flaw or a distinction if one exists, which is crucial for proving things are secure or stable. The author has found a new, powerful way to test this stability.

Technical Summary

1. Problem Statement and Context

The paper addresses the study of separability properties in group theory, specifically focusing on the interaction between twisted conjugacy and various forms of residual finiteness.

• Twisted Conjugacy: Given a group $G$ and homomorphisms $\phi, \psi: H \to G$, two elements $g_1, g_2 \in G$ are $(\phi, \psi)$-twisted conjugate if $g_1 = \psi(h)g_2\phi(h)^{-1}$ for some $h \in H$. The equivalence classes are called $(\phi, \psi)$-twisted conjugacy classes.
• Separability: A subset $S \subseteq G$ is separable if for any $g \notin S$, there exists a finite quotient of $G$ where the image of $g$ is not in the image of $S$.
• The Gap: While Twisted Conjugacy Separability (TCS) (separability of classes under automorphisms) and Residual Finiteness with respect to Nests (NRF) (separability of specific subsets called "nests") are known properties, their relationship to each other and their behavior under group operations (subgroups, quotients, extensions) were not fully understood. Specifically, the paper introduces Complete Twisted Conjugacy Separability (CTCS), where separability holds for any pair of homomorphisms from any group $H$, not just automorphisms.

2. Methodology

The author employs a combination of structural group theory, profinite topology, and the theory of nests (a concept introduced by Stebe).

• Profinite Topology: The paper utilizes the finite-index topology and profinite completions ($\hat{G}$). It leverages the fact that in strongly complete profinite groups (where every finite index subgroup is open), twisted conjugacy classes are closed sets, implying separability.
• Nest Theory: The author uses Stebe's definition of nests (images of "pre-nests" under multiplication). A key methodological step is proving that every $(\phi, \psi)$-twisted conjugacy class is a nest, and conversely, every nest can be realized as a twisted conjugacy class of the identity for some homomorphisms.
• Induction and Extension Arguments: The proofs for specific group classes (nilpotent-by-finite, polycyclic-by-nilpotent-by-finite) rely on:
  • Induction on nilpotency class.
  • Analyzing central extensions and finite extensions.
  • Using derivations (maps satisfying $d(h_1h_2) = d(h_1)h_2d(h_2)$) and applying Kilsch's theorem regarding the closure of derivation images in polycyclic-by-finite groups.

3. Key Contributions

A. Definition of Complete Twisted Conjugacy Separability (CTCS)

The paper defines a group $G$ as CTCS if for any group $H$ and any homomorphisms $\phi, \psi: H \to G$, the $(\phi, \psi)$-twisted conjugacy classes are separable. This generalizes standard TCS (where $H=G$ and $\phi, \psi$ are automorphisms).

B. Equivalence of NRF and CTCS (Theorem A)

The most significant theoretical result is the equivalence between two seemingly different concepts:

Theorem A: A group is Residually Finite with respect to Nests (NRF) if and only if it is Completely Twisted Conjugacy Separable (CTCS).

This establishes that the study of nests (which unify subgroups, double cosets, and conjugacy classes) can be entirely framed through the lens of twisted conjugacy.

C. Stability Properties

The paper clarifies how these properties behave under standard group constructions:

• CTCS/NRF: Closed under subgroups, quotients, and finite extensions.
• TCS (Standard): Not closed under subgroups or quotients (counterexamples provided using $SL_n(\mathbb{Z})$ and $p$-adic integers).
• Comparison: The paper updates the hierarchy of separability properties, showing strict inclusions (e.g., $NRF \subsetneq TCS$ is false; rather $NRF = CTCS \subsetneq TCS$ in general, though $TCS$ is not closed under operations).

D. Characterization for Specific Group Classes (Theorem B)

The paper extends Menth's results on Strong Residual Finiteness (SRF) to the broader context of CTCS.

Theorem B: For a polycyclic-by-nilpotent-by-finite group $G$, the following are equivalent:

1. $G$ is Strongly Residually Finite (SRF).
2. $G$ is Extended Residually Finite (ERF).
3. $G$ is Residually Finite with respect to Nests (NRF).
4. $G$ is Completely Twisted Conjugacy Separable (CTCS).

This unifies several distinct separability notions for a wide class of solvable groups.

4. Key Results and Examples

• Counterexamples for TCS:
  • $SL_n(\mathbb{Z})$ ($n \ge 3$) is SRF but not Conjugacy Separable (CS), and its profinite completion is TCS while the group itself is not even CS. This proves TCS is not subgroup-closed.
  • The group of $p$-adic integers $\mathbb{Z}_p$ is TCS, but it has a quotient isomorphic to $\mathbb{Q}$, which is not residually finite. This proves TCS is not quotient-closed and not SRF.
• Construction of New CTCS Groups:
  Using the semidirect product of a polycyclic group and a nilpotent-by-finite ERF-group, the author constructs explicit examples of groups that are CTCS but are neither polycyclic-by-finite nor nilpotent-by-finite.

5. Significance

1. Unification of Concepts: The paper bridges the gap between "nest" separability (a geometric/combinatorial concept introduced by Stebe) and "twisted conjugacy" (a dynamical/algebraic concept). By proving $NRF \iff CTCS$, it allows researchers to use tools from twisted conjugacy to solve problems about nests and vice versa.
2. Resolution of Open Questions: It clarifies the behavior of twisted conjugacy separability under quotients and subgroups, showing that while the standard TCS property is fragile, the "complete" version (CTCS) is robust.
3. Extension of Menth's Theorem: It generalizes the equivalence of SRF, ERF, and NRF from nilpotent-by-finite groups to the larger class of polycyclic-by-nilpotent-by-finite groups, providing a comprehensive characterization of separability in these solvable groups.
4. Methodological Advancement: The use of derivations and Kilsch's theorem to handle the "polycyclic-by-nilpotent" case offers a new technical pathway for analyzing separability in groups with mixed structural properties.

In summary, the paper establishes that for a broad and important class of solvable groups, the ability to separate twisted conjugacy classes (even under arbitrary homomorphisms) is equivalent to the group being strongly residually finite and having all its quotients residually finite.