5.1. Definitions#
(Binary operation)
A binary operation is a mapping of two elements of the same set \(S\) whose output is also an element of \(S\).
The symbol \(\times\) is used to denote the Cartesian product and \(\to\) denotes a mapping from one set to another.
We have already met examples of binary operations in addition, multiplication, subtraction and division of real numbers. If \(a,b \in \mathbb{R}\) then the following operations all output real numbers
\(f(a,b) = a + b\)
\(f(a,b) = a \cdot b\)
\(f(a,b) = a - b\)
\(f(a,b) = a \div b\)
Another example is for the set of all \(2 \times 2\) matrices \(M_{2 \times 2}(\mathbb{R})\), \(f(A, B) = AB\) is a binary operation since \(AB\) is also a \(2 \times 2\) matrix.
(Field)
A field is a set \(F\) together with two binary operations on elements of \(F\) called addition and multiplication. If \(a,b \in F\) then addition is written as \(a + b\) and multiplication is written as \(a \times b\).
The classic example of a field is a set of numbers which will suffice for what we will be doing here. However, a field can be any set of objects for which the above definition is satisfied and you may meet other examples of fields in your studies in the future.
(Vector space)
A vector space over a field \(F\) is a non-empty set \(V\) of objects called vectors on which the binary operations below are defined
addition \((+)\): \(V \times V \to V\). For example, given two elements \(u, v \in V\) we can ‘add’ them together to obtain another element \(u + v \in V\).
scalar multiplication \((\cdot)\): \(F \times V \to V\). For example given \(\alpha \in F\) and \(u \in V\) we can ‘multiply’ \(u\) by \(\alpha\) to obtain another element \(\alpha \cdot u \in V\)
For example, a field could be the set of all real numbers \(\mathbb{R}\) and a vector space be the set of all vectors in \(\mathbb{R}^3\) since we can add two vectors and multiply a vector by a scalar. Not all subsets of a field can be classified as a vector space, to do so the set \(V\) must satisfy the following axioms.
(Axioms of a vector space)
Let \(u, v, w \in V\) and \(\alpha, \beta \in F\), \(V\) is a vector space if all of the following axioms are satisfied
A1: Associativity of vector addition: \(u + (v + w) = (u + v) + w\)
A2: Commutativity of vector addition: \(u + v = v + u\)
A3: Identity element of vector addition: there exists an element \(0 \in V\) such that \(u + 0 = u\) for all \(v \in V\)
A4: Additive inverse: For every \(u \in V\) there exists an element \(- v \in V\), called the additive inverse, such that \(u + (- u) = 0\)
M1: Associativity of scalar multiplication: \(\alpha(\beta u) = (\alpha \beta) u\)
M2: Identity element of scalar multiplication: there exists an element \(1\) called the multiplicative identity such that \(1 u = u\)
M3: Distributivity of scalar multiplication with respect to vector addition: \(\alpha(u + v) = \alpha u + \alpha v\)
M4: Distributivity of scalar multiplication with respect to addition: \((\alpha + \beta)u = \alpha u + \beta u\)
The first group of four axioms are concerned with addition and the second group of four axioms are concerned with scalar multiplication. When the scalars are real numbers, e.g., \(F = \mathbb{R}\), we call \(V\) a ‘real vector space’ which is short for a ‘vector space over the field of real numbers’. When the scalars are complex numbers, e.g., \(F=\mathbb{C}\), we talk of a ‘complex vector space’.
We now list some basic properties for multiplication by scalars in a vector space.
(Properties of vector spaces)
Let \(V\) be a vector space over \(F\) and \(u \in V,\alpha\in F\). Then the following hold:
\(\alpha \cdot 0 = 0\);
\(0 \cdot u = 0\);
if \(\alpha u = 0\) then either \(\alpha = 0\) or \(u = 0\);
\(-(\alpha u) = (-\alpha)u = \alpha (-u)\).
The name ‘vector space’ indicates a connection with the study of vectors. Indeed our Euclidean spaces \(\mathbb{R}^n\), as introduced in Vectors, are vector spaces over \(F=\mathbb{R}\). Addition and scalar multiplication, in the sense of a vector space, for \(\mathbb{R}^n\) are as given in vector addition and scalar multiplication respectively. Euclidean vector spaces are often the first examples of vector spaces that a student meets. However, maybe they do not quite demonstrate the power behind this construction. The real motivation of the study of the vector spaces comes from the fact that a lot of more abstract sets, such as differentiable functions or matrices, can be viewed as vector spaces. Everything that we learn about vector spaces can be then applied to any set which satisfies the definition of a vector space. This means that the set of \(m\times n\) matrices with matrix addition and scalar multiplication or the set of all polynomials of degree at most \(n\), in some sense, behave in a very similar fashion to Euclidean space.
Show that the following are vector spaces:
(i) The set of real numbers over itself;
Solution
We need to check that all of the axioms of vector spaces are satisfied. Here \(V = \mathbb{R}\), \(F = \mathbb{R}\) and let \(u, v, w \in V\) and \(\alpha, \beta \in \mathbb{R}\)
A1: \(u + (v + w) = (u + v) + w \quad \checkmark\)
A2: \(u + v = v + u \quad \checkmark\)
A3: \(u + 0 = u \quad \checkmark\) (i.e., 0 is the identity element of addition)
A4: \(u + (-u) = 0 \quad \checkmark\) (i.e., the negative of any number is the additive inverse)
M1: \(\alpha(\beta u) = (\alpha \beta) u \quad \checkmark\)
M2: \(1 u = u \quad \checkmark\) (i.e., 1 is the multiplicative identity of all numbers)
M3: \(\alpha(u + v) = \alpha u + \alpha v \quad \checkmark\)
M4: \((\alpha + \beta) u = \alpha u + \beta u \quad \checkmark\)
(ii) The set of all polynomials of degree at most \(n\) with real coefficients \(P_n(\mathbb{R})\)
where \(a_i \in \mathbb{R}\) and \(x\) is some variable. Show that \(P(\mathbb{R}_n)\) is a vector space.
Solution
Let \(u(x), v(x), w(x) \in P_n(\mathbb{R})\) where \(u_i, v_i, w_i \in \mathbb{R}\) are the coefficients for \(u(x)\), \(v(x)\) and \(w(x)\) respectively and \(k\in \mathbb{R}\) is some scalar then we define
Vector addition:
Scalar multiplication:
Additive identity element is the zero polynomial
The additive inverse to the polynomial \(p\) is
Checking the that axioms of vector spaces are satisfied
A1: Associativity of addition
A2: Commutativity of addition
A3: Identity element for addition
A4: Inverse element for addition
M1: Associativity of scalar multiplication
M2: Identity element for scalar multiplication
M3: Distributivity of scalar multiplication
M4: Distributivity of scalar multiplication over addition
5.1.1. Examples of non-vector spaces#
Of course not all sets are vector spaces. For example, consider the set of integers \(\mathbb{Z}\) over the field \(F=\mathbb{R}\). It is easy to show that the axioms A1 to A4 are satisfied for the set of integers. The problem comes when one tries to define scalar multiplication. From the definition of scalar multiplication, \(\mathbb{R} \times \mathbb{Z} \to \mathbb{Z}\) so for \(u \in \mathbb{Z}\) and \(\alpha \in \mathbb{R}\), \(\alpha x\in \mathbb{Z}\). However, this is not always the case, for example, when \(u=1\) and \(\alpha = \frac{1}{2}\) we have \(\frac{1}{2} \cdot 1 = \frac{1}{2} \notin \mathbb{Z}\). This was an example of a proof by counterexample where we just need to show 1 instance where the axioms are not satisfied to prove that we do not have a vector space.
Show that the following a not vector spaces:
(i) The set of all positive real numbers, \(\mathbb{R}_+\) over itself;
Solution
We do not have an identity element for addition since \(0 \notin \mathbb{R}_+\) so axiom A3 is not satisfied. Also, by axiom A4, if \(u, v \in \mathbb{R}_+\) are two positive real numbers then \(x + y > 0\) so no additive inverse exists.
(ii) \(V\) is defined to be a parabola \(y=x^2\) in \(\mathbb{R}^2\), i.e., all the points in \(\mathbb{R}^2\) defined by \(V = {(x, x^2)}\).
Solution
If we take the example \(\vec{u} \in V\) such that \(\vec{u} = (1, 1)^\mathsf{T}\) then the additive inverse \(-\vec{u}^\mathsf{T} = (-1, -1) \notin V\) so \(V\) is not a vector space.