I'm struggling with this: Define P m </msub> : N &#x2192;<!-- → -->

Gretchen Schwartz

Gretchen Schwartz

Answered question

2022-07-03

I'm struggling with this:
Define P m : N N by P m ( n ) = nm and m n as ( P m ) n ( 1 )
Now prove k m + n = k m k n , and k m n = ( k m ) n and ( k n ) ( m n ) = ( k m ) n for all k , m , n N
Much appreciated! - I can get the first one using induction but the others are allusive...

Answer & Explanation

Dayana Zuniga

Dayana Zuniga

Beginner2022-07-04Added 16 answers

All three identities are proved via Mathematical Induction.

We first need to prove recursive identities.

Using the above definition for exponents of the natural numbers it is shown that m 0 = 1 and m S ( n ) = m ( m n ), where S is the successor function from Peano's postulates.
m 0 = ( P m ) 0 ( 1 ) = 1 N ( 1 ) = 1, so m 0 = 1
m S ( n ) = ( P m ) S ( n ) ( 1 ) = P m ( P m ) n ( 1 ) = P m ( m n ) = m ( m n )
Let U be the set of natural numbers, for which k m + n = k m k n is true. We use induction on n N for all natural numbers m.
0 U , as k m + 0 = k m = k m 1 = k m k 0
Assume n U, then k m + S ( n ) = k S ( m + n ) = k ( k m + n ) = k ( k m k n ) = k ( k n k m ) = ( k k n ) k m = k S ( n ) k m
So S ( n ) U and U = N by PMI

Second identity: Prove k m n = ( k m ) n
The proofs of the other two identities are similar. Let me know if you would like them and I'll post them...

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Elementary geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?