13.6. Abstract Groups

Imagine you are given a set, which may or may not be finite, and you are given some binary operation. By binary operation, I mean it operates on 2 operands from the set. The set along with the operation will be called a group if it satisfies certain properties, which we often call as group axioms.

A group consists of a set paired with a binary operation that combines any two elements of that set to produce another element in the same set. For this to qualify as a group, certain conditions, known as axioms, must be satisfied.

Think of a group as a team of players (the set) and the way they pass the ball among themselves (the operation). As long as the way they pass the ball keeps the play within the team, they can be considered a complete team.

The first axiom, closure property, demands that for any two elements from your set, performing the operation on them should result in an element of the set itself. The second property is associativity, which means that the order of operation does not matter. The third property is the existence of an identity element, where you have a special element that does not change other elements when combined. The fourth property requires each element to have an inverse, such that combining an element with its inverse results in the identity element.

1. Closure Property: If you take any two elements from the set and perform the operation, the result must also be an element of the set.
2. Associativity: If you have three elements, the way you group them while performing the operation doesn’t affect the outcome.
3. Identity Element: There exists an element that, when used in the operation with any other element in the set, returns that other element unchanged.
4. Inverse Elements: For every element, there is another element such that when they are combined using the group operation, they yield the identity element.

Using our earlier analogy of the team, closure is like ensuring every pass stays within the team. Associativity is like saying it doesn’t matter who you pass to first; the play will work out the same. The identity element is like a player who can catch the ball without changing its direction, and inverses are like resets in a game, bringing the ball back to its original state after a pass.

For instance, the set of integers with the operation of addition is a group. To check: closure is satisfied since the sum of any two integers is an integer, associativity holds because the sum does not depend on grouping, the identity element is 0 (as adding 0 doesn’t change the sum), and each integer has an inverse (for any integer x, -x is its inverse). Conversely, the set of non-negative integers lacks an inverse for negative integers, so it does not form a group.

The set of integers under addition showcases the group properties effectively. When adding any two integers, we always get another integer, fulfilling the closure property. Additionally, changing how we group numbers during addition does not affect the total. The identity element, 0, sustains the integrity of another integer during addition while inverses are visible in negative integers (which transform any positive number back to zero). In contrast, non-negative integers fail the inverse test as there are no negatives present.

Imagine a bag of apples (the integer set) where picking any two apples (adding) always gives you a certain number of apples (closure). If you take 4 apples, grouping them differently (associativity) doesn’t change the total. If you take away 0 apples (identity), you still have the same number of apples. However, if you only have 0 or more apples and no negative (inverse), you cannot balance out to a zero state with your current apples.

A crucial point to understand is that for a structure to be labeled a group, it must satisfy all four axioms. If even one is lacking, it cannot be considered a group. Furthermore, the axioms do not impose a requirement for the operation to be commutative.

For example, if the closure property fails (like in non-negative integers where negative results exist), it cannot be a group, despite satisfying other axioms. Also, commutativity—where the order of the operation does not matter—is not a requirement for a structure to become a group.

Think of a successful recipe (group) needing all ingredients (axioms); miss even one, and you cannot call it that dish anymore. Making a cake (group operation) can be done in a sequence (order matters) while mixing ingredients—the outcome is still delicious regardless of the order of some steps.

We can abstract from specific examples to a general framework for groups, considering their essential axioms as the focal point regardless of element type or operation. This allows for a broader analysis and application to other mathematical concepts.

By treating groups abstractly, ignoring the specifics about elements or operations, we simplify discussions about groups into consistencies and patterns derived from their axioms. This abstraction is powerful because it means findings applicable to one situation can be extended universally to any group meeting the same set of axioms.

This abstraction can be likened to studying the fundamental rules of a game without needing to discuss specific players or their styles. Even if the game is played differently under varying rules, its core principles still apply.

--