ABSTRACT ALGEBRA

Abstract algebra

Abstract algebra extends the familiar concepts found in elementary algebra and arithmetic of numbers to more general concepts. Here are the listed fundamental concepts in abstract algebra.

Sets: Rather than just considering the different types of numbers, abstract algebra deals with the more general concept of sets: collections of objects called elements. All collections of the familiar types of numbers are sets. Other examples of sets include the set of all two-by-two matrices, the set of all second-degree polynomials (ax² + bx + c), the set of all two dimensional vectors of a plane, and the various finite groups such as the cyclic groups, which are the groups of integers modulo n. Set theory is a branch of logic and not technically a branch of algebra.

Binary operations: The notion of addition (+) is generalized to the notion of binary operation (denoted here by ∗). The notion of binary operation is meaningless without the set on which the operation is defined. For two elements a and b in a set S, a ∗ b is another element in the set; this condition is called closure. Addition (+), subtraction (−), multiplication (×), and division (÷) can be binary operations when defined on different sets, as are addition and multiplication of matrices, vectors, and polynomials.

Identity elements: The numbers zero and one are generalized to give the notion of an identity element for an operation. Zero is the identity element for addition and one is the identity element for multiplication. For a general binary operator ∗ the identity element e must satisfy a ∗ e = a and e ∗ a = a, and is necessarily unique, if it exists. This holds for addition as a + 0 = a and 0 + a = a and multiplication a × 1 = a and 1 × a = a. Not all sets and operator combinations have an identity element; for example, the set of positive natural numbers (1, 2, 3, ...) has no identity element for addition.

Inverse elements: The negative numbers give rise to the concept of inverse elements. For addition, the inverse of a is written −a, and for multiplication the inverse is written a⁻¹. A general two-sided inverse element a⁻¹ satisfies the property that a ∗ a⁻¹ = e and a⁻¹ ∗ a = e, where e is the identity element.

Associativity: Addition of integers has a property called associativity. That is, the grouping of the numbers to be added does not affect the sum. For example: (2 + 3) + 4 = 2 + (3 + 4). In general, this becomes (a ∗ b) ∗ c = a ∗ (b ∗ c). This property is shared by most binary operations, but not subtraction or division or octonion multiplication.

Commutativity: Addition and multiplication of real numbers are both commutative. That is, the order of the numbers does not affect the result. For example: 2 + 3 = 3 + 2. In general, this becomes a ∗ b = b ∗ a. This property does not hold for all binary operations. For example, matrix multiplication and quaternion multiplication are both non-commutative.

Groups

Combining the above concepts gives one of the most important structures in mathematics: a group. A group is a combination of a set S and a single binary operation ∗, defined in any way you choose, but with the following properties:

An identity element e exists, such that for every member a of S, e ∗ a and a ∗ e are both identical to a.
Every element has an inverse: for every member a of S, there exists a member a⁻¹ such that a ∗ a⁻¹ and a⁻¹ ∗ a are both identical to the identity element.
The operation is associative: if a, b and c are members of S, then (a ∗ b) ∗ c is identical to a ∗ (b ∗ c).

If a group is also commutative – that is, for any two members a and b of S, a ∗ b is identical to b ∗ a – then the group is said to be abelian.

For example, the set of integers under the operation of addition is a group. In this group, the identity element is 0 and the inverse of any element a is its negation, −a. The associativity requirement is met, because for any integers a, b and c, (a + b) + c = a + (b + c)

The non-zero rational numbers form a group under multiplication. Here, the identity element is 1, since 1 × a = a × 1 = a for any rational number a. The inverse of a is 1/a, since a × 1/a = 1.

The integers under the multiplication operation, however, do not form a group. This is because, in general, the multiplicative inverse of an integer is not an integer. For example, 4 is an integer, but its multiplicative inverse is 1/4, which is not an integer.

The theory of groups is studied in group theory. A major result of this theory is the classification of finite simple groups, mostly published between about 1955 and 1983, which separates the finite simple groups into roughly 30 basic types.

Semi-groups, quasi-groups, and monoids are algebraic structures similar to groups, but with less constraints on the operation. They comprise a set and a closed binary operation but do not necessarily satisfy the other conditions. A semi-group has an associative binary operation but might not have an identity element. A monoid is a semi-group which does have an identity but might not have an inverse for every element. A quasi-group satisfies a requirement that any element can be turned into any other by either a unique left-multiplication or right-multiplication; however, the binary operation might not be associative.

All groups are monoids, and all monoids are semi-groups.

Examples
Set	Natural numbers N		Integers Z		Rational numbers Q Real numbers R Complex numbers C				Integers modulo 3 Z/3Z = {0, 1, 2}
Operation	+	×	+	×	+	−	×	÷	+	×
Closed	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	Yes	Yes
Identity	0	1	0	1	0	N/A	1	N/A	0	1
Inverse	N/A	N/A	−a	N/A	−a	N/A	1/a (a ≠ 0)	N/A	0, 2, 1, respectively	N/A, 1, 2, respectively
Associative	Yes	Yes	Yes	Yes	Yes	No	Yes	No	Yes	Yes
Commutative	Yes	Yes	Yes	Yes	Yes	No	Yes	No	Yes	Yes
Structure	monoid	monoid	abelian group	monoid	abelian group	quasi-group	monoid	quasi-group	abelian group	monoid

Rings and fields

Groups just have one binary operation. To fully explain the behaviour of the different types of numbers, structures with two operators need to be studied. The most important of these are rings and fields.

A ring has two binary operations (+) and (×), with × distributive over +. Under the first operator (+) it forms an abelian group. Under the second operator (×) it is associative, but it does not need to have an identity, or inverse, so division is not required. The additive (+) identity element is written as 0 and the additive inverse of a is written as −a.

Distributivity generalises the distributive law for numbers. For the integers (a + b) × c = a × c + b × c and c × (a + b) = c × a + c × b, and × is said to be distributive over +.

The integers are an example of a ring. The integers have additional properties which make it an integral domain.

A field is a ring with the additional property that all the elements excluding 0 form an abelian group under ×. The multiplicative (×) identity is written as 1 and the multiplicative inverse of a is written as a⁻¹.

The rational numbers, the real numbers and the complex numbers are all examples of fields.

Search This Blog

DR.VIJAYABALAN