Problem with proof for ClogA=logA^C

[georg gill]

hi i have link to problem it is a document from my computer uploaded tp scribd:

http://www.scribd.com/doc/72599157/PDF-Log-Rule

 

[HallsofIvy]

How you prove a basic result like that depends upon how you have defined the logarithm! Many texts first define the exponential function, f(x)= a^x, prove its propeorties, such as (a^x)^y= a^{xy}, show that it is "one-to-one" (and so has an inverse), then define log_a(x) as its inverse function. That is, y= log_a(x) if and only if x= a^y.

In particular, if y= log_a(x^C) then x^C= a^y. If C\ne 0 taking the "C"th root of both sides, x= (a^y)^{1/C}= a^{y/C}. From that, y/C= log_a(x) so that y= C log_a(x).

Many modern Calculus texts go the other way- they first define the natural logrithm by
ln(x)= \int_1^x \frac{1}{t}dt.

From that,
ln(x^C)= \int_1^{x^C} \frac{1}{t}dt
If C\ne 0 let u= t^{1/C} so that t= u^C, dt= Cu^{C-1}dt, when t= 1, u= 1^{1/C}= 1 and when t= x^C, u= (x^C)^{1/C}= x . Then
ln(x^C)= \int_1^x \frac{1}{u^C} (Cu^{c-1}du)= C\int_1^x \frac{1}{u}du= Cln(x)

The more general formula follows from the "change of base" formula:
log_a(x)= \frac{log_b(x)}{log_b(a)}

log_a(x^C)= \frac{ln(x^C)}{ln(a)}= C\frac{ln(x)}{ln(a)}= Clog_a(x)

Of course, if C= 0, then x^C= x^0= 1 in which case log_a(x^C)= log_a(1)= 0= C log_a(x).

 

[georg gill]

In particular, if y= log_a(x^C) then x^C= a^y. If C\ne 0 taking the "C"th root of both sides, x= (a^y)^{1/C}= a^{y/C}. From that, y/C= log_a(x) so that y= C log_a(x).

What you write here is wery neat but it is the same problem to me:

x= (a^y)^{1/C}= a^{y/C}

I get it if it is a simple problem like:

(e^2)^4=e^2\cdot e^2\cdot e^2\cdot e^2=e^8

where it only is e to the second power multiplied 4 times and then you multiply e to te second power 4 times and get e multiplied with itself 8 times but if

(e^2)^{1.32}

then it is a bit harder to imagine and I need a proof to make it look understandable.

I actually have gotten into a circle of problems here. The log rule above is also proved with derivation

http://bildr.no/view/1026584
It uses chain rule which i have proven by linearization and the derivation of lnx is proved in the book by its inverse function

but in the proof for polynoms they use the same logarithm rule which -I started this with:

http://bildr.no/view/1026598

it also assumes that yo know chain rule (as I said no problem) and the derivation of e^x which is proven usin definition of inverse and the fact that the slope of the inverse is 1 divided by the slope of the function it is inverse too. That is dx/dy which make ssense since for the inverse x and y have changed places

http://bildr.no/view/1026637So double occurence of same problem

 

[micromass]

So basically, you want a proof of

(a^m)^n=a^{mn}

This relies heavily on the definition of the exponentiation.

If m and n are integers, then it is pretty obvious. A proof by induction should do.

If m=x/y and n=p/q are fractions, then we recall the definition:

a^{x/y}=\sqrt[y]{a^x}

So wee need to prove

\sqrt[q]{(\sqrt[y]{a^x})^p}=\sqrt[yq]{a^{xp}}

To prove this, we need some auxiliary results (for m,n integers which are not necessarily the previous m and n)

1) \sqrt[m]{a^n}=(\sqrt[m]{a})^n This follows basically from the formula

\sqrt[m]{ab}=\sqrt[m]{a}\sqrt[m]{b}
Just raise both sides to the m-pth power.

2) \sqrt[m]{\sqrt[n]{a}}=\sqrt[mn]{a}
Raise both sides to the mn-th power

With these two results, you can prove the formula. So if m and n are rational, then you have proven it.

If m and n are irrational, then things are more complicated. I see no other way than actually working with Dedekind cuts to prove the result. You can find the proof in this case in Rudin's "principles of mathematical analysis".

 

[georg gill]

1) \sqrt[m]{a^n}=(\sqrt[m]{a})^n This follows basically from the formula

\sqrt[m]{ab}=\sqrt[m]{a}\sqrt[m]{b}
Just raise both sides to the m-pth power.

Could you please show this a bit more clearly. Would be much appreciated.

 

[georg gill]

So basically, you want a proof of

(a^m)^n=a^{mn}

This relies heavily on the definition of the exponentiation.

If m and n are integers, then it is pretty obvious. A proof by induction should do.

If m=x/y and n=p/q are fractions, then we recall the definition:

a^{x/y}=\sqrt[y]{a^x}

So wee need to prove

\sqrt[q]{(\sqrt[y]{a^x})^p}=\sqrt[yq]{a^{xp}}

To prove this, we need some auxiliary results (for m,n integers which are not necessarily the previous m and n)

1) \sqrt[m]{a^n}=(\sqrt[m]{a})^n This follows basically from the formula

\sqrt[m]{ab}=\sqrt[m]{a}\sqrt[m]{b}
Just raise both sides to the m-pth power.

2) \sqrt[m]{\sqrt[n]{a}}=\sqrt[mn]{a}
Raise both sides to the mn-th power

With these two results, you can prove the formula. So if m and n are rational, then you have proven it.

If m and n are irrational, then things are more complicated. I see no other way than actually working with Dedekind cuts to prove the result. You can find the proof in this case in Rudin's "principles of mathematical analysis".

I think I have prove the things you use in 1):

http://www.viewdocsonline.com/document/biwlgx

and

\sqrt[n]{ab}=\sqrt[n]{a}\sqrt[n]{b} (I)

we can write

\sqrt[n]{a^m}=\sqrt[n]{aa...a}=y

where (I) is

\sqrt[n]{a^m}=\sqrt[n]{a}\sqrt[n]{a}...\sqrt[n]{a}=y (I)

we have a^{\frac{1}{n}} multiplied with itself m times

and

\sqrt[n]{a}=y^{\frac{1}{m}} (II)

from (I) and (II) we get

(\sqrt[n]{a})^m=y=\sqrt[n]{a^m}

could you please tell the second step one more time?