Abstract Algebra

Abstract algebra is the axiomatic study of algebraic structures.

Definition

Abstract algebra is the field of mathematics dedicated to the study of algebraic theories, and the algebraic structures that inhabit them. Abstract algebra focuses on the axiomatic rules that define how elements in a set interact through operations.

Examples

Idea

Idea

A ring is a algebraic generalization of the integers.

Link to original

Idea

A field is a generalization encompassing number systems such as reals $\mathbb{R}$, rationals $\mathbb{Q}$, and complex numbers $\mathbb{C}$. The terminal field is $\mathbb{Q}$. ‘Field = Ring + /‘.

Link to original

Idea

A vector space is a generalization of ${\mathbb{R}}^n$¹, and is primarily of interest for studying linear maps.

Link to original

The Abstract Approach

The “abstract” in abstract algebra refers to the fact that these structures are studied independently of their specific elements. For instance, the Group Axioms apply equally to the rotations of a polygon, permutations of a set, and the addition of integers. This universality allows mathematicians to prove a theorem once for a general structure and apply it to every specific instance across mathematics and science.

Applications

Number Theory: Understanding the properties of integers using ring theory. Physics and Chemistry: Using group theory to describe the symmetry of crystals or the behavior of subatomic particles. Computer Science: Utilizing finite fields for error-correcting codes and cryptography (e.g., the AES encryption standard).

Would you like to see a formal comparison table of the axioms for groups, rings, and fields, or perhaps explore how these relate to the Universal Algebra concepts we discussed previously?

Agebraic Structure

An algebraic structure is a collection of four kinds of objects:

• Sorts
• Operations on sorts
• Distinguished elements
• Laws or equations that the operations must follow.

Instances of an algebra must provide:

• A set for each sort.
• A function for each operation
• A value in a sort for each distinguished element
• And a proof that each law is satisfied.

Example: Groups

For instance a group is made up of:

• A single sort $G$.
• A binary operation $\cdot :G\text{texttimes}G\to G$
• A unary operation ${\_}^{-1}:G\to G$
• A constant $e:G$
• An associativity law $\forall x,y,z:G.x\cdot (y\cdot z)=(x\cdot y)\cdot z$
• Left and right unit laws $\forall x:G.x\cdot e=e\cdot x=x$.
• Left and right inverse laws: $\forall x:G.x\cdot x^{-1}=x^{-1}\cdot x=e$.