Vector Spaces

Precise definition

A vector space over a field $\mathbb F$ is a set $V$ with addition and scalar multiplication satisfying closure, associativity, commutativity of addition, an additive identity and inverses, distributive laws, scalar associativity, and $1v=v$. The operations are part of the structure.

Notation and mathematical language

Vectors need not be arrows: polynomials, matrices, functions, and sequences form vector spaces under suitable pointwise operations. Scalars come from the declared field. The zero vector and negative of a vector are determined uniquely by the axioms.

Conceptual picture

The axioms capture exactly the algebra that permits linear combinations. Once they hold, span, independence, basis, and dimension apply without relying on geometric appearance.

Conditions and key results

Closure must use the specified operations, which may be nonstandard. A set can fail from one counterexample. Restrictions like degree exactly $n$, positive entries, or determinant 1 usually fail zero or addition/scaling closure.

A reliable strategy

1. State the set, scalar field, and definitions of addition and scalar multiplication.
2. Check closure and identify zero and additive inverses under those operations.
3. Verify the remaining axioms, inheriting them from a known ambient space when justified.
4. If the structure is a vector space, find useful subspaces or a basis; otherwise give one decisive axiom failure.

Fully worked example

Interpretation and application

Vector spaces unify coordinates, signals, solution families, and data features. Modelling an object linearly assumes addition and scaling are meaningful; probabilities or physical states with constraints may form convex sets rather than vector spaces.

Common mistakes

Verification and reasonableness

• Test zero, scalar zero, and a negative scalar as quick stress cases.
• Derive $0v=0$ and $(-1)v=-v$ from the proposed operations.
• Construct coordinates in a basis and reconstruct arbitrary elements.

Practice

1. Is the set of real $2\times2$ matrices a vector space?
2. Are positive real numbers a real vector space under ordinary operations?
3. What is a vector in $P_2$?

Further deduction

The field can change dimension: $\mathbb C$ is one-dimensional over itself with basis $(1)$, but two-dimensional over $\mathbb R$ with basis $(1,i)$. A complex-linear map must respect complex scalars, a stronger condition than real linearity. Therefore every dimension or linearity statement should identify its scalar field when ambiguity is possible.

Quotient spaces turn cosets $v+W$ into vectors by identifying elements that differ by a subspace vector. Their dimension is $\dim(V/W)=\dim V-\dim W$ in finite dimensions. This construction formalizes 'information remaining after ignoring directions in $W$' and underlies the first isomorphism theorem.

Infinite-dimensional spaces show why a basis need not be finite. The polynomial space $\mathbb R[x]$ is spanned by $1,x,x^2,\ldots$, and every individual polynomial uses only finitely many of these basis vectors. No finite subset spans polynomials of arbitrarily high degree. In more advanced analysis, topological notions of infinite series lead to Schauder or orthonormal bases, which should not be conflated with the algebraic Hamel-basis definition used in finite-dimensional linear algebra.

Related topics

• Subspaces
• Basis
• Linear Transformations