Thursday, March 2, 2017

calculus - Sufficient and necessary condition in order for a homographic function be absolutely monotonic



Let be I a non-empty and open interval of R.




A function f:IR is said absolutely monotonic on I if :




  1. f is C on I (differentiable as much as you want, continuous for all derivatives).

  2. nN,xI,f(n)(x)0 where f(n) is the n-th derivative.



Let be a,b,αR, we call an homographic function, a function of this form :




f(x)=ax+bxα



What would be a sufficient and necessary condition in order for f(x) to be absolutely monotonic?



Here is what I have attempted:




  • f is C by algebraic operations (quotient).


  • I wanted to find a closed form of the n-th derivative of f.
    I have thought of using Leibniz formula, obviously, it didn't work because the numerator becomes too complex to handle.

  • I remarked that the denominator is always positive due to being always squared when derivating again.

  • Knowing that denominator is always positive, I eventually need to do is to consider when x<α and x>α, and prove that all derivatives' numerators have the same sign. So I can deduce the overall sign of the fraction. That's where I don't how to proceed further.


Answer



Let be a,b,γR such that a<b and I=]a,b[ so that γI.



Let α,βR such that:




xI,f(x)=αx+βxγ, an homographic function.



First, for all n1, for all aC, for all xR{a} :



dndxn(1xa)=(1)nn!(xa)n+1



Then, for all xI :




dndxnf(x)=αdndxn(xxγ)+βdndxn(1xγ)=αdn1dxn1((xγ)x(xγ)2)+β(1)nn!(xγ)n+1=αγdn1dxn1(1(xγ)2)+β(1)nn!(xγ)n+1



By Leibniz's formula :



dn1dxn11(xγ)2=n1k=0(n1k)(1)kk!(xγ)k+1(1)nk1(nk1)!(xγ)nk=(1)n1(n1)!n1k=01(xγ)n+1=(1)n1n!(xγ)n+1



At the end :



dndxnf(x)=αγdn1dxn1(1(xγ)2)+β(1)nn!(xγ)n+1=αγ(1)nn!(xγ)n+1+β(1)nn!(xγ)n+1=(1)nn!(xγ)n+1(αγ+β)



Then f is absolutely monotonic if and only if for all nN, for all xI, f(n)(x)0.



Case n1



Sub-case : n is even



Let's write n=2k,kN.




Then, for all xI :



f(n)(x)=f(2k)(x)=(1)2k(2k)!(αγ+β)(xγ)2k+1=(2k)!(αγ+β)(xγ)2k+1



Then, f(n)(x)0 if and only if (αγ+β)(xγ)2k+10.





  • Either αγ+β0 and xγ0 for all xI, i.e. xγ, i.e. aγ (1)

  • Either αγ+β0 and xγ0 for all xI, i.e. xγ, i.e. bγ (2)



Sub-case : n is odd



Let's write n=2k+1,kN.



Then, for all xI :




f(n)(x)=f(2k+1)(x)=(1)2k+1(2k+1)!(αγ+β)(xγ)2k+2=(2k+1)!(αγ+β)((xγ)k)2



Then (αγ+β)0.



That is : αγ+β0.




Then, in the previous subcase, (1) is impossible, so that we only have (2).



Let's summarize so far.



In order for f to be absolutely monotonic, it is necessary (but not sufficient):




  • αγ+β0

  • bγ.




Case n=0



f(x)0 for all xI if and only if (αx+β)(xγ)0.



That is:




  • Either αx+β0 and xγ0 (1)


  • Either αx+β0 and xγ0 (2)



(1) is impossible because x<γ due to the previous case.
Then we have (2), i.e. αx+β0 for all xI.



Then : αxβ.




  • If α>0, then xβα, i.e. bβα, i.e. bmin{βα,γ}.


  • If α<0, then xβα, i.e. aβα.



In the end:



If f is absolutely monotonic, necessarily, we have:




  • αγ+β0.

  • If α>0, I],γ[ because γβα.


  • If α<0, I]βα,γ[.



By construction, such an homographic function is always absolutely monotonic, so these conditions are sufficient.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...