Recognition: no theorem link
An improved characterisation of inner automorphisms of groups
Pith reviewed 2026-05-11 01:47 UTC · model grok-4.3
The pith
Every group embeds malnormally into a simple, complete co-Hopfian group so that endomorphisms extend if and only if they are inner automorphisms.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We show that every group G embeds malnormally into a simple, complete co-Hopfian group H. This implies that a non-trivial endomorphism of G extends to H if and only if it is an inner automorphism, strengthening a theorem of Schupp and answering a question of Bergman.
What carries the argument
The malnormal embedding of G into a simple complete co-Hopfian group H, which forces non-inner endomorphisms of G to fail to extend.
Load-bearing premise
An explicit construction must exist that produces, for every group G, a malnormal embedding into some simple complete co-Hopfian group H.
What would settle it
A concrete group G together with a non-inner endomorphism of G that extends to an endomorphism of every simple complete co-Hopfian overgroup H containing G malnormally would falsify the claim.
read the original abstract
We show that every group $G$ embeds malnormally into a simple, complete co-Hopfian group $H$. This implies that a non-trivial endomorphism of $G$ extends to $H$ if and only if it is an inner automorphism, strengthening a theorem of Schupp and answering a question of Bergman.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that every group G admits a malnormal embedding into a simple, complete, co-Hopfian group H. This is used to characterize the inner automorphisms of G as precisely those non-trivial endomorphisms that extend to endomorphisms of H, strengthening a theorem of Schupp and answering a question of Bergman.
Significance. If the construction holds, the result supplies a concrete realization of four strong properties (malnormality, simplicity, completeness, co-Hopfian) in a single supergroup H for arbitrary G. This yields a clean, formal characterization of inner automorphisms via extendability and advances the study of automorphism groups and special embeddings in combinatorial group theory. The explicit construction is a strength that could serve as a template for related embedding problems.
minor comments (2)
- The main construction realizing the four properties simultaneously is technical; a high-level roadmap or diagram outlining the steps before the detailed verification would improve accessibility for readers.
- The introduction states the strengthening of Schupp's theorem but does not include a side-by-side comparison of the new characterization with the prior one; adding this would clarify the precise improvement.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our manuscript, the accurate summary of the main result, and the recommendation for minor revision. The referee's description correctly captures the embedding theorem and its application to the characterization of inner automorphisms, strengthening Schupp's theorem and addressing Bergman's question.
Circularity Check
No significant circularity; existence proof is self-contained
full rationale
The paper establishes an explicit malnormal embedding of arbitrary G into a simple complete co-Hopfian H via a concrete (technical) construction. The subsequent characterisation of inner automorphisms follows formally from the four properties of H (simplicity, completeness, co-Hopfian, malnormality) without any reduction to fitted parameters, self-definitional loops, or load-bearing self-citations whose justification collapses into the present argument. No step equates a derived quantity to its own input by construction, and the result is externally falsifiable via the supplied embedding.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
G. M. Bergman, An inner automorphism is only an inner automorphism, but an inner endomorphism can be something strange, Publ. Mat. 56 (2012), no. 1, 91--126. 2918185
work page 2012
-
[2]
M. R. Bridson and H. Short, Complete embeddings of groups, Bull. Aust. Math. Soc. 110 (2024), no. 1, 136--144. 4802721
work page 2024
-
[3]
Chirvasitu, Extensible endomorphisms of compact groups, Transform
A. Chirvasitu, Extensible endomorphisms of compact groups, Transform. Groups (2026), 1--19
work page 2026
-
[4]
S. M. Corson, J\' o nsson groups of various cardinalities , Proc. Amer. Math. Soc. 150 (2022), no. 7, 2771--2775. 4428866
work page 2022
-
[5]
Garner, Inner automorphisms of groupoids, Theory Appl
R. Garner, Inner automorphisms of groupoids, Theory Appl. Categ. 42 (2024), Paper No. 5, 84--101. 4768951
work page 2024
-
[6]
Higman, Subgroups of finitely presented groups, Proc
G. Higman, Subgroups of finitely presented groups, Proc. Roy. Soc. London Ser. A 262 (1961), 455--475. 130286
work page 1961
-
[7]
O. H. Kegel, Regular limits of infinite symmetric groups, Ischia group theory 2008, World Sci. Publ., Hackensack, NJ, 2009, pp. 120--130. 2816427
work page 2008
-
[8]
B. Kaya, M. Kuzucuo g lu, P. Longobardi, and M. Maj, Limit groups and automorphisms of -existentially closed groups , J. Algebra 666 (2025), 840--849. 4842656
work page 2025
-
[9]
E. I. Khukhro and V. D. Mazurov, Unsolved problems in group theory. the K ourovka notebook , arXiv:1401.0300
work page internal anchor Pith review Pith/arXiv arXiv
-
[10]
A. Minasyan, Does every group embed into a co-hopfian group?, MathOverflow, URL:https://mathoverflow.net/q/164104 (version: 2014-04-23)
work page 2014
-
[11]
C. F. Miller, III and P. E. Schupp, Embeddings into H opfian groups , J. Algebra 17 (1971), 171--176. 269728
work page 1971
-
[12]
B. H. Neumann, Some remarks on infinite groups, J. London Math. Soc. 1 (1937), no. 2, 120--127
work page 1937
-
[13]
V. N. Obraztsov, An embedding theorem for groups and its corollaries, Mat. Sb. 180 (1989), no. 4, 529--541, 560. 997899
work page 1989
-
[14]
, On infinite complete groups, Comm. Algebra 22 (1994), no. 14, 5875--5887. 1298755
work page 1994
-
[15]
, Embedding into groups with well-described lattices of subgroups, Bull. Austral. Math. Soc. 54 (1996), no. 2, 221--240. 1411532
work page 1996
-
[16]
, A new embedding scheme for groups and some applications, J. Austral. Math. Soc. Ser. A 61 (1996), no. 2, 267--288. 1405540
work page 1996
-
[17]
A. Yu. Olshanskii, An infinite group with subgroups of prime orders, Izv. Akad. Nauk SSSR Ser. Mat. 44 (1980), no. 2, 309--321, 479. 571100
work page 1980
-
[18]
, Efficient embeddings of countable groups, Vestnik Moskov. Univ. Ser. I Mat. Mekh. (1989), no. 2, 28--34, 105. 1029497
work page 1989
-
[19]
, Geometry of defining relations in groups, Mathematics and its Applications (Soviet Series), vol. 70, Kluwer Academic Publishers Group, Dordrecht, 1991, Translated from the 1989 Russian original by Yu. A. Bakhturin. 1191619
work page 1991
-
[20]
Parker, Inner automorphisms of presheaves of groups, Appl
J. Parker, Inner automorphisms of presheaves of groups, Appl. Categ. Structures 31 (2023), no. 2, Paper No. 20, 41. 4572141
work page 2023
-
[21]
M. R. Pettet, On inner automorphisms of finite groups, Proc. Amer. Math. Soc. 106 (1989), no. 1, 87--90. 968625
work page 1989
-
[22]
P. E. Schupp, A characterization of inner automorphisms, Proc. Amer. Math. Soc. 101 (1987), no. 2, 226--228. 902532
work page 1987
-
[23]
Shelah, On a problem of K urosh, J \' o nsson groups, and applications , Word problems, II ( C onf
S. Shelah, On a problem of K urosh, J \' o nsson groups, and applications , Word problems, II ( C onf. on D ecision P roblems in A lgebra, O xford, 1976), Stud. Logic Found. Math., vol. 95, North-Holland, Amsterdam-New York, 1980, pp. 373--394. 579953
work page 1976
-
[24]
Tryba, On J \' o nsson cardinals with uncountable cofinality , Israel J
J. Tryba, On J \' o nsson cardinals with uncountable cofinality , Israel J. Math. 49 (1984), no. 4, 315--324. 788256
work page 1984
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.