In this section, we consider scalars from either the field of real numbers ℝ or complex numbers ℂ by putting rational numbers ℚ into back burner. Roughly speaking, the inner product is a positive-definite bilinear mapping into the field of real or complex numbers.
An inner product of two vectors of the same size, usually denoted by \( \left\langle {\bf x} , {\bf y} \right\rangle ,\) is a generalization of the dot product if it satisfies the following postulates:
A vector space together with the inner product is called an inner product space. Every inner product space is a metric space. The metric or norm is given by
The nonzero vectors u and v of the same size are orthogonal (or perpendicular) when their inner product is zero:
\( \left\langle {\bf u} , {\bf v} \right\rangle = 0 . \) We abbreviate it as \( {\bf u} \perp {\bf v} . \)
A generalized length function on a vector space can be imposed in many different ways, not necessarily through the
inner product. What is important that this generalized length, called in mathematics a norm, should satisfy the
following four axioms.
A norm on a vector space V is a nonnegative function
\( \| \, \cdot \, \| \, : \, V \to [0, \infty ) \) that satisfies the following axioms for
any vectors \( {\bf u}, {\bf v} \in V \) and arbitrary scalar k.
In particular, if w1, w2, ... , wn are positive real numbers,
which are called weights, and if u = ( u1, u2, ... , un) and
v = ( v1, v2, ... , vn) are vectors in
\( \mathbb{R}^n , \) then the formula
defines an inner product on \( \mathbb{R}^n , \) that is called the weighted Euclidean inner product with weights
w1, w2, ... , wn.
Example 2:
The Euclidean inner product and the weighted Euclidean inner product (when \( \left\langle {\bf u} , {\bf v} \right\rangle = \sum_{k=1}^n a_k u_k v_k , \)
for some positive numbers \( a_k , \ (k=1,2,\ldots , n \) ) are special cases of a general class
of inner products on \( \mathbb{R}^n \) called matrix inner product. Let A be an
invertible n-by-n matrix. Then the formula
In linear algebra, functional analysis, and related areas of mathematics, a norm is a function that assigns a strictly positive length or size to each vector in a vector space—save for the zero vector, which is assigned a length of zero.
On an n-dimensional complex space \( \mathbb{C}^n ,\) the most common norm is
A unit vector u is a vector whose length equals one: \( {\bf u} \cdot {\bf u} =1 . \) We say that two vectors
x and y are perpendicular if their dot product is zero.
There are known many other norms.
Riesz representation theorem:
Let H be an inner product
space. For every linear functional L on H there exists a unique vector y ∈ H such that
\[
L({\bf v}) = \,< {\bf y} \,|\,{\bf v} > .
\]
Let us fix an orthonormal basis β = { e1, e2, … , en } in H, and let
where overline or asterisk \( \displaystyle \overline{\bf L}_k = {\bf L}_k^{\ast} \) denotes the complex conjugate of Lk. In the case of a real space
the conjugation does nothing and can be simply ignored.
Arbitrary vector from H can be uniquely expanded as
This statement was proved by the Hungarian mathematician of Jewish descent Frigyes Riesz (1880--1956) in 1909.
While the proof of the Riesz representation theorem does not require a basis,
the proof presented above utilizes an orthonormal basis in H. Although the
resulting vector y does not depend on the choice of the basis, this proof gives a formula for computing the representing vector.
Perform the indicated operations
〈u,v〉 = u₁·v₁ + 2u₂·v₂, where u = ( 1 -j, −3+j), v = ( 2 −3j, 2).