15.2.1. Definition of Subgroups

In this lecture, we will introduce the definition of subgroups and we will see some properties of subgroups.

The section begins by emphasizing the importance of understanding subgroups, small groups within larger groups, in the study of group theory. It introduces the concept that we will define and explore through properties and theorems.

Think of subgroups like family units within a larger population. Just as a large city may comprise many small neighborhoods, a group in mathematics can have various subgroups that share specific characteristics.

Imagine you are given an abstract group $G$ with operation $\circ$, it may or may not be finite. And imagine I take a subset $H$ for the set $G$. Again it may or may not be finite. If the subset $H$ with the same operation $\circ$ satisfies the group axioms namely $G_1, G_2, G_3, G_4$, then $H$ along with the operation $\circ$ is called a subgroup of the original group.

This chunk defines what a subgroup is. It states that for a subset to be considered a subgroup, it must satisfy certain axioms which are the basic rules of a group: closure, identity, inverses, and associativity. The subset needs to retain these properties to function as a group in its own right.

Imagine a club (the group) that consists of various committees. If one committee meets all the rules and requirements of the club (like handling its finances responsibly), it can be seen as a subgroup of the club.

For example, let group $G$ be the set of real numbers with the operation of integer addition, then the set of integers is a subset of the set of real numbers. The set of integers is indeed a group; it satisfies the group axioms with respect to integer addition. However, if I take the set of non-negative integers with the addition operation, that does not constitute a subgroup because it lacks certain group properties.

In this chunk, we explore the idea of subgroups with two examples: real numbers under integer addition and integers under addition. The integers form a subgroup because they meet the group axioms, while the non-negative integers do not because they lack an additive inverse (negative integers). This highlights how subsets can or cannot form groups based on their properties.

Consider a library (the set of real numbers), which contains many books (the integers). Every book (integer) can be borrowed (added) without issue; however, if you only allow a specific category of books (non-negative integers), you might miss important genres, paralleling the missing inverse function.

To check whether it is a subgroup or not, there are 2 options: you can manually check if all group axioms are satisfied, or we look for a characterization that gives conditions sufficient to declare whether the subset $H$ satisfies the group axioms.

This chunk discusses methods to determine if a subset is a subgroup. Instead of checking each group axiom individually, it suggests conditions to look for. If these conditions hold, the subset can be declared a subgroup without exhaustive verification.

Imagine testing if a new recipe (the subset) belongs to your cookbook (the group). Instead of cooking each dish (checking each axiom), you might look for specific ingredients (the conditions) that must be present to qualify.

The characterizations state that the subset $H$ must be non-empty and satisfy two properties: closure and the existence of inverses within the subset.

This section defines key necessary conditions for a subset to be a subgroup. It emphasizes that a subgroup must be non-empty, ensuring it contains at least the identity element and must satisfy closure (operating any two elements produces another element in the set) and have inverses.

Think about a sports team (the subgroup). If your team has at least one player (non-empty) and every member can successfully pass the ball to another (closure), as well as handle turnovers (inverses), then the team can function effectively.

If conditions are satisfied, all group axioms are satisfied. Closure ensures operation within the subset; the associativity property holds because it's inherited from the larger group; inverses are present due to properties stated.

This chunk explains that satisfying the two conditions of closure and the existence of inverses guarantees that all group axioms are satisfied within the subset. Associativity is inherited from the larger group, simplifying the verification process for determining subgroups.

Returning to our team analogy, if all players are skilled (closure) and can assist each other effectively (inverses), it’s reasonable to assume that the team can work cohesively under the rules of the game (group axioms) smoothly.

If your original group $G$ is finite, then you only need to check the closure property in the subset $H$. If closure holds, then all group axioms will also hold.

This corollary simplifies subgroup verification for finite groups. It asserts that verifying just the closure property is sufficient to confirm all group axioms hold for the subset. This is especially useful as it reduces effort when dealing with larger groups.

Think of a group project deadline (the group) and having a checklist of tasks (the subset). If every task is outlined clearly (closure), you can be confident that the project will complete on time (satisfying all group axioms).

--