Subgroups

Today, we're going to explore the concept of subgroups. A subgroup is a subset of a group that also follows the group properties. Can anyone tell me what those properties are?

Is it the closure, identity, and inverse?

Exactly! To be a subgroup, it must at least be non-empty and satisfy closure under the operation, as well as the property that every element has an inverse within the subset.

So, can you give us an example of this?

For sure! Consider the set of integers as a subgroup of real numbers under addition. The closure holds here, and every integer has an inverse also in the integers.

What if we take non-negative integers? Is it a subgroup?

Great question! No, it would not be a subgroup because the inverse of any non-zero element is negative, which is not in the set of non-negative integers.

Remember: a non-empty subset that meets closure and the presence of inverses suffices for subgroup confirmation.

Now that we understand what a subgroup is, how can we check if a subset is a subgroup without checking every condition?

Could we just test the closure and inverses?

That's right! If you check for closure and find it holds, along with having inverses, then you can conclude it’s a subgroup without checking everything else.

What happens if the original group is finite?

Great observation! If the original group is finite, just verifying closure suffices, applying Lagrange’s theorem simplifies our checks greatly.

Can you remind us of Lagrange’s theorem?

Of course! It states that the order of any subgroup must divide the order of the entire group in the case of finite groups.

So, understanding subgroups helps in various applications, including calculations involving Lagrange’s theorem.

Now, let's dive into the applications of what we have learned. Lagrange's theorem has significant implications. Can anyone explain what it states?

That the order of a subgroup divides the order of the group?

Exactly! This means that if you have a group of 12 elements, the size of any subgroup can be 1, 2, 3, 4, 6, or 12. No other sizes are possible.

That helps in identifying possible subgroups quickly.

But, why does this only apply to finite groups?

The reason is that Lagrange's theorem focuses on counting elements. If a group is infinite, we can't establish that same structure without additional information.

Can we derive any consequences from Lagrange’s theorem?

Absolutely! For example, if an element generates a cyclic subgroup, its order must divide the group order too. Let’s keep building on this understanding!