0%

Abstract Algebra, Lecture 2

How to induct an equivalent relationship by a trivial relationship

We can induct an equivalent relationship $\hat{R}$ by a trivial relationship $R$:

$ \Phi$ is the set of all equivalent relationships containing $R$. If $R$ is represented to a $n \times n$ matrix, then

  • Transitive property : $\hat{R}^2\subseteq \hat{R}$
  • Symmetric property : $\hat{R}=\hat{R}^T$

Hence,

Maps and equivalent relationship

We can induct an equivalent relationship by a arbitrary map.

Let $Im(f)=C$, then

There exits an nature Map giving an equivalent relationship $R$.

The relationship inducting by this map $R _ \pi=R$.

Example 1 :

$[(x,y)] _ {R_f}={(x,y)|y=2x+b}.$

Semi-group

Binary operation

A binary operation $(S,\cdot )$ on a set S is a map which sends elements of the Cartesian product $S \times S$ to $S$.

Semi-group

A semi-group $(S,\cdot)$ is an algebraic structure consisting of a set $S$ together with an associative binary operation. That is for all ${ a,b,c\in S} a,b,c\in S$, the equation ${(a\cdot b)\cdot c=a\cdot (b\cdot c)} (a\cdot b)\cdot c = a\cdot(b\cdot c)$ holds.

Exercise 1 : Proof that $(S, \oplus)$ an arbitrary set $S$ together with symmetric difference is a semi-group.