Contents - Student subdomain for University of Bath
Contents - Student subdomain for University of Bath
Contents - Student subdomain for University of Bath
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
3.5. EQUATIONS AND INEQUALITIES 105<br />
The reader may complain that example 3 is overly complex: can’t we just write<br />
{f > 0 ∧ x < −2} ∪ {x = − √ 3 + √ 2} ∪ {f < 0 ∧ x < 0} ∪<br />
{x = − √ 3 − √ 2 < 0} ∪ {f > 0 ∧ x > −2 ∧ x < 2} ∪<br />
{x = √ 3 − √ 2} ∪ {f < 0 ∧ x > 0} ∪ {x = √ 3 + √ 2} ∪ {f > 0 ∧ x > 2}?<br />
In this case we could, but in general theorem 8 means that we cannot 21 : we need<br />
RootOf constructs, and the question then is “which root <strong>of</strong> . . .”. In example<br />
3, we chose to use numeric inequalities (and we were lucky that they could be<br />
chosen with integer end-points). It is also possible [CR88] to describe the roots<br />
in terms <strong>of</strong> the signs <strong>of</strong> the derivatives <strong>of</strong> f, i.e.<br />
{f > 0 ∧ x < −2} ∪ {f = 0 ∧ f ′ < 0 ∧ f ′′′ < 0} ∪ {f < 0 ∧ x < 0} ∪<br />
{f = 0 ∧ f ′ > 0 ∧ f ′′′ < 0} ∪ {f > 0 ∧ x > −2 ∧ x < 2} ∪<br />
{f = 0 ∧ f ′ < 0 ∧ f ′′′ > 0} ∪ {f < 0 ∧ x > 0} ∪<br />
{f = 0 ∧ f ′ > 0 ∧ f ′′′ > 0} ∪ {f > 0 ∧ x > 2}<br />
(as it happens, the sign <strong>of</strong> f ′′ is irrelevant here). This methodology can also<br />
be applied to the one-dimensional regions, e.g. the first can also be defined as<br />
{f > 0 ∧ f ′ > 0 ∧ f ′′ < 0 ∧ f ′′′ < 0}.<br />
We may ask how we know that we have a decomposition, and where these<br />
extra constraints (such as x > 0 in example 5 or x < 3 2<br />
in example 6) come<br />
from. This will be addressed in the next section, but the brief answers are:<br />
• we know something is a decomposition because we have constructed it<br />
that way;<br />
• x = 0 came from the leading coefficient (with respect to y) <strong>of</strong> xy − 1,<br />
whereas 3 2 in example 6 is a root <strong>of</strong> Disc y(f).<br />
We stated in definition 66 that the cells must be non-empty. How do we<br />
know this? For the zero-dimensional cells {f = 0 ∧ x > a ∧ x < b}, we can rely<br />
on the fact that if f changes sign between a and b, there must be at least one<br />
zero, and if f ′ does not 22 , there cannot be more than one: such an interval can<br />
be called an isolating interval. In general, we are interested in the following<br />
concept.<br />
Definition 67 A sampled algebraic decomposition <strong>of</strong> R n is an algebraic decomposition<br />
together with, <strong>for</strong> each cell C, an explicit point Sample(C) in that<br />
cell.<br />
By ‘explicit point’ we mean a point each <strong>of</strong> whose coordinates is either a rational<br />
number, or a precise algebraic number: i.e. a defining polynomial 23 together<br />
with an indication <strong>of</strong> which root is meant, an isolating interval, a sufficiently<br />
21 And equation (3.11) means that we probably wouldn’t want to even when we could!<br />
22 Which will involve looking at f ′′ and so on.<br />
23 Not necessarily irreducible, though it is normal to insist that it be square-free.