19.07.2014 Views

Contents - Student subdomain for University of Bath

Contents - Student subdomain for University of Bath

Contents - Student subdomain for University of Bath

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

A.2. USEFUL ESTIMATES 209<br />

Corollary 19 If f and g are polynomials <strong>of</strong> degrees n and m respectively, then<br />

Res(f, g) ≤ (m + n) (m+n)/2 |f| m |g| n .<br />

Corollary 20 If f is a polynomial <strong>of</strong> degree n, then Disc(f) ≤ n n−1 |f| 2n−1 .<br />

In practice, especially if f is not monic, it is worth taking rather more care over<br />

this estimation.<br />

Proposition 67 (Hadamard bound (columns)) If M is an n × n matrix<br />

whose columns are the vectors v i , then |M| ≤ H c = ∏ |v i | ≤ n n/2 B n .<br />

In practice, <strong>for</strong> general matrices one computes min(H r , H c ). While there are<br />

clearly bad cases (e.g. matrices <strong>of</strong> determinant 0), the Hadamard bounds are<br />

“not too bad”. As pointed out in [AM01], log(min(H r , H c )/|M|) is a measure<br />

<strong>of</strong> the “wasted ef<strong>for</strong>t” in a modular algorithm <strong>for</strong> computing the determinant,<br />

and “on average” this is O(n), with a variance <strong>of</strong> O(log n). It is worth noting<br />

that this is independent <strong>of</strong> the size <strong>of</strong> the entries.<br />

Proposition 67 has a useful consequence.<br />

Corollary 21 If x is the solution to M.x = a, where M and a have integer<br />

entries bounded by B and A respectively, then the denominators <strong>of</strong> x are bounded<br />

by min(H r , H c ) and the numerators <strong>of</strong> x are bounded by n n/2 AB n−1 .<br />

Pro<strong>of</strong>. This follows from the linear algebra result that x = 1<br />

|M|<br />

adj(M).a, where<br />

adj(M), the adjoint <strong>of</strong> M, is the matrix whose (i, j)th entry is the determinant<br />

<strong>of</strong> the matrix obtained by striking row i and column j from M. The ith entry<br />

<strong>of</strong> adj(M).a is then the determinant <strong>of</strong> the matrix obtained by replacing the ith<br />

column <strong>of</strong> M by a, and we can apply Proposition 67 to this matrix.<br />

A.2.2<br />

Coefficients <strong>of</strong> a polynomial<br />

Here we are working implicitly with polynomials with complex coefficients,<br />

though the bounds will be most useful in the case <strong>of</strong> integer coefficients.<br />

Notation 28 Let<br />

f(x) =<br />

n∑<br />

a i x i = a n<br />

i=0<br />

n ∏<br />

i=1<br />

(x − α i )<br />

be a polynomial <strong>of</strong> degree n (i.e. a n ≠ 0). Define the following measures <strong>of</strong> the<br />

size <strong>of</strong> the polynomial f:<br />

H(f) (<strong>of</strong>ten written ||f|| ∞ ), the height or 1-norm, is max n i=0 |a i|;<br />

||f|| (<strong>of</strong>ten written ||f|| 2 ), the 2-norm, is √ ∑ n<br />

i=0 |a i| 2 ;<br />

L(f) (<strong>of</strong>ten written ||f|| 1 ), the length or 1-norm, is ∑ n<br />

i=0 |a i|;<br />

∏<br />

M(f) , the Mahler measure <strong>of</strong> f, is |a n | |α i |.<br />

|α i|>1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!