Let C &#x2265;<!-- ≥ --> 2 and L &gt; 0 be fixed. Let n &#x2208;<!--

pachaquis3s

pachaquis3s

Answered question

2022-06-22

Let C 2 and L > 0 be fixed. Let n { 1 , 2 , }. Does there exist a polynomial g of degree n such that
0 < g ( 0 ) < g ( L ) , g ( x ) > ( g ( L ) g ( x ) ) C ,     for all  x [ 0 , L ]
holds at least for n big enough?

Answer & Explanation

rioolpijpgp

rioolpijpgp

Beginner2022-06-23Added 19 answers

Step 1
For any fixed L , C > 0 , pick n sufficient large so that L < n C . Now define the polynomial,
p ( x ) := ( C 2 n x + 1 2 ) 2 n + 1
Note that p(x) satisfies the points ( n / C , 0 ) , ( 0 , 1 ( 1 / 2 ) 2 n ) , ( n / C , 1 ) , ( 2 n / C , 1 ( 1 / 2 ) 2 n ) , which implies that p(x) has a vertex at n / C (the absolute maximum of p), and that p(x) is increasing from ( , n / C ] (moreover, p(x) has positive derivative and is in fact concave down on that same region); additionally we see that 0 < p ( x ) < 1 for x [ 0 , L ] . Thus 0 < C 2 n x + 1 2 < 11 for x [ 0 , L ] . Additionally, we clearly see that 0 < p ( 0 ) < p ( L ) < 1 . So for any x [ 0 , L ] we have
p ( x ) = 2 n ( C 2 n x + 1 2 ) 2 n 1 C 2 n = C ( C 2 n x + 1 2 ) 2 n 1 > C ( C 2 n x + 1 2 ) 2 n > C ( ( C 2 n x + 1 2 ) 2 n ( C 2 n L + 1 2 ) 2 n ) = C ( p ( L ) p ( x ) )

Do you have a similar question?

Recalculate according to your conditions!

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?