maths.freeAbstract Algebra › 20. Vector Spaces › Definitions and Examples

Definitions and Examples

A vector space V over a field F is an abelian group with a scalar product \alpha \cdot v or \alpha v defined for all \alpha \in F and all v \in V satisfying the following axioms. \alpha(\beta v) =(\alpha \beta)v;

Definitions and Examples

A vector space \(V\) over a field \(F\) is an abelian group with a scalar product \(\alpha \cdot v\) or \(\alpha v\) defined for all \(\alpha \in F\) and all \(v \in V\) satisfying the following axioms.

  • \(\alpha(\beta v) =(\alpha \beta)v\);

  • \((\alpha + \beta)v =\alpha v + \beta v\);

  • \(\alpha(u + v) = \alpha u + \alpha v\);

  • \(1v=v\);

where \(\alpha, \beta \in F\) and \(u, v \in V\).

The elements of \(V\) are called vectors; the elements of \(F\) are called scalars. It is important to notice that in most cases two vectors cannot be multiplied. In general, it is only possible to multiply a vector with a scalar. To differentiate between the scalar zero and the vector zero, we will write them as 0 and \({\mathbf 0}\), respectively.

Let us examine several examples of vector spaces. Some of them will be quite familiar; others will seem less so.

Example

The \(n\)-tuples of real numbers, denoted by \({\mathbb R}^n\), form a vector space over \({\mathbb R}\). Given vectors \(u = (u_1, \ldots, u_n)\) and \(v = (v_1, \ldots, v_n)\) in \({\mathbb R}^n\) and \(\alpha\) in \({\mathbb R}\), we can define vector addition by \[\begin{aligned}\end{aligned}\] and scalar multiplication by \[\begin{aligned}\end{aligned}\].

Example

If \(F\) is a field, then \(F[x]\) is a vector space over \(F\). The vectors in \(F[x]\) are simply polynomials, and vector addition is just polynomial addition. If \(\alpha \in F\) and \(p(x) \in F[x]\), then scalar multiplication is defined by \(\alpha p(x)\).

Example

The set of all continuous real-valued functions on a closed interval \([a,b]\) is a vector space over \({\mathbb R}\). If \(f(x)\) and \(g(x)\) are continuous on \([a, b]\), then \((f+g)(x)\) is defined to be \(f(x) + g(x)\). Scalar multiplication is defined by \((\alpha f)(x) = \alpha f(x)\) for \(\alpha \in {\mathbb R}\). For example, if \(f(x) = \sin x\) and \(g(x)= x^2\), then \((2f + 5g)(x) =2 \sin x + 5 x^2\).

Example

Let \(V = {\mathbb Q}(\sqrt{2}\, ) = \{ a + b \sqrt{2} : a, b \in {\mathbb Q } \}\). Then \(V\) is a vector space over \({\mathbb Q}\). If \(u = a + b \sqrt{2}\) and \(v = c + d \sqrt{2}\), then \(u + v = (a + c) + (b + d ) \sqrt{2}\) is again in \(V\). Also, for \(\alpha \in {\mathbb Q}\), \(\alpha v\) is in \(V\). We will leave it as an exercise to verify that all of the vector space axioms hold for \(V\).

Condensed — the full section is in Judson, Abstract Algebra: Theory and Applications.

Symbols used here

\sqrt{x},\ \sqrt[n]{x}
square root, n-th root
The non-negative number whose square (n-th power) is x.
\sin,\ \cos,\ \tan
sine, cosine, tangent
Ratios of sides in a right triangle; coordinates on the unit circle.
x \in A,\ A \subseteq B
element of, subset
x belongs to A; every element of A is in B.
\mathbb{N},\ \mathbb{Z},\ \mathbb{Q},\ \mathbb{R},\ \mathbb{C}
number sets
Naturals, integers, rationals, reals, complex numbers.
\blacksquare\ \text{or}\ \square
end of proof (halmos)
Marks the point where the statement has been established.
a \equiv b \pmod n
congruent modulo n
n divides a − b; a and b have the same remainder.
a \mid b,\ \gcd(a,b)
divides, greatest common divisor
b is a multiple of a; the largest number dividing both.
(G, \cdot),\ e,\ g^{-1}
group, identity, inverse
A set with an operation; the do-nothing element; the element that undoes g.
G \cong H,\ G / N
isomorphic, quotient group
Same structure; the group of cosets of a normal subgroup N.
\mathbb{Z}/n\mathbb{Z},\ \mathbb{Z}_n
integers modulo n
The remainders 0…n−1 with clock arithmetic.
\operatorname{Hom}(A, B),\ f \circ g
arrows from A to B, composition
The set of morphisms; do g then f.

Questions people ask

What is a group, in plain words?

A set with one operation that is associative, has an identity, and lets every element be undone. Symmetries of any object form a group — that is where the idea came from.

What is the difference between a ring and a field?

A ring has addition and multiplication that behave like the integers (you cannot always divide); a field is a ring where every non-zero element has a reciprocal, like the rationals or the reals.

Обиди се со себе.

Parts of this page are adapted from Judson, Abstract Algebra: Theory and Applications (GFDL 1.3). Condensed and re-explained here; errors are ours.

Повеќе во Abstract Algebra