Null vector (zero vector) — definition, properties, and role in linear algebra
The null vector (zero vector) is the additive identity in a vector space. This article gives its definition, basic properties, common examples and its role in linear independence, bases, kernels and solving linear systems.
Overview. In linear algebra the null vector, commonly called the zero vector and often written as 0 or \mathbf{0}, is the unique element that leaves other vectors unchanged under addition. It plays the role of the additive identity (the identity element for addition) in any vector space. The concept is elementary but central to many constructions and proofs in linear algebra.
Definition and basic properties
Formally, a null vector is an element 0 of a vector space V such that for every vector v in V, v + 0 = v. From the axioms of vector spaces this element is unique. In coordinate descriptions such as n-dimensional coordinate space, the null vector has all components equal to the scalar zero.
- Uniqueness: if w also satisfies v + w = v for all v then w = 0.
- For any scalar c and vector v, c·0 = 0 and 0·v = 0 (where the latter means the scalar zero times v is the null vector).
- The only vector v with v = -v is the null vector; additive inverses satisfy v + (-v) = 0.
Examples and concrete instances
Common examples include the vector (0,0,...,0) in Rn, the zero function in a function space (the function that is zero at every argument), and the zero matrix in a space of matrices. These concrete cases are used when solving linear equations and when checking whether sets of vectors satisfy particular properties.
Role in linear independence, bases and kernels
The null vector is central to the definition of linear independence: vectors v1,...,vk are linearly independent if the only scalars a1,...,ak with a1v1 + ... + akvk = 0 are all zero. A basis of a vector space is a linearly independent set that spans the space; the null vector cannot be a member of a basis because its presence would make the set dependent. The kernel or null space of a linear map consists of all vectors sent to the null vector and provides a measure of how far the map is from being injective.
Use in proofs and computations
Many standard proofs use the null vector as a convenient target for equalities: for example, showing that a linear combination equals the null vector often signals dependence. Properties such as uniqueness of additive inverses, cancellation in sums, and the distributive relations that produce c·0 = 0 are straightforward consequences of the vector space axioms and are used repeatedly in arguments.
Remarks and distinctions
Although the notation overlaps, the scalar 0 and the null vector are distinct: the former is a number in the underlying field, the latter is an element of the vector space. Context and type separate them: when one writes 0 in V it denotes the null vector of V. The concept also extends to vector spaces over arbitrary fields: the same defining property (v + 0 = v for all v) characterizes the null vector whether the scalars are real numbers, complex numbers, or elements of another field.
Summary. The null vector is an elementary but indispensable element of linear algebra. It functions as the additive identity in every vector space, appears in definitions of independence and kernels, and frequently serves as the target for linear combinations and equations used in both theory and computation.
Author
AlegsaOnline.com Null vector (zero vector) — definition, properties, and role in linear algebra Leandro Alegsa
URL: https://en.alegsaonline.com/art/71414