15.2. Subgroups

In this lecture, we will introduce the definition of subgroups and we will see some properties of subgroups. And then we will discuss about Lagrange’s theorem in the context of subgroups and its applications.

In this initial part, the speaker sets the stage for the lecture by outlining the topics that will be covered. It begins with understanding the definition of 'subgroups' and discussing their properties followed by the exploration of Lagrange’s theorem. Understanding subgroups is essential in group theory, a fundamental part of abstract algebra, as they help in classifying the structures within groups.

Think of a club that has different committees within it, such as a finance committee, a marketing committee, or an events committee. Each committee operates independently but is part of the larger organization. In mathematics, subgroups function similarly as they are smaller groups defined within the bigger group, just like each committee is part of the entire club.

So, imagine you are given an abstract group G with operation ∘, it may or may not be finite. And imagine I take a subset H for the set G. H has to be non-empty. If H with the same operation ∘ satisfies the group axioms, then H is a subgroup of G.

A subgroup is defined through the relationship it maintains with its parent group. To be considered a subgroup, the subset must meet certain criteria or axioms of groups: closure, identity, inverses, and associativity. The first requirement is that H is a non-empty subset; it needs at least one element, usually the identity element. Next, H should fulfill the same group operations as G without losing the properties that characterized the group in the first place.

If we consider a group of friends going out for a movie (the original group), a subgroup can represent a small group of those friends who want to watch a specific movie. They must fulfill the same group rules, such as adding new friends, ensuring everyone agrees on the movie, and making sure each movie function has a clear structure on how to decide what to watch.

For instance, the set of integers is a subgroup of real numbers under addition, but the non-negative integers are not.

This example illustrates the concept of subgroups concretely. The integers { …, -2, -1, 0, 1, 2, … } under addition make a subgroup within the real numbers because they satisfy all group axioms. Specifically, they contain the identity (0), every integer has an inverse (its negative), and the closure property is satisfied, meaning if you add two integers, the result is still an integer. However, the non-negative integers {0, 1, 2, ...} do not fulfill all axioms since the inverse for positive integers is negative, which is outside of their set.

Considering a library of books, the entire library (real numbers) holds all sorts of genres, while a particular section for novels (integers) will have its rules (like how many people can borrow at once). A sub-section specifically for only new novels (non-negative integers) cannot thrive if it doesn't allow classics or re-issues, just like the non-negative integers fail to provide for all inverses.

To check whether a subset H is a subgroup of G, verify if it is non-empty and satisfies closure and inverse properties.

To determine if a subset is a subgroup, we use a characterization based on two critical properties: closure and inverses. The closure property states that if you take any two elements from H and perform the group operation, the result must also belong to H. The inverse property states that for every element in H, there must exist an inverse in H that also satisfies the group requirement. Meeting just these conditions can simplify verification instead of confirming all four group properties individually.

Imagine running a small project team within a larger organization. To function smoothly within this organization (the group), your project team must have its rules (closure) about how tasks interconnect. Also, every team member must mutually support each other's roles (inverse) ensuring no one is left without help. These properties allow the project team to remain effective.

If conditions of closure and inverses are satisfied, then all group axioms are also satisfied.

This proof shows that satisfying closure and inverses inherently guarantees others (identity and associativity). If both closure and inverses hold for subset H, it confirms that H contains the identity element and maintains operation rules, thus ensuring that all group conditions are met. This understanding allows for efficient checks without exhaustive evaluations of each axiom.

Consider a local sports team where having a coach (identity) and training equipment (closure) means that not only can it operate smoothly but also all players support each other (inverses). Thus, ensuring the larger organization’s requirements are consistently met.

In a finite group, checking only closure is sufficient to confirm subgroup status.

This corollary simplifies subgroup checks dramatically when dealing with finite groups. If the closure property holds in a subset, it guarantees all subgroup properties will also conclude favorably. This is particularly useful because verifying closure is less complex than checking all axioms individually.

Imagine a closed shop where checks for opening are solely based on whether there are customers (closure). If there’s a steady influx (closure), you can efficiently conclude that everything else (employee rules, services, hours) operates well without having to verify each aspect continuously.

Using the previous result, we can derive cyclic subgroups from group elements.

By taking an element and its powers, we can create a cyclic subgroup. The subgroup formed by these powers retains the properties necessary to be a valid subgroup, confirming that cyclic structures are inherent within groups. This illustrates a systematic way to identify and create subgroups based on single elements.

Consider a gym where choosing a weight (element) allows an individual to follow a workout plan where different repetitions (powers) create a tailored fitness program (cyclic subgroup). Each repetition has distinct impacts, but they all contribute back to the effective workout routine.

The left coset of subgroup H involves the product of a group element G with each element of H.

Cosets, left or right, arise when we combine a subgroup with another element from the parent group, illustrating how groups can be partitioned. A left coset is constructed from multiplying an element from the original group with every element of the subgroup, creating a new collective that showcases some division of the group.

Think of an inventory system where a specific product (group element) can be associated with all of its variations (subgroup). Every unique styling (coset) combines the essence of that product in different contexts, showcasing how subdivisions occur within the market, akin to how cosets operate within groups.

Lagrange’s theorem states that in a finite group G of order n and a subgroup H of order m, then m divides n.

Lagrange’s theorem provides a powerful link between the orders of groups and their subgroups. If you know the order of the subgroup, you can confidently ascertain that it will divide the larger group's order. This theorem is pivotal because it connects the structure of groups and subgroups mathematically, enabling us to predict relationships and characteristics of groups.

Imagine a school with many classes (the group) where each class can have students (the subgroup). If you count the total number of students in the school and know how many students are in each class, Lagrange’s theorem ensures that you can partition the total based on the class size, confirming structure in a reliable way.

--