Proof: By the first, we have a2b−2=1. However, by the second, we also have a2b−2=a2(a−1ba)(a−1ba)=ab2a, so that ab2a=1, then a−2=b2=a2 so a4=1. Now, a2=b2⇒a4=1=b4.
Prove by induction that bka=ab−k. The case holds for k=1 by the presentation, and bk+1a=bbka=bab−k=ab−1b−k=ab−(k+1). By extension, abk=b−ka. We can see by repeated multiplication the left by a, that generally aibk=b±kai.
Attempt to observe any element with a reduced width n greater than 2, necessarily in either the form ...aen−2ben−1aen=...aen−2+enb±en−1 or ...ben−2aen−1ben=...ben−2±enaen−1, a contradiction in any case. So every element can be reduced to the form axby or bxay (with 0≤x,y≤3), the latter of which can be ignored as bxay=ayb±x. Using the relations we have been given and have established, we can easily establish equivalency classes among these sixteen candidates to provide a maximum of eight distinct elements (e.g. ab3=aa2b=a3b). Since i,j∈Q8 fulfill the relations presented above for a,b and ⟨ i,j ⟩=Q8, we have the presentation validated. ◻
No comments:
Post a Comment