Theorem (Root Squaring).  Given the polynomial  [Graphics:Images/GraeffeMethodProof_gr_80.gif] of degree n in factored form  [Graphics:Images/GraeffeMethodProof_gr_81.gif]  with roots  [Graphics:Images/GraeffeMethodProof_gr_82.gif].  Then  [Graphics:Images/GraeffeMethodProof_gr_83.gif]  is defined by  
    
    [Graphics:Images/GraeffeMethodProof_gr_84.gif].  

is a polynomial of degree n with roots  [Graphics:Images/GraeffeMethodProof_gr_85.gif].  

Proof.

    Consider  [Graphics:../Images/GraeffeMethodProof_gr_86.gif]  and  [Graphics:../Images/GraeffeMethodProof_gr_87.gif],  then their product is

        [Graphics:../Images/GraeffeMethodProof_gr_88.gif]  

        [Graphics:../Images/GraeffeMethodProof_gr_89.gif]  
    
        [Graphics:../Images/GraeffeMethodProof_gr_90.gif]  

which is easily seen to be a polynomial of degree 2n with the roots [Graphics:../Images/GraeffeMethodProof_gr_91.gif].  

    However, we choose to use the polynomial  

        [Graphics:../Images/GraeffeMethodProof_gr_92.gif]  

of degree 2n with the roots [Graphics:../Images/GraeffeMethodProof_gr_93.gif].  If we replace [Graphics:../Images/GraeffeMethodProof_gr_94.gif] in the above equation then we obtain

        [Graphics:../Images/GraeffeMethodProof_gr_95.gif].

Then we define

        [Graphics:../Images/GraeffeMethodProof_gr_96.gif]  

which is a polynomial of degree n with roots  [Graphics:../Images/GraeffeMethodProof_gr_97.gif],  and the coefficient of the highest power [Graphics:../Images/GraeffeMethodProof_gr_98.gif] is 1.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005