Semigroup with Involution¶
An associative algebraic system with a self-undoing unary operation that reverses product order.
Core Idea¶
A semigroup with involution is a closed associative multiplication equipped with a unary star satisfying \((x^*)^*=x\) and \((xy)^*=y^*x^*\). Star is self-undoing as a function and reverses multiplication order. It need not be a multiplicative inverse: an identity element is not required, and \(xx^*=1\) does not follow from the two defining equations.[ref-3099fde2d905][ref-adf1cd6e41c0]
All square matrices under transpose and all binary relations under converse are examples, despite containing noninvertible elements. The broad structure should not be conflated with *-regular, Baer/Foulis, or involutive-monoid subtypes; those require additional conditions.
Scope of Application¶
The structure is used in abstract algebra wherever an associative product has a compatible order-reversing symmetry. Matrices over a field with transpose, relations with converse, groups with inversion and suitable word semigroups each realize the two laws. Extra conditions distinguish monoids, inverse semigroups or operator algebras; none is automatic from the broad definition.[ref-3099fde2d905][ref-73500a77f5cd][^ref-d9c5660f5902]
For a concrete contrast, transpose on all \(2\times2\) real matrices satisfies the star laws, but \(A=\begin{pmatrix}1&1\\0&0\end{pmatrix}\) obeys \(AA^{\mathsf T}=\operatorname{diag}(2,0)\ne I\). Similarly, converse of the one-way relation \(\{(1,2)\}\) reverses its arrow, while composition with the converse does not yield the identity relation on \(\{1,2\}\).[^ref-3099fde2d905]
Clarity¶
An involution here is not merely any self-inverse map. Both double application and product reversal must hold, so the test is \((x^*)^*=x\) and \((xy)^*=y^*x^*\). The terminology “formal inverse” describes the shape of these equations, not a guarantee of cancellation or actual undoing. The parent Semigroup has only an associative product; Monoid adds identity; Group adds actual inverses.[^ref-adf1cd6e41c0]
Manages Complexity¶
The two equations replace separate reversal calculations on each concrete carrier. They yield \((xyz)^*=z^*y^*x^*\) and the analogous rule for any finite product. They also expose assumptions: a proof using only these equations transfers among matrix and relation models; a proof needing \(xx^*=1\) or regularity belongs to a narrower class. Thus the abstraction compresses valid calculations while marking where further structure is indispensable.[ref-3099fde2d905][ref-73500a77f5cd]
Abstract Reasoning¶
To recognize an instance, identify its carrier and product, verify closure and associativity, then check star is total and satisfies both equations for arbitrary elements. To reason from an instance, reverse product order when star is applied, but do not cancel a factor by its star unless an additional inverse law has been proved. A singular matrix and a one-way relation are useful countertests for overstrong claims.[^ref-3099fde2d905]
Knowledge Transfer¶
The exact equations transfer among several mathematical carriers, not just one matrix notation. The broader portable structure is the live Semigroup prime, which every admitted instance inherits. The extra star operation makes this a domain-specific algebraic species: calling a social action “reversible” by analogy does not instantiate the formal laws.[^ref-3099fde2d905]
[^ref-3099fde2d905]: Wen-Ting Zhang, Meng Gao and Yan-Feng Luo, “Equational Theories of the Boolean Matrix Monoid BRn with Involutions,” Journal of Algebra 685 (2026), pp. 225–270, original publisher Introduction and Section 3 preview. [^ref-adf1cd6e41c0]: Edmond W. H. Lee, “Embedding Finite Involution Semigroups in Matrices with Transposition,” Discrete Applied Mathematics 340 (2023), pp. 327–330, original publisher abstract and definition snippet. [^ref-73500a77f5cd]: D. Easdown and W. D. Munn, “On Semigroups with Involution,” Bulletin of the Australian Mathematical Society 48(1) (1993), pp. 93–100, original publisher extract. [^ref-d9c5660f5902]: W. D. Munn, “Special Involutions,” in Semigroup Theory and its Applications (1996), pp. 157–165, original publisher preview.
Relationships to Other Abstractions¶
Current abstraction Semigroup with Involution Domain-specific
Parents (1) — more general patterns this builds on
-
Semigroup with Involution is a kind of Semigroup Prime
Forgetting the involution leaves the child's closed associative multiplication, a semigroup.
Hierarchy paths (4) — routes to 4 parentless roots
- Semigroup with Involution → Semigroup → Set and Membership
- Semigroup with Involution → Semigroup → Closure
- Semigroup with Involution → Semigroup → Associativity → Invariance
- Semigroup with Involution → Semigroup → Associativity → Symmetry
Neighborhood in Abstraction Space¶
Semigroup with Involution sits in a moderately populated region (57th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Algebraic Structures & Order Relations (18 abstractions)
Nearest neighbors
- Inverse Semigroup — 0.87
- Inverse Element — 0.86
- Power Associativity — 0.85
- Division Algebra — 0.85
- Ring — 0.85
Computed from structural-signature embeddings · 2026-10-08