* [[Start|Home]] * [[Possible Outlines]] * [[playground:Playground]] * [[Needs Review]] * [[sidebar|Edit The Sidebar]]
* [[Start|Home]] * [[Possible Outlines]] * [[playground:Playground]] * [[Needs Review]] * [[sidebar|Edit The Sidebar]]
This is an old revision of the document!
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.
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}$.
%%%%% % 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