# Equations and Inequalities over Domains

*Mathematica* normally assumes that variables which appear in equations can stand for arbitrary complex numbers. But when you use

Reduce, you can explicitly tell

*Mathematica* that the variables stand for objects in more restricted domains.

Solving over domains.

Reduce by default assumes that

can be complex, and gives all five complex solutions.

Out[1]= | |

But here it assumes that

is real, and gives only the real solutions.

Out[2]= | |

And here it assumes that

is an integer, and gives only the integer solutions.

Out[3]= | |

A single polynomial equation in one variable will always have a finite set of discrete solutions. And in such a case one can think of

Reduce as just filtering the solutions by selecting the ones that happen to lie in the domain

dom.

But as soon as there are more variables, things can become more complicated, with solutions to equations corresponding to parametric curves or surfaces in which the values of some variables can depend on the values of others. Often this dependence can be described by some collection of equations or inequalities, but the form of these can change significantly when one goes from one domain to another.

This gives solutions over the complex numbers as simple formulas.

Out[4]= | |

To represent solutions over the reals requires introducing an inequality.

Out[5]= | |

Over the integers, the solution can be represented as equations for discrete points.

Out[6]= | |

If your input involves only equations, then

Reduce will by default assume that all variables are complex. But if your input involves inequalities, then

Reduce will assume that any algebraic variables appearing in them are real, since inequalities can only compare real quantities.

Since the variables appear in an inequality, they are assumed to be real.

Out[7]= | |

Schematic building blocks for solutions to polynomial equations and inequalities.

For systems of polynomials over real and complex domains, the solutions always consist of a finite number of components, within which the values of variables are given by algebraic numbers or functions.

Here the components are distinguished by equations and inequations on

.

Out[8]= | |

And here the components are distinguished by inequalities on

.

Out[9]= | |

While in principle

Reduce can always find the complete solution to any collection of polynomial equations and inequalities with real or complex variables, the results are often very complicated, with the number of components typically growing exponentially as the number of variables increases.

With 3 variables, the solution here already involves 8 components.

Out[10]= | |

As soon as one introduces functions like

Sin or

Exp, even equations in single real or complex variables can have solutions with an infinite number of components.

Reduce labels these components by introducing additional parameters. By default, the

parameter in a given solution will be named

C[n]. In general you can specify that it should be named

by giving the option setting

GeneratedParameters->f.

The components here are labeled by the integer parameter

.

Out[11]= | |

Reduce can handle equations not only over real and complex variables, but also over integers. Solving such

*Diophantine equations* can often be a very difficult problem.

Describing the solution to this equation over the reals is straightforward.

Out[12]= | |

The solution over the integers involves the divisors of 8.

Out[13]= | |

Solving an equation like this effectively requires factoring a large number.

Out[14]= | |

Reduce can solve any system of linear equations or inequalities over the integers. With

linear equations in

variables,

parameters typically need to be introduced. But with inequalities, a much larger number of parameters may be needed.

Three parameters are needed here, even though there are only two variables.

Out[15]= | |

With two variables,

Reduce can solve any quadratic equation over the integers. The result can be a Fibonacci-like sequence, represented in terms of powers of quadratic irrationals.

Here is the solution to a Pell equation.

Out[16]= | |

The actual values for specific

C as integers, as they should be.

Out[17]= | |

Reduce can handle many specific classes of equations over the integers.

Here

Reduce finds the solution to a Thue equation.

Out[18]= | |

Changing the right-hand side to

, the equation now has no solution.

Out[19]= | |

Equations over the integers sometimes have seemingly quite random collections of solutions. And even small changes in equations can often lead them to have no solutions at all.

For polynomial equations over real and complex numbers, there is a definite

*decision procedure* for determining whether or not any solution exists. But for polynomial equations over the integers, the unsolvability of Hilbert's Tenth Problem demonstrates that there can never be any such general procedure.

For specific classes of equations, however, procedures can be found, and indeed many are implemented in

Reduce. But handling different classes of equations can often seem to require whole different branches of number theory, and quite different kinds of computations. And in fact it is known that there are

*universal* integer polynomial equations, for which filling in some variables can make solutions for other variables correspond to the output of absolutely any possible program. This then means that for such equations there can never in general be any closed-form solution built from fixed elements like algebraic functions.

If one includes functions like

Sin, then even for equations involving real and complex numbers the same issues can arise.

Reduce here effectively has to solve an equation over the integers.

Out[20]= | |

Handling equations involving integers modulo .

Since there are only ever a finite number of possible solutions for integer equations modulo

,

Reduce can systematically find them.

This finds all solutions modulo 4.

Out[21]= | |

Reduce can also handle equations that involve several different moduli.

Here is an equation involving two different moduli.

Out[22]= | |

Reduce[expr,vars,dom] | specify a default domain for all variables |

Reduce[{expr_{1},...,x_{1}dom_{1},...},vars] | explicitly specify individual domains for variables |

Different ways to specify domains for variables.

This assumes that

is an integer, but

is a real.

Out[23]= | |

Reduce normally treats complex variables as single objects. But in dealing with functions that are not analytic or have branch cuts, it sometimes has to break them into pairs of real variables

Re[z] and

Im[z].

The result involves separate real and imaginary parts.

Out[24]= | |

Here again there is a separate condition on the imaginary part.

Out[25]= | |

Reduce by default assumes that variables that appear algebraically in inequalities are real. But you can override this by explicitly specifying

Complexes as the default domain. It is often useful in such cases to be able to specify that certain variables are still real.

Reduce by default assumes that

is a real.

Out[26]= | |

This forces

Reduce to consider the case where

can be complex.

Out[27]= | |

Since

does not appear algebraically,

Reduce immediately assumes that it can be complex.

Out[28]= | |

Here

is a real, but

can be complex.

Out[29]= | |

Finding particular solutions in domains.

Reduce always returns a complete representation of the solution to a system of equations or inequalities. Sometimes, however, you may just want to find particular sample solutions. You can do this using

FindInstance.

If

FindInstance returns

then this means that

*Mathematica* has effectively proved that

expr cannot be satisfied for any values of variables in the specified domain. When

expr can be satisfied,

FindInstance will normally pick quite arbitrarily among values that do this, as discussed for inequalities in

"Inequalities: Manipulating Equations and Inequalities".

Particularly for integer equations,

FindInstance can often find particular solutions to equations even when

Reduce cannot find a complete solution. In such cases it usually returns one of the smallest solutions to the equations.

This finds the smallest integer point on an elliptic curve.

Out[30]= | |

One feature of

FindInstance is that it also works with Boolean expressions whose variables can have values

True or

False. You can use

FindInstance to determine whether a particular expression is

*satisfiable*, so that there is some choice of truth values for its variables that makes the expression

True.

This expression cannot be satisfied for any choice of

and

.

Out[31]= | |

Out[32]= | |