24 Subgroups Generated by Subsets of a Group

1

Question

Prove that if H is a Subgroup of G then ⟨H⟩=H (see Subgroup Generator)

Proof

Suppose H≤G. Here:

⟨H⟩=⋂H⊆Hi:Hi≤GHi

by definition. We want to show this equals H itself.
(⊆): Let h∈⟨H⟩. Then ∀Hi≤G,H⊆Hi(h∈Hi). Assume that h∉H. Then since H≤H then h∉Hi for some Hi (possibly H itself). But then that contradicts h∈⟨H⟩, so then h∈H.
(⊇): Let h∈H. To show that h∈⟨H⟩, let H≤Hi be arbitrary. We want to show that h∈Hi, but by being a subgroup we get that for free.

☐

2

Question

Prove that if A⊆B then ⟨A⟩≤⟨B⟩. Give an example where A⊆B and A≠B but ⟨A⟩=⟨B⟩. (see Subgroup Generator)

Proof

(Subset): Let a∈⟨A⟩. Then ∀A⊆H,H≤G(a∈H). Now using H:=⟨B⟩ then we get that a∈⟨B⟩ as desired. It goes to show that obviously that ⟨B⟩≤G since it is a subgroup of any H≤G, but to show A⊆⟨B⟩ if we let h∈A then since A⊆B then h∈B. If we let B⊆H,H≤G then h∈H and thus h∈⟨B⟩ as desired.

The closure and inverse come from the fact that ⟨A⟩ is from how it is an intersection of Subgroups, so it itself must be a subgroup.

Consider the example ⟨G⟩=⟨G−{1}⟩. This is an example where these generators equal, but the sets themselves don't.

☐