# Binary Operations : Monoids

Not what you're looking for? Search our solutions OR ask your own Custom question.

Let S be a set with an associative binary operation but with no identity. Choose an element 1 not belonging to S, write M = {1} or S, and define an operation on M by using the operation of S and 1s=s=s1 for all s belonging to S. Show that M is a monoid.

Â© BrainMass Inc. brainmass.com December 24, 2021, 4:52 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/binary-operations-monoids-12910

#### Solution Preview

Proof. Let M={1}or S. It suffices to show that M is associative and has an identity. By the definition of the operation on M, we know that element 1 is in fact the identity since for ...

#### Solution Summary

Associativity and identity is used to provide proof of a monoid.

$2.49