Group

A monoid in which every element has an inverse
Group

A group is a GG together with a :G×GG\cdot : G\times G\to G such that:

  1. (Associativity) For all a,b,cGa,b,c\in G, (ab)c=a(bc)(a\cdot b)\cdot c = a\cdot(b\cdot c).
  2. (Identity) There exists an element eGe\in G such that for all aGa\in G, ea=ae\cdot a=a and ae=aa\cdot e=a.
  3. (Inverses) For every aGa\in G there exists an element a1Ga^{-1}\in G such that aa1=ea\cdot a^{-1}=e and a1a=ea^{-1}\cdot a=e.

Equivalently, a group is a in which every element is invertible. Much of group theory studies and structure-preserving maps called .

Examples:

  • (Z,+)(\mathbb{Z},+) is a group (identity 00, inverse of nn is n-n).
  • (Q×,×)(\mathbb{Q}^{\times},\times) is a group (nonzero rationals under multiplication).
  • The symmetric group SnS_n of permutations of {1,,n}\{1,\dots,n\} is a group under composition.
  • The set of invertible n×nn\times n real matrices is a group under multiplication (often denoted GLn(R)GL_n(\mathbb{R})).