<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Inequality (mathematics) - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=inequality_(mathematics)&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=inequality_%28mathematics%29&amp;p=4">3.Next</a>
</p>

<p>In the 17th and 18th centuries, personal notations or typewriting signs were used to signal inequalities. For example, In 1670, <a href="page.php?w=John_Wallis">John Wallis</a> used a single horizontal bar above rather than below the < and >.Later in 1734, ? and ?, known as "less than (greater-than) over equal to" or "less than (greater than) or equal to with double horizontal bars", first appeared in <a href="page.php?w=Pierre_Bouguer">Pierre Bouguer</a>'s work . After that, mathematicians simplified Bouguer's symbol to "less than (greater than) or equal to with one horizontal bar" (<=), or "less than (greater than) or slanted equal to" (?).</p>

<p>The relation <b>not greater than</b> can also be represented by  the symbol for "greater than" bisected by a slash, "not". The same is true for <b>not less than</b>, </p>

<p>The notation a != b means that a is not equal to b; this <a href="page.php?w=inequation">inequation</a> sometimes is considered a form of strict inequality. It does not say that one is greater than the other; it does not even require a and b to be a member of an <a href="page.php?w=ordered_set">ordered set</a>.</p>

<p>In engineering sciences, less formal use of the notation is to state that one quantity is "much greater" than another, normally by several <a href="page.php?w=Order_of_magnitude">orders of magnitude</a>.<br/>
* The notation a << b</i> means that a is <b>much less than</b> b.<br/>
* The notation a >> b means that a is <b>much greater than</b> b.This implies that the lesser value can be neglected with little effect on the accuracy of an <a href="page.php?w=approximation">approximation</a> (such as the case of <a href="page.php?w=ultrarelativistic_limit">ultrarelativistic limit</a> in physics).</<></p>

<p>In all of the cases above, any two symbols mirroring each other are symmetrical; a < b</i> and b > a are equivalent, etc.</></p>

<p><big> Properties on the number line </big></p>
<p>Inequalities are governed by the following <a href="page.php?w=Property_%28philosophy%29">properties</a>. All of these properties also hold if all of the non-strict inequalities (<= and >=) are replaced by their corresponding strict inequalities (< and >) and -- in the case of applying a function -- monotonic functions are limited to strictly <a href="page.php?w=monotonic_function">monotonic function</a>s.</></=></p>

<p><big> Converse </big></p>
<p>The relations <= and >= are each other's <a href="page.php?w=Converse_relation">converse</a>, meaning that for any <a href="page.php?w=real_number">real number</a>s a and b:</=></p>

<p><big>Transitivity</big></p>
<p>The transitive property of inequality states that for any <a href="page.php?w=real_number">real number</a>s a, b, c:If either of the premises is a strict inequality, then the conclusion is a strict inequality:</p>

<p><big>Addition and subtraction</big></p>
<p>A common constant c may be <a href="page.php?w=addition">added</a> to or <a href="page.php?w=subtraction">subtracted</a> from both sides of an inequality. So, for any <a href="page.php?w=real_number">real number</a>s a, b, c:</p>

<p>In other words, the inequality relation is preserved under addition (or subtraction) and the real numbers are an <a href="page.php?w=Partially_ordered_group">ordered group</a> under addition.</p>

<p><big>Multiplication and division</big></p>
<p>The properties that deal with <a href="page.php?w=multiplication">multiplication</a> and <a href="page.php?w=division_%28mathematics%29">division</a> state that for any real numbers, a, b and non-zero c:</p>

<p>In other words, the inequality relation is preserved under multiplication and division with positive constant, but is reversed when a negative constant is involved. More generally, this applies for an <a href="page.php?w=ordered_field">ordered field</a>. For more information, see <b>'.</b></p>

<p><big>Additive inverse</big></p>
<p>The property for the <a href="page.php?w=additive_inverse">additive inverse</a> states that for any real numbers a and b:</p>

<p><big>Multiplicative inverse</big></p>
<p>If both numbers are positive, then the inequality relation between the <a href="page.php?w=multiplicative_inverse">multiplicative inverse</a>s is opposite of that between the original numbers. More specifically, for any non-zero real numbers a and b that are both <a href="page.php?w=Positive_number">positive</a> (or both <a href="page.php?w=Negative_number">negative</a>):</p>

<p>All of the cases for the signs of a and b can also be written in chained notation, as follows:</p>

<p><big>Applying a function to both sides</big></p>
<p>Any <a href="page.php?w=Monotonic_function">monotonic</a>ally increasing <a href="page.php?w=function_%28mathematics%29">function</a>, by its definition, may be applied to both sides of an inequality without breaking the inequality relation (provided that both expressions are in the <a href="page.php?w=Domain_of_a_function">domain</a> of that function). However, applying a monotonically decreasing function to both sides of an inequality means the inequality relation would be reversed. The rules for the additive inverse, and the multiplicative inverse for positive numbers, are both examples of applying a monotonically decreasing function.</p>

<p>If the inequality is strict (a < b</i>, a > b) and the function is strictly monotonic, then the inequality remains strict. If only one of these conditions is strict, then the resultant inequality is non-strict. In fact, the rules for additive and multiplicative inverses are both examples of applying a strictly monotonically decreasing function.</></p>

<p>A few examples of this rule are: <br/>
* Raising both sides of an inequality to a power n > 0 (equiv., -n < 0), when a</i> and b are positive real numbers:  <br/>
* Taking the <a href="page.php?w=natural_logarithm">natural logarithm</a> on both sides of an inequality, when a and b are positive real numbers:      (this is true because the natural logarithm is a strictly increasing function.)</></p>

<p><big> Formal definitions and generalizations </big></p>
<p>A (non-strict) partial order<b> is a <a href="page.php?w=binary_relation">binary relation</a> <= over a <a href="page.php?w=Set_%28mathematics%29">set P which is <a href="page.php?w=Reflexive_relation">reflexive</a>, <a href="page.php?w=Antisymmetric_relation">antisymmetric</a>, and <a href="page.php?w=Transitive_relation">transitive</a>. That is, for all a, b, and c in P, it must satisfy the three following clauses:</=></b></p>

<p>
* a <= a</i> (<a href="page.php?w=Reflexive_relation">reflexivity</a>)<br/>
* if a <= b</i> and b <= a</i>, then a = b (<a href="page.php?w=Antisymmetric_relation">antisymmetry</a>)<br/>
* if a <= b</i> and b <= c</i>, then a <= c</i> (<a href="page.php?w=Transitive_relation">transitivity</a>)</=></=></=></=></=></=></p>

<p>A set with a partial order is called a <a href="page.php?w=partially_ordered_set">partially ordered set</a><b>. Those are the very basic axioms that every kind of order has to satisfy. </b></p>

<p>A strict partial order is a relation < that satisfies <br/>
* a !< a</i> (<a href="page.php?w=Reflexive_relation">irreflexivity</a>),<br/>
* if a < b</i>, then b !< a</i> (<a href="page.php?w=Asymmetric_relation">asymmetry</a>),<br/>
* if a < b</i> and b < c</i>, then a < c</i> (<a href="page.php?w=Transitive_relation">transitivity</a>),where  means that  does not hold.</></></></></></></p>

<p>Some types of partial orders are specified by adding further axioms, such as:</p>

<p>
* <a href="page.php?w=Total_order">Total order</a>: For every a and b in P, a <= b</i> or b <= a</i> .<br/>
* <a href="page.php?w=Dense_order">Dense order</a>: For all a and b in P for which a < b</i>, there is a c in P such that a < c</i> < b</i>.<br/>
* <a href="page.php?w=Least-upper-bound_property">Least-upper-bound property</a>: Every non-empty <a href="page.php?w=Set_%28mathematics%29">subset</a> of P with an <a href="page.php?w=upper_bound">upper bound</a> has a <a href="page.php?w=Least_upper_bound">''least'' upper bound</a> (supremum) in P.</></></></=></=></p>

<p><big> Ordered fields </big></p>
<p>If (F, +, ×) is a <a href="page.php?w=Field_%28mathematics%29">field</a> and <= is a <a href="page.php?w=total_order">total order on F, then (F, +, ×, <=) is called an </b><a href="page.php?w=ordered_field">ordered field</a><b> if and only if:<br/>
* a <= b</i> implies a + c <= b</i> + c;<br/>
* 0 <= a</i> and 0 <= b</i> implies 0 <= a</i> × b.</=></=></=></=></=></b></=)></=></p>

<p>Both  and  are <a href="page.php?w=ordered_field">ordered field</a>s, but  cannot be defined in order to make  an <a href="page.php?w=ordered_field">ordered field</a>, because -1 is the square of i and would therefore be positive.</p>

<p>Besides being an ordered field, R<b> also has the <a href="page.php?w=Least-upper-bound_property">Least-upper-bound property</a>. In fact, </b>R<b> can be defined as the only ordered field with that quality.</b></p>

<p><big> Chained notation </big></p>
<p>The notation a < b</i> < c<b><i> stands for "</i>a < </i>b and b < </i>c", from which, by the transitivity property above, it also follows that a < </i>c. By the above laws, one can add or subtract the same number to all three terms, or multiply or divide all three terms by same nonzero number and reverse all inequalities if that number is negative. Hence, for example, a < </i>b + e < </i>c is equivalent to a - e < </i>b < </i>c - e.</></></></></></></></></></p>

<p>This notation can be generalized to any number of terms: for instance, <b><i>a</i><sub>1</sub> <= a</i><sub>2</sub> <= ... <= a</i><sub>n</sub><b> means that a<sub>i</sub> <= a</i><sub>i+1</sub> for i = 1, 2, ..., n - 1. By transitivity, this condition is equivalent to a<sub>i</sub> <= a</i><sub>j</sub> for any 1 <= i</i> <= j</i> <= n</i>.</=></=></=></=></=></b></=></=></b></p>

<p>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</i> + 1 <= 3x</i> + 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 <  and x</i> >= -1 respectively, which can be combined into the final solution -1 <= x</i> < .</p>

<p>Occasionally, chained notation is used with inequalities in different directions, in which case the meaning is the <a href="page.php?w=logical_conjunction">logical conjunction</a> of the inequalities between adjacent terms. For example, the defining condition of a <a href="page.php?w=zigzag_poset">zigzag poset</a> is written as a<sub>1</sub> < a</i><sub>2</sub> > a<sub>3</sub> < a</i><sub>4</sub> > a<sub>5</sub> < a</i><sub>6</sub> > ... . Mixed chained notation is used more often with compatible relations, like <, =, <=. For instance, a</i> < b</i> = c <= d</i> means that a < b</i>, b = c, and c <= d</i>. This notation exists in a few <a href="page.php?w=programming_language">programming language</a>s such as <a href="page.php?w=Python_%28programming_language%29">Python</a>. In contrast, in programming languages that provide an ordering on the type of comparison results, such as <a href="page.php?w=C_%28programming_language%29">C</a>, even homogeneous chains may have a completely different meaning.</=></></=></></,></></></></p>

<p><big>Sharp inequalities</big></p>
<p>An inequality is said to be sharp if it cannot be relaxed and still be valid in general. Formally, a <a href="page.php?w=universally_quantified">universally quantified</a> inequality ? is called sharp if, for every valid universally quantified inequality ?, if ''?'' [[material conditional holds, then ''?'' [[equivalence (logic) also holds. For instance, the inequality [[universal quantification is sharp, whereas the inequality ?''a'' ? '''R'''. ''a''<sup>2</sup> >= -1 is not sharp.</p>

<p><big>Inequalities between means</big></p>
<p>There are many inequalities between means. For example, for any positive numbers a<sub>1</sub>, a<sub>2</sub>, ..., a<sub>n</sub> we have</p>

<p>
: </p>

<p>where they represent the following means of the sequence:</p>

<p>
* <a href="page.php?w=Harmonic_mean">Harmonic mean</a> : <br/>
* <a href="page.php?w=Geometric_mean">Geometric mean</a> : <br/>
* <a href="page.php?w=Arithmetic_mean">Arithmetic mean</a> : <br/>
* <a href="page.php?w=Root_mean_square">Quadratic mean</a> : </p>

<p><big>Cauchy-Schwarz inequality</big></p>
<p>The Cauchy-Schwarz inequality states that for all vectors u and v of an <a href="page.php?w=inner_product_space">inner product space</a> it is true that</p>

<p>where  is the <a href="page.php?w=inner_product">inner product</a>. Examples of inner products include the real and complex <a href="page.php?w=dot_product">dot product</a>; In <a href="page.php?w=Euclidean_space">Euclidean space</a> R<sup>n</sup> with the standard inner product, the Cauchy-Schwarz inequality is</p>

<p><big>Power inequalities</big></p>
<p>A power inequality<b> is an inequality containing terms of the form a<sup>b</sup>, where a and b are real positive numbers or variable expressions. They often appear in <a href="page.php?w=mathematical_olympiads">mathematical olympiads</a> exercises.</b></p>

<p>Examples:<br/>
* For any real x, <br/>
* If x > 0 and p > 0, then  In the limit of p -> 0, the upper and lower bounds converge to ln(x). <br/>
* If x > 0, then <br/>
* If x > 0, then <br/>
* If x, y, z > 0, then <br/>
* For any real distinct numbers a and b, <br/>
* If x, y > 0 and 0 < p</i> < 1, then <br/>
* If x, y, z > 0, then <br/>
* If a, b > 0, then <br/>
* If a, b > 0, then <br/>
* If a, b, c > 0, then <br/>
* If a, b > 0, then </></p>

<p><big> Well-known inequalities </big></p>
<p><a href="page.php?w=Mathematician">Mathematician</a>s often use inequalities to bound quantities for which exact formulas cannot be computed easily. Some inequalities are used so often that they have names:<br/>
* <a href="page.php?w=Azuma%27s_inequality">Azuma's inequality</a><br/>
* <a href="page.php?w=Bernoulli%27s_inequality">Bernoulli's inequality</a><br/>
* <a href="page.php?w=Bell%27s_inequality">Bell's inequality</a><br/>
* <a href="page.php?w=Boole%27s_inequality">Boole's inequality</a><br/>
* <a href="page.php?w=Cauchy-Schwarz_inequality">Cauchy-Schwarz inequality</a><br/>
* <a href="page.php?w=Chebyshev%27s_inequality">Chebyshev's inequality</a><br/>
* <a href="page.php?w=Chernoff%27s_inequality">Chernoff's inequality</a><br/>
* <a href="page.php?w=Cram%C3%A9r-Rao_inequality">Cramér-Rao inequality</a><br/>
* <a href="page.php?w=Hoeffding%27s_inequality">Hoeffding's inequality</a><br/>
* <a href="page.php?w=H%C3%B6lder%27s_inequality">Hölder's inequality</a><br/>
* <a href="page.php?w=Inequality_of_arithmetic_and_geometric_means">Inequality of arithmetic and geometric means</a><br/>
* <a href="page.php?w=Jensen%27s_inequality">Jensen's inequality</a><br/>
* <a href="page.php?w=Kolmogorov%27s_inequality">Kolmogorov's inequality</a><br/>
* <a href="page.php?w=Markov%27s_inequality">Markov's inequality</a><br/>
* <a href="page.php?w=Minkowski_inequality">Minkowski inequality</a><br/>
* <a href="page.php?w=Nesbitt%27s_inequality">Nesbitt's inequality</a><br/>
* <a href="page.php?w=Pedoe%27s_inequality">Pedoe's inequality</a><br/>
* <a href="page.php?w=Poincar%C3%A9_inequality">Poincaré inequality</a><br/>
* <a href="page.php?w=Samuelson%27s_inequality">Samuelson's inequality</a><br/>
* <a href="page.php?w=Sobolev_inequality">Sobolev inequality</a><br/>
* <a href="page.php?w=Triangle_inequality">Triangle inequality</a></p>

<p><big>Complex numbers and inequalities</big></p>
<p>The set of <a href="page.php?w=complex_number">complex number</a>s  with its operations of <a href="page.php?w=addition">addition</a> and <a href="page.php?w=multiplication">multiplication</a> is a <a href="page.php?w=field_%28mathematics%29">field</a>, but it is impossible to define any relation  so that  becomes an <a href="page.php?w=ordered_field">ordered field</a>. To make  an <a href="page.php?w=ordered_field">ordered field</a>, it would have to satisfy the following two properties:<br/>
* if ''a'' <= ''b'', then ''a'' + ''c'' <= ''b'' + ''c'';<br/>
* if 0 <= ''a'' and 0 <= ''b'', then 0 <= ''ab''.</p>

<p>Because <= is a <a href="page.php?w=total_order">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''<sup>2; this means that ''i''<sup>2</sup> > 0 and 1<sup>2</sup> > 0; so -1 > 0 and 1 > 0, which means (-1 + 1) > 0; contradiction.</=></=></p>

<p>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 <a href="page.php?w=lexicographical_order">lexicographical order definition is used:<br/>
* ''a'' <= ''b'', if<br/>
** Re(''a'') < Re(''b''), or<br/>
** 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''.</p>

<p><big> Systems of inequalities </big></p>
<p>Systems of <a href="page.php?w=linear_inequalities">linear inequalities</a> can be simplified by <a href="page.php?w=Fourier-Motzkin_elimination">Fourier-Motzkin elimination</a>.</p>

<p>The <a href="page.php?w=cylindrical_algebraic_decomposition">cylindrical algebraic decomposition</a> is an algorithm that allows testing whether a system of polynomial equations and inequalities has solutions, and, if solutions exist, describing them. The complexity of this algorithm is <a href="page.php?w=double_exponential_function">doubly exponential</a> in the number of variables. It is an active research domain to design algorithms that are more efficient in specific cases.</p>

<p><big>See also</big></p>
<p>
*<a href="page.php?w=Binary_relation">Binary relation</a><br/>
*<a href="page.php?w=Bracket_%28mathematics%29">Bracket (mathematics)</a>, for the use of similar < and > signs as <a href="page.php?w=bracket">bracket</a>s<br/>
*<a href="page.php?w=Inclusion_%28set_theory%29">Inclusion (set theory)</a><br/>
*<a href="page.php?w=Inequation">Inequation</a><br/>
*<a href="page.php?w=Interval_%28mathematics%29">Interval (mathematics)</a><br/>
*<a href="page.php?w=List_of_inequalities">List of inequalities</a><br/>
*<a href="page.php?w=List_of_triangle_inequalities">List of triangle inequalities</a><br/>
*<a href="page.php?w=Partially_ordered_set">Partially ordered set</a><br/>
*<a href="page.php?w=Relational_operator">Relational operator</a>s, used in programming languages to denote inequality</></p>

<p><big>References</big></p>
<p><big> Sources </big></p>
<p>
* <br/>
* <br/>
* <br/>
* <br/>
* <br/>
* <br/>
* <br/>
* <br/>
* <br/>
* <br/>
* </p>

<p><big> External links </big></p>
<p>
* <br/>
*  by <a href="page.php?w=Ed_Pegg%2C_Jr.">Ed Pegg, Jr.</a><br/>
* </p>

<p></p>
<p>
<a accesskey="1" href="page.php?w=inequality_(mathematics)&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=inequality_%28mathematics%29&amp;p=4">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
