: Let . We want to show that that , so then that then .
Now, let . Then then . Now since then as desired. Thus then .
Now to deduce , notice that for any set that:
so using our first part automatically gives us .
☐
3
Question
Prove that if and are subsets of with then is a Subgroup of .
Proof
Let's just assume that is a group as it's trivial to show. It is good to note that as if we let then then . Let (and thus ) so then and thus .
(Closure under binary operation) Let . Then then and the same for . Now let and consider . We want to show:
To do this, notice that as , so then and the same for . Thus:
Thus .
(Inverses are in the set). Let . Again then . We want to show that . Now to do this let . Then as described before. We really want to show that but that's easy since:
(a): Let's assume that be a group. Let's show that . Let . We want to show that (because then by definition we have ). To do this consider the following subset arguments:
: Let . Then because is closed under binary operations then as desired.
: Let . Construct (by closure of ). Notice that:
Thus as desired.
To show that this is not necessarily true if is not a subgroup, it begs to find a group that isn't a subset, as then we don't get the subset property above (and thus it's not a valid statement). Let and . Clearly is not a valid subgroup, and , but still doesn't have the identity element and thus is not a subgroup here.
(b): For the forward direction, suppose . Let . Then by . Then . Use to get that , showing abelianness of .
For the reverse direction, suppose is abelian. Then to show (similar to (a)) we only need to show . Let . To show let . Notice that by being abelian, then . Thus .
☐
11
Question
Prove that for any
Proof
Clearly is closed (with its inverses) so we'll only show for any .
Let , and let . Then by the definition for .
To show requires showing :
: Let , so where . Now and so then . Thus using then . Thus: