The main reason why vectors are so useful and popular is that we can do operations with them similarly to ordinary algebra. Namely, there is an internal operation on vectors called addition together with its negation---subtraction. So two vectors can be added or subtracted. Besides these two internal arithmetic operations, there is another outer operation that admits multiplication of a vector by a scalar (real or complex numbers). It is also assumed that there exists a unique zero vector (of zero magnitude and no direction), which can
be added/subtracted from any vector without changing the outcome. The zero vector is not the number zero, but it is obtained upon multiplication of any vector by scalar zero. When discussing vectors geometrically, we assume that scalars are real numbers.
are parallel. If λ is negative, then it is a common slang to say that
are anti-parallel, but we will not use that language.
Generalizing well-known examples of vectors (velocity and force) in physics and engineering, mathematicians introduced abstract object called vectors. So vectors are objects that can be added/subtracted and multiplied by scalars. These two operations (internal addition and external scalar multiplication) are assumed to satisfy natural conditions described above.
A set of vectors is said to form a vector space (also called a linear space), if any vectors from it can be added/subtracted and multiplied by scalars, subject to regular properties of addition and multiplication. Wind, for example, has both a speed and a direction and,
hence, is conveniently expressed as a vector. The same can be said of moving objects, momentum, forces, electromagnetic fields, and weight.
(Weight is the force produced by the acceleration of gravity acting on a mass.)
The first thing we need to know is how to define a vector so it
will be clear
to everyone. Today more than ever, information technologies are an integral
part of our everyday lives. That is why we need a tool to model vectors on
computers. One of the common ways to do this is to introduce a system of
coordinates, either Cartesian or any other.
In engineering, we
traditionally use the
Cartesian
coordinate system that specifies any point with a string of digits. Each
coordinate measures a distance from a point to its perpendicular projections
onto the mutually perpendicular hyperplanes.
Let us start with our familiar three dimensional space in which the
Cartesian coordinate system consists of an ordered triplet of lines (the axes)
that go through a common point (the origin), and are pair-wise perpendicular;
it also includes an orientation for each axis and a single unit of length for
all three axes. Every point is
assigned distances to three mutually perpendicular planes, called coordinate planes (such that the pair x and y axes define the z-plane, x and z axes define the y-plane, etc.).
The reverse construction determines the point given its three coordinates.
Each pair of axes defines a coordinate plane. These planes divide space into
eight trihedra, called
octants. The coordinates are usually written as three numbers (or algebraic
formulas) surrounded by parentheses and separated by commas, as in
(-2.1,0.5,7). Thus, the origin has coordinates (0,0,0), and the unit points
on the three axes are (1,0,0), (0,1,0), and (0,0,1).
There are no universal names for the coordinates in the three axes. However,
the horizontal axis is traditionally called abscissa borrowed from New
Latin (short for linear abscissa, literally, "cut-off line"), and usually
denoted by x. The next axis is called ordinate, which came from
New Latin (linea), literally, line applied in an orderly manner; we will
usually label it by y. The last axis is called applicate and
usually denoted by z. Correspondingly,
the unit vectors are denoted by i
(abscissa), j (ordinate), and k
(applicate), called the basis. Once rectangular coordinates are set up, any vector can be expanded through these unit
vectors. In the three dimensional case, every vector can be expanded as \( {\bf v} = v_1 {\bf i} + v_2 {\bf j} + v_3 {\bf k} ,\) where \( v_1, v_2 , v_3 \) are called the coordinates of the vector v. Coordinates are always specified relative to an ordered basis. When a basis has been chosen, a vector can be expanded with respect to the basis vectors and it can be identified with an ordered n-tuple of n real (or complex) numbers or coordinates. The set of all real (or complex) ordered numbers is denoted by ℝn (or ℂn).
In general, a vector in infinite dimensional space is identified by an infinite sequence
of numbers. Finite dimensional coordinate vectors can be represented by
either a column vector (which is usually the case) or a row vector. We will
denote column-vectors by lower case letters in bold font, and row-vectors by
lower case letters with a superimposed arrow. Because of the way the Wolfram Language uses lists to represent vectors, matlabMathematica does not distinguish
column vectors from row vectors, unless the user specifies
which one is defined. One can define vectors using matlabMathematica
commands: List, Table, Array, or curly brackets.
In mathematics and applications, it is a custom to distinguish column
vectors
\[
{\bf v} = \left( \begin{array}{c} v_1 \\ v_2 \\ \vdots \\ v_m \end{array} \right) \qquad \mbox{also written as } \qquad
{\bf v} = \left[ \begin{array}{c} v_1 \\ v_2 \\ \vdots \\ v_m \end{array} \right] ,
\]
for which we use lowercase letters in boldface type, from row vectors (ordered
n-tuple)
\[
\vec{v} = \left[ v_1 , v_2 , \ldots , v_n \right] .
\]
Here entries
\( v_i \) are known as the component of the vector.
The column vectors and the row vectors can be defined using matrix command as an example of an
\( n\times 1 \) matrix and
\( 1\times n \) matrix, respectively.
The concept of a vector space (also a linear space) has been defined abstractly
in mathematics. Historically, the first ideas leading to vector spaces can be traced back as far as the 17th century;
however, the idea crystallized with the work of the German mathematician Hermann Günther
Grassmann (1809--1877), who
published a paper in 1862. A vector space is a collection of objects called
vectors, which may be added together and multiplied ("scaled") by numbers,
called scalars, the result producing more vectors in this collection. Scalars are often taken to be real numbers, but
there are also vector spaces with scalar multiplication by complex numbers, rational numbers, or generally scalars in any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called axioms (they can be found on the web page).
Vectors in matlab are built, manipulated and accessed
similarly to matrices (see next section). However,
as simple lists (“one-dimensional,” not “two-dimensional” such as matrices
that look more tabular), they are easier to construct and manipulate. They
will be enclosed in brackets ( [,] ) which allows us to distinguish a
vector from a matrix with just one row, if we look carefully. The
number of “slots” in a vector is not referred to in matlabMathematica as
rows or columns, but rather by “size.”
In matlab, defining vectors and matrices is done by typing every row by inputing entries with or without comas:
The ones, zeros linspace, and logspace functions allow for explicit creations of vectors of a specific size and with a prescribed spacing between the elements. These functions will be demonstrated by example without providing an exhaustive reference. To create a vector with one of these functions you must (atleast initially) decide how long do you want the vector to be. You must also decide whether the vector is a row or column vector.
The ones and zeros functions have two arguments. The first is the number of rows in the matrix you wish to create. The second is the number of columns. To create a row or a column vector set the appropriate argument of ones and zeros to one.
To create a row vector of length 5, filled with ones use
To create a column vector of length 5, filled with zeros use
The
linspace
and
logspace
functions create vectors with linearly spaced or logarithmically spaced elements, respectively. Here are examples including the
matlab output
The third argument of both linspace and logspace is optional. The third argument is the number of elements to use between the the range specified with the first and second arguments.
You can define a vector with functions as compenets
syms x
v = [1,2^6,sin(x)]
The same code can be executed with
Octave, but you need additional request to load symbolic package:
pkg load symbolic
syms x
v = [1,2^6,sin(x)]
So v is a vector with three components, v(1) =1,
v(2)= 2^6, and v(3)=sin(x). Parenthesis notation is
abbreviation for the
matlab command
and other entities. We usually denote vectors with lower case letters while matrices with upper case letters. Say we define a \( 2\times 3 \)
matrix (with two rows and three columns) as
A column vector can be constructed from square brackets shown here [ ]. A semicolumn delineates each row. The output, however, may not look like a column vector.
Constructing a row vector is very similar to constructing a column vector,
except two sets of semicolumns are eliminated.
So we see that
a is a column vector, which is a matrix of dimension
\( 3 \times 1 ,\) while
b is a row vector, which is a matrix of dimension
\( 1 \times 3 .\) When we multiply the matrix
A by vector
a from left or right,
matlabMathematica treats this vector either as a
\( 3 \times 1 \) matrix or as a
\( 1 \times 3 \) vector:
Object Sizes
The following functions allow you to determine the size of a variable or expression. These functions are defined for all objects. They return -1 when the operation doesn’t make sense.
-
ndims (a) Return the number of dimensions of a
-
columns (a) Return the number of columns of a.
Octave’s data structure type doesn’t have rows or columns, so the rows and columns functions return -1 for structure arguments.
-
rows (a) Return the number of rows of a.
-
numel (a) Return the number of elements in the object a.
-
length (a) Return the length of the object a.
-
size (a) Return a row vector with the size (number of elements) of each dimension for the object a.
-
isempty (a) Return true if a is an empty matrix (any one of its dimensions is zero).
-
: isnull (x) Return true if x is a special null matrix, string, or single quoted string.
-
: sizeof (val) Return the size of val in bytes.
-
squeeze (x) Remove singleton dimensions from x and return the result.
Note that for compatibility with matlab, all objects have a minimum of two dimensions and row vectors are left unchanged.
The following command finds the length (number of components) of a vector:
The size of the second dimension of rand(2,3,4) is 3.
The size is output as a single vector.
matlab has also the following options:
length(A)
size(A,1)
dimensions
numel
function size_test
nRepeats = 10000;
times1 = zeros(nRepeats, 1);
times2 = zeros(nRepeats, 1);
times3 = zeros(nRepeats, 1);
for k = 1:nRepeats
data = rand(10000, 1);
tic
size(data, 1);
times1(k) = toc;
tic
length(data);
times2(k) = toc;
tic
numel(data);
times3(k) = toc;
end
% Compute the total time required for each method
fprintf('size:\t%0.8f\n', sum(times1));
fprintf('length:\t%0.8f\n', sum(times2));
fprintf('numel:\t%0.8f\n', sum(times3));
end
Let S be a set of vectors \( {\bf v}_1 , \ {\bf v}_2 , \ \ldots , \ {\bf v}_k , \) from a vector space V. A vector v
is said to be a linear combination of the vectors from S if and only if there are scalars (not all zeroes)
\( c_1 , \ c_2 , \ \ldots , \ c_k , \) such that \( {\bf v} = c_1 {\bf v}_1 + c_2 {\bf v}_2 + \cdots + c_k {\bf v}_k .\)
That is, a linear combination of vectors from
S is a sum of scalar multiples of those vectors.
Let
S be a nonempty subset of
V. Then the
span of
S in
V
is the set of all possible (finite) linear combinations of the vectors in
S (including the zero vector). It is usually denoted by span(
S).
In other words, a
linear span of a set of vectors in a vector space is the subspace of
V equal to the intersection of all subspaces containing that set.
Example 1:
In 3-dimensional space, the electric field
E of a point charge
q1 with position vector
r1 at a point
P---called the field point---with position vector
r is given by the formula
\[
{\bf E} = \frac{k_e q_1}{\left\vert {\bf r} - {\bf r}_1 \right\vert^3} \left( {\bf r} - {\bf r}_1 \right)
\]
We define the position vectors in
matlabMathematica:
r = {x,y,z}; r1 ={x1,y1,z1} ;
When we place a semicolon at the end of an expression,
matlabMathematica does not provide any
output. Next, we will write an expression for the field
(with
ke = 1). Recall that in
matlabMathematica
vector names are followed by underscores when being called in a
function.
EField[r_ , r1_ , q1_ ] := q1/((r-r1).(r-r1))^(3/2) (r-r1)
We now take only the first two components of the field and try to make a two-dimensional plot of the field lines
{E1x,E1y} = Take[EField[{x,y,0},{1,1,0},1],2];
where
Take[list, n] takes the first
n elements of
list and make a new list of them.
VectorPlot[{E1x, E1y}, {x, 0, 2}, {y, 0, 2}, Axes -> True]
Now we introduce another location of the second charge
r2 = {x2,y2,z2} ;
Then calculate the field due to this charge at the same field point
EField2[r_ , r2_ , q2_ ] := q2/((r-r2).(r-r2))^(3/2) (r-r2)
Now add the two fields to get the total electric field at
r:
Etotal[r_, r1_, r2_, q1_, q2_] = EField[r,r1,q1] + EField2[r , r2 , q2 ]
Let us see what the field lines of a dipole look like. A dipole is a combination of two charges of equal strength and opposite signs. Let the positive charge of +1 be at (1,1,0) and the negative charge of -1 be at (2,1,0). Let us also assume that the field point is at (x,y,0). Since we are interested in a two-dimensional plot of the field lines, we separate the first two components of
Etotal
{Etotal1, Etotal2} =
vEtotal[r_] = EField[r, {1, 1, 0}, 1] + EField2[r, {2, 1, 0}, -1]
Take[Etotal[{x, y, 0}, 2];
Now we ready to plot this field
StreamPlot[{Etotal1, Etotal2}, {x, 0, 3}, {y, 0, 2}, Axes -> True,
Ticks -> None]
|
 
|
Another version of the same plot:
charge[q_, {x0_, y0_, z0_}][x_, y_, z_] :=
q/((x - x0)^2 + (y - y0)^2 + (z - z0)^2)^(3/2) {x - x0, y - y0,
z - z0};
projector[{x_, y_, z_}] := {x, y}
VectorPlot[
projector[
charge[1, {0, 4, 0}][x, y, 0] +
charge[-1, {0, -4, 0}][x, y, 0]], {x, -10, 10}, {y, -10, 10}];
StreamPlot[
projector[
charge[1, {-2, 0, 0}][x, y, 0] +
charge[-1, {2, 0, 0}][x, y, 0]], {x, -5, 5}, {y, -5, 5}]
|
Electric field potential of a dipole.
|
|
matlabMathematica code
|
First, we define the Coulomb fields at the origin using "Ec" in the code below
Ec[x_,y_] := {x/(x^2 + y^2)^(3/2), y/(x^2 + y^2)^(3/2)};
|
 
|
A complitely different vector field is obtained when we add two equal charges:
Ec[x_, y_] := {x/(x^2 + y^2)^(3/2), y/(x^2 + y^2)^(3/2)};
StreamPlot[Ec[x + 2, y] + Ec[x - 2, y], {x, -5, 5}, {y, -5, 5}]
|
Electric field potential of two equal charges.
|
|
Mathematica code
|
We can visualize vector fields in 3-dimensional space.
■
Example 2:
The vector [-2, 8, 5, 0] is a linear combination of the vectors [3, 1,
-2, 2], [1, 0, 3, -1], and [4, -2, 1 0], because it is the sum of
scalar multiples of the three vectors:
\[
2\,[3,\, 1,\, -2,\,2] + 4\,[1,\,0,\,3,\,-1] -3\,[4,\,-2,\, 1,\, 0] = [-2,\,8,\, 5,\, 0] . \qquad ■
\]
■
Both a vector and a matrix can be multiplied by a scalar; with the operation being *. Matrices and vectors can be added or subtracted only when their dimensions are the same.
Let S be a subset of a vector space V.
(1) S is a linearly independent subset of V if and only if no vector in S can be expressed as a linear combination of the other vectors in S.
(2) S is a linearly dependent subset of V if and only if some vector v in S
can be expressed as a linear combination of the other vectors in S.
Theorem 1:
A nonempty set
\( S = \{ {\bf v}_1 , \ {\bf v}_2 , \ \ldots , \ {\bf v}_r \} \) of nonzero vectors
in a vector space
V is linearly independent if and only if the only coefficients satisfying the vector equation
\[
k_1 {\bf v}_1 + k_2 {\bf v}_2 + \cdots + k_r {\bf v}_r = {\bf 0}
\]
are
\( k_1 =0, \ k_2 =0, \ \ldots , \ k_r =0 . \)
Theorem 2:
A nonempty set
\( S = \{ {\bf v}_1 , \ {\bf v}_2 , \ \ldots , \ {\bf v}_r \} \) of
r nonzero vectors
in a vector space
V is linearly independent if and only if the matrix of the column-vectors from
S has
rank r.
Let
\( S = \{ {\bf v}_1 , \ {\bf v}_2 , \ \ldots , \ {\bf v}_n \} \) be a set of vectors in a finite-dimensional vector space
V. Then
S is called
basis for
V if:
- S spans V;
- S is linearly independent.
matlab has three multiplication commands for vectors: the dot (or inner), outer products (for arbitrary vectors), and
the cross product (for three dimensional vectors).
For three dimensional vectors \( {\bf a} = a_1 \,{\bf i} + a_2 \,{\bf j} + a_3 \,{\bf k} =
\left[ a_1 , a_2 , a_3 \right] \) and
\( {\bf b} = b_1 \,{\bf i} + b_2 \,{\bf j} + b_3 \,{\bf k} = \left[ b_1 , b_2 , b_3 \right] \) , it is possible to define special multiplication, called the cross-product:
\[
{\bf a} \times {\bf b} = \det \left[ \begin{array}{ccc} {\bf i} & {\bf j} & {\bf k} \\ a_1 & a_2 & a_3 \\ b_1 & b_2 & b_3
\end{array} \right] = {\bf i} \left( a_2 b_3 - b_2 a_3 \right) - {\bf j} \left( a_1 b_3 - b_1 a_3 \right) + {\bf k} \left( a_1 b_2 - a_2 b_1 \right) .
\]
The cross product can be done on two vectors. It is important to note that the cross product is an operation that is only functional in three dimensions. The operation can be computed using the Cross[vector 1, vector 2] operation or by generating a cross product operator between two vectors by pressing [Esc] cross [Esc]. ([Esc] refers to the escape button)
The dot product of two vectors of the same size
\( {\bf x} = \left[ x_1 , x_2 , \ldots , x_n \right] \) and
\( {\bf y} = \left[ y_1 , y_2 , \ldots , y_n
\right] \) (regardless of whether they are columns or rows
because matlabMathematica does not distinguish rows from columns) is the number,
denoted either by \( {\bf x} \cdot {\bf y} \) or \( \left\langle {\bf x} , {\bf y} \right\rangle ,\)
\[
\left\langle {\bf x} , {\bf y} \right\rangle = {\bf x} \cdot {\bf y} = x_1 y_1 + x_2 y_2 + \cdots + x_n y_n ,
\]
when entries are real, or
\[
\left\langle {\bf x} , {\bf y} \right\rangle = {\bf x} \cdot {\bf y} = \overline{x_1} y_1 + \overline{x_2} y_2 + \cdots + \overline{x_n} y_n ,
\]
when entries are complex.
Here \( \overline{\bf x} = \overline{a + {\bf j}\, b} =
a - {\bf j}\,b \) is a complex conjugate of a complex number
x = a + jb.
The dot product of any two vectors of the same dimension can be done with the dot operation given as Dot[vector 1, vector 2] or with use of a period “. “ .
or
With Euclidean norm ‖·‖2, the dot product formula
\[
{\bf x} \cdot {\bf y} = \| {\bf x} \|_2 \, \| {\bf y} \|_2 \, \cos \theta ,
\]
defines θ, the angle between two vectors.
The dot product was first introduced by the American physicist and
mathematician
Josiah Willard Gibbs (1839--1903) in the 1880s. ■
An outer product is the tensor product of two coordinate vectors \( {\bf u} = \left[ u_1 , u_2 , \ldots , u_m \right] \) and
\( {\bf v} = \left[ v_1 , v_2 , \ldots , v_n \right] , \) denoted \( {\bf u} \otimes {\bf v} , \) is
an m-by-n matrix W of rank 1 such that its coordinates satisfy \( w_{i,j} = u_i v_j . \)
The outer product \( {\bf u} \otimes {\bf v} , \) is equivalent to a matrix multiplication
\( {\bf u} \, {\bf v}^{\ast} , \) (or \( {\bf u} \, {\bf v}^{\mathrm T} , \) if vectors are real) provided that u is represented as a
column \( m \times 1 \) vector, and v as a column \( n \times 1 \) vector. Here \( {\bf v}^{\ast} = \overline{{\bf v}^{\mathrm T}} . \)
Example 3:
Taking, for instance,
m = 4 and
n = 3, we have
\[
{\bf u} \otimes {\bf v} = {\bf u} \, {\bf v}^{\mathrm T} = \begin{bmatrix} u_1 \\ u_2 \\ u_3 \\ u_4 \end{bmatrix} \begin{bmatrix} v_1 & v_2 & v_3 \end{bmatrix} =
\begin{bmatrix} u_1 v_1 & u_1 v_2 & u_1 v_3 \\ u_2 v_1 & u_2 v_2 & u_2 v_3 \\ u_3 v_1 & u_3 v_2 & u_3 v_3 \\ u_4 v_1 & u_4 v_2 & u_4 v_3 \end{bmatrix} .
\]
If we take two vectors
\( {\bf u} = [1, 2, 3, 4] \) and
\( {\bf v} = [-1, 0, 2] , \) then their outer product is
\[
{\bf u} \otimes {\bf v} = {\bf u} \, {\bf v}^{\mathrm T} = \begin{bmatrix} -1 &0&2 \\ -2&0&4 \\ -3&0&6 \\ -4&0&8 \end{bmatrix} ,
\]
Here command
rank
is the rank of matrix
outer
. ■
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 properties:
- \( \left\langle {\bf v}+{\bf u} , {\bf w} \right\rangle = \left\langle {\bf v} , {\bf w} \right\rangle + \left\langle {\bf u} , {\bf w} \right\rangle . \)
-
\( \left\langle {\bf v} , \alpha {\bf u} \right\rangle = \alpha \left\langle {\bf v} , {\bf u} \right\rangle \) for any scalar α.
- \( \left\langle {\bf v} , {\bf u} \right\rangle = \overline{\left\langle {\bf u} , {\bf v} \right\rangle} , \) where overline means complex conjugate.
-
\( \left\langle {\bf v} , {\bf v} \right\rangle \ge 0 , \) and equal if and only if
\( {\bf v} = {\bf 0} . \)
The fourth condition in the list above is known as the positive-definite condition. 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
\[
\| {\bf u} \| = \sqrt{\left\langle {\bf u} , {\bf u} \right\rangle} .
\]
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} . \)
If
A is an
n ×
n positive definite matrix and
u and
v are
n-vectors, then we can define the weighted Euclidean inner product
\[
\left\langle {\bf u} , {\bf v} \right\rangle = {\bf A} {\bf u} \cdot {\bf v} = {\bf u} \cdot {\bf A}^{\ast} {\bf v} \qquad\mbox{and} \qquad {\bf u} \cdot {\bf A} {\bf v} = {\bf A}^{\ast} {\bf u} \cdot {\bf v} .
\]
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 ℝ
n, then the formula
\[
\left\langle {\bf u} , {\bf v} \right\rangle = w_1 u_1 v_1 + w_2 u_2 v_2 + \cdots + w_n u_n v_n
\]
defines an inner product on
\( \mathbb{R}^n , \) that is called the
weighted Euclidean inner product with weights
w1,
w2, ... ,
wn.
Example 4:
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
\[
\left\langle {\bf u} , {\bf v} \right\rangle = {\bf A} {\bf u} \cdot {\bf A} {\bf v} = {\bf v}^{\mathrm T} {\bf A}^{\mathrm T} {\bf A} {\bf u}
\]
defines an inner product generated by
A.
Example 5:
In the set of integrable functions on an interval [a,b], we can define the inner product of two functions
f and
g as
\[
\left\langle f , g \right\rangle = \int_a^b \overline{f} (x)\, g(x) \, {\text d}x \qquad\mbox{or} \qquad
\left\langle f , g \right\rangle = \int_a^b f(x)\,\overline{g} (x) \, {\text d}x .
\]
Then the norm
\( \| f \| \) (also called
the 2-norm or 𝔏²
norm) becomes the square root of
\[
\| f \|^2 = \left\langle f , f \right\rangle = \int_a^b \left\vert f(x) \right\vert^2 \, {\text d}x .
\]
In particular, the 2-norm of the function
\( f(x) = 5x^2 +2x -1 \) on the interval [0,1] is
\[
\| 2 x^2 +2x -1 \| = \sqrt{\int_0^1 \left( 5x^2 +2x -1 \right)^2 {\text d}x } = \sqrt{7} .
\]
Example 6:
Consider a set of polynomials of degree
n. If
\[
{\bf p} = p(x) = p_0 + p_1 x + p_2 x^2 + \cdots + p_n x^n \quad\mbox{and} \quad {\bf q} = q(x) = q_0 + q_1 x + q_2 x^2 + \cdots + q_n x^n
\]
are two polynomials, and if
\( x_0 , x_1 , \ldots , x_n \) are distinct real numbers (called sample points), then the formula
\[
\left\langle {\bf p} , {\bf q} \right\rangle = p(x_0 ) q(x_0 ) + p_1 (x_1 )q(x_1 ) + \cdots + p(x_n ) q(x_n )
\]
defines an inner product, which is called the evaluation inner product at
\( x_0 , x_1 , \ldots , x_n . \) ■
The invention of Cartesian coordinates in 1649 by René Descartes (Latinized name: Cartesius) revolutionized mathematics by providing the first systematic link between Euclidean geometry and algebra.
In order to define how close two vectors are, and in order to define the convergence of sequences of vectors, we can use the notion of a
norm. We will heavily use the following notation for nonnegative real numbers:
\[
\mathbb{R}_{+} = \left\{ x \in \mathbb{R} \, : \, x\ge 0 \right\} .
\]
with appropriate addition and multiplication operations. The unit vector in positive vertical direction is denoted by
² = −1. Also recall that if
.
\[
\| {\bf x} \|_2 = \sqrt{ {\bf x}\cdot {\bf x}} = \sqrt{x_1^2 + x_2^2 + \cdots + x_n^2} .
\]
is a vector space with an additional structure called an inner product. So every inner product space inherits the Euclidean norm and becomes a metric space.
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
\[
\| {\bf z} \| = \sqrt{ {\bf z}\cdot {\bf z}} = \sqrt{\overline{z_1} \,z_1 + \overline{z_2}\,z_2 + \cdots + \overline{z_n}\,z_n} = \sqrt{|z_1|^2 + |z_2 |^2 + \cdots + |z_n |^2} .
\]