Let and if , let's define . Due to Weierstrass extrem value theorem this maximum exits.
Example.-
Find ,i.e, Minimize such that . Give the exact answer.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki.- Chebyshev Polynomials
If p is a monic polynomial of degree n ≥ 1 in [ − 1 , 1 ] with coefficients in R , then ∣ ∣ p ∣ ∣ ∞ ≥ 2 n − 1 1 = ∣ ∣ 2 n − 1 1 ⋅ T n ∣ ∣ ∞ in [-1, 1], whith T n being Chebyshev polynomial of first kind of degree n and ∣ ∣ f ∣ ∣ ∞ = supremum { ∣ f ( x ) ∣ ; x ∈ [ − 1 , 1 ] } .
Therefore, p ∈ P 6 [ − 1 , 1 ] min ∣ ∣ p ∣ ∣ ∞ = 2 5 1 = 3 2 1 = 0 . 0 3 1 2 5 and it's got with the polynomial 2 5 1 ⋅ T 6 ( t ) = 3 2 1 ⋅ ( 3 2 t 6 − 4 8 t 4 + 1 8 t 2 − 1 )
Chebyshev polynomials
Chebyshev polynomials (of first kind) are defined by recurrence: ⎩ ⎪ ⎨ ⎪ ⎧ T 0 ( t ) = 1 T 1 ( t ) = t T n + 1 ( t ) = 2 t T n ( t ) − T n − 1 ( t ) , ∀ n ≥ 1
First Examples.-
T 0 ( t ) T 1 ( t ) T 2 ( t ) T 3 ( t ) T 4 ( t ) T 5 ( t ) T 6 ( t ) = 1 = t = 2 t 2 − 1 = 4 t 3 − 3 t = 8 t 4 − 8 t 2 + 1 = 1 6 t 5 − 2 0 t 3 + 5 t = 3 2 t 6 − 4 8 t 4 + 1 8 t 2 − 1 .
Observations.-
1 . − The recurrent formula uniquely determines these polynomials, i.e, these polynomials are well-defined and are unique defined by this recurrence.
2 . − T n is a polynomial of degree n (Prove it by induction) .
3 . − The coefficient of t n in T n is 2 n − 1 , ∀ n ≥ 1 . Prove it by induction too.
T n ( t ) = cos ( n cos − 1 ( t ) ) , ∀ t ∈ [ − 1 , 1 ] , where cos − 1 : [ − 1 , 1 ] → [ 0 , π ] is a continuous determitation of cos − 1 .
Proof.-
Let's define f n ( t ) = cos ( n cos − 1 ( t ) ) , where ( f n ) n = 0 ∞ satisfies: f 0 ( t ) = 1 , f 1 ( t ) = t Now, we are going to use cos ( n + 1 ) θ = cos ( n θ ) cos θ − sin θ sin ( n θ ) cos ( n − 1 ) θ = cos ( n θ ) cos θ + sin θ sin ( n θ ) Therefore, cos ( n + 1 ) θ + cos ( n − 1 ) θ = 2 cos ( n θ ) cos θ ⇒ cos ( n + 1 ) θ = 2 cos ( n θ ) cos θ − cos ( n − 1 ) θ , ∀ θ ∈ [ 0 , π ] Let's call, cos θ = t ⟺ θ = cos − 1 ( t ) , ∀ θ ∈ [ 0 , π ] , ∀ t ∈ [ − 1 , 1 ] ⇒ cos ( ( n + 1 ) cos − 1 ( t ) ) = 2 t cos ( n cos − 1 ( t ) ) ) − cos ( ( n − 1 ) cos − 1 ( t ) ) ⇒ f n + 1 ( t ) = 2 t f n ( t ) − f n − 1 ( t ) , ∀ t ∈ [ − 1 , 1 ] ⇒ f n = T n , n = 0 , 1 , . . . q.e.d
If ( T n ) n = 0 ∞ is the sequence of Chebyshev polynomials (of first kind), then:
1 . − ∣ T n ( t ) ∣ ≤ 1 , ∀ t ∈ [ − 1 , 1 ]
2 . − T n ( cos ( n j π ) ) = ( − 1 ) j , ∀ 0 ≤ j ≤ n
3 . − T n ( cos ( 2 n ( 2 j − 1 ) π ) ) = 0 , ∀ 1 ≤ j ≤ n
Proof.-
1 . − Trivial due to previous proposition.
2 . − T n ( cos ( n j π ) ) = cos ( n ⋅ ( n j π ) ) = ( − 1 ) j , ∀ 0 ≤ j ≤ n
3 . − T n ( cos ( 2 n ( 2 j − 1 ) π ) ) = cos ( n ⋅ ( 2 n ( 2 j − 1 ) π ) ) = cos ( n ( 2 j − 1 ) π ) = 0 , ∀ 1 ≤ j ≤ n
q.e.d
If p is a monic polynomial of degree n ≥ 1 in [ − 1 , 1 ] with coefficients in R , then ∣ ∣ p ∣ ∣ ∞ ≥ 2 n − 1 1 = ∣ ∣ 2 n − 1 1 ⋅ T n ∣ ∣ ∞ in [-1, 1], (whith T n being Chebyshev polynomial of first kind of degree n and ∣ ∣ f ∣ ∣ ∞ = supremum { ∣ f ( x ) ∣ ; x ∈ [ − 1 , 1 ] } .)
Proof.- (by contradiction or reductio ad absurdum)
I'm going to use the two previous propositions and this Bolzano's theorem
Let's suppose that there exists a monic polynomial p of degree n ≥ 1 such that ∣ ∣ p ∣ ∣ ∞ < 2 n − 1 1 ⟺ ∣ p ( t ) ∣ < 2 n − 1 1 , ∀ t ∈ [ − 1 , 1 ] Take t i = cos n i π , i = 0 , 1 , . . . , n and remember that T n ( t i ) = ( − 1 ) i , i = 0 , 1 , . . . , n . Let's call 2 n − 1 1 ⋅ T n ( t ) = q ( t ) which it's a monic polynomial of degree n. Then, ( − 1 ) i ⋅ p ( t i ) ≤ ∣ p ( t i ) ∣ < 2 n − 1 1 = 2 n − 1 1 ⋅ T n ( t i ) ⋅ ( − 1 ) i = ( − 1 ) i ⋅ q ( t i ) ⇒ ( − 1 ) i ( q ( t i ) − p ( t i ) ) > 0 , ∀ 0 ≤ i ≤ n ⇒ q ( t ) − p ( t ) changes sign at least n times, i.e, q ( t ) − p ( t ) has at least n zeros (due to Bolzano theorem) but δ ( q − p ) = degree ((q(t) - p(t))) ≤ n − 1 . (Contradiction due to fundamental theorem of Algebra) □ .
q.e.d