Definition

A group is a set GG with binary operation (i.e. a law of composition) ∗* satisfying axioms of:

  • closure
    • for all elements gg and hh of GG, g∗hg * h is an element of GG
  • associativity
    • (g∗h)∗k=g∗(h∗k)(g * h) * k = g * (h * k) for all g,h,k∈Gg,h,k \in G
  • existence of identity
    • exists element e∈Ge \in G, identity (or unit) of GG such that e∗g=g∗e=ge * g = g * e = g for all g∈Gg \in G
  • existence of inverse
    • for every g∈Gg \in G there exists an element h∈Gh \in G called the inverse of gg such that e∗g=g∗e=ge * g = g * e = g for all g∈Gg \in G

An abelian or commutative group is a group (G,∗)(G,*) also satisfying

  • commutativity
    • g∗h=h∗gg * h = h * g for all g,h∈Gg,h \in G

Notes

  • a group is a special case of semigroup where there is existence of identity and inverse
  • it can also be considered as a special case of a monoid with an inverse
  • closure is sometimes omitted in definitions, in this case, it is incorporated into the properties required for the relevant law of composition instead

References

  1. https://people.tamu.edu/~yvorobets/MATH433-2010B/Lect2-05web.pdf
  2. https://www.bananaspace.org/wiki/群
  3. https://zhuanlan.zhihu.com/p/314567658
  4. https://math.stackexchange.com/questions/63697/why-is-closure-omitted-in-some-group-definitions
  5. M. Artin, Algebra, 2. ed. Boston, Mass. Munich: Pearson Education, Prentice Hall, 2011, pp. 42-43.