Commutative monoids have binary products

  • Thread starter Thread starter imlala
  • Start date Start date
  • Tags Tags
    Binary
imlala
Messages
3
Reaction score
0

Homework Statement


Hello,

I'd like to prove that the category cmon of commutative monoids has binary products.


The Attempt at a Solution



actually I'm aware that i have to use cartesian products
given monoids (M, \bulletm, e^{}_{m}) and (N, \bulletn, e^{}_{n})

it follows that (M\timesN) \times (M\timesN) \rightarrow M\times N

and ((m,n), (m',n')) |---> (m \bulletm m', n \bulletn n') ...

Thanks in advance for any help!
 
Physics news on Phys.org
Well, what have you managed to do successfully, and where are you stuck? Can you, at least, write an outline of the individual steps you have to do even if you can't do them?


P.S. I'm assuming you don't have any general structure theorems available -- e.g. that any variety of universal algebra has products.
 
actually I've got the solution for the particular problem for category monoid of monoids but i can't figure out what is needed to add to the proof to satisfy the proposition that cmon of commutative monoids have binary products.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top