Sidebar

* [[Start|Home]] * [[Possible Outlines]] * [[playground:Playground]] * [[Needs Review]] * [[sidebar|Edit The Sidebar]]

definition:group

This is an old revision of the document!


Group

Definition

Let $G$ be a set, and let $\cdot$ be a binary operation on $G$. The structure $\mathbb{G} = (G,\cdot)$ is called a $\textdef{group}$ if the following hold.

  1. $\textbf{[Associativity]}$ For all $x,y,z\in G$ one has $(x\cdot y)\cdot z = x\cdot (y\cdot z)$.
  2. $\textbf{[Identity]}$ There is a unique $e\in G$ such that for all $x\in G$ one has $x \cdot e = e\cdot x = x$.
  3. $\textbf{[Inverses]}$ For all $x\in G$ there is a unique $y\in G$ such that $x\cdot y = y\cdot x = e$.

We usually simply write $G$ when referring to the entire structure $\mathbb{G}$. The element $e$ from the second point is called the $\textdef{identity}$. The element $y$ from the third point is called the $\textdef{inverse}$ of $x$ and is usually denoted $x^{-1}$.


Remarks

  • A binary operation on $G$ is simply a function from $G\times G$ to $G$ (that is defined on all of $G\times G$). As is customary, we write $x\cdot y$ in place of $\cdot(x,y)$.
  • We usually think of $\cdot$ as defining a multiplication on $G$, though often this is better interpreted as addition. In the later case, we may use the symbol $+$ instead of $\cdot$.
  • When thinking of $\cdot$ as multiplication we often use the symbol $1$ instead of $e$. Similarly, when thinking of $\cdot$ as addition we may use the symbol $0$ instead of $e$.

$\LaTeX$ version

definition.group.tex
%%%%%
% DEPENDENCIES 
% RequiredMacros: \newcommand{\textdef}[1]{\textit{#1}} 
%%%%%
\begin{definition}
Let $G$ be a set, and let $\cdot$ be a binary operation on $G$. The structure $\mathbb{G} = (G,\cdot)$ is called a \textdef{group} if the following hold.
\begin{enumerate}
\item \textbf{[Associativity]} For all $x,y,z\in G$ one has $(x\cdot y)\cdot z = x\cdot (y\cdot z)$.
\item \textbf{[Identity]} There is a unique $e\in G$ such that for all $x\in G$ one has $x \cdot e = e\cdot x = x$. 
\item \textbf{[Inverses]} For all $x\in G$ there is a unique $y\in G$ such that $x\cdot y = y\cdot x = e$.
\end{enumerate}
We usually simply write $G$ when referring to the entire structure $\mathbb{G}$. The element $e$ from the second point is called the \textdef{identity}. The element $y$ from the third point is called the \textdef{inverse} of $x$ and is usually denoted $x^{-1}$.
\end{definition}

definition needsreview rjosh

definition/group.1377077379.txt.gz · Last modified: 2013/08/21 05:29 by joshuawiscons