Lesson plan

Semigroup with involution

In mathematics, particularly in abstract algebra, a semigroup with involution, or a *-semigroup, is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: * Uniqueness * Double application "cancelling itself out". * The same interaction law with the binary operation as in the case of the group inverse. It is thus not a surprise that any group is a semigroup with involution. However, there are significant natural examples of semigroups with involution that are not groups. An example from linear algebra is a set of real-valued n-by-n square matrices with the matrix-transpose as the involution. The map which sends a matrix to its transpose is an involution because the transpose is well defined for any matrix and obeys the law , which has the same form of interaction with multiplication as taking inverses has in the general linear group (which is a subgroup of the full linear monoid). However, for an arbitrary matrix, AA T does not equal the identity element (namely the diagonal matrix).…

Back to article

Article summary

In mathematics, particularly in abstract algebra, a semigroup with involution, or a *-semigroup, is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: * Uniqueness * Double application "cancelling itself out". * The same interaction law with the binary operation as in the case of the group inverse. It is thus not a surprise that any group is a semigroup with involution. However, there are significant natural examples of semigroups with involution that are not groups. An example from linear algebra is a set of real-valued n-by-n square matrices with the matrix-transpose as the involution. The map which sends a matrix to its transpose is an involution because the transpose is well defined for any matrix and obeys the law , which has the same form of interaction with multiplication as taking inverses has in the general linear group (which is a subgroup of the full linear monoid). However, for an arbitrary matrix, AA T does not equal the identity element (namely the diagonal matrix).…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.