# Inequality

For the use of the < and > signs in punctuation, see Bracket.
Error creating thumbnail: Unable to save thumbnail to destination
The feasible regions of linear programming are defined by a set of inequalities.

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

• The notation ${\displaystyle a means that a is less than b and
• The notation ${\displaystyle a>b\!\ }$ means that a is greater than b.

These relations are known as strict inequality; in contrast

• ${\displaystyle a\leq b}$ means that a is less than or equal to b;
• ${\displaystyle a\geq b}$ means that a is greater than or equal to b;
• ${\displaystyle a\not >b}$ means that a is not greater than b and
• ${\displaystyle a\not means that a is 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 greater than b.
• The notation a << b means that a is much less 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. The sense of an inequality is not changed if both sides are increased or decreased by the same number, or if both sides are multiplied or divided by a positive number; the sense of an inequality is reversed if both members are multiplied or divided by a negative number.

## 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 ≥).

### Trichotomy

The trichotomy property states:

• For any real numbers, a and b, exactly one of the following is true:
• a < b
• a = b
• a > b

### Transitivity

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

### Reversal

The inequality relations are inverse relations:

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

The properties which deal with addition and subtraction state:

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

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

### Multiplication and division

The properties which deal with multiplication and division state:

• For any real numbers, a, b, c:
• If c is positive and a < b, then ac < bc
• If c is negative and a < b, then ac > bc

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

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

### Applying a function to both sides

We consider two cases of functions: monotonic and strictly monotonic.

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.

If you have a non-strict inequality (ab, ab) then:

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

It will never become strictly unequal, since, for example, 3 ≤ 3 does not imply that 3 < 3.

### Ordered fields

If F,+,* be a field and ≤ be a total order on F, then F,+,*,≤ is called an ordered field if and only if:

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

Note that both ${\displaystyle \mathbb {Q} }$,+,*,≤ and ${\displaystyle \mathbb {R} }$,+,*,≤ are ordered fields.

≤ cannot be defined in order to make ${\displaystyle \mathbb {C} }$,+,*,≤ an ordered field.

The non-strict inequalities ≤ and ≥ on real numbers are total orders. The strict inequalities < and > on real numbers are Template:Ml.

## 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. But care must be taken so that you really use the same number in all cases, eg. a < b + e < c is equivalent to ae < b < ce.

This notation can be generalized to any number of terms: for instance, a1a2 ≤ ... ≤ an means that aiai+1 for i = 1, 2, ..., n − 1. By transitivity, this condition is equivalent to aiaj for any 1 ≤ ijn.

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 > cd means that a < b, b > c, and cd. In addition to rare use in mathematics, this notation exists in a few programming languages such as Python.

## Representing Inequalities on the real number line

Every inequality (except those which involve imaginary numbers) can be represented on the real number line showing darkened regions on the line. Template:Sectstub

## Power inequalities

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

### Examples

1. If ${\displaystyle x>0}$, then ${\displaystyle x^{x}\geq \left({\frac {1}{e}}\right)^{\frac {1}{e}}}$
2. If ${\displaystyle x>0}$, then ${\displaystyle x^{x^{x}}\geq x}$
3. If ${\displaystyle x,y,z>0}$, then ${\displaystyle (x+y)^{z}+(x+z)^{y}+(y+z)^{x}>2}$.
4. For any real distinct numbers ${\displaystyle a}$ and ${\displaystyle b}$, ${\displaystyle {\frac {e^{b}-e^{a}}{b-a}}>e^{\frac {a+b}{2}}}$
5. If ${\displaystyle x,y>0}$ and ${\displaystyle 0, then ${\displaystyle (x+y)^{p}
6. If ${\displaystyle x}$, ${\displaystyle y}$ and ${\displaystyle z}$ are positive, then ${\displaystyle x^{x}y^{y}z^{z}\geq (xyz)^{\frac {x+y+z}{3}}}$
7. If ${\displaystyle a}$ and ${\displaystyle b}$ are positive, then ${\displaystyle a^{b}+b^{a}>1}$. This result was generalized by R. Ozols in 2002 who proved that if ${\displaystyle a_{1},a_{2},}$ ..., ${\displaystyle a_{n}}$ are any positive numbers, then ${\displaystyle a_{1}^{a_{2}}+a_{2}^{a_{3}}+...+a_{n}^{a_{1}}>1}$ (result is published in Latvian popular-scientific quarterly The Starry Sky, see references).

## Well-known 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:

## Mnemonics for students

Young students sometimes confuse the less-than and greater-than signs, which are mirror images of one another. A commonly taught mnemonic is that the sign represents a hungry alligator that is trying to eat the larger number; thus, it opens towards 8 in both 3 < 8 and 8 > 3.[1] Another method is noticing the larger quantity points to the smaller quantity and says, "ha-ha, I'm bigger than you."

Also, on a horizontal number line, the greater than sign is the arrow that is at the larger end of the number line. Likewise, the less than symbol is the arrow at the smaller end of the number line (<---0--1--2--3--4--5--6--7--8--9--->).

## Complex numbers and inequalities

By introducing a lexicographical order on the complex numbers, it is a totally ordered set. However, it is impossible to define ≤ so that ${\displaystyle \mathbb {C} }$,+,*,≤ becomes an ordered field. If ${\displaystyle \mathbb {C} }$,+,*,≤ were an ordered field, it has to satisfy the following two properties:

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

Because ≤ is a total order, for any number a, a ≤ 0 or 0 ≤ a. In both cases 0 ≤ a2; the squares of 1 and ${\displaystyle i}$ are 1 and -1, respectively, giving a contradiction.

However ≤ can be defined in order to satisfy the first property, i.e. if ab then a + cb + c. A definition which is sometimes used is the lexicographical order:

• a ≤ b if ${\displaystyle Re(a)}$ < ${\displaystyle Re(b)}$ or (${\displaystyle Re(a)=Re(b)}$ and ${\displaystyle Im(a)}$${\displaystyle Im(b)}$)

It can easily be proven that for this definition ab then a + cb + c

## References

• {{
 #if: Hardy, G., Littlewood J.E., Polya, G.
| {{
#if:
#if:
| {{{last}}}{{ #if:  | , {{{first}}} }}
| Hardy, G., Littlewood J.E., Polya, G.
}}]]
| {{
#if:
| {{{last}}}{{ #if:  | , {{{first}}} }}
| Hardy, G., Littlewood J.E., Polya, G.
}}
}}


}}{{

 #if: Hardy, G., Littlewood J.E., Polya, G.
| {{ #if:  | ; {{{coauthors}}} }}


}}{{

 #if:
|  [{{{origdate}}}]
| {{
#if:
| {{
#if:
|  [{{{origmonth}}} {{{origyear}}}]
|  [{{{origyear}}}]
}}
}}


}}{{

 #if:
|  ({{{date}}})
| {{
#if: 1999
| {{
#if:
|  ({{{month}}} 1999)
|  (1999)
}}
}}


}}{{ #if: Hardy, G., Littlewood J.E., Polya, G. | . }}{{

 #if:
|  "{{
#if:
| [{{{chapterurl}}} {{{chapter}}}]
| {{{chapter}}}


}}",}}{{

 #if:
|  in {{{editor}}}:


}} {{

 #if:  | [{{{url}}} Inequalities] | Inequalities


}}{{

 #if:  |  ({{{format}}})


}}{{

 #if:  | , {{{others}}}


}}{{

 #if:  | , {{{edition}}}


}}{{

 #if:  | , {{{series}}}


}}{{

 #if:  |  (in {{{language}}})


}}{{

 #if: Cambridge Mathematical Library, Cambridge University Press
| {{#if:  | ,  | .  }}{{
#if:
| {{{location}}}:
}}Cambridge Mathematical Library, Cambridge University Press


}}{{

 #if:  | , {{{page}}}


}}{{

 #if:  | . DOI:{{{doi}}}


}}{{

 #if: ISBN 0-521-05206-8 | . ISBN 0-521-05206-8


}}{{

 #if:  | . ISBN {{{isbn}}}


}}{{

 #if:  | . OCLC {{{oclc}}}


}}{{

 #if:  | {{
#if:  |
. Retrieved on [[{{{accessdate}}}]]
| {{
#if:
| . Retrieved {{
#if:
| on [[{{{accessmonth}}} {{{accessyear}}}]]
| during [[{{{accessyear}}}]]
}}}}
}}


}}.{{ #if: |  “{{{quote}}}” }}

• {{
 #if: Beckenbach, E.F., Bellman, R.
| {{
#if:
#if:
| {{{last}}}{{ #if:  | , {{{first}}} }}
| Beckenbach, E.F., Bellman, R.
}}]]
| {{
#if:
| {{{last}}}{{ #if:  | , {{{first}}} }}
| Beckenbach, E.F., Bellman, R.
}}
}}


}}{{

 #if: Beckenbach, E.F., Bellman, R.
| {{ #if:  | ; {{{coauthors}}} }}


}}{{

 #if:
|  [{{{origdate}}}]
| {{
#if:
| {{
#if:
|  [{{{origmonth}}} {{{origyear}}}]
|  [{{{origyear}}}]
}}
}}


}}{{

 #if:
|  ({{{date}}})
| {{
#if: 1975
| {{
#if:
|  ({{{month}}} 1975)
|  (1975)
}}
}}


}}{{ #if: Beckenbach, E.F., Bellman, R. | . }}{{

 #if:
|  "{{
#if:
| [{{{chapterurl}}} {{{chapter}}}]
| {{{chapter}}}


}}",}}{{

 #if:
|  in {{{editor}}}:


}} {{

 #if:  | [{{{url}}} An Introduction to Inequalities] | An Introduction to Inequalities


}}{{

 #if:  |  ({{{format}}})


}}{{

 #if:  | , {{{others}}}


}}{{

 #if:  | , {{{edition}}}


}}{{

 #if:  | , {{{series}}}


}}{{

 #if:  |  (in {{{language}}})


}}{{

 #if: Random House Inc
| {{#if:  | ,  | .  }}{{
#if:
| {{{location}}}:
}}Random House Inc


}}{{

 #if:  | , {{{page}}}


}}{{

 #if:  | . DOI:{{{doi}}}


}}{{

 #if: ISBN 0-394-01559-2 | . ISBN 0-394-01559-2


}}{{

 #if:  | . ISBN {{{isbn}}}


}}{{

 #if:  | . OCLC {{{oclc}}}


}}{{

 #if:  | {{
#if:  |
. Retrieved on [[{{{accessdate}}}]]
| {{
#if:
| . Retrieved {{
#if:
| on [[{{{accessmonth}}} {{{accessyear}}}]]
| during [[{{{accessyear}}}]]
}}}}
}}


}}.{{ #if: |  “{{{quote}}}” }}

• {{
 #if: Drachman, Byron C., Cloud, Michael J.
| {{
#if:
#if:
| {{{last}}}{{ #if:  | , {{{first}}} }}
| Drachman, Byron C., Cloud, Michael J.
}}]]
| {{
#if:
| {{{last}}}{{ #if:  | , {{{first}}} }}
| Drachman, Byron C., Cloud, Michael J.
}}
}}


}}{{

 #if: Drachman, Byron C., Cloud, Michael J.
| {{ #if:  | ; {{{coauthors}}} }}


}}{{

 #if:
|  [{{{origdate}}}]
| {{
#if:
| {{
#if:
|  [{{{origmonth}}} {{{origyear}}}]
|  [{{{origyear}}}]
}}
}}


}}{{

 #if:
|  ({{{date}}})
| {{
#if: 1998
| {{
#if:
|  ({{{month}}} 1998)
|  (1998)
}}
}}


}}{{ #if: Drachman, Byron C., Cloud, Michael J. | . }}{{

 #if:
|  "{{
#if:
| [{{{chapterurl}}} {{{chapter}}}]
| {{{chapter}}}


}}",}}{{

 #if:
|  in {{{editor}}}:


}} {{

 #if:  | [{{{url}}} Inequalities: With Applications to Engineering] | Inequalities: With Applications to Engineering


}}{{

 #if:  |  ({{{format}}})


}}{{

 #if:  | , {{{others}}}


}}{{

 #if:  | , {{{edition}}}


}}{{

 #if:  | , {{{series}}}


}}{{

 #if:  |  (in {{{language}}})


}}{{

 #if: Springer-Verlag
| {{#if:  | ,  | .  }}{{
#if:
| {{{location}}}:
}}Springer-Verlag


}}{{

 #if:  | , {{{page}}}


}}{{

 #if:  | . DOI:{{{doi}}}


}}{{

 #if: ISBN 0-387-98404-6 | . ISBN 0-387-98404-6


}}{{

 #if:  | . ISBN {{{isbn}}}


}}{{

 #if:  | . OCLC {{{oclc}}}


}}{{

 #if:  | {{
#if:  |
. Retrieved on [[{{{accessdate}}}]]
| {{
#if:
| . Retrieved {{
#if:
| on [[{{{accessmonth}}} {{{accessyear}}}]]
| during [[{{{accessyear}}}]]
}}}}
}}


}}.{{ #if: |  “{{{quote}}}” }}

1. if: {{#if: http://www.math.kth.se/math/TOPS/index.html | {{#if: Mathematical Problem Solving |1}}}}
 ||You must specify  title =  and url =  when using {{cite web}}.


{{#if: ||}} }}{{

1. if:
 | {{#if: {{#if: | {{#if:  |1}}}}
||You must specify archiveurl =  and archivedate =  when using {{cite web}}.


{{#if: ||}} }} }}{{#if: Harold Shapiro

 | {{#if:
| {{{last}}}{{#if:  | , {{{first}}} }}
| Harold Shapiro
}}]]
| {{#if:
| {{{last}}}{{#if:  | , {{{first}}} }}
| Harold Shapiro
}}
}}


}}{{#if: Harold Shapiro

 | {{#if: | ; {{{coauthors}}} }}


}}{{#if: Harold Shapiro|

   {{#if: missingdate
|  ({{#ifeq:{{#time:Y-m-d|missingdate}}|missingdate|missingdate|missingdate}})
| {{#if:
| {{#if:
|  ({{{month}}} {{{year}}})
|  ({{{year}}})
}}
}}
|}}


}}{{#if: Harold Shapiro

 | . }}{{
#if:
|  {{{editor}}}:


}}{{#if:

   | {{#if:  | {{#if: Mathematical Problem Solving | [{{{archiveurl}}} Mathematical Problem Solving] }}}}
| {{#if: http://www.math.kth.se/math/TOPS/index.html | {{#if: Mathematical Problem Solving | Mathematical Problem Solving }}}}


}}{{#if: | () }}{{#if: | ({{{language}}}) }}{{#if: The Old Problem Seminar

 | . The Old Problem Seminar


}}{{#if:

 |  {{{pages}}}


}}{{#if: Kungliga Tekniska högskolan

 | . Kungliga Tekniska högskolan{{#if: Harold Shapiro
|
| {{#if: missingdate || }}
}}


}}{{#if: Harold Shapiro

 ||{{#if: missingdate
|  ({{#ifeq:{{#time:Y-m-d|missingdate}}|missingdate|missingdate|missingdate}})
| {{#if:
| {{#if:
|  ({{{month}}} {{{year}}})
|  ({{{year}}})
}}
}}
}}


}}.{{#if:

 |  Archived from the original on [[{{{archivedate}}}]].


}}{{#if:

 |  DOI:{{{doi}}}.


}}{{#if:

 |  Retrieved on [[{{{accessdate}}}]]{{#if:  | , [[{{{accessyear}}}]] }}.


}}{{#if:

 |  Retrieved on {{{accessmonthday}}}, {{{accessyear}}}.


}}{{#if:

 |  Retrieved on {{{accessdaymonth}}} {{{accessyear}}}.


}}{{#if:

 |  “{{{quote}}}”


}}

• {{
1. if: {{#if: http://www.kalva.demon.co.uk/usa/usa74.html | {{#if: 3rd USAMO |1}}}}
 ||You must specify  title =  and url =  when using {{cite web}}.


{{#if: ||}} }}{{

1. if:
 | {{#if: {{#if: | {{#if:  |1}}}}
||You must specify archiveurl =  and archivedate =  when using {{cite web}}.


{{#if: ||}} }} }}{{#if:

 | {{#if:
| {{{last}}}{{#if:  | , {{{first}}} }}
| {{{author}}}
}}]]
| {{#if:
| {{{last}}}{{#if:  | , {{{first}}} }}
| {{{author}}}
}}
}}


}}{{#if:

 | {{#if: | ; {{{coauthors}}} }}


}}{{#if: |

   {{#if:
|  ({{#ifeq:{{#time:Y-m-d|{{{date}}}}}|{{{date}}}|[[{{{date}}}]]|{{{date}}}}})
| {{#if:
| {{#if:
|  ({{{month}}} {{{year}}})
|  ({{{year}}})
}}
}}
|}}


}}{{#if:

 | . }}{{
#if:
|  {{{editor}}}:


}}{{#if:

   | {{#if:  | {{#if: 3rd USAMO | [{{{archiveurl}}} 3rd USAMO] }}}}
| {{#if: http://www.kalva.demon.co.uk/usa/usa74.html | {{#if: 3rd USAMO | 3rd USAMO }}}}


}}{{#if: | () }}{{#if: | ({{{language}}}) }}{{#if:

 | . {{{work}}}


}}{{#if:

 |  {{{pages}}}


}}{{#if:

 | . {{{publisher}}}{{#if:
|
| {{#if:  || }}
}}


}}{{#if:

 ||{{#if:
|  ({{#ifeq:{{#time:Y-m-d|{{{date}}}}}|{{{date}}}|[[{{{date}}}]]|{{{date}}}}})
| {{#if:
| {{#if:
|  ({{{month}}} {{{year}}})
|  ({{{year}}})
}}
}}
}}


}}.{{#if:

 |  Archived from the original on [[{{{archivedate}}}]].


}}{{#if:

 |  DOI:{{{doi}}}.


}}{{#if:

 |  Retrieved on [[{{{accessdate}}}]]{{#if:  | , [[{{{accessyear}}}]] }}.


}}{{#if:

 |  Retrieved on {{{accessmonthday}}}, {{{accessyear}}}.


}}{{#if:

 |  Retrieved on {{{accessdaymonth}}} {{{accessyear}}}.


}}{{#if:

 |  “{{{quote}}}”


}}

1. if: {{#if: http://www.shepherd.edu/mathweb/solution6.html | {{#if: Problem 6 solution |1}}}}
 ||You must specify  title =  and url =  when using {{cite web}}.


{{#if: ||}} }}{{

1. if:
 | {{#if: {{#if: | {{#if:  |1}}}}
||You must specify archiveurl =  and archivedate =  when using {{cite web}}.


{{#if: ||}} }} }}{{#if:

 | {{#if:
| {{{last}}}{{#if:  | , {{{first}}} }}
| {{{author}}}
}}]]
| {{#if:
| {{{last}}}{{#if:  | , {{{first}}} }}
| {{{author}}}
}}
}}


}}{{#if:

 | {{#if: | ; {{{coauthors}}} }}


}}{{#if: |

   {{#if:
|  ({{#ifeq:{{#time:Y-m-d|{{{date}}}}}|{{{date}}}|[[{{{date}}}]]|{{{date}}}}})
| {{#if:
| {{#if:
|  ({{{month}}} {{{year}}})
|  ({{{year}}})
}}
}}
|}}


}}{{#if:

 | . }}{{
#if:
|  {{{editor}}}:


}}{{#if:

   | {{#if:  | {{#if: Problem 6 solution | [{{{archiveurl}}} Problem 6 solution] }}}}
| {{#if: http://www.shepherd.edu/mathweb/solution6.html | {{#if: Problem 6 solution | Problem 6 solution }}}}


}}{{#if: | () }}{{#if: | ({{{language}}}) }}{{#if:

 | . {{{work}}}


}}{{#if:

 |  {{{pages}}}


}}{{#if:

 | . {{{publisher}}}{{#if:
|
| {{#if:  || }}
}}


}}{{#if:

 ||{{#if:
|  ({{#ifeq:{{#time:Y-m-d|{{{date}}}}}|{{{date}}}|[[{{{date}}}]]|{{{date}}}}})
| {{#if:
| {{#if:
|  ({{{month}}} {{{year}}})
|  ({{{year}}})
}}
}}
}}


}}.{{#if:

 |  Archived from the original on [[{{{archivedate}}}]].


}}{{#if:

 |  DOI:{{{doi}}}.


}}{{#if:

 |  Retrieved on [[{{{accessdate}}}]]{{#if:  | , [[{{{accessyear}}}]] }}.


}}{{#if:

 |  Retrieved on {{{accessmonthday}}}, {{{accessyear}}}.


}}{{#if:

 |  Retrieved on {{{accessdaymonth}}} {{{accessyear}}}.


}}{{#if:

 |  “{{{quote}}}”


}}