<?xml version="1.0" encoding="UTF-8"?>

<record version="6" id="388">
 <title>semigroup</title>
 <name>Semigroup</name>
 <created>2001-10-19 11:34:32</created>
 <modified>2008-05-13 01:41:20</modified>
 <type>Definition</type>
 <creator id="24" name="djao"/>
 <author id="3771" name="CWoo"/>
 <author id="24" name="djao"/>
 <classification>
	<category scheme="msc" code="20M99"/>
 </classification>
 <defines>
	<concept>semigroup homomorphism</concept>
 </defines>
 <synonyms>
	<synonym concept="semigroup" alias="homomorphism"/>
 </synonyms>
 <related>
	<object name="groupoid"/>
	<object name="Band2"/>
	<object name="SubmonoidSubsemigroup"/>
	<object name="NullSemigroup"/>
	<object name="ZeroElements"/>
	<object name="Monoid"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>A {\em semigroup} $G$ is a set together with a binary operation $\cdot: G \times G \longrightarrow G$ which satisfies the associative property: $(a \cdot b) \cdot c = a \cdot (b \cdot c)$ for all $a,b,c \in G$.

The set $G$ is not required to be nonempty.

Let $G,H$ be two semigroups.  A \emph{semigroup homomorphism} from $G$ to $H$ is a function $f:G\to H$ such that $f(ab)=f(a)f(b)$.</content>
</record>
