Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 1.1.19 ($x^{a+b} = x^a x^b$ and $(x^a)^b = x^{ab}$)

Exercise 1.1.19 ($x^{a+b} = x^a x^b$ and $(x^a)^b = x^{ab}$)

Let x G and let a , b + .

(a)
Prove that x a + b = x a x b and ( x a ) b = x 𝑎𝑏 .
(b)
Prove that ( x a ) 1 = x a .
(c)
Establish part (a) for arbitrary integers a and b (positive, negative, or zero).

Answers

Let denote the set { 0 , 1 , 2 , 3 , } .

Proof. Let x G . By the inductive definition of x n (see p. 20), for all n ,

x 0 = 1 , (1) x n + 1 = x n x , (2) x n = ( x 1 ) n . (3)
(a)
Let a be any fixed positive or zero integer. We proceed by induction on b .
  • First, by (1),

    x a + 0 = x a = x a x 0 .

  • Assume that for some b , x a + b = x a x b . Then, using (2),

    x a + ( b + 1 ) = x a + b x = x a x b x = x a x b + 1 .

  • The induction is done, which proves that for all b , x a + b = x a x b . Since a is an arbitrary integer ( a ) , then

    a , b , x a + b = x a x b .

Similarly, let a be any fixed positive or zero integer. We proceed by induction on b .

  • By (1),

    ( x a ) 0 = 1 = x 0 = x a 0 .

  • Assume ( x a ) b = x 𝑎𝑏 for some b . Then

    ( x a ) b + 1 = ( x a ) b x a ( by (2) = x 𝑎𝑏 x a (by the induction hypothesis) = x 𝑎𝑏 + a by the first part = x a ( b + 1 ) .
  • The induction is done, so

    a , b , ( x a ) b = x 𝑎𝑏 .

(b)
By (3), for any a , x a = ( x 1 ) a .

We must prove ( x a ) 1 = ( x 1 ) a , or equivalently x a ( x 1 ) a = 1 . By part (a), x a x = x a + 1 = x 1 + a = x 1 x a = x x a , so x commutes with x a .

  • First x 0 ( x 1 ) 0 = 1 .
  • Assume x a ( x 1 ) a for some a . Then ( x a ) 1 = ( x 1 ) a , thus

    x a + 1 ( x 1 ) a + 1 ) = x a x ( x 1 ) a x 1 ) = x a x ( x a ) 1 x 1 = x x a ( x a ) 1 x 1 ( since  x x a = x a x ) = x x 1 = 1 .
  • The induction is done which proves that for all a , x a ( x 1 ) a = 1 , so

    x a = ( x 1 ) a = ( x a ) 1 ( a ) . (4)

Note: It is important for part (c) to prove that (4) remains true if a < 0 ( a ) . Put α = a , so that α > 0 . By equalities (4), where a is replaced by α > 0 ,

x α = ( x 1 ) α = ( x α ) 1 .

Therefore their inverses are equal:

( x α ) 1 = ( ( x 1 ) α ) 1 = x α .

By (4), where x is replaced by x 1 and a by α > 0 ,

( x 1 ) α = x α = ( ( x 1 ) α ) 1 .

This shows that

x α = ( x 1 ) α = ( x α ) 1 ,

where α = a , so for any integer a < 0

x a = ( x 1 ) a = ( x a ) 1 .

Therefore (4) is true for any a :

x a = ( x 1 ) a = ( x a ) 1 ( a ) . (5)
(c)
Now let a , b be any integers.
  • if a 0 and b 0 , then by part (a),

    x a + b = x a x b .

  • if a 0 and b < 0 , then b > 0 , thus

    • If a + b 0 , then

      x a = x a + b + ( b ) = x a + b x b ,

      and since x b = ( x b ) 1 , then

      x a + b = x a x b .

    • If a + b < 0 , then a b > 0 , and by (5) and part (a);

      x a ( x a + b ) 1 = x a x a b = x b = ( x b ) 1 ,

      thus

      x a + b = x a x b .

  • If a < 0 and b 0 , we prove by exchanging the roles of a and b that x a + b = x a x b .
  • If a < 0 and b < 0 , then by (5)

    x a + b = ( x 1 ) a b = ( x 1 ) a ( x 1 ) b = x a x b .

In every case,

x a + b = x a x b ( a , b ) .

Similarly,

  • If a 0 and b 0 , then by part (a),

    ( x a ) b = x 𝑎𝑏 .

  • If a 0 and b < 0 , then using (5)

    ( x a ) b = ( ( x a ) b ) 1 = ( x 𝑎𝑏 ) 1 = x 𝑎𝑏 .

  • If a < 0 and b 0 , then using (5)

    ( x a ) b = ( ( x 1 ) a ) b = ( x 1 ) 𝑎𝑏 = x 𝑎𝑏 .

  • If a < 0 and b < 0 , then

    ( x a ) b = ( ( ( x 1 ) a ) b ) 1 = ( ( x 1 ) ( a ) ( b ) ) 1 = ( x 𝑎𝑏 ) 1 = x 𝑎𝑏 .

In every case

( x a ) b = x 𝑎𝑏 ( a , b ) .

User profile picture
2026-01-07 12:20
Comments