Inequality (mathematics)

Not to be confused with Inequation.

"Less than" and "Greater than" redirect here. For the use of the "<" and ">" signs as punctuation, see Bracket.

"More than" redirects here. For the UK insurance brand, see RSA Insurance Group.

The feasible regions of linear programming are defined by a set of inequalities.

In mathematics, an inequality is a statement how the relative size or order of two objects, or about whether they are the same or not (See also: equality).

• The notation a < b means that a is less than b.
• The notation a > b means that a is greater than b.
• The notation a ≠ b means that a is not equal to b, but does not say that one is greater than the other or even that they can be compared in size.

In each statement above, a is not equal to b. These relations are known as strict inequalities. The notation a < b may also be read as "a is strictly less than b".

In contrast to strict inequalities, there are two types of inequality statements that are not strict:

• The notation a ≤ b means that a is less than or equal to b (or, equivalently, not greater than b)
• The notation a ≥ b means that a is greater than or equal to b (or, equivalently, not less than b)

An additional use of the notation is to show that one quantity is much greater than another, normally by several orders of magnitude.

• The notation a ≪ b means that a is much less than b.
• The notation a ≫ b means that a is much greater than b.

If the sense of the inequality is the same for all values of the variables for which its members are defined, then the inequality is called an "absolute" or "unconditional" inequality. If the sense of an inequality holds only for certain values of the variables involved, but is reversed or destroyed for other values of the variables, it is called a conditional inequality.

Properties

Inequalities are governed by the following properties. Note that, for the transitivity, reversal, addition and subtraction, and multiplication and division properties, the property also holds if strict inequality signs (< and >) are replaced with their corresponding non-strict inequality sign (≤ and ≥).

Transitivity

cus ur stupid The transitivity of inequalities states:

• For any real numbers, a, b, c:
  • If a > b and b > c; then a > c
  • If a < b and b < c; then a < c
  • If a > b and b = c; then a > c
  • If a < b and b = c; then a < c

Addition and subtraction

The properties that deal with cus ur stupid addition and subtraction state:

• For any real numbers, a, b, c:
  • If a < b, then a + c < b + c and a − c < b − c
  • If a > b, then a + c > b + c and a − c > b − c

i.e., the real numbers are an ordered group

Multiplication and division

The properties that deal with multiplication and division state:

• For any real numbers, a, b, and non-zero c
  • If c is positive and a < b, then ac < bc and a/c < b/c
  • If c is negative and a < b, then ac > bc and a/c > b/c

More generally this applies for an ordered field, see below.

Additive inverse

The properties for the additive inverse state:

• For any real numbers a and b
  • If a < b then −a > −b
  • If a > b then −a < −b

Multiplicative inverse

The properties for the multiplicative inverse state:

• For any non-zero real numbers a and b that are both positive or both negative
  • If a < b then 1/a > 1/b
  • If a > b then 1/a < 1/b

• If either a or b is negative (but not both) then
  • If a < b then 1/a < 1/b
  • If a > b then 1/a > 1/b

Applying a function to both sides

The graph of y = ln x

Any strictly monotonically increasing function may be applied to both sides of an inequality and it will still hold. Applying a strictly monotonically decreasing function to both sides of an inequality means the opposite inequality now holds. The rules for additive and multiplicative inverses are both examples of applying a monotonically decreasing function.

For a non-strict inequality (a ≤ b, a ≥ b):

• Applying a monotonically increasing function preserves the relation (≤ remains ≤, ≥ remains ≥)
• Applying a monotonically decreasing function reverses the relation (≤ becomes ≥, ≥ becomes ≤)

As an example, consider the application of the natural logarithm to both sides of an inequality:

$0<a<b\Leftrightarrow \ln(a)<\ln(b).$

This is true because the natural logarithm is a strictly increasing function.

Ordered fields

If (F, +, ×) is a field and ≤ is a total order on F, then (F, +, ×, ≤) is called an ordered field if and only if:

• a ≤ b implies a + c ≤ b + c;
• 0 ≤ a and 0 ≤ b implies 0 ≤ a × b.

Note that both (Q, +, ×, ≤) and (R, +, ×, ≤) are ordered fields, but ≤ cannot be defined in order to make (C, +, ×, ≤) an ordered field, because −1 is the square of i and would therefore be positive.

The non-strict inequalities ≤ and ≥ on real numbers are total orders. The strict inequalities < and > on real numbers are {{#invoke:Total_order|Strict_total_order|strict total orders}}.

Chained notation

The notation a < b < c stands for "a < b and b < c", from which, by the transitivity property above, it also follows that a < c. Obviously, by the above laws, one can add/subtract the same number to all three terms, or multiply/divide all three terms by same nonzero number and reverse all inequalities according to sign. Hence, for example, a < b + e < c is equivalent to a − e < b < c − e.

This notation can be generalized to any number of terms: for instance, a₁ ≤ a₂ ≤ ... ≤ a_n means that a_i ≤ a_i+1 for i = 1, 2, ..., n − 1. By transitivity, this condition is equivalent to a_i ≤ a_j for any 1 ≤ i ≤ j ≤ n.

When solving inequalities using chained notation, it is possible and sometimes necessary to evaluate the terms independently. For instance to solve the inequality 4x < 2x + 1 ≤ 3x + 2, it is not possible to isolate x in any one part of the inequality through addition or subtraction. Instead, the inequalities must be solved independently, yielding x < 1/2 and x ≥ −1 respectively, which can be combined into the final solution −1 ≤ x < 1/2.

Occasionally, chained notation is used with inequalities in different directions, in which case the meaning is the logical conjunction of the inequalities between adjacent terms. For instance, a < b = c ≤ d means that a < b, b = c, and c ≤ d. This notation exists in a few programming languages such as Python.

Inequalities between means

See also: Inequality of arithmetic and geometric means

There are many inequalities between means. For example, for any positive numbers a₁, a₂, …, a_n we have H ≤ G ≤ A ≤ Q, where

$H={\frac {n}{1/a_{1}+1/a_{2}+\cdots +1/a_{n}}}$	(harmonic mean),
$G={\sqrt[{n}]{a_{1}\cdot a_{2}\cdots a_{n}}}$	(geometric mean),
$A={\frac {a_{1}+a_{2}+\cdots +a_{n}}{n}}$	(arithmetic mean),
$Q={\sqrt {\frac {a_{1}^{2}+a_{2}^{2}+\cdots +a_{n}^{2}}{n}}}$	(quadratic mean).

Power inequalities

Sometimes with notation "power inequality" understand inequalities that contain a^b type expressions where a and b are real positive numbers or expressions of some variables. They can appear in exercises of mathematical olympiads and some calculations.

Examples

• If x > 0, then

$x^{x}\geq \left({\frac {1}{e}}\right)^{1/e}.\,$

• If x > 0, then

$x^{x^{x}}\geq x.\,$

• If x, y, z > 0, then

$(x+y)^{z}+(x+z)^{y}+(y+z)^{x}>2.\,$

• For any real distinct numbers a and b,

${\frac {e^{b}-e^{a}}{b-a}}>e^{(a+b)/2}.$

• If x, y > 0 and 0 < p < 1, then

$(x+y)^{p}<x^{p}+y^{p}.\,$

• If x, y, z > 0, then

$x^{x}y^{y}z^{z}\geq (xyz)^{(x+y+z)/3}.\,$

• If a, b > 0, then

$a^{b}+b^{a}>1.\,$

This result was generalized by R. Ozols in 2002 who proved that if a₁, ..., a_n > 0, then

$a_{1}^{a_{2}}+a_{2}^{a_{3}}+\cdots +a_{n}^{a_{1}}>1$

(result is published in Latvian popular-scientific quarterly The Starry Sky, see references).

Well-known inequalities

See also list of inequalities.

Mathematicians often use inequalities to bound quantities for which exact formulas cannot be computed easily. Some inequalities are used so often that they have names:

• Azuma's inequality
• Bernoulli's inequality
• Boole's inequality
• Cauchy–Schwarz inequality
• Chebyshev's inequality
• Chernoff's inequality
• Cramér–Rao inequality
• Hoeffding's inequality
• Hölder's inequality
• Inequality of arithmetic and geometric means
• Jensen's inequality
• Kolmogorov's inequality
• Markov's inequality
• Minkowski inequality
• Nesbitt's inequality
• Pedoe's inequality
• Poincaré inequality
• Triangle inequality

Complex numbers and inequalities

The set of complex numbers $\mathbb {C}$ with its operations of addition and multiplication is a field, but it is impossible to define any relation ≤ so that $(\mathbb {C} ,+,\times ,\leq )$ becomes an ordered field. To make $(\mathbb {C} ,+,\times ,\leq )$ an ordered field, it would have to satisfy the following two properties:

• if a ≤ b then a + c ≤ b + c
• if 0 ≤ a and 0 ≤ b then 0 ≤ a b

Because ≤ is a total order, for any number a, either 0 ≤ a or a ≤ 0 (in which case the first property above implies that 0 ≤ $-a$). In either case 0 ≤ a²; this means that $i^{2}>0$ and $1^{2}>0$; so $-1>0$ and $1>0$, which means $(-1+1)>0$; contradiction.

However, an operation ≤ can be defined so as to satisfy only the first property (namely, "if a ≤ b then a + c ≤ b + c"). Sometimes the lexicographical order definition is used:

• a ≤ b if $Re(a)$ < $Re(b)$ or ($Re(a)=Re(b)$ and $Im(a)$ ≤ $Im(b)$)

It can easily be proven that for this definition a ≤ b implies a + c ≤ b + c.

Vector inequalities

Inequality relationships similar to those defined above can also be defined for column vector. If we let the vectors $x,y\in \mathbb {R} ^{n}$ (meaning that $x=\left(x_{1},x_{2},\ldots ,x_{n}\right)^{T}$ and $y=\left(y_{1},y_{2},\ldots ,y_{n}\right)^{T}$ where $x_{i}$ and $y_{i}$ are real numbers for $i=1,\ldots ,n$), we can define the following relationships.

• $x=y\$ if $x_{i}=y_{i}\$ for $i=1,\ldots ,n$
• $x<y\$ if $x_{i}<y_{i}\$ for $i=1,\ldots ,n$
• $x\leq y$ if $x_{i}\leq y_{i}$ for $i=1,\ldots ,n$ and $x\neq y$
• $x\leqq y$ if $x_{i}\leq y_{i}$ for $i=1,\ldots ,n$

Similarly, we can define relationships for $x>y$, $x\geq y$, and $x\geqq y$. We note that this notation is consistent with that used by Matthias Ehrgott in Multicriteria Optimization (see References).

We observe that the property of Trichotomy (as stated above) is not valid for vector relationships. We consider the case where $x=\left[2,5\right]^{T}$ and $y=\left[3,4\right]^{T}$. There exists no valid inequality relationship between these two vectors. Also, a multiplicative inverse would need to be defined on a vector before this property could be considered. However, for the rest of the aforementioned properties, a parallel property for vector inequalities exists.

See also

• Binary relation
• Bracket for the use of the < and > signs as brackets
• Fourier-Motzkin elimination
• Inclusion (set theory)
• Inequation
• Interval (mathematics)
• Partially ordered set
• Relational operators, used in programming languages to denote inequality

References

• Hardy, G., Littlewood J.E., Polya, G. (1999). Inequalities. Cambridge Mathematical Library, Cambridge University Press. ISBN 0-521-05206-8.{{cite book}}: CS1 maint: multiple names: authors list (link)
• Beckenbach, E.F., Bellman, R. (1975). An Introduction to Inequalities. Random House Inc. ISBN 0-394-01559-2.{{cite book}}: CS1 maint: multiple names: authors list (link)
• Drachman, Byron C., Cloud, Michael J. (1998). Inequalities: With Applications to Engineering. Springer-Verlag. ISBN 0-387-98404-6.{{cite book}}: CS1 maint: multiple names: authors list (link)
• Murray S. Klamkin. ""Quickie" inequalities" (PDF). Math Strategies.
• Arthur Lohwater (1982). "Introduction to Inequalities". Online e-book in PDF format.
• Harold Shapiro (2005,1972–1985). "Mathematical Problem Solving". The Old Problem Seminar. Kungliga Tekniska högskolan. {{cite web}}: Check date values in: |date= (help)
• "3rd USAMO". Archived from the original on 2008-02-03.
• Ehrgott, Matthias (2005). Multicriteria Optimization. Springer-Berlin. ISBN 3-540-21398-8.
• Steele, J. Michael (2004). The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. Cambridge University Press. ISBN 978-0521546775.

External links

• Graph of Inequalities by Ed Pegg, Jr., Wolfram Demonstrations Project.