3
$\begingroup$

I have a bunch of inequalities, and I'm trying to see if another inequality can be deduced from the first bunch. For example, assuming that $a \leq b$ and $c \leq d$, we can deduce that $a + c \leq b + d$, but we cannot deduce that $a + d \leq b + c$. Is there some software that allows me to take some inequalities which are assumed to be true as input, and to check if another input inequality can be deduced or proved from these earlier inequalities?

I am most familiar with MATLAB and it doesn't seem to do this. I realized that I could hack it and say for example $b = a + p$, $d = c + q$ with $p, q \geq 0$, then just writing $b + d - (a + c)$ and asking MATLAB to simplify the expression, and noticing that all the $p, q$ terms are nonnegative. But is there a more natural way to do this?

Improve this question
$\endgroup$
3
  • 2
    $\begingroup$ There is the Coq software. See coq.inria.fr/a-short-introduction-to-coq $\endgroup$
    – Damian Rössler
    Commented Jul 31, 2012 at 14:29
  • 1
    $\begingroup$ Use the Reduce function in mathematica...maybe that'll help. $\endgroup$
    – Suvrit
    Commented Jul 31, 2012 at 17:42
  • $\begingroup$ If you're talking about linear inequalities (as in your examples), this can be written as a feasibility problem of linear programming. The nonlinear case is much more difficult. Still, numerical optimization software may be helpful. $\endgroup$
    – Robert Israel
    Commented Jul 31, 2012 at 18:41

2 Answers 2

Reset to default
6
$\begingroup$

As @Robert Israel points out, the linear case is MUCH easier than the general case, and the really general case (arbitrary inequalities of the form $f(\mathbf{x}) \geq 0$) is clearly undecidable, but if the inequalities are polynomial, this is the problem of "quantifier elimination over real closed fields", which you can google. The first algorithm was "Tarski's algorithm", there have been many improvements since, most of them used by computer algebra systems (Mathematica, Maple, etc).

Improve this answer
$\endgroup$
2
  • 2
    $\begingroup$ In particular, Maple 16 has new features for solving polynomial systems, including polynomial equations, inequations and inequalities. See, for instance, maplesoft.com/support/help/Maple/view.aspx?path=updates/Maple16/… $\endgroup$
    – J W
    Commented Jul 31, 2012 at 20:24
  • $\begingroup$ Thank you for your answer. My case is linear, so I will be solving a feasibility problem for linear programming to find if the inequality is implied. But this is definitely useful information for me to keep in mind. $\endgroup$
    – user25446
    Commented Aug 2, 2012 at 17:15
3
$\begingroup$

According Wolfran,

Mathematica uses a large number of original algorithms to provide automatic systemwide support for inequalities and inequality constraints. Whereas equations can often be solved in terms of numbers, even representing solution sets for inequalities is only made possible by Mathematica's symbolic capabilities.

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .