Let P(n) : If AB=BA, then ABn=BnA
For n=1
L.H.S. =AB1=AB
R.H.S.=B1A=BA=AB
So, L.H.S.=R.H.S.
∴ P(n) is true for n=1.
Let us assume P(k) is true for some kϵN
P(k) : If AB=BA, then ABk=BkA …(1)
We will prove that P(k+1) is true.
P(k+1): If AB=BA, then ABk+1=Bk+1A
Taking L.H.S.
ABk+1=A.(BkB)
=(ABk).B
=(Bk.A)B (From (1), ABk=BkA)
=Bk(AB)
=Bk(BA) (AB=BA given)
=(BkB)A
=Bk+1A
=R.H.S.
Hence P(k+1) is true is when P(k) is true.
∴ By the principle of mathematical induction,
P(n) is true for all nϵN.
∴ If AB=BA, then ABn=BnA where nϵN.
Let P(n) : If AB=BA, then (AB)n=AnBn
For n=1
L.H.S. =(AB)1=AB
R.H.S. =A1B1=AB
So, L.H.S.=R.H.S.
∴ P(n) is true for n=1.
We assume that P(k) is true for some kϵN
P(k) : If AB=BA, then (AB)k=AkBk …(2)
We will prove that P(k+1) is true
P(k+1): If AB=BA, then
(AB)k+1=Ak+1.Bk+1
Taking L.H.S.
(AB)k+1=(AB)k.AB
=AkBk(AB) (From (2))
=AkBk(BA) (Given: AB=BA)
=Ak(BkB)A
=Ak(Bk+1)A
=Ak(Bk+1A)
=Ak(ABk+1) (Proved by induction)
=(AkA)Bk+1
=Ak+1.Bk+1
=R.H.S.
Hence P(k+1) is true
∴ By the principle of mathematical induction, P(n) is true for all nϵN.
∴ If AB=BA, then (AB)n=AnBn where nϵN.