Bézout matrix

From HandWiki
Short description: Matrix whose determinant is a resultant

In mathematics, a Bézout matrix (or Bézoutian or Bezoutiant) is a special square matrix associated with two polynomials, introduced by James Joseph Sylvester in 1853 and Arthur Cayley in 1857 and named after Étienne Bézout.[1][2] Bézoutian may also refer to the determinant of this matrix, which is equal to the resultant of the two polynomials. Bézout matrices are sometimes used to test the stability of a given polynomial.

Definition

Let f(z) and g(z) be two complex polynomials of degree at most n,

f(z)=i=0nuizi,g(z)=i=0nvizi.

(Note that any coefficient ui or vi could be zero.) The Bézout matrix of order n associated with the polynomials f and g is

Bn(f,g)=(bij)i,j=0,,n1

where the entries bij result from the identity

f(x)g(y)f(y)g(x)xy=i,j=0n1bijxiyj.

It is an n × n complex matrix, and its entries are such that if we let ij=max{0,ij} and mij=min{i,n1j} for each i,j=0,,n1, then:

bij=k=ijmij(uj+k+1vikuikvj+k+1).

To each Bézout matrix, one can associate the following bilinear form, called the Bézoutian:

Bez:n×n:(x,y)Bez(x,y)=x*Bn(f,g)y.

Examples

  • For n = 3, we have for any polynomials f and g of degree (at most) 3:
B3(f,g)=[u1v0u0v1u2v0u0v2u3v0u0v3u2v0u0v2u2v1u1v2+u3v0u0v3u3v1u1v3u3v0u0v3u3v1u1v3u3v2u2v3].
  • Let f(x)=3x3x and g(x)=5x2+1 be the two polynomials. Then:
B4(f,g)=[10300800301500000].

The last row and column are all zero as f and g have degree strictly less than n (which is 4). The other zero entries are because for each i=0,,n, either ui or vi is zero.

Properties

  • Bn(f,g) is symmetric (as a matrix);
  • Bn(f,g)=Bn(g,f);
  • Bn(f,f)=0;
  • (f,g)Bn(f,g) is a bilinear function;
  • Bn(f,g) is a real matrix if f and g have real coefficients;
  • Bn(f,g) is nonsingular with n=max(deg(f),deg(g)) if and only if f and g have no common roots.
  • Bn(f,g) with n=max(deg(f),deg(g)) has determinant which is the resultant of f and g.
  • Bezoutians can be reduced to block diagonal form with the help of confluent Vandermonde matrix [3].

Applications

An important application of Bézout matrices can be found in control theory. To see this, let f(z) be a complex polynomial of degree n and denote by q and p the real polynomials such that f(iy) = q(y) + ip(y) (where y is real). We also denote r for the rank and σ for the signature of Bn(p,q). Then, we have the following statements:

  • f(z) has n − r roots in common with its conjugate;
  • the left r roots of f(z) are located in such a way that:
    • (r + σ)/2 of them lie in the open left half-plane, and
    • (r − σ)/2 lie in the open right half-plane;
  • f is Hurwitz stable if and only if Bn(p,q) is positive definite.

The third statement gives a necessary and sufficient condition concerning stability. Besides, the first statement exhibits some similarities with a result concerning Sylvester matrices while the second one can be related to Routh–Hurwitz theorem.

Citations

  1. Sylvester 1853.
  2. Cayley 1857.
  3. Bini, D.A.; Mehrmann, V.; Olshevsky, V. (2010). Numerical Methods for Structured Matrices and Applications, Operator Theory: Advances and Applications Book 199. Birkhäuser. Proposition 9.7. doi:10.1007/978-3-7643-8996-3. ISBN 978-3-7643-8996-3. 

References