by definition. We want to show this equals itself. : Let . Then . Assume that . Then since then for some (possibly itself). But then that contradicts , so then . : Let . To show that , let be arbitrary. We want to show that , but by being a subgroup we get that for free.
☐
2
Question
Prove that if then . Give an example where and but . (see Subgroup Generator)
Proof
(Subset): Let . Then . Now using then we get that as desired. It goes to show that obviously that since it is a subgroup of any , but to show if we let then since then . If we let then and thus as desired.
The closure and inverse come from the fact that is from how it is an intersection of Subgroups, so it itself must be a subgroup.
Consider the example . This is an example where these generators equal, but the sets themselves don't.