# Inequalities

Just as the *equation* asserts that is equal to , so also the *inequality* asserts that is greater than . In *Mathematica*, Reduce works not only on equations, but also on inequalities.

Reduce[{ineq_{1},ineq_{2},...},x] | reduce a collection of inequalities in x |

Manipulating univariate inequalities.

In[1]:= |

Out[1]= |

In[2]:= |

Out[2]= |

When applied to an equation, Reduce[eqn, x] tries to get a result consisting of simple equations for x of the form , .... When applied to an inequality, Reduce[ineq, x] does the exactly analogous thing, and tries to get a result consisting of simple inequalities for x of the form , ....

In[3]:= |

Out[3]= |

In[4]:= |

Out[4]= |

You can think of the result generated by Reduce[ineq, x] as representing a series of intervals, described by inequalities. Since the graph of a polynomial of degree can go up and down as many as times, a polynomial inequality of degree can give rise to as many as distinct intervals.

In[5]:= |

Out[5]= |

In[6]:= |

Out[6]= |

In[7]:= |

Out[7]= |

Transcendental functions like have graphs that go up and down infinitely many times, so that infinitely many intervals can be generated.

In[8]:= |

Out[8]= |

In[9]:= |

Out[9]= |

In[10]:= |

Out[10]= |

If you have inequalities that involve as well as , there may be isolated points where the inequalities can be satisfied. Reduce represents such points by giving equations.

In[11]:= |

Out[11]= |

In[12]:= |

Out[12]= |

Reduce[{ineq_{1},ineq_{2},...},{x_{1}, x_{2}, ... }] | reduce a collection of inequalities in several variables |

For inequalities involving several variables, Reduce in effect yields nested collections of interval specifications, in which later variables have bounds that depend on earlier variables.

In[13]:= |

Out[13]= |

In geometrical terms, any linear inequality divides space into two halves. Lists of linear inequalities thus define polyhedra, sometimes bounded, sometimes not. Reduce represents such polyhedra in terms of nested inequalities. The corners of the polyhedra always appear among the endpoints of these inequalities.

In[14]:= |

Out[14]= |

In[15]:= |

Out[15]= |

Lists of inequalities in general represent regions of overlap between geometrical objects. Often the description of these can be quite complicated.

In[16]:= |

Out[16]= |

In[17]:= |

Out[17]= |

In[18]:= |

Out[18]= |

In[19]:= |

Out[19]= |

If you have inequalities that involve parameters, Reduce automatically handles the different cases that can occur, just as it does for equations.

In[20]:= |

Out[20]= |

In[21]:= |

Out[21]= |

Reduce tries to give you a complete description of the region defined by a set of inequalities. Sometimes, however, you may just want to find individual instances of values of variables that satisfy the inequalities. You can do this using FindInstance.

FindInstance[ineqs,{x_{1},x_{2},...}] | try to find an instance of the satisfying ineqs |

FindInstance[ineqs,vars,n] | try to find n instances |

Finding individual points that satisfy inequalities.

In[22]:= |

Out[22]= |

In[23]:= |

Out[23]= |

FindInstance is in some ways an analog for inequalities of Solve for equations. For like Solve, it returns a list of rules giving specific values for variables. But while for equations these values can generically give an accurate representation of all solutions, for inequalities they can only correspond to isolated sample points within the regions described by the inequalities.

Every time you call FindInstance with specific input, it will give the same output. And when there are instances that correspond to special, limiting, points of some kind, it will preferentially return these. But in general, the distribution of instances returned by FindInstance will typically seem somewhat random. Each instance is, however, in effect a constructive proof that the inequalities you have given can in fact be satisfied.

In[24]:= |

Out[24]= |

In[25]:= |

In[26]:= |

Out[26]= |