Fact-checked by Grok 2 weeks ago

Absolute value

In mathematics, the absolute value of a real number x, denoted |x|, is defined as the non-negative distance between x and 0 on the real number line, which disregards the sign of x.^[1] It is formally given by the piecewise function: |x| = x if x \geq 0, and |x| = -x if x < 0.^[1] This concept, also known as the modulus in some contexts, ensures that |x| is always greater than or equal to zero, with equality holding only when x = 0.^[1] Key properties of the absolute value include non-negativity (|x| \geq 0), positive-definiteness (|x| = 0 if and only if x = 0), multiplicativity (|xy| = |x| \cdot |y| for all real numbers x and y), symmetry (|-x| = |x|), and the triangle inequality (|x + y| \leq |x| + |y|).^[1] These properties make the absolute value a fundamental norm in real analysis, enabling its use in defining distances and metrics on the real line.^[1] The absolute value function plays a central role in various mathematical domains, such as solving equations and inequalities (e.g., |x - a| < b describes an interval centered at a with radius b), graphing V-shaped functions like f(x) = |x|, and extending to vectors and complex numbers as the Euclidean norm or modulus.^[1] In applied contexts, it measures magnitudes in physics and engineering, such as displacement or error bounds.^[2]^[3]

Basic Concepts

Notation and Terminology

The primary notation for the absolute value of a real number x is |x|, consisting of vertical bars enclosing the expression, which was introduced by the German mathematician Karl Weierstrass in his 1841 essay "Zur Theorie der Potenzreihen."^[4] Prior to this adoption for absolute value, vertical bars had been employed in mathematical notation for other purposes, such as denoting determinants, dating back to usages by mathematicians like Arthur Cayley around the same period.^[5] Alternative notations for absolute value include the function \operatorname{abs}(x), commonly used in computer science, programming languages, and some analytical contexts to explicitly denote the operation.^[6] Single vertical bars |x| are standard for the absolute value, while double vertical bars \|x\| denote norms in vector spaces or matrices to distinguish from the scalar case.^[7] The term "absolute value" is standard for the concept when applied to real numbers, emphasizing the non-negative magnitude irrespective of sign. For complex numbers, the equivalent notion is typically called the "modulus," reflecting its role in measuring distance in the complex plane, while "magnitude" is reserved for the length or norm of vectors in higher-dimensional spaces to avoid confusion with scalar contexts.^[8] This terminological distinction helps clarify applications across different mathematical domains, with "absolute value" primarily tied to one-dimensional real analysis.^[9] The etymology of "absolute value" traces to the Latin word absolutus, the past participle of absolvere, meaning "to loosen from" or "to set free," which in this mathematical sense evokes the idea of freeing a number from its sign to yield its positive essence.^[10]

Definition for Real Numbers

The absolute value of a real number x, denoted |x|, is defined piecewise as

|x| = \begin{cases} x & \text{if } x \geq 0, \\ -x & \text{if } x < 0. \end{cases}

^[11] This construction ensures that |x| is always a non-negative real number, satisfying |x| \geq 0 for all real x, with |0| = 0. Equivalent formulations include |x| = \sqrt{x^2}, where the principal square root yields the non-negative value, and |x| = \max(x, -x), which selects the greater of x and its negation.^[12]^[13] The absolute value is the unique non-negative real number such that |x| \cdot \sgn(x) = x, where the sign function \sgn(x) is defined as \sgn(x) = 1 if x > 0, \sgn(x) = -1 if x < 0, and \sgn(0) = 0.^[14]^[15] The notation |x| is the standard mathematical symbol for the absolute value of x.

Properties and Interpretations

Algebraic Properties

The absolute value function on the real numbers satisfies several key algebraic identities and inequalities, establishing it as a multiplicative norm on \mathbb{R}. A fundamental identity is multiplicativity: for all real numbers x and y,

|xy| = |x| \cdot |y|.

This can be verified using the equivalent definition |x| = \sqrt{x^2}, yielding \sqrt{(xy)^2} = \sqrt{x^2 y^2} = \sqrt{x^2} \sqrt{y^2}. Alternatively, a proof by cases on the signs of x and y proceeds as follows: if x \geq 0 and y \geq 0, then xy \geq 0 and |xy| = xy = |x| |y|; if x \geq 0 and y < 0, then xy \leq 0 and |xy| = -xy = x (-y) = |x| |y|; the cases x < 0 and y \geq 0, or both negative, follow symmetrically; if either is zero, both sides vanish.^[16] Another basic identity is that the absolute value is even: for all real x,

|-x| = |x|.

This holds by definition, as -x and x are equidistant from zero, or via multiplicativity: |-x| = |(-1) x| = |-1| \cdot |x| = 1 \cdot |x| = |x|.^[17] Multiplicativity implies a quotient identity: for all real x and y \neq 0,

\left| \frac{x}{y} \right| = \frac{|x|}{|y|}.

To see this, note that \frac{x}{y} = x \cdot \frac{1}{y}, so \left| \frac{x}{y} \right| = |x| \cdot \left| \frac{1}{y} \right|; then \left| \frac{1}{y} \right| = \frac{|1|}{|y|} = \frac{1}{|y|}.^[17] The triangle inequality provides a core bound: for all real x, y,

|x + y| \leq |x| + |y|,

with equality if and only if xy \geq 0 (i.e., x and y are both nonnegative, both nonpositive, or at least one is zero). Using the squared form, |x + y|^2 = x^2 + y^2 + 2xy \leq x^2 + y^2 + 2|xy| = (|x| + |y|)^2 since xy \leq |xy|, and taking nonnegative square roots preserves the inequality; equality requires xy = |xy|.^[18] The reverse triangle inequality complements this: for all real x, y,

||x| - |y|| \leq |x - y|.

Applying the triangle inequality gives |x| = |(x - y) + y| \leq |x - y| + |y|, so |x| - |y| \leq |x - y|; symmetrically, |y| - |x| \leq |y - x| = |x - y|, yielding the result upon taking absolute values.^[19]

Geometric Interpretation as Distance

In geometry, the absolute value of a real number x, denoted |x|, represents the distance from x to 0 on the real number line, which is always non-negative.^[20] This interpretation emphasizes that distance measures separation without regard to direction, so |5| = 5 (five units to the right of 0) and |-3| = 3 (three units to the left of 0).^[21] More generally, the distance between any two points x and y on the real line is given by |x - y|, which quantifies the shortest path length along the line connecting them.^[22] For example, the distance from -2 to $3 is |3 - (-2)| = |5| = 5 units. This formulation aligns with the intuitive notion of linear separation, where the absolute value ensures the result is positive regardless of the order of x and y. The absolute value also visualizes symmetric intervals around 0; specifically, the set of points within distance r (where r \geq 0) from 0 forms the closed interval [-r, r], with r acting as the radius.^[20] On the number line, this interval spans from -r to r, encapsulating all positions no farther than r units from the origin. In one dimension, the absolute value metric coincides with the Euclidean distance: d(x, y) = |x - y| = \sqrt{(x - y)^2}.^[23] This equivalence highlights how the real line embeds the standard geometry of \mathbb{R}^1. The absolute value satisfies the triangle inequality |x - z| \leq |x - y| + |y - z|, confirming it meets the axioms of a metric on the real line.^[24]

Extension to Complex Numbers

Definition for Complex Numbers

In the context of complex numbers, the absolute value is also known as the modulus. For a complex number z = x + iy, where x and y are real numbers and i is the imaginary unit satisfying i^2 = -1, the complex conjugate is defined as \bar{z} = x - iy.^[8] The modulus is then given by

|z| = \sqrt{z \bar{z}} = \sqrt{x^2 + y^2}.

This definition extends the real absolute value, applied to the components x and y, into a two-dimensional Euclidean norm.^[25]^[8] Equivalently, in polar form, any nonzero complex number z can be expressed as z = r e^{i\theta}, where r > 0 is the modulus |z| = r and \theta is the argument of z.^[26] The modulus of a complex number is always a non-negative real number, with |z| \geq 0 for all z \in \mathbb{C}, and |z| = 0 if and only if z = 0.^[8] For example, if z = 1 + i, then |z| = \sqrt{1^2 + 1^2} = \sqrt{2}. Similarly, for z = i, |z| = \sqrt{0^2 + 1^2} = 1.^[25]

Properties in the Complex Plane

In the complex plane, also known as the Argand plane, the absolute value of a complex number z = x + iy, denoted |z|, represents the Euclidean distance from the origin to the point (x, y), given by |z| = \sqrt{x^2 + y^2}. Similarly, the distance between two points z and w in the plane is |z - w|, which aligns with the modulus definition and enables geometric interpretations of complex operations. This distance metric underscores the complex numbers as a two-dimensional vector space over the reals, where the modulus serves as the norm. A fundamental algebraic property is the multiplicativity of the modulus: for any complex numbers z and w, |zw| = |z| \cdot |w|. This follows from the definition, as |zw|^2 = (zw)(\overline{zw}) = (zw)(\bar{z}\bar{w}) = (z\bar{z})(w\bar{w}) = |z|^2 |w|^2, so |zw| = |z| |w| since moduli are non-negative. The multiplicativity implies that the modulus of the reciprocal is |1/z| = 1/|z| for z \neq 0, derived by setting w = 1/z and noting |z \cdot (1/z)| = |1| = 1. Additionally, the modulus is invariant under conjugation: |\bar{z}| = |z|, because \bar{z} = x - iy yields |\bar{z}|^2 = x^2 + (-y)^2 = x^2 + y^2 = |z|^2. The triangle inequality states that |z + w| \leq |z| + |w| for all complex z, w, with equality if and only if z and w are non-negative real multiples of each other. Geometrically, this reflects that the length of a side in a triangle formed by points $0, z, z+w in the plane does not exceed the sum of the other two sides. The inequality arises from the Cauchy-Schwarz inequality in the inner product space of complex numbers, where |z + w|^2 = (z + w)(\bar{z} + \bar{w}) = |z|^2 + |w|^2 + 2 \operatorname{Re}(z \bar{w}) \leq |z|^2 + |w|^2 + 2 |z \bar{w}| = (|z| + |w|)^2, since |\bar{w}| = |w| and \operatorname{Re}(z \bar{w}) \leq |z \bar{w}| = |z| |w|.

The Absolute Value as a Function

Relation to Sign, Max, and Min Functions

The absolute value function for real numbers is closely related to the sign function, denoted sgn(x), which extracts the sign of x. The sign function is defined such that sgn(x) = 1 if x > 0, sgn(x) = -1 if x < 0, and sgn(0) = 0.^[27] For x ≠ 0, this leads to the relation sgn(x) = x / |x|, and consequently, any real number x can be decomposed as x = sgn(x) \cdot |x|.^[28] This decomposition separates the magnitude |x| from the sign sgn(x), providing a useful way to analyze the directional aspect of real numbers independently from their size. The absolute value can also be expressed using the maximum and minimum functions. Specifically, |x| = \max(x, -x), since the larger of x and its negation -x is always non-negative and equals the distance from x to 0.^[29] Equivalently, |x| = -\min(x, -x), as the minimum of x and -x is the negative of the absolute value, and negating it recovers |x|. These expressions highlight the absolute value as the greater deviation from zero in the positive direction. For example, consider x = -3. Here, sgn(-3) = -1 and |-3| = 3, so -3 = (-1) \cdot 3, illustrating the sign-magnitude decomposition. Similarly, \max(-3, 3) = 3 and -\min(-3, 3) = -(-3) = 3, both yielding the absolute value.^[28]^[29]

Differentiability and Integration

The absolute value function f(x) = |x| is differentiable at all points x \neq 0, where its derivative is given by the sign function f'(x) = \sgn(x).^[30] Specifically, for x > 0, f(x) = x and f'(x) = 1; for x < 0, f(x) = -x and f'(x) = -1. At x = 0, the function is not differentiable because the left-hand derivative is -1 and the right-hand derivative is +1, so the limit defining the derivative does not exist.^[30] In the context of convex analysis, the absolute value function is convex, and although not differentiable at x = 0, it admits a subdifferential there. The subdifferential \partial f(0) is the convex set [-1, 1], consisting of all subgradients g such that f(y) \geq f(0) + g(y - 0) for all y \in \mathbb{R}.^[31] For x > 0, the subdifferential is the singleton \{1\}; for x < 0, it is \{-1\}.^[31] The indefinite integral of |x| is found by considering the piecewise definition of the absolute value. For x \geq 0, \int |x| \, dx = \int x \, dx = \frac{1}{2} x^2 + C_1; for x < 0, \int |x| \, dx = \int -x \, dx = -\frac{1}{2} x^2 + C_2. To obtain a single continuous antiderivative across \mathbb{R}, the expression \int |x| \, dx = \frac{1}{2} x |x| + C satisfies the requirement, as its derivative recovers |x| everywhere, including at x = 0.^[32] For compositions of the form |g(x)|, where g is differentiable, the derivative is \frac{d}{dx} |g(x)| = \sgn(g(x)) g'(x) at points where g(x) \neq 0. This follows from the chain rule applied piecewise: when g(x) > 0, |g(x)| = g(x) and the derivative is g'(x); when g(x) < 0, |g(x)| = -g(x) and the derivative is -g'(x). At points where g(x) = 0, differentiability depends on whether the left and right derivatives match, which may fail if g'(x) \neq 0.^[30] As an example, consider h(x) = |x^2 - 1|. The critical points are x = \pm 1, where g(x) = x^2 - 1 = 0. For |x| > 1, g(x) > 0, so h(x) = x^2 - 1 and h'(x) = 2x. For |x| < 1, g(x) < 0, so h(x) = 1 - x^2 and h'(x) = -2x. At x = 1, the left derivative is -2(1) = -2 and the right is $2(1) = 2, so h is not differentiable there. Similarly, at x = -1, the left derivative is $2(-1) = -2 and the right is -2(-1) = 2, confirming nondifferentiability.^[30]

Generalizations

In Ordered Rings and Fields

In an ordered ring R, equipped with a total order compatible with the ring operations, the absolute value function is defined piecewise as |x| = x if x \geq 0 and |x| = -x if x < 0.^[33] This definition ensures that |x| \geq 0 for all x \in R.^[33] Moreover, multiplicativity holds: |xy| = |x||y| for all x, y \in R, provided the ring is an integral domain to avoid issues with zero divisors.^[33] The absolute value in ordered rings exhibits an Archimedean property when the structure mirrors that of the real numbers, where the absolute value is unbounded on the integers: for every M > 0, there exists a positive integer n such that |n| > M. This is equivalent to the absence of nonzero infinitesimal elements, meaning there is no nonzero x such that $0 < |x| < 1/n for all positive integers n.^[34] In contrast, non-Archimedean ordered rings admit infinitesimal elements, where the absolute value remains bounded on the integers (|n| \leq 1 for all integers n), allowing for orders where the natural numbers do not dominate all nonzero elements.^[34] The real absolute value serves as the prototypical Archimedean example in this context.^[34] In the more general setting of fields K, an absolute value is a function |\cdot| : K \to [0, \infty) satisfying: |x| = 0 if and only if x = 0; |xy| = |x||y| for all x, y \in K; and the triangle inequality |x + y| \leq |x| + |y| for all x, y \in K.^[35] Such absolute values induce a metric topology on K, enabling the study of completeness and extensions.^[35] Two absolute values on the same field are equivalent if one is a positive power of the other, preserving the underlying topology.^[35] Non-Archimedean absolute values on fields are characterized by the stronger ultrametric inequality: |x + y| \leq \max(|x|, |y|) for all x, y \in K.^[36] This holds if and only if |n| \leq 1 for every integer n, distinguishing them from Archimedean cases where integer multiples can exceed any bound.^[36] A canonical example is the p-adic absolute value on the rational numbers \mathbb{Q}, for a prime p. The p-adic valuation v_p(x) for nonzero x \in \mathbb{Q} is the exponent of p in the prime factorization of x, extended multiplicatively and with v_p(0) = \infty.^[37] The absolute value is then |x|_p = p^{-v_p(x)}, satisfying the ultrametric inequality and yielding |x|_p = 0 only for x = 0.^[37] For the 2-adic absolute value on \mathbb{Q}, consider x = 3/4 = 3 \cdot 2^{-2}; here v_2(x) = -2, so |3/4|_2 = 2^{2} = 4.^[38] In contrast, |4|_2 = |2^2|_2 = 2^{-2} = 1/4, illustrating how the 2-adic metric prioritizes powers of 2 over other factors.^[38] This non-Archimedean structure completes to the 2-adic numbers, forming a field where series converge based on decreasing 2-adic norms.^[39]

In Vector Spaces and Norms

In vector spaces over the real or complex numbers, the absolute value generalizes to the concept of a norm, which measures the "length" or magnitude of vectors while satisfying key properties that extend the behavior of the absolute value on scalars. A norm on a vector space V is a function \|\cdot\|: V \to [0, \infty) that obeys three axioms: positivity, where \|v\| \geq 0 for all v \in V and \|v\| = 0 if and only if v = 0; homogeneity, where \|c v\| = |c| \|v\| for any scalar c \in \mathbb{R} (or \mathbb{C}) and v \in V; and the triangle inequality, where \|u + v\| \leq \|u\| + \|v\| for all u, v \in V.^[40]^[41] These properties ensure that norms induce a metric on the space, allowing notions of distance and convergence, much like the absolute value does on the real line.^[42] On the one-dimensional real vector space \mathbb{R}, the absolute value |x| serves as a norm, satisfying all three axioms directly, and in fact, every norm on \mathbb{R} is a positive scalar multiple of the absolute value.^[43] More precisely, when viewing \mathbb{R} as \mathbb{R}^1, the absolute value corresponds to the 1-norm \|x\|_1 = |x| or the infinity-norm \|x\|_\infty = |x|, though it is most naturally identified with the Euclidean (2-)norm \|x\|_2 = |x|, since \sqrt{x^2} = |x|.^[44] In higher dimensions, such as \mathbb{R}^n, the Euclidean norm \|x\|_2 = \sqrt{\sum_{i=1}^n x_i^2} generalizes this, reducing to the absolute value in one dimension and providing a direct extension where each component's contribution is weighted by its square, akin to the modulus in the complex plane when \mathbb{C} is identified with \mathbb{R}^2.^[41]^[45] A broader family of norms that explicitly incorporate absolute values are the p-norms (or \ell_p-norms) on \mathbb{R}^n for $1 \leq p \leq \infty, defined by \|x\|_p = \left( \sum_{i=1}^n |x_i|^p \right)^{1/p} for finite p, and \|x\|_\infty = \max_i |x_i| for p = \infty.^[40] These satisfy the norm axioms for p \geq 1, with the case p=1 yielding the sum of absolute values \|x\|_1 = \sum_{i=1}^n |x_i|, which measures total variation, and the limit as p \to \infty approaching the maximum absolute component.^[41] The p-norms highlight how absolute values scale and aggregate component magnitudes, influencing the geometry of the space; for instance, the unit ball \{x \in \mathbb{R}^n : \|x\|_p \leq 1\} in \mathbb{R}^2 forms a diamond (square rotated 45 degrees) for p=1, a circle for p=2, and a square aligned with the axes for p=\infty, with intermediate p values producing increasingly rounded shapes between these extremes. This shaping by absolute values underscores their role in defining convex, symmetric sets central to optimization and analysis in normed spaces.

In Composition Algebras

Composition algebras over the real numbers are finite-dimensional algebras equipped with a nondegenerate quadratic form N, known as the norm, satisfying the multiplicativity condition N(xy) = N(x)N(y) for all x, y in the algebra. The associated absolute value is defined by |x| = \sqrt{N(x)}, which is likewise multiplicative: |xy| = |x||y|. Unlike the real or complex cases, these algebras are typically noncommutative and, in higher dimensions, nonassociative, yet the norm ensures a Euclidean-like structure with properties such as the triangle inequality |x + y| \leq |x| + |y|.^[46]^[47] The quaternions \mathbb{H} provide the prototypical four-dimensional example of a composition algebra. A quaternion is expressed as q = a + bi + cj + dk where a, b, c, d \in \mathbb{R} and i, j, [k](/page/K) satisfy i^2 = j^2 = [k](/page/K)^2 = ijk = -1. The norm is given by

N(q) = a^2 + b^2 + c^2 + d^2,

so |q| = \sqrt{N(q)}. This norm is multiplicative, N(qr) = N(q)N(r), and the absolute value preserves lengths under multiplication, facilitating applications in three-dimensional rotations where unit quaternions (|q| = [1](/page/1)) parameterize the rotation group SO(3). For instance, the basis element i has |i| = [1](/page/1). The triangle inequality holds, ensuring the norm behaves like a metric.^[48] The octonions \mathbb{O} extend this to eight dimensions, forming the highest-dimensional real composition algebra. An octonion is o = \sum_{m=0}^{7} a_m e_m with a_m \in \mathbb{R} and \{e_0 = 1, e_1, \dots, e_7\} a basis satisfying specific multiplication rules derived from the Fano plane. The norm is the Euclidean form

N(o) = \sum_{m=0}^{7} a_m^2,

yielding |o| = \sqrt{N(o)}, which remains multiplicative N(op) = N(o)N(p) despite the nonassociativity of octonion multiplication (xy)z \neq x(yz) in general. The absolute value satisfies the triangle inequality, though the lack of associativity complicates algebraic manipulations. This structure underpins exceptional Lie groups like G_2, with applications in string theory and exceptional geometry.^[49] These algebras arise via the Cayley-Dickson construction, which recursively doubles the dimension of a composition algebra A with conjugation * and parameter \lambda \in A to form a new algebra on pairs (a, b) with multiplication (a, b)(c, d) = (ac + \lambda d^* b, da + bc^*) and norm N((a, b)) = N(a) - \lambda N(b). Starting from \mathbb{R}, this yields \mathbb{C} (dimension 2), \mathbb{H} (dimension 4), and \mathbb{O} (dimension 8), preserving norm multiplicativity at each step. Beyond octonions, further iterations introduce zero divisors, violating the division algebra property, though multiplicativity persists. Hurwitz's 1898 theorem establishes that the only real finite-dimensional composition algebras (normed division algebras) occur in dimensions 1, 2, 4, and 8.^[50]^[47]

References

[1]
Absolute value of real number - BYJU'S
The absolute value of a number or integer is the actual distance of the integer from zero, in a number line. Therefore, the absolute value is always a positive ...
[2]
Absolute Value - Math is Fun
Absolute value is how far a number is from zero, removing any negative sign, so all numbers are positive or zero.Missing: properties | Show results with:properties<|control11|><|separator|>
[3]
Absolute Value – Properties & Examples - The Story of Mathematics
Absolute value refers to a point's distance from zero or origin on the number line, regardless of the direction. The absolute value of a number is always.Missing: definition | Show results with:definition
[4]
Earliest Uses of Function Symbols - MacTutor History of Mathematics
Absolute value function. Karl Weierstrass (1815-1897) used | | in an 1841 essay "Zur Theorie der Potenzreihen," in which the symbol appears on page 67. He ...
[5]
Earliest Uses of Symbols for Matrices and Vectors
Aug 19, 2019 · The use of a single vertical line on both sides of the entries seems to have introduced by Cayley writing in 1841: see Muir vol. 1 p. and Cajori ...
[6]
Abs: Absolute Value (Modulus) - Wolfram Language Documentation
Abs is also known as modulus. · Mathematical function, suitable for both symbolic and numerical manipulation. · For complex numbers z, Abs[z] gives the modulus .Missing: alternative | Show results with:alternative
[7]
Absolute Value -- from Wolfram MathWorld
The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, where sgn(x) is the sign function.
[8]
Meaning, Sign, Examples | How to Find Absolute Value? - Cuemath
Absolute Value. The absolute value of a variable x is represented by |x| which is pronounced as 'Mod x' or 'Modulus of x'. 'Modulus' is a Latin word, ...
[9]
Complex Number Primer - Pauls Online Math Notes
The modulus of a complex number is always a real number and in fact it will never be negative since square roots always return a positive number or zero.
[10]
Absolute - Etymology, Origin & Meaning
Late 14c. origin from Latin absolutus, meaning "complete, free from ... absolute value is from 1907. As a noun in metaphysics, the absolute "that which ...
[11]
Algebra - Miscellaneous Functions - Pauls Online Math Notes
Nov 16, 2022 · First, let's remind ourselves of the definition of the absolute value function. f(x)={xif x≥0−xif x<0 f ( x ) = { x if x ≥ 0 − x if x < 0.
[12]
Absolute Value
Section1Absolute Value¶ permalink. The Absolute Value function is strangely mysterious. ... plot(f(x), (x, -2, 2), color='green',thickness=3). Evaluate Sage Code.
[13]
Absolute values - LP_Solve
It is X if X is positive or 0 and it is -X if X is negative. This also implies that maximum is always bigger than or equal to zero.
[14]
[PDF] Class Notes for Math 1110, Section 5 - Cornell Mathematics
The absolute value function, |x|, can be defined by. |x| = x if x ≥ 0. −x if x < 0 . ... x if x ≥ 0. −x if x < 0 . Hence. |x − 2| = x − 2 if x − 2 ≥ 0.<|control11|><|separator|>
[15]
[PDF] Chapter 6: Limits of Functions - UC Davis Math
Moreover, even if a function is defined at c and its limit as x → c exists, ... Define the sign function sgn : R → R by sgn x = ⎛. ⎢ . ⎢k. 1 if x > 0,. 0.
[16]
Real Numbers:Absolute Value - Department of Mathematics at UTSA
Nov 7, 2021 · Because we have not established how to prove these statements through algebraic manipulation, we will be deriving properties as we go to gain a ...
[17]
5.4 Absolute values and the triangle inequality
Before we state (and prove) the triangle inequality, let's prove a few useful lemmas that describe some useful properties of the absolute value. 🔗. Lemma ...
[18]
[PDF] Section 2.2 Absolute Value and the Real Line - Purdue Math
We see from the definition that [a] ≥ 0 for all. | € a ER, and that a = 0 if and only if a 0. Also alla for all a R. Some additional properties are as follows.<|control11|><|separator|>
[19]
[PDF] Absolute Values and the Triangle Inequality
For any real number a we define the absolute value of a as. |a| = a if a ≥ 0. −a if a < 0. Useful Fact. For all real numbers −|a| ≤ a ≤ |a|. Proof. I'll ...
[20]
ORCCA Introduction to Absolute Value Functions - Index of
Recall that in Section 1.4, we defined the absolute value of a number to be the distance between that number and 0 0 on a number line.
[21]
Math 1010 on-line - The Real Number Line
The distance between two real numbers x and y is the absolute value of their difference. For example, the distance between 3 and 5 is $ \vert 3-5\vert $ (i.e., ...
[22]
Absolute Value Function - UCCS
The absolute value function is commonly used to determine the distance between two numbers on the number line. Given two values a and b , then | a − b ...
[23]
[PDF] Math 441 Topology Summer 2007 Handout #3: Metric Spaces
When n = 1, this just gives the absolute value of the difference, because (x2)1/2 = |x| for any real number x. The general formula is motivated by the familiar ...
[24]
[PDF] METRIC SPACES 1. Introduction As calculus developed, eventually ...
This is the usual distance used in Rm, and when we speak about Rm as a metric space without specifying a metric, it's the Euclidean metric that is intended.
[25]
Complex Modulus -- from Wolfram MathWorld
The modulus of a complex number z, also called the complex norm, is denoted |z| and defined by |x+iy|=sqrt(x^2+y^2).
[26]
Complex Number -- from Wolfram MathWorld
z=|z|(costheta+isintheta)=|z|e^. (2). Here, |z| is known as the complex modulus (or sometimes the complex norm) and theta is known as the complex argument or ...
[27]
Sign -- from Wolfram MathWorld
The sign of a real number, also called sgn or signum, is -1 for a negative number (i.e., one with a minus sign "-"), 0 for the number zero, or +1 for a ...
[28]
[PDF] Lecture Notes: Discrete Mathematics for Computer Science
Then sgn(x) · |x| = 1 · x = x. The structure of this proof can be represented by an inference rule with four premises: F1 ∨ F2 ∨ F3. F1 → G.
[29]
[PDF] Introduction to Decision Sciences [.1in] Lecture 4 - Andrew B. Nobel
Sep 5, 2017 · Definition: The absolute value of x ∈ R is defined by. |x| = ( x if x ≥ 0. −x if x < 0. Fact: For each x ∈ R. (1) |x| ≥ 0. (2) |x| = max(x, −x).
[30]
[PDF] Differentiable Functions - UC Davis Math
The absolute value function f(x) = |x| is differentiable at x ̸= 0 with derivative f′(x) = sgn x. It is not differentiable at 0, however, since lim h→0 f(h) ...
[31]
[PDF] Subgradients - Stanford University
Apr 13, 2022 · A function f is called subdifferentiable if it is subdifferentiable at all x ∈ domf. Example. Absolute value. Consider f(z) = |z|. For x < 0 the ...
[32]
[PDF] Integrating an Absolute Value
|x3 − 5x2 + 6x| dx. There is no anti-derivative for an absolute value; however, we know it's definition. |x| = x if x ≥ 0. −x elsewise. Thus we can split ...
[33]
[PDF] Chapter 1. Rings, Fields, and Orders
For a ∈ F we define the absolute value of a to be. |a| = ( a if a ≥ 0,. −a if a ≤ 0. 1.33 Theorem: (Properties of Absolute Value) Let F be an ordered field.<|separator|>
[34]
[PDF] Math 676. Some basics concerning absolute values
Math 676. Some basics concerning absolute values. A remarkable unification of congruential and Euclidean-space methods in number theory is achieved.
[35]
[PDF] 1 Absolute values and discrete valuations - MIT Mathematics
Sep 8, 2016 · The p-adic absolute value on Q is defined by. |x|p := p. −vp(x) ... In addition to being an integral domain, every discrete valuation ring A enjoys ...
[36]
[PDF] 1 Absolute values on fields - Kiran S. Kedlaya
4 Examples of nonarchimedean absolute values ... Any nontrivial nonarchimedean absolute value on Q is equivalent to the p-adic absolute value for some prime p.<|separator|>
[37]
[PDF] Chapter 8 P-adic numbers
The p-adic absolute value |·|p on Q is defined as follows: if a ∈ Q, a 6= 0 then write a = pmb/c where b, c are integers not divisible by p and put |a|p = p−m; ...
[38]
p-adic Norm -- from Wolfram MathWorld
Any nonzero rational number x can be represented by where p is a prime number, r and s are integers not divisible by p, and a is a unique integer.
[39]
[PDF] p-ADIC ABSOLUTE VALUES - UChicago Math
Abstract. p-adic absolute values are functions which define magnitudes and distances on the rationals using the multiplicity of primes in the factorization.
[40]
[PDF] 1 Norms and Vector Spaces
A norm is a function f : V → R which satisfies. (i) f(x) ≥ 0 for all x ∈ V. (ii) f(x + y) ≤ f(x) + f(y) for all x, y ∈ V.
[41]
[PDF] Chapter 4 Vector Norms and Matrix Norms - UPenn CIS
A vector space E together with a norm is called a normed vector space. From (N3), we easily get. | x − y | ≤ x − y .
[42]
CS 357 | Norms and Vector Spaces
A vector norm is a function ‖u‖:V→R+0 (i.e., it takes a vector and returns a nonnegative real number) that satisfies the following properties, where u,v∈V and α ...
[43]
[PDF] 1 Introduction 2 What are norms and why study them? - Chi-Kwong Li
Norms can be regarded as generalizations of the absolute value function of numbers. Actually, one easily verifies: Fact 1 Consider IR as a real vector space.
[44]
ALAFF Absolute value - Texas Computer Science
The absolute value (magnitude) of a complex number can also be thought of as the (Euclidean) distance from the point in the complex plane to the origin of ...
[45]
Math 6702, Assignment 4 Introduction 1. Let f(z) = f(x + iy) = u(x, y) + ...
Note that the “absolute value” here is the complex modulus which is essentially the same as the Euclidean norm in R2: |z| = |x + iy| = px2 + y2. Show that u ...
[46]
Real Normed Algebra -- from Wolfram MathWorld
A real normed algebra, also called a composition algebra, is a multiplication * on R^n that respects the length of vectors, i.e., |x*y|=|x|*|y| ...
[47]
[1011.6197] Hurwitz' theorem on composition algebras - arXiv
Nov 29, 2010 · The main aim of this article is to give an exposition of the diagrammatic proof due to Boos and Rost of the theorem of Hurwitz that the dimension of a ...Missing: original | Show results with:original
[48]
Quaternion -- from Wolfram MathWorld
While the quaternions are not commutative, they are associative, and they form a group known as the quaternion group. ... H=a·1+bi+cj+dk. ... must be explicit real ...
[49]
Degen's Eight-Square Identity -- from Wolfram MathWorld
Since the identity follows from the fact that the norm of the product of two octonions is the product of the norms, the octonions are sometimes known as the ...
[50]
Cayley-Dickson construction - PlanetMath
Mar 22, 2013 · 1. (Multiplication) (a⊕b)(c⊕d):=(ac+λd∗b)⊕(da+bc∗) ( a ⊕ b ) ⁢ ( c ⊕ d ) := ( a ⁢ c + λ ⁢ d * ⁢ b ) ⊕ ( d ⁢ a + b ⁢ c * ) , where * * is the ...