Semigroup with two elements

Uses your system voice; voice and rate in settings.

Snapshot

≈ 6 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a semigroup with two elements is a semigroup for which the cardinality of the underlying set is two. There are exactly five nonisomorphic semigroups having two elements: * O 2 , the null semigroup of order two. * LO 2 , the left zero semigroup of order two. * RO 2 , the right zero semigroup of order two. * ({0,1}, ∧) (where "∧" is the logical connective "and"), or equivalently the set {0,1} under multiplication: the only semilattice with two elements and the only non-null semigroup with zero of order two, also a monoid, and ultimately the two-element Boolean algebra; this is also isomorphic to (Z 2 , · 2 ), the multiplicative group of {0,1} modulo 2. * (Z 2 , + 2 ) (where Z 2 = {0,1} and "+ 2 " is "addition modulo 2"), or equivalently ({0,1}, ⊕) (where "⊕" is the logical connective "xor"), or equivalently the set {−1,1} under multiplication: the only group of order two. The semigroups LO 2 and RO 2 are antiisomorphic. O 2 , and are commutative, and LO 2 and RO 2 are noncommutative. LO 2 , RO 2 and are bands.

In mathematics, a semigroup with two elements is a semigroup for which the cardinality of the underlying set is two. There are exactly five nonisomorphic semigroups having two elements: O 2 , the null semigroup of order two. LO 2 , the left zero semigroup of order two. RO 2 , the right zero semigroup of order two. ({0,1}, ∧) (where "∧" is the logical connective "and"), or equivalently the set {0,1} under multiplication: the only semilattice with two elements and the only non-null semigroup with zero of order two, also a monoid, and ultimately the two-element Boolean algebra; this is also isomorphic to (Z 2 , · 2 ), the multiplicative group of {0,1} modulo 2. (Z 2 , + 2 ) (where Z 2 = {0,1} and "+ 2 " is "addition modulo 2"), or equivalently ({0,1}, ⊕) (where "⊕" is the logical connective "xor"), or equivalently the set {−1,1} under multiplication: the only group of order two. The semigroups LO 2 and RO 2 are antiisomorphic. O 2 , and are commutative, and LO 2 and RO 2 are noncommutative. LO 2 , RO 2 and are bands. |align="center"| |align="center"| |align="center"| |- |  Null semigroup O 2   |  ≡ Semigroup   |  ,   |  Left zero semigroup LO 2   |- |align="center"| |align="center"| |align="center"| |align="center"| |- |  ,   |  Right zero semigroup RO 2   |  ≡ Group   |  ≡ Semigroup |- |align="center"| | align="center"| | align="center"| |align="center"| |- |  ,   |  ≡ Group   |  ,   |  ,   |- |align="center"| |align="center"| |align="center"| |align="center"| |- |  ,   |  ,   |  ,   |  Null semigroup O 2   |} In this table: The semigroup denotes the two-element semigroup containing the zero element 0 and the unit element 1. The two binary operations defined by matrices in a green background are associative and pairing either with A creates a semigroup isomorphic to the semigroup . Every element is idempotent in this semigroup, so it is a band. Furthermore, it is commutative (abelian) and thus a semilattice. The order induced is a linear order, and so it is in fact a lattice and it is also a distributive and complemented lattice, i.e. it is actually the two-element Boolean algebra. The two binary operations defined by matrices in a blue background are associative and pairing either with A creates a semigroup isomorphic to the null semigroup O 2 with two elements. The binary operation defined by the matrix in an orange background is associative and pairing it with A creates a semigroup. This is the left zero semigroup LO 2 . It is not commutative. The binary operation defined by the matrix in a purple background is associative and pairing it with A creates a semigroup. This is the right zero semigroup RO 2 . It is also not commutative. The two binary operations defined by matrices in a red background are associative and pairing either with A creates a semigroup isomorphic to the group . The remaining eight binary operations defined by matrices in a white background are not associative and hence none of them create a semigroup when paired with A. This is the simplest non-trivial example of a semigroup that is not a group. This semigroup has an identity element, 1, making it a monoid. It is also commutative. It is not a group because the element 0 does not have an inverse, and is not even a cancellative semigroup because we cannot cancel the 0 in the equation 1·0 = 0·0. This semigroup arises in various contexts. For instance, if we choose 1 to be the truth value "true" and 0 to be the truth value "false" and the operation to be the logical connective "and", we obtain this semigroup in logic. It is isomorphic to the monoid {0,1} under multiplication. It is also isomorphic to the semigroup S = \left\{ \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}, \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix} \right\} under matrix multiplication. Let A be the three-element set . Altogether, a total of 3 9 = 19683 different binary operations can be defined on A. 113 of the 19683 binary operations determine 24 nonisomorphic semigroups, or 18 non-equivalent semigroups (with equivalence being isomorphism or anti-isomorphism). With the exception of the group with three elements, each of these has one (or more) of the above two-element semigroups as subsemigroups. For example, the set under multiplication is a semigroup of order 3, and contains both and as subsemigroups.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378036962 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.