Magma (Algebraic)

magma

A magma is a set G together with a binary operation:

μ:G×G→G;μ(a,b)↦μ(a,b)

Some Examples

Take the set Z={1,2,3,4,…} which has some example binary operations:

  1. μ(a,b)=a+b
  2. μ(a,b)=ab
  3. μ(a,b)=min{a,b}
  4. μ(a,b)=max{a,b}
  5. μ(a,b)=a ("projection")
  6. μ(a,b)=ab
  7. μ(a,b)=2ab
  8. ...

Two Possible Properties

We may want to ask: Is the operation μ (for a,b,c∈G)

  1. associative: μ(a,μ(b,c))=μ(μ(a,b),c) (think of a(bc)=(ab)c from the integers, parenthesis don't matter, here the operations can be applied in whatever order as long as it's in-order))
  2. commutativity: μ(a,b)=μ(b,a) (ab=ba) (order doesn't matter)

Looking at the examples above:

  1. Both (commutative and associative)
  2. Both
  3. Both (equivalent to min{a,b,c})
  4. Both (same as (3))
  5. Not Commutative (since μ(2,1)=2≠1=μ(1,2)), but is Associative
  6. Not Commutative (since μ(1,2)=12≠21=μ(2,1)), and Not Associative (abc vs. (ab)c≡abc, just choose an example where bc≠bc)
  7. Commutative but not associative

It's actually not too uncommon to find operations that aren't commutative, but the associativity is an important property, since there's only a few operations that really aren't associative (ex: the cross product × in R3)