Basic Algebraic Structures in Mathematics, Lecture notes of Algebra

Definitions and discussions of key ideas and objects in algebra, with a focus on semigroups, groups, and fields. It explains how mathematicians generalize the algebraic properties of real, rational, and complex numbers into a general definition of a field. The document also presents examples of semigroups and groups, and how linear algebra can be done in the setting of general fields. useful for students who want to get accustomed to a slightly different level of abstraction in linear algebra.

Typology: Lecture notes

2021/2022

Uploaded on 05/11/2023

paperback
paperback 🇺🇸

4.8

(12)

263 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Mathematics Department Stanford University
Math 61CM/DM Basic algebraic structures
The purpose of this handout is to provide some basic definitions and a brief discussion of some
key ideas and objects in algebra. One main new idea you will be studying in class is the notion
of a field. This is a concept which generalizes the algebraic properties of the real numbers
(as well as the rational numbers and the complex numbers). However, mathematicians find it
useful to abstract the properties of these familiar fields into a general definition. It turns out
that there are a lot of other interesting examples; we present a few of these below. One of
the points of this is that a substantial portion of linear algebra can be done in the setting of
general fields, rather than how it is more customarily done, over the real numbers. This will be
especially pertinent to the students in 61DM. For the 61CM students, you should view this as
a good way to get accustomed to a slightly different level of abstraction, and you should also
use this as an opportunity to get used to the fact that the basic results and methods in linear
algebra are really “algebraic”, i.e., only depend on the handful of axioms in the definition of a
field.
In mathematics, the most fundamental objects are sets. These are just collections of objects.
We will be concerned with either finite or certain infinite sets. (It turns out that there is quite
a lot that can be said about sets in general, but that’s another story.) However, sets are kind
of static objects they just sit there. One can define progressively more sophisticated objects
by prescribing certain sets of rules, or axioms, about how the elements of the sets are related
to or interact with one another. We are going to describe a few different types of rules, each
slightly more specific than the last, leading to different types of algebraic objects: semigroups,
groups and then fields. This handout collects these definitions, discusses a few examples and
basic results.
Definition 1 A semigroup with unit (G, , e)is a set of objects Gcontaining a distinguished
element eG, along with a map :G×GG, with the following properties:
1. (Associativity) For all x, y , z G,x(yz)=(xy)z.
2. (Units) There exists an element eGsuch that for all xG,xe=x=ex.
You should think of the operation as being ‘multiplication’; it is a way of combining elements
of the set Gto get other elements. Here is a basic example: let G={1,2,3, . . .}, and ordinary
multiplication. The ‘identity element’ eis simply 1. It is obvious that the two rules hold. Here
is another example: now let G={0,1,2, . . .}, but this time, suppose that is the symbol which
corresponds to addition. Now e= 0 and once again the two rules hold.
This is one of the most primitive algebraic structures: we have a set and a way of combining
elements in it. We only have one “extra”, which is the existence of a unit e. (One can also talk
about semigroups without units; there are even some interesting examples!)
Lemma 1 In any semigroup with (G, , e), the unit eis unique.
Proof: Suppose e, f Gare two possibly different elements which both satisfy the properties
of a unit. Then e=efsince fis a unit, and ef=fsince eis a unit. Combining these,
we see that e=f.This means that one can talk about the unit, i.e. given (1) and (2), e
is unique.
It is a bit more interesting if one adds one further property:
Definition 2 A group (G, )is a semigroup with unit (G, , e)with one additional property:
pf3

Partial preview of the text

Download Basic Algebraic Structures in Mathematics and more Lecture notes Algebra in PDF only on Docsity!

Mathematics Department Stanford University Math 61CM/DM – Basic algebraic structures

The purpose of this handout is to provide some basic definitions and a brief discussion of some key ideas and objects in algebra. One main new idea you will be studying in class is the notion of a field. This is a concept which generalizes the algebraic properties of the real numbers (as well as the rational numbers and the complex numbers). However, mathematicians find it useful to abstract the properties of these familiar fields into a general definition. It turns out that there are a lot of other interesting examples; we present a few of these below. One of the points of this is that a substantial portion of linear algebra can be done in the setting of general fields, rather than how it is more customarily done, over the real numbers. This will be especially pertinent to the students in 61DM. For the 61CM students, you should view this as a good way to get accustomed to a slightly different level of abstraction, and you should also use this as an opportunity to get used to the fact that the basic results and methods in linear algebra are really “algebraic”, i.e., only depend on the handful of axioms in the definition of a field.

In mathematics, the most fundamental objects are sets. These are just collections of objects. We will be concerned with either finite or certain infinite sets. (It turns out that there is quite a lot that can be said about sets in general, but that’s another story.) However, sets are kind of static objects – they just sit there. One can define progressively more sophisticated objects by prescribing certain sets of rules, or axioms, about how the elements of the sets are related to or interact with one another. We are going to describe a few different types of rules, each slightly more specific than the last, leading to different types of algebraic objects: semigroups, groups and then fields. This handout collects these definitions, discusses a few examples and basic results.

Definition 1 A semigroup with unit (G, ∗, e) is a set of objects G containing a distinguished element e ∈ G, along with a map ∗ : G × G → G, with the following properties:

  1. (Associativity) For all x, y, z ∈ G, x ∗ (y ∗ z) = (x ∗ y) ∗ z.
  2. (Units) There exists an element e ∈ G such that for all x ∈ G, x ∗ e = x = e ∗ x.

You should think of the operation ∗ as being ‘multiplication’; it is a way of combining elements of the set G to get other elements. Here is a basic example: let G = { 1 , 2 , 3 ,.. .}, and ∗ ordinary multiplication. The ‘identity element’ e is simply 1. It is obvious that the two rules hold. Here is another example: now let G = { 0 , 1 , 2 ,.. .}, but this time, suppose that ∗ is the symbol which corresponds to addition. Now e = 0 and once again the two rules hold.

This is one of the most primitive algebraic structures: we have a set and a way of combining elements in it. We only have one “extra”, which is the existence of a unit e. (One can also talk about semigroups without units; there are even some interesting examples!)

Lemma 1 In any semigroup with (G, ∗, e), the unit e is unique.

Proof: Suppose e, f ∈ G are two possibly different elements which both satisfy the properties of a unit. Then e = e ∗ f since f is a unit, and e ∗ f = f since e is a unit. Combining these, we see that e = f.  This means that one can talk about the unit, i.e. given (1) and (2), e is unique.

It is a bit more interesting if one adds one further property:

Definition 2 A group (G, ∗) is a semigroup with unit (G, ∗, e) with one additional property:

  1. (Inverses) For every x ∈ G, there exists an element y ∈ G such that x ∗ y = e = y ∗ x.

Similarly to the lemma above, inverses are also unique.

Lemma 2 Suppose that (G, ∗) is a group. If x ∈ G there exist elements y, z ∈ G such that y ∗ x = e = x ∗ z. Then y = z.

Try to prove this yourself!

It is usually simpler to just say that G is a group, without explicitly mentioning ∗ and e.

Groups turn out to be really fundamental and extraordinarily important objects in mathemat- ics; they are the basic way to describe symmetry. Groups are widely used in physics, chemistry and elsewhere.

Here are a few interesting groups:

  1. (R, +), the set of all real numbers with addition;
  2. (Z, +), the set of all integers with addition;
  3. (Q, +), the set of all rational numbers with addition;
  4. (Q[

2], +), the set of all numbers of the form a + b

2 where a, b ∈ Q;

  1. (Rn, +), the set of all vectors with n components under addition;
  2. (R+, ·), the set of all positive real numbers with multiplication;
  3. (Z/(nZ), +), the set of integers modulo n, where n is an integer greater than 2, under addition;
  4. The group of all rotations around the origin in R^2 ;
  5. The group of all rotations around the origin in R^3.

For 7) here, we recall that as a set, Z/(nZ) is identified with { 0 , 1 ,... , n − 1 } (remainders when dividing by n), and + means ordinary addition in Z, reduced modulo n, so e.g. in (Z/(5Z), +), 2 + 4 = 1. It is maybe less confusing to write this set as {[0],... , [n − 1]} so we don’t think of its elements as ordinary integers. Then [2] + [4] = [1], etc.

All but the last of these examples of groups have an important extra property:

Definition 3 A commutative, or abelian, group G is one in which x ∗ y = y ∗ x for all x, y ∈ G.

Noncommutative groups (and semigroups) do play a role, even in this class. The group of rotations in R^3 is a really important example; another example of a noncommutative semigroup is the set Mn of n × n matrices, where ∗ denotes matrix multiplication. This is noncommutative when n ≥ 2. Another example we shall see again is the set of all permutations of a finite set S. Permutations form a group: if we permute S then permute again, then the composition of the two permutations is another permutation. The order in which we compose is important, and we would get a different answer if S has at least three elements.

Finally we come to the definition of a field: