0% found this document useful (0 votes)
24 views27 pages

Understanding Algebraic Structures

The document outlines the definitions and properties of various algebraic structures including algebraic structures, semigroups, monoids, groups, and abelian groups, detailing their axioms such as closure, associativity, identity elements, and inverses. It also discusses subgroups, congruence relations, Cayley tables, and cyclic groups, highlighting their characteristics and relationships. Additionally, it provides examples and conditions for each structure, emphasizing the hierarchical nature of these concepts in abstract algebra.

Uploaded by

Shreya Singh
Copyright
© All Rights Reserved
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
0% found this document useful (0 votes)
24 views27 pages

Understanding Algebraic Structures

The document outlines the definitions and properties of various algebraic structures including algebraic structures, semigroups, monoids, groups, and abelian groups, detailing their axioms such as closure, associativity, identity elements, and inverses. It also discusses subgroups, congruence relations, Cayley tables, and cyclic groups, highlighting their characteristics and relationships. Additionally, it provides examples and conditions for each structure, emphasizing the hierarchical nature of these concepts in abstract algebra.

Uploaded by

Shreya Singh
Copyright
© All Rights Reserved
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 Structure

A non-empty set S is called an algebraic structure w.r.t binary operation (*) if


it follows following axioms:
• Closure:(a*b) belongs to S for all a, b ∈ S.
Ex: S = {1, -1} is algebraic structure under *
As 1*1 = 1, 1*-1 = -1, -1*-1 = 1 all results belong to S.
But above is not algebraic structure under + as 1+(-1) = 0 not belongs to S.
Semi Group
A non-empty set S, (S, *) is called a semigroup if it follows the following
axiom:
• Closure:(a*b) belongs to S for all a, b ∈ S.
• Associativity: a*(b*c) = (a*b) *c ∀ a, b, c belongs to S.
Note: A semi group is always an algebraic structure.
Ex: (Set of integers, +), and (Matrix, *) are examples of semigroup.

Monoid
A non-empty set S, (S, *) is called a monoid if it follows the following axiom:
• Closure:(a*b) belongs to S for all a, b ∈ S.
• Associativity: a*(b*c) = (a*b) *c ∀ a, b, c belongs to S.
• Identity Element: There exists e ∈ S such that a*e = e*a = a ∀ a ∈ S
Note: A monoid is always a semi-group and algebraic structure.
Ex: (Set of integers, *) is Monoid as 1 is an integer which is also identity
element.
(Set of natural numbers, +) is not Monoid as there doesn’t exist any identity
element. But this is Semigroup.
But (Set of whole numbers, +) is Monoid with 0 as identity element.

Group
A non-empty set G, (G, *) is called a group if it follows the following axiom:
• Closure:(a*b) belongs to G for all a, b ∈ G.
• Associativity: a*(b*c) = (a*b) *c ∀ a, b, c belongs to G.
• Identity Element: There exists e ∈ G such that a*e = e*a = a ∀ a ∈ G
• Inverses: ∀ a ∈ G there exists a-1 ∈ G such that a*a-1 = a-1*a = e
Note:
1. A group is always a monoid, semigroup, and algebraic structure.
2. (Z, +) and Matrix multiplication is example of group.
Abelian Group or Commutative group
A non-empty set S, (S, *) is called a Abelian group if it follows the following
axiom:
• Closure:(a*b) belongs to S for all a, b ∈ S.
• Associativity: a*(b*c) = (a*b) *c ∀ a, b, c belongs to S.
• Identity Element: There exists e ∈ S such that a*e = e*a = a ∀ a ∈ S
• Inverses: ∀ a ∈ S there exists a-1 ∈ S such that a*a-1 = a-1*a = e
• Commutative: a*b = b*a for all a, b ∈ S

Must Satisfy Properties

Algebraic Structure Closure

Semi Group Closure, Associative

Monoid Closure, Associative, Identity

Group Closure, Associative, Identity, Inverse

Abelian Group Closure, Associative, Identity, Inverse, Commutative

N=Set of Natural Number, Z=Set of Integer, R=Set of Real Number, E=Set of


Even Number, O=Set of Odd Number, M=Set of Matrix
+, -, ×, ÷ are the operations.

Algebraic Semi Abelian


Set, Operation Structure Group Monoid Group Group

N, + Y Y X X X

N, - X X X X X
N, × Y Y Y X X

N, ÷ X X X X X

Z, + Y Y Y Y Y

Z, - Y X X X X

Z, × Y Y Y X X

Z, ÷ X X X X X

R, + Y Y Y Y Y

R, - Y X X X X

R, × Y Y Y X X

R, ÷ X X X X X

E, + Y Y Y Y Y

E, × Y Y X X X

O, + X X X X X

O, × Y Y Y X X

M, + Y Y Y Y Y

M, × Y Y Y X X
Subgroup:
A subgroup is a subset of a group. H is a subgroup of a group G if it is a subset
of G, and follows all axioms that are required to form a group.

Subgroups also satisfy the following laws:

• Closure
• Associative
• Identity element
• Inverse law
A subgroup is also a group, and the order of a subgroup is less than the order of
a group.
If H is a subgroup of finite group G then the order of subgroup H divides the
order of group G.
Congruence Relation
If a and b are integers and m is a positive integer, then a is congruent
to b modulo m iff m|(a − b).
Properties of Congruence Relation
Features of Cayley Table –
• Every row and column of the table should contain each element
exactly once. If the table does not have this property, it cannot
represent a group; the cancellation law does not hold.
• The identity element of the group should not only appear in every
row and column (exactly once), but it should also be “distributed
symmetrically” about the main diagonal. Otherwise, one or more
elements in the table do not have an inverse.
• There should not be any entries in the table that is not a row/column
label. Otherwise, the operation is not closed.
• There should be one row in which the column labels appear in order,
this indicates the presence of an identity element. The column of this
element should reflect the row labels. Otherwise, there is no identity.
Note: If the Cayley table is symmetric along its diagonal, then the group is an
abelian group.

Cyclic group:

It is a group generated by a single element, and that element is called generator


of that cyclic group. or a cyclic group G is one in which every element is a
power of a particular element g, in the group. That is, every element of G can
be written as gn for some integer n for a multiplicative group, or ng for some
integer n for an additive group. So, g is a generator of the group G.
Properties of Cyclic Group:
1. Every cyclic group is also an Abelian group.
2. If G is a cyclic group with generator g and order n. If m < n, then the

order of the element gm is given by,


3. Every subgroup of a cyclic group is cyclic.
4. If G is a finite cyclic group with order n, the order of every element
in G divides n.
5. If d is a positive divisor of n, the number of elements of order d in a
cyclic group of order n is Φ(d), where Φ(d) is Euler Phi function.
6. The order of a cyclic group and the order of its generator is same.

Common questions

Powered by AI

A Cayley table illustrates an Abelian group if it is symmetric along its diagonal. This symmetry demonstrates that the operation is commutative, meaning a*b = b*a for any elements a and b in the group. Additionally, every row and column containing each element exactly once ensures closure, and the symmetrical presence of the identity element confirms the associative and identity properties required of a group .

A symmetric Cayley table along its diagonal implies that the group is Abelian, as this symmetry showcases the commutative property of the group operation (a*b = b*a). This commutativity changes the nature of the group, enabling additional structural properties such as the simpler subgroups and factor groups. Thus, symmetry in the Cayley table not only confirms group membership but also classifies it as Abelian, indicating deeper internal relationships and operations symmetry .

Closure is a fundamental requirement for all algebraic structures, including algebraic structures, semigroups, monoids, groups, and Abelian groups. For a set S with an operation *, closure means that the result of the operation on any elements in S is also in S. This property distinguishes algebraic structures from sets that do not maintain closure, leading to differing levels of algebraic structure based on additional axioms such as associativity, identity, inverses, and commutativity .

The set of natural numbers under addition cannot form a group because it lacks an identity element within the set; there is no natural number that can be added to others without changing their value (i.e., 0 is not included). Furthermore, natural numbers do not have inverses within the set under addition (there is no natural number that added to itself would yield zero).

For a subset H to be a subgroup of a finite group G, it must satisfy closure, associativity, possess an identity element, and each element must have an inverse within H. Moreover, the order of the subgroup H must divide the order of the group G, demonstrating the compatibility and sub-structure preservation within the larger group .

For the set of even numbers E under addition to form an Abelian group, it needs to satisfy closure, associativity, the existence of an identity element (0), the existence of inverses (for any even number there exists another even number such that their sum is 0), and commutativity. The set E satisfies all these conditions, thus forming an Abelian group under addition .

In cyclic groups, if G is a finite cyclic group of order n, Euler's Phi function Φ(d) determines the number of elements of order d, where d is a positive divisor of n. This highlights the relationship between divisors of the group order and the symmetry of element distribution within the group, showcasing how factors relate to the possible substructure arrangements and element orderings .

A semigroup and a monoid both require the set S with a binary operation to satisfy the closure and associativity axioms. However, a monoid further requires the existence of an identity element e such that a*e = e*a = a for all a in S. This additional requirement makes every monoid a semigroup but not vice versa .

The inverses axiom mandates that for every element a in group G, there exists an inverse element a-1 such that a*a-1 = a-1*a = e, where e is the identity element. This requirement ensures that every element can 'undo' itself under the group operation, a property not required in a monoid, where closure, associativity, and an identity element suffice without needing inverse elements .

Every cyclic group is an Abelian group, meaning it satisfies commutativity in addition to other group axioms. Cyclic groups are generated by a single element, such that every element of the group can be expressed as a power or multiple of this generator. Moreover, every subgroup of a cyclic group is also cyclic, and the order of elements divides the order of the group, further extending the structure and divisibility properties inherent in Abelian groups .

You might also like