Inequation

Last updated November 11, 2023

In mathematics, an inequation is a statement that an inequality holds between two values.^[1]^[2] 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:

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\leq a<b\leq 1

is shorthand for

0\leq a~~\mathrm {and} ~~a<b~~\mathrm {and} ~~b\leq 1

which also implies that $0<b$ and $a<1$ .

In rare cases, chains without such implications about distant terms are used. For example $i\neq 0\neq j$ is shorthand for $i\neq 0~~\mathrm {and} ~~0\neq j$ , which does not imply $i\neq j.$ ^{[ citation needed ]} Similarly, $a<b>c$ is shorthand for $a<b~~\mathrm {and} ~~b>c$ , which does not imply any order of $a$ and $c$ .^[4]

Solving 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.^[5]

For example,

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 $\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.^[6] 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 $\textstyle {\sqrt {f(x)}}<g(x)$ is logically equivalent to the following three inequations combined:

$f(x)\geq 0$
$g(x)>0$
$f(x)<\left(g(x)\right)^{2}$

Related Research Articles

<span class="mw-page-title-main">Diophantine equation</span> Polynomial equation whose integer solutions are sought

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.

In probability theory, the expected value is a generalization of the weighted average. Informally, the expected value is the arithmetic mean of a large number of independently selected outcomes of a random variable. Since it is obtained through arithmetic, the expected value sometimes may not even be included in the sample data set; it is not the value you would "expect" to get in reality.

In mathematics, a polynomial is an expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate $x$ is $x 2 - 4 x + 7$ . An example with three indeterminates is $x 3 + 2 xyz 2 - yz + 1$ .

In mathematics, the $L p$ spaces are function spaces defined using a natural generalization of the $p$ -norm for finite-dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue, although according to the Bourbaki group they were first introduced by Frigyes Riesz.

In mathematics, an inequality is a relation which makes a non-equal comparison between two numbers or other mathematical expressions. It is used most often to compare two numbers on the number line by their size. There are several different notations used to represent different kinds of inequalities:

In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup.

In mathematics, LHS is informal shorthand for the left-hand side of an equation. Similarly, RHS is the right-hand side. The two sides have the same value, expressed differently, since equality is symmetric.

In mathematics, an implicit equation is a relation of the form $where R is a function of several variables. For example, the implicit equation of the unit circle is$

A thermodynamic potential is a scalar quantity used to represent the thermodynamic state of a system. Just as in mechanics, where potential energy is defined as capacity to do work, similarly different potentials have different meanings. The concept of thermodynamic potentials was introduced by Pierre Duhem in 1886. Josiah Willard Gibbs in his papers used the term fundamental functions.

In mathematical analysis, a function of bounded variation, also known as $BV$ function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a single variable, being of bounded variation means that the distance along the direction of the $y$ -axis, neglecting the contribution of motion along $x$ -axis, traveled by a point moving along the graph has a finite value. For a continuous function of several variables, the meaning of the definition is the same, except for the fact that the continuous path to be considered cannot be the whole graph of the given function, but can be every intersection of the graph itself with a hyperplane parallel to a fixed $x$ -axis and to the $y$ -axis.

<span class="mw-page-title-main">Tetration</span> Repeated exponentiation

In mathematics, tetration is an operation based on iterated, or repeated, exponentiation. There is no standard notation for tetration, though $and the left-exponent x b are common.$

In the theory of partial differential equations, elliptic operators are differential operators that generalize the Laplace operator. They are defined by the condition that the coefficients of the highest-order derivatives be positive, which implies the key property that the principal symbol is invertible, or equivalently that there are no real characteristic directions.

In mathematics, the Helmholtz equation is the eigenvalue problem for the Laplace operator. It corresponds to the linear partial differential equation

A stochastic differential equation (SDE) is a differential equation in which one or more of the terms is a stochastic process, resulting in a solution which is also a stochastic process. SDEs have many applications throughout pure mathematics and are used to model various behaviours of stochastic models such as stock prices, random growth models or physical systems that are subjected to thermal fluctuations.

In numerical analysis, the Weierstrass method or Durand–Kerner method, discovered by Karl Weierstrass in 1891 and rediscovered independently by Durand in 1960 and Kerner in 1966, is a root-finding algorithm for solving polynomial equations. In other words, the method can be used to solve numerically the equation

In group theory, a group $is algebraically closed if any finite set of equations and inequations that are applicable to have a solution in without needing a group extension. This notion will be made precise later in the article in § Formal definition.$

In mathematics, Gårding's inequality is a result that gives a lower bound for the bilinear form induced by a real linear elliptic partial differential operator. The inequality is named after Lars Gårding.

In mathematics, the logarithmic norm is a real-valued functional on operators, and is derived from either an inner product, a vector norm, or its induced operator norm. The logarithmic norm was independently introduced by Germund Dahlquist and Sergei Lozinskiĭ in 1958, for square matrices. It has since been extended to nonlinear operators and unbounded operators as well. The logarithmic norm has a wide range of applications, in particular in matrix theory, differential equations and numerical analysis. In the finite-dimensional setting, it is also referred to as the matrix measure or the Lozinskiĭ measure.

In mathematics a linear inequality is an inequality which involves a linear function. A linear inequality contains one of the symbols of inequality:

In mathematics, a free boundary problem is a partial differential equation to be solved for both an unknown function $and an unknown domain . The segment of the boundary of which is not known at the outset of the problem is the free boundary .$

References

↑ Thomas H. Sidebotham (2002). The A to Z of Mathematics: A Basic Guide. John Wiley and Sons. p. 252. ISBN 0-471-15045-2.
1 2 Weisstein, Eric W. "Inequation". mathworld.wolfram.com. Retrieved 2019-12-03.
↑ "BestMaths". bestmaths.net. Retrieved 2019-12-03.
↑ 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.
↑ Stapel, Elizabeth. "Linear Programming: Introduction". Purplemath. Retrieved 2019-12-03.
↑ "Optimization - The simplex method". Encyclopedia Britannica. Retrieved 2019-12-03.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[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.

[:1-2] 1 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.

[1]

[2]

[3]

[4]

[5]

[6]