Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Inequality (mathematics)

From Wikipedia, the free encyclopedia
(Redirected fromGreater than or equal to)
Mathematical relation expressed with < or ≤
This article is about relations "greater than" and "less than". For the relation "not equal", seeInequation."Less than" redirects here; not to be confused withLess Than (song)."≪" redirects here; not to be confused withAbsolute continuity of measures.
This article includes a list ofgeneral references, butit lacks sufficient correspondinginline citations. Please help toimprove this article byintroducing more precise citations.(May 2017) (Learn how and when to remove this message)
Thefeasible regions oflinear programming are defined by a set of inequalities.

Inmathematics, aninequality is a relation which makes a non-equal comparison between two numbers or other mathematical expressions.[1] It is used most often to compare two numbers on thenumber line by their size. The main types of inequality areless than andgreater than (denoted by< and>, respectively theless-than andgreater-than signs).

Notation

[edit]

There are several different notations used to represent different kinds of inequalities:

  • The notationa <b means thata isless thanb.
  • The notationa >b means thata isgreater thanb.

In either case,a is not equal tob. These relations are known asstrict inequalities,[1] meaning thata is strictly less than or strictly greater thanb. Equality is excluded.

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

  • The notationab orab orab means thata isless than or equal tob (or, equivalently, at mostb, or not greater thanb).
  • The notationab orab orab means thata isgreater than or equal tob (or, equivalently, at leastb, or not less thanb).

In the 17th and 18th centuries, personal notations or typewriting signs were used to signal inequalities.[2] For example, In 1670,John Wallis used a single horizontal barabove 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 inPierre Bouguer's work .[3] 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" (⩽).

The relationnot greater than can also be represented byab,{\displaystyle a\ngtr b,} the symbol for "greater than" bisected by a slash, "not". The same is true fornot less than,ab.{\displaystyle a\nless b.}

The notationab means thata is not equal tob; thisinequation sometimes is considered a form of strict inequality.[4] It does not say that one is greater than the other; it does not even requirea andb to be member of anordered set.

In engineering sciences, less formal use of the notation is to state that one quantity is "much greater" than another,[5] normally by severalorders of magnitude.

  • The notationab means thata ismuch less thanb.[6]
  • The notationab means thata ismuch greater thanb.[7]

This implies that the lesser value can be neglected with little effect on the accuracy of anapproximation (such as the case ofultrarelativistic limit in physics).

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

Properties on the number line

[edit]

Inequalities are governed by the followingproperties. 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 tostrictlymonotonic functions.

Converse

[edit]

The relations ≤ and ≥ are each other'sconverse, meaning that for anyreal numbersa andb:

ab andba are equivalent.

Transitivity

[edit]

The transitive property of inequality states that for anyreal numbersa,b,c:[8]

Ifab andbc, thenac.

Ifeither of the premises is a strict inequality, then the conclusion is a strict inequality:

Ifab andb <c, thena <c.
Ifa <b andbc, thena <c.

Addition and subtraction

[edit]
Ifx <y, thenx +a <y +a.

A common constantc may beadded to orsubtracted from both sides of an inequality.[4] So, for anyreal numbersa,b,c:

Ifab, thena +cb +c andacbc.

In other words, the inequality relation is preserved under addition (or subtraction) and the real numbers are anordered group under addition.

Multiplication and division

[edit]
Ifx <y anda > 0, thenax <ay.
Ifx <y anda < 0, thenax >ay.

The properties that deal withmultiplication anddivision state that for any real numbers,a,b and non-zeroc:

Ifab andc > 0, thenacbc anda/cb/c.
Ifab andc < 0, thenacbc anda/cb/c.

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 anordered field. For more information, see§ Ordered fields.

Additive inverse

[edit]

The property for theadditive inverse states that for any real numbersa andb:

Ifab, then −a ≥ −b.

Multiplicative inverse

[edit]

If both numbers are positive, then the inequality relation between themultiplicative inverses is opposite of that between the original numbers. More specifically, for any non-zero real numbersa andb that are bothpositive (or bothnegative):

Ifab, then1/a1/b.

All of the cases for the signs ofa andb can also be written inchained notation, as follows:

If 0 <ab, then1/a1/b > 0.
Ifab < 0, then 0 >1/a1/b.
Ifa < 0 <b, then1/a < 0 <1/b.

Applying a function to both sides

[edit]
The graph ofy = lnx

Anymonotonically increasingfunction, by its definition,[9] may be applied to both sides of an inequality without breaking the inequality relation (provided that both expressions are in thedomain 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.

If the inequality is strict (a <b,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 astrictly monotonically decreasing function.

A few examples of this rule are:

  • Raising both sides of an inequality to a powern > 0 (equiv., −n < 0), whena andb are positive real numbers:
    0 ≤ab ⇔ 0 ≤anbn.
    0 ≤abanbn ≥ 0.
  • Taking thenatural logarithm on both sides of an inequality, whena andb are positive real numbers:
    0 <ab ⇔ ln(a) ≤ ln(b).
    0 <a <b ⇔ ln(a) < ln(b).
    (this is true because the natural logarithm is a strictly increasing function.)

Formal definitions and generalizations

[edit]

A (non-strict)partial order is abinary relation ≤ over asetP which isreflexive,antisymmetric, andtransitive.[10] That is, for alla,b, andc inP, it must satisfy the three following clauses:

A set with a partial order is called apartially ordered set.[11] Those are the very basic axioms that every kind of order has to satisfy.

A strict partial order is a relation < that satisfies

where means that< does not hold.

Some types of partial orders are specified by adding further axioms, such as:

Ordered fields

[edit]
Main article:Ordered field

If (F, +, ×) is afield and ≤ is atotal order onF, then (F, +, ×, ≤) is called anordered field if and only if:

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

Both(Q,+,×,){\displaystyle (\mathbb {Q} ,+,\times ,\leq )} and(R,+,×,){\displaystyle (\mathbb {R} ,+,\times ,\leq )} areordered fields, but cannot be defined in order to make(C,+,×,){\displaystyle (\mathbb {C} ,+,\times ,\leq )} anordered field,[12] because −1 is the square ofi and would therefore be positive.

Besides being an ordered field,R also has theLeast-upper-bound property. In fact,R can be defined as the only ordered field with that quality.[13]

Chained notation

[edit]

The notationa <b <c stands for "a <b andb <c", from which, by the transitivity property above, it also follows thata <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 <b +e <c is equivalent toae <b <ce.

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

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 isolatex in any one part of the inequality through addition or subtraction. Instead, the inequalities must be solved independently, yieldingx <1/2 andx ≥ −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 thelogical conjunction of the inequalities between adjacent terms. For example, the defining condition of azigzag poset is written asa1 <a2 >a3 <a4 >a5 <a6 > ... . Mixed chained notation is used more often with compatible relations, like <, =, ≤. For instance,a <b =cd means thata <b,b =c, andcd. This notation exists in a fewprogramming languages such asPython. In contrast, in programming languages that provide an ordering on the type of comparison results, such asC, even homogeneous chains may have a completely different meaning.[14]

Sharp inequalities

[edit]

An inequality is said to besharp if it cannot berelaxed and still be valid in general. Formally, auniversally quantified inequalityφ is called sharp if, for every valid universally quantified inequalityψ, ifψφ holds, thenψφ also holds. For instance, the inequalityaR.a2 ≥ 0 is sharp, whereas the inequalityaR.a2 ≥ −1 is not sharp.[citation needed]

Inequalities between means

[edit]
See also:Inequality of arithmetic and geometric means

There are many inequalities between means. For example, for any positive numbersa1,a2, ...,an we have

HGAQ,{\displaystyle H\leq G\leq A\leq Q,}

where they represent the following means of the sequence:

Cauchy–Schwarz inequality

[edit]
See also:Cauchy–Schwarz inequality

The Cauchy–Schwarz inequality states that for all vectorsu andv of aninner product space it is true that|u,v|2u,uv,v,{\displaystyle |\langle \mathbf {u} ,\mathbf {v} \rangle |^{2}\leq \langle \mathbf {u} ,\mathbf {u} \rangle \cdot \langle \mathbf {v} ,\mathbf {v} \rangle ,}where,{\displaystyle \langle \cdot ,\cdot \rangle } is theinner product. Examples of inner products include the real and complexdot product; InEuclidean spaceRn with the standard inner product, the Cauchy–Schwarz inequality is(i=1nuivi)2(i=1nui2)(i=1nvi2).{\displaystyle {\biggl (}\sum _{i=1}^{n}u_{i}v_{i}{\biggr )}^{2}\leq {\biggl (}\sum _{i=1}^{n}u_{i}^{2}{\biggr )}{\biggl (}\sum _{i=1}^{n}v_{i}^{2}{\biggr )}.}

Power inequalities

[edit]

Apower inequality is an inequality containing terms of the formab, wherea andb are real positive numbers or variable expressions. They often appear inmathematical olympiads exercises.

Examples:

Well-known inequalities

[edit]
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:

Complex numbers and inequalities

[edit]

The set ofcomplex numbersC{\displaystyle \mathbb {C} } with its operations ofaddition andmultiplication is afield, but it is impossible to define any relation so that(C,+,×,){\displaystyle (\mathbb {C} ,+,\times ,\leq )} becomes anordered field. To make(C,+,×,){\displaystyle (\mathbb {C} ,+,\times ,\leq )} anordered field, it would have to satisfy the following two properties:

  • ifab, thena +cb +c;
  • if0 ≤a and0 ≤b, then0 ≤ab.

Because ≤ is atotal order, for any numbera, either0 ≤a ora ≤ 0 (in which case the first property above implies that0 ≤ −a). In either case0 ≤a2; this means thati2 > 0 and12 > 0; so−1 > 0 and1 > 0, which means (−1 + 1) > 0; contradiction.

However, an operation ≤ can be defined so as to satisfy only the first property (namely, "ifab, thena +cb +c"). Sometimes thelexicographical order definition is used:

  • ab, if
    • Re(a) < Re(b), or
    • Re(a) = Re(b) andIm(a) ≤ Im(b)

It can easily be proven that for this definitionab impliesa +cb +c.

Systems of inequalities

[edit]

Systems oflinear inequalities can be simplified byFourier–Motzkin elimination.[17]

Thecylindrical algebraic decomposition 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 isdoubly exponential in the number of variables. It is an active research domain to design algorithms that are more efficient in specific cases.

See also

[edit]

References

[edit]
  1. ^ab"Inequality Definition (Illustrated Mathematics Dictionary)".www.mathsisfun.com. Retrieved2019-12-03.
  2. ^Halmaghi, Elena; Liljedahl, Peter. "Inequalities in the History of Mathematics: From Peculiarities to a Hard Discipline".Proceedings of the 2012 Annual Meeting of the Canadian Mathematics Education Study Group.
  3. ^"Earliest Uses of Symbols of Relation".MacTutor. University of St Andrews, Scotland.
  4. ^ab"Inequality".www.learnalberta.ca. Retrieved2019-12-03.
  5. ^Polyanin, A.D.; Manzhirov, A.V. (2006).Handbook of Mathematics for Engineers and Scientists. CRC Press. p. 29.ISBN 978-1-4200-1051-0. Retrieved2021-11-19.
  6. ^Weisstein, Eric W."Much Less".mathworld.wolfram.com. Retrieved2019-12-03.
  7. ^Weisstein, Eric W."Much Greater".mathworld.wolfram.com. Retrieved2019-12-03.
  8. ^Drachman, Bryon C.; Cloud, Michael J. (2006).Inequalities: With Applications to Engineering. Springer Science & Business Media. pp. 2–3.ISBN 0-3872-2626-5.
  9. ^"ProvingInequalities".www.cs.yale.edu. Retrieved2019-12-03.
  10. ^Simovici, Dan A. & Djeraba, Chabane (2008)."Partially Ordered Sets".Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics. Springer.ISBN 9781848002012.
  11. ^Weisstein, Eric W."Partially Ordered Set".mathworld.wolfram.com. Retrieved2019-12-03.
  12. ^Feldman, Joel (2014)."Fields"(PDF).math.ubc.ca.Archived(PDF) from the original on 2022-10-09. Retrieved2019-12-03.
  13. ^Stewart, Ian (2007).Why Beauty Is Truth: The History of Symmetry. Hachette UK. p. 106.ISBN 978-0-4650-0875-9.
  14. ^Brian W. Kernighan and Dennis M. Ritchie (Apr 1988).The C Programming Language. Prentice Hall Software Series (2nd ed.). Englewood Cliffs/NJ: Prentice Hall.ISBN 0131103628. Here: Sect.A.7.9Relational Operators, p.167: Quote: "a<b<c is parsed as (a<b)<c"
  15. ^Laub, M.; Ilani, Ishai (1990). "E3116".The American Mathematical Monthly.97 (1):65–67.doi:10.2307/2324012.JSTOR 2324012.
  16. ^Manyama, S. (2010)."Solution of One Conjecture on Inequalities with Power-Exponential Functions"(PDF).Australian Journal of Mathematical Analysis and Applications.7 (2): 1.Archived(PDF) from the original on 2022-10-09.
  17. ^Gärtner, Bernd;Matoušek, Jiří (2006).Understanding and Using Linear Programming. Berlin: Springer.ISBN 3-540-30697-8.

Sources

[edit]

External links

[edit]
Wikimedia Commons has media related toInequalities (mathematics).
Authority control databases: NationalEdit this at Wikidata
Retrieved from "https://en.wikipedia.org/w/index.php?title=Inequality_(mathematics)&oldid=1278946656"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp