User Tools

Site Tools


definition:group

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
definition:group [2013/08/21 05:10]
joshuawiscons
definition:group [2013/08/21 13:01] (current)
bmwoodruff [External links]
Line 2: Line 2:
  
 ====Definition====  ====Definition==== 
-Let $G$ be a set, and let $\cdot$ be a [[wp>binary operation]] on $G$. The structure $\mathbb{G} = (G,\cdot)$ is called a $\textdef{group}$ if the following hold. +Let $G$ be a set, and let $*$ be a binary operation on $G$. The structure $\mathbb{G} = (G,*)$ is called a $\textdef{group}$ if the following hold. 
-  - $\textbf{[Associativity]}$ For all $x,y,z\in G$ one has $(x\cdot y)\cdot z = x\cdot (y\cdot z)$. +  - $\textbf{[Associativity]}$ For all $x,y,z\in G$ one has $(xy)z = x(yz)$. 
-  - $\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$.  +  - $\textbf{[Identity]}$ There is a unique $e\in G$ such that for all $x\in G$ one has $x e = ex = x$.  
-  - $\textbf{[Inverses]}$ For all $x\in G$ there is a unique $y\in G$ such that $x\cdot y = y\cdot x = e$. +  - $\textbf{[Inverses]}$ For all $x\in G$ there is a unique $y\in G$ such that $xy = yx = 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}$.+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}$. One often simply writes $xy$ in place of $x* y$, and for every positive integer $n$, $x^n$ is short for $x* x* \cdots * x$ ($n$ times).
  
 ---- ----
 ==== Remarks ====  ==== Remarks ==== 
-  * A [[wp>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)$.  +  * A [[wp>binary operation]] on $G$ is simply a function from $G\times G$ to $G$ (and its domain is **all** of $G\times G$). As is customary, we write $x*y$ in place of $*(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$. +  * We usually think of $*$ 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 $*$. 
-  * 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$.+  * When thinking of $*$ as multiplication we often use the symbol $1$ instead of $e$. Similarly, when thinking of $*$ as addition we may use the symbol $0$ instead of $e$.
  
  
 ---- ----
 ==== $\LaTeX$ version ==== ==== $\LaTeX$ version ====
-<file tex group.tex>+<file tex definition.group.tex>
 %%%%% %%%%%
 % DEPENDENCIES  % DEPENDENCIES 
Line 23: Line 23:
 %%%%% %%%%%
 \begin{definition} \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.+Let $G$ be a set, and let $*$ be a binary operation on $G$. The structure $\mathbb{G} = (G,*)$ is called a \textdef{group} if the following hold.
 \begin{enumerate} \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{[Associativity]} For all $x,y,z\in G$ one has $(xy)z = x(yz)$. 
-\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{[Identity]} There is a unique $e\in G$ such that for all $x\in G$ one has $x e = ex = 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$.+\item \textbf{[Inverses]} For all $x\in G$ there is a unique $y\in G$ such that $xy = yx = e$.
 \end{enumerate} \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}$.+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}$. One often simply writes $xy$ in place of $x* y$, and for every positive integer $n$, $x^n$ is short for $x* x* \cdots * x$ ($n$ times).
 \end{definition} \end{definition}
 </file> </file>
Line 38: Line 38:
  
  
-{{tag>definition needsreview rjosh}}+{{tag>definition needsreview rjosh rben}}
definition/group.1377076210.txt.gz · Last modified: 2013/08/21 05:10 by joshuawiscons