Let be a group, , and .
- Prove that and .
- Prove that .
- Prove part (1) when and are arbitrary integers.
- First we show that by induction on . For the base case, note that for all . For the inductive step, suppose for all and . Then . So by induction, for all and .We now show that by induction on . For the base case, note that for all . For the inductive step, suppose for all and . Then . So by induction, for all and .
- We prove this using induction. For the base case , we have , so that . For the inductive step, suppose for some . Then , using the definition of for negative exponents. Thus . By induction, for all .
- Part (1) yields the case . Now for all integers and , we have and . Without loss of generality, two cases remain: and and . In the first case, we have . In the second case, we have three subcases: , , and . In the first case, we have . Then , so by the uniqueness of inverses, . So . If we have . If , we have . Thus for all integers and .Next, we show that for all integers and . If either of or is zero, then holds trivially. If and , we showed this in part 1. If and , then . Now . Similarly if and . If , then .
No comments:
Post a Comment