Recognition: unknown
The Inverse Monoid of Partial Inner Automorphisms of a Semigroup
Pith reviewed 2026-05-09 20:21 UTC · model grok-4.3
The pith
Every semigroup admits a canonical inverse monoid formed by its partial 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 introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner automorphisms with a zero adjoined. We then describe this structure for completely simple semigroups, the full transformation monoid, and the endomorphism monoid of a finite G-set when G is a finite abelian group.
What carries the argument
The inverse monoid of partial inner automorphisms, obtained by equipping the collection of all partial inner automorphisms of a semigroup with multiplication and inversion operations that satisfy the inverse monoid axioms.
If this is right
- Groups produce their ordinary inner automorphism group with an extra zero element adjoined.
- Completely simple semigroups admit an explicit description of this inverse monoid.
- The full transformation monoid on a finite set has its partial inner automorphisms forming a concrete inverse monoid.
- Endomorphism monoids of finite G-sets with G abelian likewise receive explicit descriptions.
- Several open problems about further properties and examples of the construction are posed.
Where Pith is reading between the lines
- The construction supplies a uniform way to attach an inverse semigroup to each semigroup that might be studied as a functor between the two categories.
- Properties of the resulting inverse monoid could be used to distinguish or classify different semigroups.
- The explicit calculations for standard examples such as transformation monoids suggest possible algorithmic approaches to computing the monoid in finite cases.
Load-bearing premise
The partial inner automorphisms of an arbitrary semigroup can be equipped with operations that turn them into an inverse monoid.
What would settle it
A concrete semigroup whose set of partial inner automorphisms fails to form an inverse monoid under any choice of multiplication and inversion operations.
read the original abstract
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner automorphisms with a zero adjoined. We then describe this structure for completely simple semigroups, the full transformation monoid, and the endomorphism monoid of a finite $G$-set when $G$ is a finite abelian group. The paper ends with some open problems.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces the inverse monoid of partial inner automorphisms of an arbitrary semigroup S. Partial inner automorphisms are defined as partial maps on S induced by conjugation with elements of S. The set of all such partial maps is equipped with a composition operation and an inversion operation, and the manuscript verifies that this structure satisfies the axioms of an inverse monoid (including the existence of a zero element). Special cases are derived explicitly: when S is a group the resulting monoid is the inner automorphism group with a zero adjoined; descriptions are also given for completely simple semigroups, the full transformation monoid, and the endomorphism monoid of a finite G-set with G finite abelian. The paper concludes with open problems.
Significance. If the central construction holds, the paper supplies a uniform, assumption-free method for associating an inverse monoid to every semigroup via its partial inner automorphisms. This directly generalizes the inner automorphism group of a group and recovers known structures in the treated special cases. The explicit, parameter-free derivations for completely simple semigroups and transformation monoids, together with the direct verification of the inverse-monoid axioms from the definitions, constitute a concrete contribution to the structural theory of semigroups.
major comments (2)
- §3, definition of the composition operation: the manuscript must explicitly confirm that the domain of the composite partial map is always a subset of the domain of the first factor, as required for the partial-map category; the current sketch leaves the domain calculation implicit.
- §4, verification of a a^{-1} a = a: the argument relies on the fact that conjugation by s and s^{-1} are mutual inverses on their common domain, but the proof should include a short diagram or equation showing that the domains match exactly when the idempotents commute.
minor comments (3)
- The notation for the zero element of the inverse monoid is introduced without a dedicated symbol; a consistent symbol (e.g., 0 or ⊥) would improve readability across sections.
- In the treatment of the full transformation monoid, the explicit description of the idempotents could be cross-referenced to the general case in §2 to highlight the specialization.
- A brief remark on how the construction behaves for the empty semigroup or the trivial semigroup would clarify the boundary cases.
Simulated Author's Rebuttal
We thank the referee for the positive evaluation and the precise suggestions that will improve the clarity of the exposition. We address each major comment below.
read point-by-point responses
-
Referee: §3, definition of the composition operation: the manuscript must explicitly confirm that the domain of the composite partial map is always a subset of the domain of the first factor, as required for the partial-map category; the current sketch leaves the domain calculation implicit.
Authors: We agree that an explicit verification is needed. In the revised manuscript we will insert a direct computation showing that if φ_s and φ_t are partial inner automorphisms, then dom(φ_s ∘ φ_t) ⊆ dom(φ_s), using the definition of composition of partial maps on the semigroup. revision: yes
-
Referee: §4, verification of a a^{-1} a = a: the argument relies on the fact that conjugation by s and s^{-1} are mutual inverses on their common domain, but the proof should include a short diagram or equation showing that the domains match exactly when the idempotents commute.
Authors: We accept the suggestion. The revised proof of a a^{-1} a = a will contain an additional short equation chain that records the precise equality of domains once the relevant idempotents are shown to commute. revision: yes
Circularity Check
No significant circularity identified
full rationale
The paper defines partial inner automorphisms of an arbitrary semigroup S via conjugation by elements of S (extended to partial maps), equips the collection with composition and inversion, and directly verifies the inverse monoid axioms including a zero element, associativity, and the relations a a^{-1} a = a together with commuting idempotents. This is a standard definitional construction followed by explicit proof of the claimed properties; the result does not reduce to its inputs by construction, nor does it rely on load-bearing self-citations, fitted parameters renamed as predictions, or imported uniqueness theorems. Special cases for groups, completely simple semigroups, and transformation monoids are derived as corollaries from the general construction rather than presupposed. The derivation is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
Ara´ ujo, J.P
J. Ara´ ujo, J.P. Ara´ ujo, W. Bentz, P.J. Cameron, and P. Spiga, A transversal property for permutation groups motivated by partial transformations,J. Algebra573(2021), 741–759
2021
-
[2]
Ara´ ujo, W
J. Ara´ ujo, W. Bentz, and P.J. Cameron, Orbits of primitive k-homogenous groups on (n−k)-partitions with applications to semigroups,Trans. Amer. Math. Soc.371(2019), 105–136
2019
-
[3]
Ara´ ujo, W
J. Ara´ ujo, W. Bentz, and P.J. Cameron, The existential transversal property: a generalization of homo- geneity and its impact on semigroups,Trans. Amer. Math. Soc.374(2021), 1155–1195
2021
-
[4]
Ara´ ujo, W
J. Ara´ ujo, W. Bentz, P.J. Cameron, M. Kinyon, and J. Konieczny, Matrix theory for independence algebras,Linear Algebra Appl.642(2022), 221–250
2022
-
[5]
Ara´ ujo, W
J. Ara´ ujo, W. Bentz, M. Kinyon, J. Konieczny, A. Malheiro, and V. Mercier,Conjugacy in abstract semigroups, transformation and diagram monoids, and conjugacy growth, to appear
-
[6]
Ara´ ujo and P.J
J. Ara´ ujo and P.J. Cameron, Two generalizations of homogeneity in groups with applications to regular semigroups,Trans. Amer. Math. Soc.368(2016), 1159–1188
2016
-
[7]
Ara´ ujo, P.J
J. Ara´ ujo, P.J. Cameron, and B. Steinberg, Between primitive and 2-transitive: synchronization and its friends,EMS Surv. Math. Sci.4(2017), 101–184. 25
2017
-
[8]
Ara´ ujo, M
J. Ara´ ujo, M. Kinyon, and J. Konieczny, Conjugacy in inverse semigroups,J. Algebra,533(2019), 142–173
2019
-
[9]
Ara´ ujo, M
J. Ara´ ujo, M. Kinyon, J. Konieczny, and A. Malheiro, Four notions of conjugacy for abstract semigroups, Proc. Roy. Soc. Edinburgh Sect. A147(2017), 1169–1214
2017
-
[10]
Ara´ ujo and J
J. Ara´ ujo and J. Konieczny, Automorphisms of endomorphism monoids of relatively free bands,Proc. Edinb. Math. Soc.50(2007), 1–21
2007
-
[11]
Ara´ ujo, J
J. Ara´ ujo, J. Konieczny, and A. Malheiro, Conjugation in semigroups,J. Algebra403(2014), 93–134
2014
-
[12]
Ara´ ujo, J.M
J. Ara´ ujo, J.M. Mitchell, and N. Silva, On generating countable sets of endomorphisms,Alg. Univers. 50(2003), 61–67
2003
-
[13]
Ara´ ujo and F
J. Ara´ ujo and F. Wehrung, Embedding properties of endomorphism semigroups,Fund. Math.202(2009), 125–146
2009
-
[14]
Baumslag, Automorphism groups of residually finite groups,J
G. Baumslag, Automorphism groups of residually finite groups,J. London Math. Soc.38(1963), 117– 118
1963
-
[15]
Borralho and M
M. Borralho and M. Kinyon, Variants of epigroups and primary conjugacy,Comm. Algebra48(2020), no. 12, 5465–5473
2020
-
[16]
P.J. Cameron, Endomorphisms and partial isomorphisms,Semigroup Forum(2025).https://doi.org/ 10.1007/s00233-025-10514-5
-
[17]
Cameron and C
P.J. Cameron and C. Szab´ o, Independence algebras,J. London Math. Soc. (2)61(2000), 321–334
2000
-
[18]
Ceccherini-Silberstein and M
T. Ceccherini-Silberstein and M. Coornaert,Cellular automata and groups, 2nd ed., Springer Monogr. Math., Springer, Cham, 2023
2023
-
[19]
Clifford and G.B
A.H. Clifford and G.B. Preston,The Algebraic Theory of Semigroups, Mathematical Surveys, No. 7, Amer. Math. Soc., Providence, Rhode Island, 1964 (Vol. I) and 1967 (Vol. II)
1964
-
[20]
V. D. Derech, Classification of finite commutative semigroups for which the inverse monoid of local automorphisms is a ∆-semigroup,Ukra¨ ın. Mat. Zh.67(2015), 867–873; translation inUkrainian Math. J.67(2015), 981–988
2015
-
[21]
V. D. Derech, Complete classification of finite semigroups for which the inverse monoid of local auto- morphisms is a permutable semigroup,Ukra¨ ın. Mat. Zh.68(2016), 1571–1578; translation inUkrainian Math. J.68(2017), 1820–1828
2016
-
[22]
V. D. Derech, Complete classification of finite semigroups for which the inverse monoid of local auto- morphisms is a ∆-semigroup,Semigroup Forum102(2021), 397–407
2021
-
[23]
O. I. Domanov, Semigroups of all partial automorphisms of universal algebras. (Russian)Izv. Vysˇ s. Uˇ cebn. Zaved. Matematika1971(1971), no. 8(111), 52–58
1971
-
[24]
Fernandes, Presentations for some monoids of partial transformations on a finite chain: a survey, Semigroups, Algorithms, Automata and Languages, Coimbra, 2001, 363–378, World Sci
V.H. Fernandes, Presentations for some monoids of partial transformations on a finite chain: a survey, Semigroups, Algorithms, Automata and Languages, Coimbra, 2001, 363–378, World Sci. Publ., River Edge, NJ (2002)
2001
-
[25]
D. G. FitzGerald, Representations of inverse monoids by partial automorphisms,Semigroup Forum61 (2000), no. 3, 357–362
2000
-
[26]
Ganyushkin and V
O. Ganyushkin and V. Mazorchuk,Classical finite transformation semigroups: an introduction, Algebra and Applications9, Springer-Verlag, London, 2010. 26
2010
-
[27]
Garreta and R
A. Garreta and R. D. Gray, On equations and first-order theory of one-relator monoids,Inform. Comput. 281(2021), Paper No. 104745, 19 pp
2021
-
[28]
S. M. Goberstein,PA-isomorphisms of inverse semigroups,Algebra Universalis53(2005), 407–432
2005
-
[29]
S. M. Goberstein, Inverse semigroups determined by their partial automorphism monoids,J. Aust. Math. Soc.81(2006), 185–198
2006
-
[30]
Gould, Independence algebras,Alg
V. Gould, Independence algebras,Alg. Univers.33(1995), 294–318
1995
-
[31]
Gray, Idempotent rank in endomorphism monoids of finite independence algebras,Proc
R. Gray, Idempotent rank in endomorphism monoids of finite independence algebras,Proc. Roy. Soc. Edinb. Sect. A137(2007), 303–331
2007
-
[32]
Howie,Fundamentals of semigroup theory, Oxford University Press, New York, 1995
J.M. Howie,Fundamentals of semigroup theory, Oxford University Press, New York, 1995
1995
-
[33]
Jack, On the complexity of inverse semigroup conjugacy,Semigroup Forum106(2023), no
T. Jack, On the complexity of inverse semigroup conjugacy,Semigroup Forum106(2023), no. 3, 618– 632
2023
-
[34]
Jack,Answering five open problems involving semigroup conjugacy, arXiv:2411.16284, 2024
T. Jack,Answering five open problems involving semigroup conjugacy, arXiv:2411.16284, 2024
-
[35]
M. Kinyon and D. Stanovsk´ y, Abelianness and centrality in inverse semigroups,Proc. Edinburgh Math. J., to appear.arXiv:2209.13805
-
[36]
Konieczny, A new definition of conjugacy for semigroups,J
J. Konieczny, A new definition of conjugacy for semigroups,J. Algebra and Appl.17(2018), 1850032, 20 pp
2018
-
[37]
Kudryavtseva and V
G. Kudryavtseva and V. Mazorchuk, On conjugation in some transformation and Brauer-type semi- groups,Publ. Math. Debrecen70(2007), 19–43
2007
-
[38]
Liu and S
X. Liu and S. Wang, The transitivity of primary conjugacy in regularω-semigroups,Open Math.20 (2022), no. 1, 1479–1508
2022
-
[39]
Mitsch, A natural partial order for semigroups,Proc
H. Mitsch, A natural partial order for semigroups,Proc. Amer. Math. Soc.97(1986), 384–388
1986
-
[40]
Narendran and F
P. Narendran and F. Otto, Complexity results on the conjugacy problem for monoids,Theoret. Comput. Sci.35(1985), no. 2–3, 227–243
1985
-
[41]
Narendran, F
P. Narendran, F. Otto, and K. Winklmann, The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete,Inform. Control63(1984), no. 1–2, 58–66
1984
-
[42]
Otto, Conjugacy in monoids with a special Church-Rosser presentation is decidable,Semigroup Forum 29(1984), no
F. Otto, Conjugacy in monoids with a special Church-Rosser presentation is decidable,Semigroup Forum 29(1984), no. 1–2, 223–240
1984
-
[43]
G. B. Preston, Inverse semigroups: some open questions,Proceedings of a Symposium on Inverse Semi- groups and their Generalisations (Northern Illinois Univ., DeKalb, Ill., 1973), pp. 122–139, Northern Illinois University, De Kalb, IL, 1973
1973
-
[44]
Preston, A note on representations of inverse semigroups,Proc
G. Preston, A note on representations of inverse semigroups,Proc. Amer. Math. Soc.8(1957), 1144– 1147
1957
-
[45]
Shevrin, Epigroups, inStructural theory of automata, semigroups, and universal algebra, 331–380, NATO Sci
L.N. Shevrin, Epigroups, inStructural theory of automata, semigroups, and universal algebra, 331–380, NATO Sci. Ser. II Math. Phys. Chem., 207, Springer, Dordrecht, 2005
2005
-
[46]
Steinberg,The representation theory of finite monoids, Springer Monographs in Mathematics, Springer, New York, 2015
B. Steinberg,The representation theory of finite monoids, Springer Monographs in Mathematics, Springer, New York, 2015
2015
-
[47]
Steinberg, Linear conjugacy,Canad
B. Steinberg, Linear conjugacy,Canad. Math. Bull.62(2019), 886–895
2019
-
[48]
Zhang, Conjugacy in special monoids,J
L. Zhang, Conjugacy in special monoids,J. Algebra143(1991), no. 2, 487–497
1991
-
[49]
Zhang, Applying rewriting methods to special monoids,Math
L. Zhang, Applying rewriting methods to special monoids,Math. Proc. Cambridge Philos. Soc.112 (1992), no. 3, 495–505. 27
1992
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.