Hostname: page-component-74656f9884-kv2lp Total loading time: 0 Render date: 2026-11-05T16:25:55.145Z Has data issue: false hasContentIssue false

Every non-trivial knot group is fully residually perfect

Published online by Cambridge University Press:  07 August 2026

TETSUYA ITO
Affiliation:
Department of Mathematics, Kyoto University, Kyoto 606-8502, Japan. e-mail: tetitoh@math.kyoto-u.ac.jp
KIMIHIKO MOTEGI
Affiliation:
Department of Mathematics, Nihon University, 3-25-40 Sakurajosui, Setagaya-ku, Tokyo 156–8550, Japan. e-mail: motegi.kimihiko@nihon-u.ac.jp
MASAKAZU TERAGAITO
Affiliation:
Department of Mathematics Education, Hiroshima University, 1-1-1 Kagamiyama, Higashi-Hiroshima, 739–8524, Japan. e-mail: teragai@hiroshima-u.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

Given a class $\mathcal{P}$ of groups we say that a group G is fully residually $\mathcal{P}$ if for any finite subset F of G, there exists an epimorphism from G to a group in $\mathcal{P}$ which is injective on F. It is known that any non-trivial knot group is fully residually finite, but not residually free. For hyperbolic knots, its knot group is fully residually closed hyperbolic 3–manifold group, and such a group is fully residually simple. In this paper, we show that every non-trivial knot group is fully residually perfect, closed 3–manifold group.

Information

Type
Research Article
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of The Cambridge Philosophical Society
Figure 0

Fig. 1. The subgroups π1(Ei)$\pi_1(E_i)$.

Figure 1

Fig. 2. Decomposition of elements as products of elements in factor groups.

Figure 2

Fig. 3. Graph of groups.

Figure 3

Fig. 4. A graph of groups (G,YE(K))$(G, Y_{E(K)})$ and an oriented closed path in YE(K)$Y_{E(K)}$.

Figure 4

Fig. 5. backtrack condition: xi∉Gyit(yi)⊂Gt(yi)$x_i \not\in G_{y_i}^{t(y_i)} \subset G_{t(y_i)}$ for a backtrack yixiyi+1=yixiyi¯$y_i x_i y_{i+1} = y_i x_i \overline{y_i}$.

Figure 5

Fig. 6. g=g1g2g3g4$g = g_1g_2g_3g_4$ and its corresponding graphical word |c,g|=x0y1x1y2x2y3$|c, g| = x_0 y_1 x_1 y_2 x_2 y_3 $x3y4x4y5x5y6x6$x_3 y_4 x_4 y_5 x_5 y_6 x_6$; x0=1,x1=g1,x2=1,x3=g2,x4=g3,x5=g4,x6=1$x_0 = 1, x_1 = g_1, x_2 = 1, x_3 = g_2, x_4 = g_3, x_5 = g_4, x_6 = 1$ and y2=y1¯,$y_2 = \overline{y_1},$y4=y3¯,y6=y5¯$y_4 = \overline{y_3}, y_6 = \overline{y_5}$.