A semigroup is a pair (S,∘), where S is a non-empty set and ∘:S×S→S is an associative binary operation on S. A monoid is a semigroup (S,∘) with identity element e∈S in the sence that e∘s=s∘e=s for any s∈S.
Let us show that the set of positive Integer N is a monoid for the operation defined by a∘b=max{a,b}.
If a,b∈N then a∘b=max{a,b}∈N, and hence the operation is defined on the set N.
Since
a∘(b∘c)=a∘max{b,c}=max{a,max{b,c}}=max{a,b,c}=max{max{a,b},c}=max{a∘b,c}=(a∘b)∘c
for any a,b,c∈N, we conclude that operation ∘ is associative, and hence (N,∘) is a semigroup.
Taking into account that a∘1=max{a,1}=a=max{1,a}=1∘a for each a∈N, we conclude that 1 is the identity of the semigroup (N,∘), and consequently (N,∘) is a monoid.
Comments
Leave a comment