Scribd
Upload
8 views1 page

Understanding Algebraic Structures

The document defines several algebraic structures including binary operations, closed sets, monoids, groups, cyclic groups, groupoids, semigroups, and their properties. A binary operation maps ordered pairs of elements of a set to another element of that set. A set is closed under an operation if applying the operation to any two set elements results in another element of the set. A monoid is a semigroup with an identity element, and a group is a monoid with unique inverses. A cyclic group is generated by a single element and its powers under the group operation. Groupoids and semigroups are defined by their binary operations, with semigroups having an associative operation and possible identity elements and

Uploaded by

Chuck Norris
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views1 page

Understanding Algebraic Structures

The document defines several algebraic structures including binary operations, closed sets, monoids, groups, cyclic groups, groupoids, semigroups, and their properties. A binary operation maps ordered pairs of elements of a set to another element of that set. A set is closed under an operation if applying the operation to any two set elements results in another element of the set. A monoid is a semigroup with an identity element, and a group is a monoid with unique inverses. A cyclic group is generated by a single element and its powers under the group operation. Groupoids and semigroups are defined by their binary operations, with semigroups having an associative operation and possible identity elements and

Uploaded by

Chuck Norris
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

ALGEBRAIC STRUCTURES

DEFINITION. A binary operation on a set A is a function f that maps each and every ordered pair (a,b) A A to an element of A. That is f : A A A. Notation: Denote binary operations by * and denote the element assigned to the ordered pair (a,b) by a*b. In other words, f (a,b) = a*b. DEFINITION. A set A is said to be closed under the operation * if it has the following property: if a and b are elements of the set A, then a*b A Remark: If A = {a1, a2, , an} is a finite set, we can define a binary operation on A by means of a table, as follows: * a1 a2 aj an a1 a1*a1 a1*a2 a1*aj a1*an a2 a2*a1 a2*a2 a2*aj a2*an : : : : : ai ai*a1 ai*a2 ai*aj ai*an : : : : : an an*a1 an*a2 an*aj an*an Properties of Binary Operations A binary operation on a set A is said to be commutative if a*b = b*a for all elements a and b in A. A binary operation on a set A is said to be associative if (a*b)*c = (a*b)*c for all elements a and b in A.

DEFINITION. DEFINITION.

DEFINITION.

THEOREM. DEFINITION. DEFINITION. DEFINITION. DEFINITION.

element is unique. A monoid is a semigroup (M,*) that has an identity element. Let (M,*) be a monoid with identity element e, and let T be a nonempty subset of M. If a) T is closed under the operation *, and b) the identity element e of M is also in T, then (T,*) is called a submonoid of (M,*). An element a in a monoid (M,*) with identity element e is called the inverse of a if a*a = a*a = e for every element a in M. If a monoid (M,*) has an inverse element, that inverse element is unique for every element a. A group is a monoid (G,*) with identity element e, which also has an inverse element a for each element a in S. A group (G,*) is said to be an abelian group if * is also commutative. If G is a finite group, then the order of G, denoted by |G| is the number of elements in G. Let (H,*) be a subset of group (G,*) such that a) the identity element e in G is also in H; b) if for every element a in H there exists an inverse a also in H; and c) H is closed under the binary operation *. then (H,*) is called a subgroup of (G,*).

CYCLIC GROUPS
DEFINITION. Suppose (S,*) is a semigroup and let a S. For n Z+, the powers of a can be defined recursively as follows: a) a1 = a b) an = an-1*a for n 2 Moreover if (S,*) is a monoid with identity element e, a0 = e. THEOREM. Let (G,*) be a group and let a G. Then H = { an | n Z } is a subgroup of (G,*) and is the smallest subgroup of G which contains a. DEFINITION. H = {an| n Z} is the cyclic subgroup of G generated by a, denoted by <a>. DEFINITION. An element a of a group G generates G and is a generator for G if <a> = G itself. A group (G,*) is cyclic if there is some element a in G which generates G.

GROUPOIDS, SEMIGROUPS and GROUPS


DEFINITION. A groupoid, denoted by (G,*), is a nonempty set G together with a binary operation * defined on G. DEFINITION. A semigroup denoted by (S,*) is a nonempty set S together with an associative binary operation * defined on S. Remark: a*b is also known as the product of a and b. DEFINITION. The semigroup (S,*) is said to be commutative semigroup if * is also a commutative operation. DEFINITION. Let (S,*) be a semigroup and let T be a subset of S. If T is closed under the operation *, then (T,*) is called a subsemigroup of (S,*). DEFINITION. An element e in a semigroup (S,*) is called an identity element if e*a = a*e = a for all elements a in S. THEOREM. If a semigroup (S,*) has an identity element, that identity

You might also like