Scribd
Upload
11 views8 pages

Algebraic Structres CNS

Algebraic structures consist of a set and operations applied to its elements, with common types including groups, rings, and fields. A group is defined by properties such as closure, associativity, identity, and inverses, while rings and fields expand on these concepts with additional operations and properties. Finite fields, known as Galois fields, are particularly important in computer science for representing integers in a limited bit range.

Uploaded by

komatineni0599
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views8 pages

Algebraic Structres CNS

Algebraic structures consist of a set and operations applied to its elements, with common types including groups, rings, and fields. A group is defined by properties such as closure, associativity, identity, and inverses, while rings and fields expand on these concepts with additional operations and properties. Finite fields, known as Galois fields, are particularly important in computer science for representing integers in a limited bit range.

Uploaded by

komatineni0599
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

ALGEBRAIC STRUCTURES

ALGEBRAIC STRUCTURES:

The combination of the set and the operations that are applied to the elements of the set
is calledan algebraic structure.

three common algebraic structures:


 groups,
 rings,
 fields

Groups:
A group (G) is a set of elements with a binary operation “•” that satisfies four properties.

Commutative group or Abelian group:


A commutative group, also called an abelian group, is a group in which the operator
satisfies the four properties for groups plus an extra property, commutativity.

1. Closure
2. Associativity
3. Commutativity
4. Existence of identity
5. Existence of inverse
Closure: If a and b are elements of G, then c = a • b is also an element of G.
Associativity: If a, b, and c are elements of G, then (a • b) • c = a • (b • c).
Commutativity: For all a and b in G, we have a • b = b • a.
Existence of identity: For all a in G, there exists an element e, called the identity
element, such that e • a = a • e = a.
Existence of inverse: For each a in G, there exists an element a′, called the inverse
of a, such that a • a′ = a′ • a = e.
Finite Group:
A group is called a finite group if the set has a finite number of elements; otherwise, it is
an infinite group.

Order of a Group:
The order of a group, |G|, is the number of elements in the group. If the group is not
finite, its order is infinite; if the group is finite, the order is finite.

Subgroups:
 A subset H of a group G is a subgroup of G if H itself is a group with respect to the
operation on G.
 In other words, if G = <S, • > is a group, H = <T, •> is a group under the same
operation, and T is a nonempty subset of S, then H is a subgroup of G.
The above definition implies that:
1. If a and b are members of both groups, then c = a • b is also a member of both
groups.
2. The group share the same identity element.
3. If a is a member of both groups, the inverse of a is also a member of both
groups.
4. The group made of the identity element of G, H = <{e}, •>, is a subgroup of G.
5. Each group is a subgroup of itself.
Cyclic Subgroups:
If a subgroup of a group can be generated using the power of an element, the subgroup
is called the cyclic subgroup.

Example:
Four cyclic subgroups can be made from the group G = <Z6, +>. They are H1 = <{0}, +>, H2 =
<{0, 2, 4}, +>, H3 = <{0, 3}, +>, and H4 = G.

The cyclic subgroup generated from 0 is H1

The cyclic subgroup generated from 1 is H4, which is G itself.

The cyclic subgroup generated from 2 is H2

The cyclic subgroup generated from 3 is H3

Cyclic Groups:
A cyclic group is a group that is its own cyclic subgroup.

Example:
The group G = <Z6, +> is a cyclic group with two generators, g = 1 and g = 5.

Lagrange’s Theorem:
G is a group, and H is a subgroup of G.
If the order of G and H are |G| and |H|, respectively,
then, based on this theorem, |H| divides |G|.

Examplem:

Order of an Element:

The order of an element a in a group G is the smallest positive integer k

such that:

k⋅a≡0mod 6

where k⋅a means adding a, k times.


Ring:
A ring, denoted as R = <{…}, +,. >, is an algebraic structure with two operations.
The first operation must satisfy all five properties required for an abelian group.
he second operation must satisfy only the first two.

Commutative ring:
the second operation must be distributed over the first. Distributivity means that for all a,
b, and c elements of R.
we have a .(b + c) = (a. b) • (a . c) and (a + b). c = (a +c) • (b+ c).

Field:
A field, denoted by F = <{…}, •, > is a commutative ring in which the second operation
satisfies all five properties defined for the first operation except that the identity of the
first operation (sometimes called the zero element) has no inverse.
Finite Fields:
A finite field, a field with a finite number of elements.

Galois fields :
The finite fields are usually called Galois fields.
the number of elements should be , where p is a prime and n is a positive integer.

GF(p) Fields:
When n = 1, we have GF(p) field.
This field can be the set Zp, {0, 1, …, p − 1}, with two arithmetic operations (addition
and multiplication).

Example:
GF(2) with the set {0, 1} and two operations, addition and multiplication.

Example:
We can define GF(5) on the set Z5 (5 is a prime) with addition and multiplication operators.
:
 when we workwith computers, the positive integers are stored in the computer as
n-bit words in which
 n is usually 8, 16, 32, 64, and so on.
 This means that the range of integers is 0 to 2n − 1.
 The modulus is 2n.
 we have two choices if we want to use a field:

1. We can use GF(p) with the set Zp, where p is the largest prime number less than
2n.
For example, if n = 4, the largest prime less than 24 is 13. This means that we cannot use
integers 13, 14, and 15.

2. We can work in GF(2n) and uses a set of 2n elements. The elements in this set
aren-bit words.

For example, if n = 3, the set is

Example:
GF(22) field in which the set has four 2-bit words: {00, 01, 10, 11}.

You might also like