Misplaced Pages

Inequation

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Disequality) Mathematical statement that two values are not equal "≠" redirects here. Not to be confused with ‡ or ǂ.
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Inequation" – news · newspapers · books · scholar · JSTOR (March 2010) (Learn how and when to remove this message)

In mathematics, an inequation is a statement that an inequality holds between two values. It is usually written in the form of a pair of expressions denoting the values in question, with a relational sign between them indicating the specific inequality relation. Some examples of inequations are:

  • a < b {\displaystyle a<b}
  • x + y + z ≤ 1 {\displaystyle x+y+z\leq 1}
  • n > 1 {\displaystyle n>1}
  • x ≠ 0 {\displaystyle x\neq 0}

In some cases, the term "inequation" can be considered synonymous to the term "inequality", while in other cases, an inequation is reserved only for statements whose inequality relation is "not equal to" (≠).

Chains of inequations

A shorthand notation is used for the conjunction of several inequations involving common expressions, by chaining them together. For example, the chain

0 ≤ a < b ≤ 1 {\displaystyle 0\leq a<b\leq 1}

is shorthand for

0 ≤ a     a n d     a < b     a n d     b ≤ 1 {\displaystyle 0\leq a~~\mathrm {and} ~~a<b~~\mathrm {and} ~~b\leq 1}

which also implies that 0 < b {\displaystyle 0<b} and a < 1 {\displaystyle a<1} .

In rare cases, chains without such implications about distant terms are used. For example i ≠ 0 ≠ j {\displaystyle i\neq 0\neq j} is shorthand for i ≠ 0     a n d     0 ≠ j {\displaystyle i\neq 0~~\mathrm {and} ~~0\neq j} , which does not imply i ≠ j . {\displaystyle i\neq j.} Similarly, a < b > c {\displaystyle a<b>c} is shorthand for a < b     a n d     b > c {\displaystyle a<b~~\mathrm {and} ~~b>c} , which does not imply any order of a {\displaystyle a} and c {\displaystyle c} .

Solving inequations

Solution set (portrayed as feasible region) for a sample list of inequations

Similar to equation solving, inequation solving means finding what values (numbers, functions, sets, etc.) fulfill a condition stated in the form of an inequation or a conjunction of several inequations. These expressions contain one or more unknowns, which are free variables for which values are sought that cause the condition to be fulfilled. To be precise, what is sought are often not necessarily actual values, but, more in general, expressions. A solution of the inequation is an assignment of expressions to the unknowns that satisfies the inequation(s); in other words, expressions such that, when they are substituted for the unknowns, make the inequations true propositions. Often, an additional objective expression (i.e., an optimization equation) is given, that is to be minimized or maximized by an optimal solution.

For example,

0 ≤ x 1 ≤ 690 − 1.5 ⋅ x 2 ∧ 0 ≤ x 2 ≤ 530 − x 1 ∧ x 1 ≤ 640 − 0.75 ⋅ x 2 {\displaystyle 0\leq x_{1}\leq 690-1.5\cdot x_{2}\;\land \;0\leq x_{2}\leq 530-x_{1}\;\land \;x_{1}\leq 640-0.75\cdot x_{2}}

is a conjunction of inequations, partly written as chains (where ∧ {\displaystyle \land } can be read as "and"); the set of its solutions is shown in blue in the picture (the red, green, and orange line corresponding to the 1st, 2nd, and 3rd conjunct, respectively). For a larger example. see Linear programming#Example.

Computer support in solving inequations is described in constraint programming; in particular, the simplex algorithm finds optimal solutions of linear inequations. The programming language Prolog III also supports solving algorithms for particular classes of inequalities (and other relations) as a basic language feature. For more, see constraint logic programming.

Combinations of meanings

Usually because of the properties of certain functions (like square roots), some inequations are equivalent to a combination of multiple others. For example, the inequation f ( x ) < g ( x ) {\displaystyle \textstyle {\sqrt {f(x)}}<g(x)} is logically equivalent to the following three inequations combined:

  1. f ( x ) ≥ 0 {\displaystyle f(x)\geq 0}
  2. g ( x ) > 0 {\displaystyle g(x)>0}
  3. f ( x ) < ( g ( x ) ) 2 {\displaystyle f(x)<\left(g(x)\right)^{2}}

See also

References

  1. Thomas H. Sidebotham (2002). The A to Z of Mathematics: A Basic Guide. John Wiley and Sons. p. 252. ISBN 0-471-15045-2.
  2. ^ Weisstein, Eric W. "Inequation". mathworld.wolfram.com. Retrieved 2019-12-03.
  3. "BestMaths". bestmaths.net. Retrieved 2019-12-03.
  4. Brian A. Davey; Hilary Ann Priestley (1990). Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press. definition of a fence in exercise 1.11, p.23. ISBN 0-521-36766-2. LCCN 89009753.
  5. Stapel, Elizabeth. "Linear Programming: Introduction". Purplemath. Retrieved 2019-12-03.
  6. "Optimization - The simplex method". Encyclopedia Britannica. Retrieved 2019-12-03.
Categories: