We deal with root separation of a real polynomial. We bound the spread of a given polynomial, and we bound the roots of a polynomial whose roots are the differences of the roots of the initial polynomial. Intensive use of matricial norms (and matrix norms) is made. Extensions and ameliorations of the Leverrier-Faddeev algorithm and of the Cayley-Hamilton theorem are mentioned.