Equations and Inequalities over Domains

The Wolfram Language normally assumes that variables which appear in equations can stand for arbitrary complex numbers. But when you use Reduce, you can explicitly tell the Wolfram Language that the variables stand for objects in more restricted domains.

Reduce[expr,vars,dom]reduce eqns over the domain dom
Complexescomplex numbers
Realsreal numbers

Solving over domains.

Reduce by default assumes that x can be complex, and gives all five complex solutions:
Click for copyable input
But here it assumes that x is real, and gives only the real solutions:
Click for copyable input
And here it assumes that x is an integer, and gives only the integer solutions:
Click for copyable input

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[eqns,vars,dom] 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:
Click for copyable input
To represent solutions over the reals requires introducing an inequality:
Click for copyable input
Over the integers, the solution can be represented as equations for discrete points:
Click for copyable input

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:
Click for copyable input
Complexespolynomial!=0, xi==Root[]
RealsRoot[]<xi<Root[], xi==Root[]
Integersarbitrarily complicated

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 x:
Click for copyable input
And here the components are distinguished by inequalities on x:
Click for copyable input

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:
Click for copyable input

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 f[n] by giving the option setting GeneratedParameters->f.

The components here are labeled by the integer parameter c1:
Click for copyable input

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:
Click for copyable input
The solution over the integers involves the divisors of 8:
Click for copyable input
Solving an equation like this effectively requires factoring a large number:
Click for copyable input

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:
Click for copyable input

With two variables, Reduce can solve any quadratic equation over the integers. The result can be a Fibonaccilike sequence, represented in terms of powers of quadratic irrationals.

Here is the solution to a Pell equation:
Click for copyable input
The actual values for specific C[1] as integers, as they should be:
Click for copyable input

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

Here Reduce finds the solution to a Thue equation:
Click for copyable input
Changing the righthand side to 3, the equation now has no solution:
Click for copyable input

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 Hilberts 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 closedform 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:
Click for copyable input
Reduce[eqns,vars,Modulus->n]find solutions modulo Null

Handling equations involving integers modulo Null.

Since there are only ever a finite number of possible solutions for integer equations modulo Null, Reduce can systematically find them.

This finds all solutions modulo 4:
Click for copyable input

Reduce can also handle equations that involve several different moduli.

Here is an equation involving two different moduli:
Click for copyable input
Reduce[expr,vars,dom]specify a default domain for all variables
Reduce[{expr1,,x1dom1,},vars]explicitly specify individual domains for variables

Different ways to specify domains for variables.

This assumes that x is an integer, but y is a real:
Click for copyable input

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:
Click for copyable input
Here again there is a separate condition on the imaginary part:
Click for copyable input

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 x is a real:
Click for copyable input
This forces Reduce to consider the case where x can be complex:
Click for copyable input
Since x does not appear algebraically, Reduce immediately assumes that it can be complex:
Click for copyable input
Here x is a real, but y can be complex:
Click for copyable input
FindInstance[expr,{x1,x2,},dom]try to find an instance of the Null in dom satisfying expr
FindInstance[expr,vars,dom,n]try to find Null instances
Complexesthe domain of complex numbers
Realsthe domain of real numbers
Integersthe domain of integers
Booleansthe domain of Booleans (True and False)

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[expr,vars,dom] returns {} then this means that the Wolfram Language 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:
Click for copyable input

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 p and q:
Click for copyable input
But this can:
Click for copyable input