Absolute value - wikipedia Absolute value For other uses, see Absolute value ( disambiguation ). The graph of the absolute value function for real numbers The absolute value of a number may be thought of as its distance from zero. In mathematics, the absolute value or modulus x of a real number x is the non-negative value of x without regard to its sign. Namely, x = x for a positive x, x = − x for a negative x ( in which case − x is positive ), and 0 = 0. For example, the absolute value of 3 is 3, and the absolute value of − 3 is also 3. The absolute value of a number may be thought of as its distance from zero. Generalisations of the absolute value for real numbers occur in a wide variety of mathematical settings. For example, an absolute value is also defined for the complex numbers, the quaternions, ordered rings, fields and vector spaces. The absolute value is closely related to the notions of magnitude, distance, and norm in various mathematical and physical contexts. Contents 1 Terminology and notation 2 Definition and properties 2.1 Real numbers 2.2 Complex numbers 2.2. 1 Proof of the triangle inequality for complex numbers 3 Absolute value function 3.1 Relationship to the sign function 3.2 Derivative 3.3 Antiderivative 4 Distance 5 Generalizations 5.1 Ordered rings 5.2 Fields 5.3 Vector spaces 5.4 Composition algebras 6 Notes 7 References 8 External links Terminology and notation In 1806, Jean - Robert Argand introduced the term module, meaning unit of measure in French, specifically for the complex absolute value, and it was borrowed into English in 1866 as the Latin equivalent modulus. The term absolute value has been used in this sense from at least 1806 in French and 1857 in English. The notation x, with a vertical bar on each side, was introduced by Karl Weierstrass in 1841. Other names for absolute value include numerical value and magnitude. In programming languages and computational software packages, the absolute value of x is generally represented by abs ( x ), or a similar expression. The vertical bar notation also appears in a number of other mathematical contexts : for example, when applied to a set, it denotes its cardinality ; when applied to a matrix, it denotes its determinant. Vertical bars denote the absolute value only for algebraic objects for which the notion of an absolute value is defined, notably an element of a normed division algebra like a real number, complex number, quaternion. A closely related but distinct notation is the use of vertical bars for either the euclidean norm or sup norm of a vector in R n ( displaystyle mathbb ( R ) ^ ( n ) ), although double vertical bars with subscripts ( ⋅ 2 ( displaystyle cdot _ ( 2 ) ) and ⋅ ∞ ( displaystyle cdot _ ( infty ) ), respectively ) are a more common and less ambiguous notation. Definition and properties Real numbers For any real number x, the absolute value or modulus of x is denoted by x ( a vertical bar on each side of the quantity ) and is defined as x = ( x, if x ≥ 0 − x, if x < 0. ( displaystyle x = left ( ( \begin ( array ) ( rl ) x, & ( \text ( if ) ) x geq 0 - x, & ( \text ( if ) ) x < 0. end ( array ) ) \right. ) The absolute value of x is thus always either positive or zero, but never negative, since x < 0 implies − x > 0. From an analytic geometry point of view, the absolute value of a real number is that number 's distance from zero along the real number line, and more generally the absolute value of the difference of two real numbers is the distance between them. Indeed, the notion of an abstract distance function in mathematics can be seen to be a generalisation of the absolute value of the difference ( see `` Distance '' below ). Since the square root notation without sign represents the positive square root, it follows that a = a 2 ( displaystyle a = ( sqrt ( a ^ ( 2 ) ) ) ) ( 1 ) for real values of a ( equation ( 1 ) ). This identity is sometimes used as a definition of absolute value of real numbers. The absolute value has the following four fundamental properties ( a, b are real numbers ) : a ≥ 0 ( displaystyle a geq 0 ) ( 2 ) Non-negativity a = 0 ⟺ a = 0 ( displaystyle a = 0 iff a = 0 ) ( 3 ) Positive - definiteness a b = a b ( displaystyle ab = a , b ) ( 4 ) Multiplicativity a + b ≤ a + b ( displaystyle a + b leq a + b ) ( 5 ) The triangle inequality, equivalent to subadditivity The properties given by equations ( 2 ) - ( 4 ) are readily apparent from the definition. To see that equation ( 5 ) holds, choose ε ( displaystyle \varepsilon ) from ( − 1, 1 ) ( displaystyle ( - 1, 1 ) ) so that ε ( a + b ) ≥ 0 ( displaystyle \varepsilon ( a + b ) geq 0 ). Since ε x ≤ x ( displaystyle \varepsilon x leq x ) for real x ( displaystyle x ) regardless of the value of ε ( displaystyle \varepsilon ) chosen, ( 5 ) follows from the calculation a + b = ε ( a + b ) = ε a + ε b ≤ a + b ( displaystyle a + b = \varepsilon ( a + b ) = \varepsilon a+ \varepsilon b leq a + b ). ( For a generalization of this argument to complex numbers, see `` Proof of the triangle inequality for complex numbers '' below. ) Some additional useful properties are given below. These properties are either implied by or equivalent to the properties given by equations ( 2 ) - ( 5 ). a = a ( displaystyle ( \big ) , a , ( \big ) = a ) ( 6 ) Idempotence ( the absolute value of the absolute value is the absolute value ) − a = a ( displaystyle - a = a ) ( 7 ) Evenness ( reflection symmetry of the graph ) a − b = 0 ⟺ a = b ( displaystyle a-b = 0 iff a = b ) ( 8 ) Identity of indiscernibles ( equivalent to positive - definiteness ) a − b ≤ a − c + c − b ( displaystyle a-b leq a-c + c-b ) ( 9 ) Triangle inequality # Example norms ( equivalent to subadditivity ) a b = a b ( displaystyle left ( \frac ( a ) ( b ) ) \right = ( \frac ( a ) ( b ) ) ) ( if b ≠ 0 ( displaystyle b \neq 0 ) ) ( 10 ) Preservation of division ( equivalent to multiplicativity ) a − b ≥ a − b ( displaystyle a-b geq ( \big ) , a - b , ( \big ) ) ( 11 ) Reverse triangle inequality ( equivalent to subadditivity ) Two other useful properties concerning inequalities are : a ≤ b ⟺ − b ≤ a ≤ b ( displaystyle a leq b iff - b leq a leq b ) a ≥ b ⟺ a ≤ − b ( displaystyle a geq b iff a leq - b ) or a ≥ b ( displaystyle a geq b ) These relations may be used to solve inequalities involving absolute values. For example : x − 3 ≤ 9 ( displaystyle x-3 leq 9 ) ⟺ − 9 ≤ x − 3 ≤ 9 ( displaystyle iff - 9 leq x-3 leq 9 ) ⟺ − 6 ≤ x ≤ 12 ( displaystyle iff - 6 leq x leq 12 ) Absolute value is used to define the absolute difference, the standard metric on the real numbers. Complex numbers The absolute value of a complex number z is the distance r from z to the origin. It is also seen in the picture that z and its complex conjugate z have the same absolute value. Since the complex numbers are not ordered, the definition given above for the real absolute value can not be directly generalised for a complex number. However the geometric interpretation of the absolute value of a real number as its distance from 0 can be generalised. The absolute value of a complex number is defined as its distance in the complex plane from the origin. This can be computed using the Pythagorean theorem : For any complex number z = x + i y, ( displaystyle z = x + iy, ) where x and y are real numbers, the absolute value or modulus of z is denoted z and is given by z = ( R e ( z ) ) 2 + ( I m ( z ) ) 2 = x 2 + y 2, ( displaystyle z = ( sqrt ( ( mathrm ( Re ) ( z ) ) ^ ( 2 ) + ( mathrm ( Im ) ( z ) ) ^ ( 2 ) ) ) = ( sqrt ( x ^ ( 2 ) + y ^ ( 2 ) ) ), ) where Re ( z ) = x and Im ( z ) = y denote the real and imaginary parts of z, respectively. When the imaginary part y is zero, this coincides with the definition of the absolute value of the real number x. When a complex number z is expressed in polar form as z = r e i θ ( displaystyle z = re ^ ( i \theta ) ) with r ≥ 0 ( so θ = arctan ( y / x ) is the argument ( or phase ) of z ), its absolute value is z = r ( displaystyle z = r ). Observing that the product of any complex number z and its complex conjugate z  ̄ ( displaystyle ( \bar ( z ) ) ), with z  ̄ = x − i y, ( displaystyle ( \bar ( z ) ) = x-iy, ) is always a non-negative real number, the absolute value of a complex number can be written similar to equation ( 1 ) above as z = z ⋅ z  ̄ ( displaystyle z = ( sqrt ( z cdot ( overline ( z ) ) ) ) ) Equation ( 1 ) in its original form is not, in general, true for complex z : z ≠ z 2 ( displaystyle z \neq ( sqrt ( z ^ ( 2 ) ) ) ). The complex absolute value shares all the properties of the real absolute value given in equations ( 2 ) -- ( 11 ) above. In the context of abstract algebra, since the positive real numbers form a subgroup of the complex numbers under multiplication, equation ( 4 ) implies that we may think of absolute value as an endomorphism of the multiplicative group of the complex numbers. Importantly, the property of subadditivity ( `` triangle inequality '', equation ( 5 ) ) extends to any finite collection of n complex numbers ( z k ) k = 1 n ( \textstyle ( z_ ( k ) ) _ ( k = 1 ) ^ ( n ) ) : ∑ k = 1 n z k ≤ ∑ k = 1 n z k. ( ∗ ) ( displaystyle ( Bigg ) sum _ ( k = 1 ) ^ ( n ) z_ ( k ) ( Bigg ) leq sum _ ( k = 1 ) ^ ( n ) z_ ( k ). quad quad ( * ) ) This inequality also applies to infinite families, provided that the infinite series ∑ k = 1 ∞ z k ( \textstyle sum _ ( k = 1 ) ^ ( infty ) z_ ( k ) ) is absolutely convergent. If ( Lebesgue ) integration is viewed as the continuous analog of summation, then this inequality is analogously obeyed by complex - valued, measurable functions f : R → C ( displaystyle f : mathbb ( R ) \to mathbb ( C ) ) when integrated over a measurable subset E ( displaystyle E ) : ∫ E f d x ≤ ∫ E f d x. ( ∗ ∗ ) ( displaystyle ( Bigg ) int _ ( E ) f dx ( Bigg ) leq int _ ( E ) f dx. quad quad ( * * ) ) ( This includes Riemann - integrable functions over a bounded interval ( a, b ) ( displaystyle ( a, b ) ) as a special case. ) Proof of the triangle inequality for complex numbers The triangle inequality, as given by ( ∗ ) ( displaystyle ( * ) ), can be demonstrated by applying a few easily verified properties of the complex numbers : Namely, for every complex number z ∈ C ( displaystyle z in mathbb ( C ) ), ( i ) : there exists ω ∈ C ( displaystyle omega in mathbb ( C ) ) such that ω = 1 ( displaystyle omega = 1 ), z = ω z ( displaystyle z = omega z ), and ( ii ) : R e ( z ) ≤ z ( displaystyle mathrm ( Re ) ( z ) leq z ) ; and also, if ( w k ) k = 1 l ( displaystyle ( w_ ( k ) ) _ ( k = 1 ) ^ ( ell ) ) are complex numbers but ∑ k = 1 l w k ( \textstyle sum _ ( k = 1 ) ^ ( ell ) w_ ( k ) ) is real, then ∑ k = 1 l w k = ∑ k = 1 l R e ( w k ) ( \textstyle sum _ ( k = 1 ) ^ ( ell ) w_ ( k ) = sum _ ( k = 1 ) ^ ( ell ) mathrm ( Re ) ( w_ ( k ) ) ). Proof of ( ∗ ) ( displaystyle ( * ) ) : Choose c ( displaystyle c ) such that c = 1 ( displaystyle c = 1 ), ∑ k z k = c ( ∑ k z k ) ( \textstyle sum _ ( k ) z_ ( k ) = c ( sum _ ( k ) z_ ( k ) ) ) ( summed over k = 1, 2,..., n ). The following computation then affords the desired inequality : ∑ k z k = c ( ∑ k z k ) = ∑ k c z k = ∑ k R e ( c z k ) ≤ ∑ k c z k = ∑ k z k ( 1 ≤ k ≤ n ). ◼ ( displaystyle ( Big ) sum _ ( k ) z_ ( k ) ( Big ) = c ( Big ( ) sum _ ( k ) z_ ( k ) ( Big ) ) = sum _ ( k ) cz_ ( k ) = sum _ ( k ) mathrm ( Re ) ( cz_ ( k ) ) leq sum _ ( k ) cz_ ( k ) = sum _ ( k ) z_ ( k ) quad quad ( 1 leq k leq n ). \blacksquare ) It is clear from this proof that equality holds in ( ∗ ) ( displaystyle ( * ) ) if and only if the c z k ( displaystyle cz_ ( k ) ) are non-negative real numbers for k = 1, 2,..., n ( displaystyle k = 1, 2, ldots, n ), which in turn occurs if and only if all nonzero z k ( displaystyle z_ ( k ) ) have the same argument, i.e., z k = a k ζ ( displaystyle z_ ( k ) = a_ ( k ) zeta ) for a complex constant ζ ( displaystyle zeta ) and real constants a 1, a 2,..., a n ≥ 0 ( displaystyle a_ ( 1 ), a_ ( 2 ), ldots, a_ ( n ) geq 0 ). After arguing that f ( displaystyle f ) is also measurable, the proof of the inequality ( ∗ ∗ ) ( displaystyle ( * * ) ) proceeds via the same technique, by replacing ∑ k ( \textstyle sum _ ( k ) ) with ∫ E ( ⋅ ) d x ( \textstyle int _ ( E ) ( cdot ) dx ) and z k ( displaystyle z_ ( k ) ) with f ( x ) ( displaystyle f ( x ) ). Absolute value function The graph of the absolute value function for real numbers Composition of absolute value with a cubic function in different orders The real absolute value function is continuous everywhere. It is differentiable everywhere except for x = 0. It is monotonically decreasing on the interval ( − ∞, 0 ) and monotonically increasing on the interval ( 0, + ∞ ). Since a real number and its opposite have the same absolute value, it is an even function, and is hence not invertible. The real absolute value function is a piecewise linear, convex function. Both the real and complex functions are idempotent. Relationship to the sign function The absolute value function of a real number returns its value irrespective of its sign, whereas the sign ( or signum ) function returns a number 's sign irrespective of its value. The following equations show the relationship between these two functions : x = x sgn ⁡ ( x ), ( displaystyle x = x operatorname ( sgn ) ( x ), ) or x sgn ⁡ ( x ) = x, ( displaystyle x operatorname ( sgn ) ( x ) = x, ) and for x ≠ 0, sgn ⁡ ( x ) = x x = x x. ( displaystyle operatorname ( sgn ) ( x ) = ( \frac ( x ) ( x ) ) = ( \frac ( x ) ( x ) ). ) Derivative The real absolute value function has a derivative for every x ≠ 0, but is not differentiable at x = 0. Its derivative for x ≠ 0 is given by the step function : d x d x = x x = ( − 1 x < 0 1 x > 0. ( displaystyle ( \frac ( d x ) ( dx ) ) = ( \frac ( x ) ( x ) ) = ( \begin ( cases ) - 1&x < 0 1&x > 0. end ( cases ) ) ) The subdifferential of x at x = 0 is the interval ( − 1, 1 ). The complex absolute value function is continuous everywhere but complex differentiable nowhere because it violates the Cauchy -- Riemann equations. The second derivative of x with respect to x is zero everywhere except zero, where it does not exist. As a generalised function, the second derivative may be taken as two times the Dirac delta function. Antiderivative The antiderivative ( indefinite integral ) of the absolute value function is ∫ x d x = x x 2 + C, ( displaystyle int x dx = ( \frac ( x x ) ( 2 ) ) + C, ) where C is an arbitrary constant of integration. Distance See also : Metric space The absolute value is closely related to the idea of distance. As noted above, the absolute value of a real or complex number is the distance from that number to the origin, along the real number line, for real numbers, or in the complex plane, for complex numbers, and more generally, the absolute value of the difference of two real or complex numbers is the distance between them. The standard Euclidean distance between two points a = ( a 1, a 2,..., a n ) ( displaystyle a = ( a_ ( 1 ), a_ ( 2 ), dots, a_ ( n ) ) ) and b = ( b 1, b 2,..., b n ) ( displaystyle b = ( b_ ( 1 ), b_ ( 2 ), dots, b_ ( n ) ) ) in Euclidean n - space is defined as : ∑ i = 1 n ( a i − b i ) 2. ( displaystyle ( sqrt ( sum _ ( i = 1 ) ^ ( n ) ( a_ ( i ) - b_ ( i ) ) ^ ( 2 ) ) ). ) This can be seen to be a generalisation of a − b, since if a and b are real, then by equation ( 1 ), a − b = ( a − b ) 2. ( displaystyle a-b = ( sqrt ( ( a-b ) ^ ( 2 ) ) ). ) While if a = a 1 + i a 2 ( displaystyle a = a_ ( 1 ) + ia_ ( 2 ) ) and b = b 1 + i b 2 ( displaystyle b = b_ ( 1 ) + ib_ ( 2 ) ) are complex numbers, then a − b ( displaystyle a-b ) = ( a 1 + i a 2 ) − ( b 1 + i b 2 ) ( displaystyle = ( a_ ( 1 ) + ia_ ( 2 ) ) - ( b_ ( 1 ) + ib_ ( 2 ) ) ) = ( a 1 − b 1 ) + i ( a 2 − b 2 ) ( displaystyle = ( a_ ( 1 ) - b_ ( 1 ) ) + i ( a_ ( 2 ) - b_ ( 2 ) ) ) = ( a 1 − b 1 ) 2 + ( a 2 − b 2 ) 2. ( displaystyle = ( sqrt ( ( a_ ( 1 ) - b_ ( 1 ) ) ^ ( 2 ) + ( a_ ( 2 ) - b_ ( 2 ) ) ^ ( 2 ) ) ). ) The above shows that the `` absolute value '' distance for the real numbers or the complex numbers, agrees with the standard Euclidean distance they inherit as a result of considering them as the one and two - dimensional Euclidean spaces respectively. The properties of the absolute value of the difference of two real or complex numbers : non-negativity, identity of indiscernibles, symmetry and the triangle inequality given above, can be seen to motivate the more general notion of a distance function as follows : A real valued function d on a set X × X is called a metric ( or a distance function ) on X, if it satisfies the following four axioms : d ( a, b ) ≥ 0 ( displaystyle d ( a, b ) geq 0 ) Non-negativity d ( a, b ) = 0 ⟺ a = b ( displaystyle d ( a, b ) = 0 iff a = b ) Identity of indiscernibles d ( a, b ) = d ( b, a ) ( displaystyle d ( a, b ) = d ( b, a ) ) Symmetry d ( a, b ) ≤ d ( a, c ) + d ( c, b ) ( displaystyle d ( a, b ) leq d ( a, c ) + d ( c, b ) ) Triangle inequality Generalizations Ordered rings The definition of absolute value given for real numbers above can be extended to any ordered ring. That is, if a is an element of an ordered ring R, then the absolute value of a, denoted by a, is defined to be : a = ( a, if a ≥ 0 − a, if a < 0. ( displaystyle a = left ( ( \begin ( array ) ( rl ) a, & ( \text ( if ) ) a geq 0 - a, & ( \text ( if ) ) a < 0. end ( array ) ) \right. ) where − a is the additive inverse of a, 0 is the additive identity element, and < and ≥ have the usual meaning with respect to the ordering in the ring. Fields Main article : Absolute value ( algebra ) The fundamental properties of the absolute value for real numbers given in ( 2 ) -- ( 5 ) above, can be used to generalise the notion of absolute value to an arbitrary field, as follows. A real - valued function v on a field F is called an absolute value ( also a modulus, magnitude, value, or valuation ) if it satisfies the following four axioms : v ( a ) ≥ 0 ( displaystyle v ( a ) geq 0 ) Non-negativity v ( a ) = 0 ⟺ a = 0 ( displaystyle v ( a ) = 0 iff a = mathbf ( 0 ) ) Positive - definiteness v ( a b ) = v ( a ) v ( b ) ( displaystyle v ( ab ) = v ( a ) v ( b ) ) Multiplicativity v ( a + b ) ≤ v ( a ) + v ( b ) ( displaystyle v ( a + b ) leq v ( a ) + v ( b ) ) Subadditivity or the triangle inequality Where 0 denotes the additive identity element of F. It follows from positive - definiteness and multiplicativity that v ( 1 ) = 1, where 1 denotes the multiplicative identity element of F. The real and complex absolute values defined above are examples of absolute values for an arbitrary field. If v is an absolute value on F, then the function d on F × F, defined by d ( a, b ) = v ( a − b ), is a metric and the following are equivalent : d satisfies the ultrametric inequality d ( x, y ) ≤ max ( d ( x, z ), d ( y, z ) ) ( displaystyle d ( x, y ) leq max ( d ( x, z ), d ( y, z ) ) ) for all x, y, z in F. ( v ( ∑ k = 1 n 1 ) : n ∈ N ) ( displaystyle ( \big ( ) v ( Big ( ) ( \textstyle sum _ ( k = 1 ) ^ ( n ) ) mathbf ( 1 ) ( Big ) ) : n in mathbb ( N ) ( \big ) ) ) is bounded in R. v ( ∑ k = 1 n 1 ) ≤ 1 ( displaystyle v ( Big ( ) ( \textstyle sum _ ( k = 1 ) ^ ( n ) ) mathbf ( 1 ) ( Big ) ) leq 1 ) for every n ∈ N. ( displaystyle n in mathbb ( N ). ) v ( a ) ≤ 1 ⇒ v ( 1 + a ) ≤ 1 ( displaystyle v ( a ) leq 1 Rightarrow v ( 1 + a ) leq 1 ) for all a ∈ F. ( displaystyle a in F. ) v ( a + b ) ≤ m a x ( v ( a ), v ( b ) ) ( displaystyle v ( a + b ) leq mathrm ( max ) ( v ( a ), v ( b ) ) ) for all a, b ∈ F. ( displaystyle a, b in F. ) An absolute value which satisfies any ( hence all ) of the above conditions is said to be non-Archimedean, otherwise it is said to be Archimedean. Vector spaces Main article : Norm ( mathematics ) Again the fundamental properties of the absolute value for real numbers can be used, with a slight modification, to generalise the notion to an arbitrary vector space. A real - valued function on a vector space V over a field F, represented as ‖ ‖, is called an absolute value, but more usually a norm, if it satisfies the following axioms : For all a in F, and v, u in V, ∥ v ∥ ≥ 0 ( displaystyle mathbf ( v ) geq 0 ) Non-negativity ∥ v ∥ = 0 ⟺ v = 0 ( displaystyle mathbf ( v ) = 0 iff mathbf ( v ) = 0 ) Positive - definiteness ∥ a v ∥ = a ∥ v ∥ ( displaystyle a mathbf ( v ) = a mathbf ( v ) ) Positive homogeneity or positive scalability ∥ v + u ∥ ≤ ∥ v ∥ + ∥ u ∥ ( displaystyle mathbf ( v ) + mathbf ( u ) leq mathbf ( v ) + mathbf ( u ) ) Subadditivity or the triangle inequality The norm of a vector is also called its length or magnitude. In the case of Euclidean space R, the function defined by ∥ ( x 1, x 2,..., x n ) ∥ = ∑ i = 1 n x i 2 ( displaystyle ( x_ ( 1 ), x_ ( 2 ), dots, x_ ( n ) ) = ( sqrt ( sum _ ( i = 1 ) ^ ( n ) x_ ( i ) ^ ( 2 ) ) ) ) is a norm called the Euclidean norm. When the real numbers R are considered as the one - dimensional vector space R, the absolute value is a norm, and is the p - norm ( see L space ) for any p. In fact the absolute value is the `` only '' norm on R, in the sense that, for every norm ‖ ‖ on R, ‖ x ‖ = ‖ 1 ‖ ⋅ x. The complex absolute value is a special case of the norm in an inner product space. It is identical to the Euclidean norm, if the complex plane is identified with the Euclidean plane R. Composition algebras Main article : Composition algebra Every composition algebra A has an involution x → x * called its conjugation. The product in A of an element x and its conjugate x * is written N ( x ) = xx * and called the norm of x. The real numbers R, complex numbers C, and quaternions H are all composition algebras with norms given by definite quadratic forms. The absolute value in these division algebras is given by the square root of the composition algebra norm. In general the norm of a composition algebra may be a quadratic form that is not definite and has null vectors. However, as in the case of division algebras, when an element x has a non-zero norm, then x has a multiplicative inverse given by x * / N ( x ). Notes ^ Jump up to : Oxford English Dictionary, Draft Revision, June 2008 Jump up ^ Nahin, O'Connor and Robertson, and functions.Wolfram.com. ; for the French sense, see Littré, 1877 Jump up ^ Lazare Nicolas M. Carnot, Mémoire sur la relation qui existe entre les distances respectives de cinq point quelconques pris dans l'espace, p. 105 at Google Books Jump up ^ James Mill Peirce, A Text - book of Analytic Geometry at Google Books. The oldest citation in the 2nd edition of the Oxford English Dictionary is from 1907. The term absolute value is also used in contrast to relative value. Jump up ^ Nicholas J. Higham, Handbook of writing for the mathematical sciences, SIAM. ISBN 0 - 89871 - 420 - 6, p. 25 Jump up ^ Spivak, Michael ( 1965 ). Calculus on Manifolds. Boulder, CO : Westview. p. 1. ISBN 0805390219. Jump up ^ Munkres, James ( 1991 ). Analysis on Manifolds. Boulder, CO : Westview. p. 4. ISBN 0201510359. Jump up ^ Mendelson, p. 2. Jump up ^ Stewart, James B. ( 2001 ). Calculus : concepts and contexts. Australia : Brooks / Cole. ISBN 0 - 534 - 37718 - 1., p. A5 Jump up ^ González, Mario O. ( 1992 ). Classical Complex Analysis. CRC Press. p. 19. ISBN 9780824784157. Jump up ^ Lorenz, Falko ( 2008 ), Algebra. Vol. II. Fields with structure, algebras and advanced topics, Universitext, New York : Springer, p. 39, doi : 10.1007 / 978 - 0 - 387 - 72488 - 1, ISBN 978 - 0 - 387 - 72487 - 4, MR 2371763. Jump up ^ Rudin, Walter ( 1976 ). Principles of Mathematical Analysis ( PDF ). New York : McGraw - Hill. p. 325. ISBN 0 - 07 - 054235 - X. ^ Jump up to : Weisstein, Eric W. Absolute Value. From MathWorld -- A Wolfram Web Resource. Jump up ^ Bartel and Sherbert, p. 163 Jump up ^ Peter Wriggers, Panagiotis Panatiotopoulos, eds., New Developments in Contact Problems, 1999, ISBN 3 - 211 - 83154 - 1, p. 31 -- 32 Jump up ^ These axioms are not minimal ; for instance, non-negativity can be derived from the other three : 0 = d ( a, a ) ≤ d ( a, b ) + d ( b, a ) = 2d ( a, b ). Jump up ^ Mac Lane, p. 264. Jump up ^ Shechter, p. 260. This meaning of valuation is rare. Usually, a valuation is the logarithm of the inverse of an absolute value Jump up ^ Shechter, pp. 260 -- 261. References Bartle ; Sherbert ; Introduction to real analysis ( 4th ed. ), John Wiley & Sons, 2011 ISBN 978 - 0 - 471 - 43331 - 6. Nahin, Paul J. ; An Imaginary Tale ; Princeton University Press ; ( hardcover, 1998 ). ISBN 0 - 691 - 02795 - 1. Mac Lane, Saunders, Garrett Birkhoff, Algebra, American Mathematical Soc., 1999. ISBN 978 - 0 - 8218 - 1646 - 2. Mendelson, Elliott, Schaum 's Outline of Beginning Calculus, McGraw - Hill Professional, 2008. ISBN 978 - 0 - 07 - 148754 - 2. O'Connor, J.J. and Robertson, E.F. ; `` Jean Robert Argand ''. Schechter, Eric ; Handbook of Analysis and Its Foundations, pp. 259 -- 263, `` Absolute Values '', Academic Press ( 1997 ) ISBN 0 - 12 - 622760 - 8. External links Hazewinkel, Michiel, ed. ( 2001 ) ( 1994 ), `` Absolute value '', Encyclopedia of Mathematics, Springer Science + Business Media B.V. / Kluwer Academic Publishers, ISBN 978 - 1 - 55608 - 010 - 4 absolute value at PlanetMath.org. Weisstein, Eric W. `` Absolute Value ''. MathWorld. Retrieved from `` https://en.wikipedia.org/w/index.php?title=Absolute_value&oldid=815077428 '' Categories : Special functions Real numbers Norms ( mathematics ) Hidden categories : Use dmy dates from June 2013 Talk Contents About Wikipedia Wikibooks Afrikaans አማርኛ Azərbaycanca বাংলা Беларуская Беларуская ( тарашкевіца ) ‎ Български Bosanski Català Čeština Dansk Deutsch Eesti Ελληνικά Español Esperanto Euskara فارسی Français Furlan Galego 한국어 Հայերեն हिन्दी Hrvatski Bahasa Indonesia Íslenska Italiano עברית Қазақша Кыргызча Latina Latviešu Lietuvių Magyar Bahasa Melayu Nederlands 日本 語 Norsk Norsk nynorsk ភាសា ខ្មែរ Piemontèis Polski Português Română Русский Scots Shqip Simple English Slovenčina Slovenščina Soomaaliga کوردی Српски / srpski Srpskohrvatski / српскохрватски Suomi Svenska Tagalog தமிழ் ไทย Türkçe Türkmençe Українська Tiếng Việt 文言 粵語 中文 Edit links This page was last edited on 12 December 2017, at 16 : 53. Text is available under the Creative Commons Attribution - ShareAlike License ; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia ® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. About Wikipedia

Question: the absolute value of a real number x is
Answer: the non-negative value of x without regard to its sign