In mathematics, a norm is a function from a real or complex vector space to the nonnegative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and is zero only at the origin. In particular, the Euclidean distance of a vector from the origin is a norm, called the Euclidean norm, or 2-norm, which may also be defined as the square root of the inner product of a vector with itself.
A pseudonorm or seminorm satisfies the first two properties of a norm, but may be zero for other vectors than the origin. A vector space with a specified norm is called a normed vector space. In a similar manner, a vector space with a seminorm is called a ''seminormed vector space''.

** Definition **

Given a vector space over a subfield of the complex numbers $\backslash mathbb\; C$, a norm on is a nonnegative-valued real-valued function $p\backslash colon\; V\backslash to\; \backslash mathbb\; R$ with the following properties, where denotes the usual absolute value of :
For all in and all in ,
# (being ''subadditive'' or satisfying the ''triangle inequality'').
# (being ''absolutely homogeneous'' or ''absolutely scalable'').
# If then is the zero vector (being ''positive definite'' or being ''point-separating'').
A seminorm on is a function $p\backslash colon\; V\backslash to\; \backslash mathbb\; R$ with the properties 1 and 2 above.

** Equivalent norms **

Suppose that and are two norms (or seminorms) on a vector space . Then and are called equivalent, if there exist two real constants and with such that for every vector ,
:$cq(\backslash mathbf\; v)\; \backslash le\; p(\backslash mathbf\; v)\backslash le\; Cq(\backslash mathbf\; v).$
The norms and are equivalent if and only if they induce the same topology on . Any two norms on a finite-dimensional space are equivalent but this does not extend to infinite-dimensional spaces.

** Notation **

If a norm $p\; :\; X\; \backslash rarr\; \backslash mathbb$ is given on a vector space , then the norm of a vector is usually denoted by enclosing it within double vertical lines: $\backslash |v\backslash |=p(v).$ Such notation is also sometimes used if is only a seminorm. For the length of a vector in Euclidean space (which is an example of a norm, as explained below), the notation with single vertical lines is also widespread.
In LaTeX and related markup languages, the double bar of norm notation is entered with the macro

** Examples **

Every (real or complex) vector space admits a norm: If is a Hamel basis for a vector space then the real-valued map that sends (where all but finitely many of the scalars are 0) to is a norm on . There are also a large number of norms that exhibit additional properties that make them useful for specific problems.

** Absolute-value norm **

The absolute value
:$\backslash left\backslash |\; x\; \backslash right\backslash |\; =\; \backslash left|\; x\; \backslash $
is a norm on the one-dimensional vector spaces formed by the real or complex numbers.
Any norm on a one-dimensional vector space is equivalent (up to scaling) to the absolute value norm, meaning that there is a norm-preserving isomorphism of vector spaces $f\; :\; \backslash mathbb\; \backslash rarr\; X,$ where $\backslash mathbb$ is either $\backslash mathbb$ or $\backslash mathbb$, and norm-preserving means that $\backslash left|x\backslash \; =\; p(f(x))$.
This isomorphism is given by sending $1\; \backslash isin\; \backslash mathbb$ to a vector of norm , which exists since such a vector is obtained by multiplying any nonzero vector by the inverse of its norm.

** Euclidean norm **

On the -dimensional Euclidean space $\backslash mathbb^n,$ the intuitive notion of length of the vector is captured by the formula
:$\backslash left\backslash |\; \backslash boldsymbol\; \backslash right\backslash |\_2\; :=\; \backslash sqrt.$
This is the Euclidean norm, which gives the ordinary distance from the origin to the point ''X''—a consequence of the Pythagorean theorem.
This operation may also be referred to as "SRSS", which is an acronym for the square root of the sum of squares.
The Euclidean norm is by far the most commonly used norm on $\backslash mathbb^n$, but there are other norms on this vector space as will be shown below.
However, all these norms are equivalent in the sense that they all define the same topology.
The inner product of two vectors of a Euclidean vector space is the dot product of their coordinate vectors over an orthonormal basis.
Hence, the Euclidean norm can be written in a coordinate-free way as
:$\backslash left\backslash |\; \backslash boldsymbol\; \backslash right\backslash |\; :=\; \backslash sqrt.$
The Euclidean norm is also called the ''L''^{2} norm, ℓ^{2} norm, 2-norm, or square norm; see ''L''^{''p''} space.
It defines a distance function called the Euclidean length, ''L''^{2} distance, or ℓ^{2} distance.
The set of vectors in $\backslash mathbb^$ whose Euclidean norm is a given positive constant forms an -sphere.

** Euclidean norm of complex numbers **

The Euclidean norm of a complex number is the absolute value (also called the modulus) of it, if the complex plane is identified with the Euclidean plane $\backslash mathbb^2.$ This identification of the complex number as a vector in the Euclidean plane, makes the quantity $\backslash sqrt$ (as first suggested by Euler) the Euclidean norm associated with the complex number.

** Quaternions and octonions **

There are exactly four Euclidean Hurwitz algebras over the real numbers. These are the real numbers $\backslash mathbb$, the complex numbers $\backslash mathbb$, the quaternions $\backslash mathbb$, and lastly the octonions $\backslash mathbb$, where the dimensions of these spaces over the real numbers are , , , and , respectively.
The canonical norms on $\backslash mathbb$ and $\backslash mathbb$ are their absolute value functions, as discussed previously.
The canonical norm on $\backslash mathbb$ of quaternions is defined by
:$\backslash lVert\; q\; \backslash rVert\; =\; \backslash sqrt\; =\; \backslash sqrt\; =\; \backslash sqrt$
for every quaternion $q\; =\; a\; +\; b\backslash ,\backslash mathbf\; i\; +\; c\backslash ,\backslash mathbf\; j\; +\; d\backslash ,\backslash mathbf\; k$ in $\backslash mathbb.$ This is the same as the Euclidean norm on $\backslash mathbb$ considered as the vector space $\backslash mathbb^4.$ Similarly, the canonical norm on the octonions is the just Euclidean norm on $\backslash mathbb^8.$
;Finite-dimensional complex normed spaces
On an -dimensional complex space $\backslash mathbb^n,$ the most common norm is
:$\backslash left\backslash |\; \backslash boldsymbol\; \backslash right\backslash |\; :=\; \backslash sqrt=\; \backslash sqrt.$
In this case, the norm can be expressed as the square root of the inner product of the vector and itself:
:$\backslash left\backslash |\; \backslash boldsymbol\; \backslash right\backslash |\; :=\; \backslash sqrt,$
where $\backslash boldsymbol$ is represented as a column vector ('x''_{1}; ''x''_{2}; ...; ''x''_{''n''}, and $\backslash boldsymbol^H$ denotes its conjugate transpose.
This formula is valid for any inner product space, including Euclidean and complex spaces. For complex spaces, the inner product is equivalent to the complex dot product.
Hence the formula in this case can also be written using the following notation:
:$\backslash left\backslash |\; \backslash boldsymbol\; \backslash right\backslash |\; :=\; \backslash sqrt.$

** Taxicab norm or Manhattan norm **

:$\backslash left\backslash |\; \backslash boldsymbol\; \backslash right\backslash |\; \_1\; :=\; \backslash sum\_^n\; \backslash left|\; x\_i\; \backslash \; .$
The name relates to the distance a taxi has to drive in a rectangular street grid to get from the origin to the point .
The set of vectors whose 1-norm is a given constant forms the surface of a cross polytope of dimension equivalent to that of the norm minus 1.
The Taxicab norm is also called the ''$\backslash ell$''_{1} norm.
The distance derived from this norm is called the Manhattan distance or ''$\backslash ell$''_{1} distance.
The 1-norm is simply the sum of the absolute values of the columns.
In contrast,
:$\backslash sum\_^n\; x\_i$
is not a norm because it may yield negative results.

** ''p''-norm **

Let be a real number.
The -norm (also called $\backslash ell\_p$-norm) of vector $\backslash mathbf\; =\; (x\_1,\; \backslash ldots,\; x\_n)$ is
:$\backslash left\backslash |\; \backslash mathbf\; \backslash right\backslash |\; \_p\; :=\; \backslash bigg(\; \backslash sum\_^n\; \backslash left|\; x\_i\; \backslash \; ^p\; \backslash bigg)\; ^.$
For , we get the taxicab norm, for , we get the Euclidean norm, and as approaches the -norm approaches the infinity norm or maximum norm:
:$\backslash left\backslash |\; \backslash mathbf\; \backslash right\backslash |\; \_\backslash infty\; :=\; \backslash max\_i\; \backslash left|\; x\_i\; \backslash .$
The -norm is related to the generalized mean or power mean.
This definition is still of some interest for , but the resulting function does not define a norm, because it violates the triangle inequality.
What is true for this case of , even in the measurable analog, is that the corresponding class is a vector space, and it is also true that the function
:$\backslash int\_X\; \backslash left|\; f\; (\; x\; )\; -\; g\; (\; x\; )\; \backslash \; ^p\; ~\; \backslash mathrm\; d\; \backslash mu$
(without th root) defines a distance that makes into a complete metric topological vector space. These spaces are of great interest in functional analysis, probability theory and harmonic analysis.
However, aside from trivial cases, this topological vector space is not locally convex, and has no continuous non-zero linear forms. Thus the topological dual space contains only the zero functional.
The partial derivative of the -norm is given by
:$\backslash frac\; \backslash left\backslash |\; \backslash mathbf\; \backslash right\backslash |\_p\; =\; \backslash frac\; .$
The derivative with respect to , therefore, is
:$\backslash frac\; =\backslash frac\; .$
where denotes Hadamard product and $|\backslash cdot|$ is used for absolute value of each component of the vector.
For the special case of , this becomes
:$\backslash frac\; \backslash left\backslash |\; \backslash mathbf\; \backslash right\backslash |\; \_2\; =\; \backslash frac\; ,$
or
:$\backslash frac\; \backslash left\backslash |\; \backslash mathbf\; \backslash right\backslash |\; \_2\; =\; \backslash frac\; .$

** Maximum norm (special case of: infinity norm, uniform norm, or supremum norm) **

If $\backslash mathbf$ is some vector such that $\backslash mathbf\; =\; (x\_1,\; x\_2,\; \backslash ldots\; ,x\_n)$, then:
:$\backslash left\backslash |\; \backslash mathbf\; \backslash right\backslash |\; \_\backslash infty\; :=\; \backslash max\; \backslash left(\; \backslash left|\; x\_1\; \backslash \; ,\; \backslash ldots\; ,\; \backslash left|\; x\_n\; \backslash \; \backslash right)\; .$
The set of vectors whose infinity norm is a given constant, , forms the surface of a hypercube with edge length 2''c''.

** Zero norm **

In probability and functional analysis, the zero norm induces a complete metric topology for the space of measurable functions and for the F-space of sequences with F–norm $(x\_n)\; \backslash mapsto\; \backslash sum\_n$.
Here we mean by ''F-norm'' some real-valued function $\backslash lVert\; \backslash \; \backslash cdot\backslash \; \backslash rVert$ on an F-space with distance , such that $\backslash lVert\; x\; \backslash rVert\; =\; d(x,0)$.
The ''F''-norm described above is not a norm in the usual sense because it lacks the required homogeneity property.

** Hamming distance of a vector from zero **

In metric geometry, the discrete metric takes the value one for distinct points and zero otherwise. When applied coordinate-wise to the elements of a vector space, the discrete distance defines the ''Hamming distance'', which is important in coding and information theory.
In the field of real or complex numbers, the distance of the discrete metric from zero is not homogeneous in the non-zero point; indeed, the distance from zero remains one as its non-zero argument approaches zero.
However, the discrete distance of a number from zero does satisfy the other properties of a norm, namely the triangle inequality and positive definiteness.
When applied component-wise to vectors, the discrete distance from zero behaves like a non-homogeneous "norm", which counts the number of non-zero components in its vector argument; again, this non-homogeneous "norm" is discontinuous.
In signal processing and statistics, David Donoho referred to the ''zero'' "''norm''" with quotation marks.
Following Donoho's notation, the zero "norm" of is simply the number of non-zero coordinates of , or the Hamming distance of the vector from zero.
When this "norm" is localized to a bounded set, it is the limit of -norms as approaches 0.
Of course, the zero "norm" is not truly a norm, because it is not positive homogeneous.
Indeed, it is not even an F-norm in the sense described above, since it is discontinuous, jointly and severally, with respect to the scalar argument in scalar–vector multiplication and with respect to its vector argument.
Abusing terminology, some engineers omit Donoho's quotation marks and inappropriately call the number-of-nonzeros function the ''L^{0}'' norm, echoing the notation for the Lebesgue space of measurable functions.

** Infinite dimensions **

The generalization of the above norms to an infinite number of components leads to and spaces, with norms
:$\backslash left\backslash |\; x\; \backslash right\backslash |\; \_p\; =\; \backslash bigg(\; \backslash sum\_\; \backslash left|\; x\_i\; \backslash \; ^p\; \backslash bigg)^\; \backslash text\backslash \; \backslash left\backslash |\; f\; \backslash right\backslash |\; \_\; =\; \backslash bigg(\; \backslash int\_X\; \backslash left|\; f(x)\; \backslash \; ^p\; ~\; \backslash mathrm\; d\; x\; \backslash bigg)^$
for complex-valued sequences and functions on $X\; \backslash sube\; \backslash mathbb^n$ respectively, which can be further generalized (see Haar measure).
Any inner product induces in a natural way the norm $\backslash left\backslash |\; x\; \backslash right\backslash |\; :=\; \backslash sqrt\; .$
Other examples of infinite-dimensional normed vector spaces can be found in the Banach space article.

** Composite norms **

Other norms on $\backslash mathbb^n$ can be constructed by combining the above; for example
:$\backslash left\backslash |\; x\; \backslash right\backslash |\; :=\; 2\; \backslash left|\; x\_1\; \backslash \; +\; \backslash sqrt$
is a norm on $\backslash mathbb^4.$
For any norm and any injective linear transformation we can define a new norm of , equal to
:$\backslash left\backslash |\; Ax\; \backslash right\backslash |\; .$
In 2D, with a rotation by 45° and a suitable scaling, this changes the taxicab norm into the maximum norm. Each applied to the taxicab norm, up to inversion and interchanging of axes, gives a different unit ball: a parallelogram of a particular shape, size, and orientation.
In 3D, this is similar but different for the 1-norm (octahedrons) and the maximum norm (prisms with parallelogram base).
There are examples of norms that are not defined by "entrywise" formulas. For instance, the Minkowski functional of a centrally-symmetric convex body in $\backslash mathbb^n$ (centered at zero) defines a norm on $\backslash mathbb^n$ (see below).
All the above formulas also yield norms on $\backslash mathbb^n$ without modification.
There are also norms on spaces of matrices (with real or complex entries), the so-called matrix norms.

** In abstract algebra **

Let be a finite extension of a field of inseparable degree , and let have algebraic closure . If the distinct embeddings of are , then the Galois-theoretic norm of an element is the value $\backslash left(\backslash prod\_j\backslash right)^$. As that function is homogenous of degree , the Galois-theoretic norm is not a norm in the sense of this article. However, the ^{th} root of the norm (assuming that concept makes sense), is a norm.

** Composition algebras **

The concept of norm $N(z)$ in composition algebras does ''not'' share the usual properties of a norm as it may be negative or zero for ''z'' ≠ 0. A composition algebra (''A'', *, ''N'') consists of an algebra over a field ''A'', an involution *, and a quadratic form $N(z)\; =\; zz^*\; ,$ which is called the "norm".
The characteristic feature of composition algebras is the homomorphism property of ''N'': for the product ''wz'' of two elements ''w'' and ''z'' of the composition algebra, its norm satisfies $N(wz)\; =\; N(w)N(z).$ For $\backslash mathbb$, $\backslash mathbb$, $\backslash mathbb$, and O the composition algebra norm is the square of the norm discussed above. In those cases the norm is a definite quadratic form. In other composition algebras the norm is an isotropic quadratic form.

** Properties **

For any norm ''p'' on a vector space ''V'', the reverse triangle inequality holds: for all u and ,
:''p''(u ± v) ≥ |''p''(u) − ''p''(v)|
If is a continuous linear map between normed space, then the norm of and the norm of the transpose of are equal.
For the L^{p} norms, we have Hölder's inequality
:$\backslash left|\; \backslash langle\; x,\; y\; \backslash rangle\; \backslash \; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\; \_p\; \backslash left\backslash |\; y\; \backslash right\backslash |\; \_q\; \backslash qquad\; \backslash frac\; +\; \backslash frac\; =\; 1\; .$
A special case of this is the Cauchy–Schwarz inequality:
$\backslash left|\; \backslash langle\; x,\; y\; \backslash rangle\; \backslash \; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\; \_2\; \backslash left\backslash |\; y\; \backslash right\backslash |\; \_2\; .$

** Equivalence **

The concept of unit circle (the set of all vectors of norm 1) is different in different norms: for the 1-norm, the unit circle is a square, for the 2-norm (Euclidean norm), it is the well-known unit circle, while for the infinity norm, it is a different square. For any ''p''-norm, it is a superellipse with congruent axes (see the accompanying illustration). Due to the definition of the norm, the unit circle must be convex and centrally symmetric (therefore, for example, the unit ball may be a rectangle but cannot be a triangle, and $p\backslash ge\; 1$ for a ''p''-norm).
In terms of the vector space, the seminorm defines a topology on the space, and this is a Hausdorff topology precisely when the seminorm can distinguish between distinct vectors, which is again equivalent to the seminorm being a norm. The topology thus defined (by either a norm or a seminorm) can be understood either in terms of sequences or open sets. A sequence of vectors $\backslash $ is said to converge in norm to $v$, if $\backslash left\backslash |\; v\_n\; -\; v\; \backslash right\backslash |\; \backslash rightarrow\; 0$ as $n\; \backslash to\; \backslash infty$. Equivalently, the topology consists of all sets that can be represented as a union of open balls. If is a normed space then for all .
Two norms ‖•‖_{''α''} and ‖•‖_{''β''} on a vector space ''V'' are called equivalent if they induce the same topology, which happens if and only if there exist positive real numbers ''C'' and ''D'' such that for all ''x'' in ''V''
:$C\; \backslash left\backslash |\; x\; \backslash right\backslash |\_\backslash alpha\; \backslash leq\; \backslash left\backslash |\; x\; \backslash right\backslash |\; \_\backslash beta\; \backslash leq\; D\; \backslash left\backslash |\; x\; \backslash right\backslash |\_\backslash alpha\; .$
For instance, if ''p'' > ''r'' ≥ 1 on $\backslash mathbf^n$, then
:$\backslash left\backslash |\; x\; \backslash right\backslash |\_p\; \backslash leq\; \backslash left\backslash |\; x\; \backslash right\backslash |\; \_r\; \backslash leq\; n\; ^\; \backslash left\backslash |\; x\; \backslash right\backslash |\_p$
In particular,
:$\backslash left\backslash |\; x\; \backslash right\backslash |\_2\; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\_1\; \backslash le\; \backslash sqrt\; \backslash left\backslash |\; x\; \backslash right\backslash |\_2$
:$\backslash left\backslash |\; x\; \backslash right\backslash |\_\backslash infty\; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\_2\; \backslash le\; \backslash sqrt\; \backslash left\backslash |\; x\; \backslash right\backslash |\_\backslash infty$
:$\backslash left\backslash |\; x\; \backslash right\backslash |\_\backslash infty\; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\_1\; \backslash le\; n\; \backslash left\backslash |\; x\; \backslash right\; \backslash |\_\backslash infty\; ,$
That is,
:$\backslash left\backslash |\; x\; \backslash right\backslash |\_\backslash infty\; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\_2\; \backslash le\; \backslash left\backslash |\; x\; \backslash right\backslash |\_1\; \backslash le\; \backslash sqrt\; \backslash left\backslash |\; x\; \backslash right\backslash |\_2\; \backslash le\; n\; \backslash left\backslash |\; x\; \backslash right\; \backslash |\_\backslash infty.$
If the vector space is a finite-dimensional real or complex one, all norms are equivalent. On the other hand, in the case of infinite-dimensional vector spaces, not all norms are equivalent.
Equivalent norms define the same notions of continuity and convergence and for many purposes do not need to be distinguished. To be more precise the uniform structure defined by equivalent norms on the vector space is uniformly isomorphic.

Classification of seminorms: absolutely convex absorbing sets

All seminorms on a vector space ''V'' can be classified in terms of absolutely convex absorbing subsets ''A'' of ''V''. To each such subset corresponds a seminorm ''p_{A}'' called the gauge of ''A'', defined as
:''p_{A}''(''x'') := inf
with the property that
: ⊆ ''A'' ⊆ .
Conversely:
Any locally convex topological vector space has a local basis consisting of absolutely convex sets. A common method to construct such a basis is to use a family (''p'') of seminorms ''p'' that separates points: the collection of all finite intersections of sets turns the space into a locally convex topological vector space so that every p is continuous.
Such a method is used to design weak and weak* topologies.
norm case:
:Suppose now that (''p'') contains a single ''p'': since (''p'') is separating, ''p'' is a norm, and is its open unit ball. Then ''A'' is an absolutely convex bounded neighbourhood of 0, and is continuous.
:The converse is due to Andrey Kolmogorov: any locally convex and locally bounded topological vector space is normable. Precisely:
:If ''V'' is an absolutely convex bounded neighbourhood of 0, the gauge ''g_{V}'' (so that ) is a norm.

** See also **

*
*
*
*
*
*
*
* Operator norm
*
*
*
*

** References **

** Bibliography **

*
*
*
*
*
*
{{DEFAULTSORT:Norm (Mathematics)
Category:Linear algebra

`\|`

, which renders as $\backslash |.$ The double vertical line used to denote parallel lines, parallel operator and parallel addition is entered with `\parallel`

and is rendered as $\backslash parallel.$ Although looking similar, these two macros must not be confused as `\|`

denotes a bracket and `\parallel`

denotes an operator. Therefore, their size and the spaces around them are not computed in the same way. Similarly, the single vertical bar is coded as `|`

when used as a bracket, and as `\mid`

when used as an operator.
In Unicode, the code point of the "double vertical line" character ‖ is U+2016. The "double vertical line" symbol should not be confused with the "parallel to" symbol, Unicode U+2225 ( ∥ ), which is intended to denote parallel lines and parallel operators. The double vertical line should also not be confused with Unicode U+01C1 ( ǁ ), aimed to denote lateral clicks in linguistics.
The single vertical line | is called "vertical line" in Unicode and its code point is U+007C.
Classification of seminorms: absolutely convex absorbing sets

All seminorms on a vector space ''V'' can be classified in terms of absolutely convex absorbing subsets ''A'' of ''V''. To each such subset corresponds a seminorm ''p