This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: , > < p p , where , >= < p p if and only if = p . Its easy to see that ) 1 ( ) 2 1 ( ) ( ) 1 ( ) 1 ( ) 2 1 ( ) 2 1 ( ) ( ) ( , 2 2 2 + + = + + >= < p p p p p p p p p p p . If = p , i.e. p(x) = 0, then , >= < p p . 1 On the other hand, if , >= < p p , we have ) 1 ( , ) 2 1 ( , ) ( = = = p p p . Since p P 2 , let p(x) = ax 2 + bx + c and plug 0, and 1 into it to obtain 3 equations: c = 0 a + b + c = 0 a + b + c = 0 Solve the equations to obtain a = b = c = 0 . Therefore ) ( = = x p p . Fraleigh & Beauregard , 2...
View
Full
Document
This note was uploaded on 12/20/2010 for the course MAT MATB24 taught by Professor X.jiang during the Spring '10 term at University of Toronto Toronto.
 Spring '10
 X.Jiang
 Linear Algebra, Algebra, Linear Programming, Addition

Click to edit the document details