Dimension (vector space)

In mathematics, the dimension of a vector space V is the cardinality (i.e., the number of vectors) of a basis of V over its base field.^[1]^[2] It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to distinguish it from other types of dimension.

For every vector space there exists a basis,^[a] and all bases of a vector space have equal cardinality;^[b] as a result, the dimension of a vector space is uniquely defined. We say $V$ is finite-dimensional if the dimension of $V$ is finite, and infinite-dimensional if its dimension is infinite.

The dimension of the vector space $V$ over the field $F$ can be written as $\dim _{F}(V)$ or as $[V:F],$ read "dimension of $V$ over $F$ ". When $F$ can be inferred from context, $\dim(V)$ is typically written.

Examples

The vector space $\mathbb {R} ^{3}$ has $\left\{{\begin{pmatrix}1\\0\\0\end{pmatrix}},{\begin{pmatrix}0\\1\\0\end{pmatrix}},{\begin{pmatrix}0\\0\\1\end{pmatrix}}\right\}$ as a standard basis, and therefore $\dim _{\mathbb {R} }(\mathbb {R} ^{3})=3.$ More generally, $\dim _{\mathbb {R} }(\mathbb {R} ^{n})=n,$ and even more generally, $\dim _{F}(F^{n})=n$ for any field $F.$

The complex numbers $\mathbb {C}$ are both a real and complex vector space; we have $\dim _{\mathbb {R} }(\mathbb {C} )=2$ and $\dim _{\mathbb {C} }(\mathbb {C} )=1.$ So the dimension depends on the base field.

The only vector space with dimension $0$ is $\{0\},$ the vector space consisting only of its zero element.

Properties

If $W$ is a linear subspace of $V$ then $\dim(W)\leq \dim(V).$

To show that two finite-dimensional vector spaces are equal, the following criterion can be used: if $V$ is a finite-dimensional vector space and $W$ is a linear subspace of $V$ with $\dim(W)=\dim(V),$ then $W=V.$

The space $\mathbb {R} ^{n}$ has the standard basis $\left\{e_{1},\ldots ,e_{n}\right\},$ where $e_{i}$ is the $i$ -th column of the corresponding identity matrix. Therefore, $\mathbb {R} ^{n}$ has dimension $n.$

Any two finite dimensional vector spaces over $F$ with the same dimension are isomorphic. Any bijective map between their bases can be uniquely extended to a bijective linear map between the vector spaces. If $B$ is some set, a vector space with dimension $|B|$ over $F$ can be constructed as follows: take the set $F(B)$ of all functions $f:B\to F$ such that $f(b)=0$ for all but finitely many $b$ in $B.$ These functions can be added and multiplied with elements of $F$ to obtain the desired $F$ -vector space.

An important result about dimensions is given by the rank–nullity theorem for linear maps.

If $F/K$ is a field extension, then $F$ is in particular a vector space over $K.$ Furthermore, every $F$ -vector space $V$ is also a $K$ -vector space. The dimensions are related by the formula $\dim _{K}(V)=\dim _{K}(F)\dim _{F}(V).$ In particular, every complex vector space of dimension $n$ is a real vector space of dimension $2n.$

Some formulae relate the dimension of a vector space with the cardinality of the base field and the cardinality of the space itself. If $V$ is a vector space over a field $F$ and if the dimension of $V$ is denoted by $\dim V,$ then:

If dim

V

is finite then

|V|=|F|^{\dim V}.

If dim

V

is infinite then

|V|=\max(|F|,\dim V).

Generalizations

A vector space can be seen as a particular case of a matroid, and in the latter there is a well-defined notion of dimension. The length of a module and the rank of an abelian group both have several properties similar to the dimension of vector spaces.

The Krull dimension of a commutative ring, named after Wolfgang Krull (1899–1971), is defined to be the maximal number of strict inclusions in an increasing chain of prime ideals in the ring.

Trace

The dimension of a vector space may alternatively be characterized as the trace of the identity operator. For instance, $\operatorname {tr} \ \operatorname {id} _{\mathbb {R} ^{2}}=\operatorname {tr} \left({\begin{smallmatrix}1&0\\0&1\end{smallmatrix}}\right)=1+1=2.$ This appears to be a circular definition, but it allows useful generalizations.

Firstly, it allows for a definition of a notion of dimension when one has a trace but no natural sense of basis. For example, one may have an algebra $A$ with maps $\eta :K\to A$ (the inclusion of scalars, called the unit) and a map $\epsilon :A\to K$ (corresponding to trace, called the counit). The composition $\epsilon \circ \eta :K\to K$ is a scalar (being a linear operator on a 1-dimensional space) corresponds to "trace of identity", and gives a notion of dimension for an abstract algebra. In practice, in bialgebras, this map is required to be the identity, which can be obtained by normalizing the counit by dividing by dimension ( $\epsilon :=\textstyle {\frac {1}{n}}\operatorname {tr}$ ), so in these cases the normalizing constant corresponds to dimension.

Alternatively, it may be possible to take the trace of operators on an infinite-dimensional space; in this case a (finite) trace is defined, even though no (finite) dimension exists, and gives a notion of "dimension of the operator". These fall under the rubric of "trace class operators" on a Hilbert space, or more generally nuclear operators on a Banach space.

A subtler generalization is to consider the trace of a family of operators as a kind of "twisted" dimension. This occurs significantly in representation theory, where the character of a representation is the trace of the representation, hence a scalar-valued function on a group $\chi :G\to K,$ whose value on the identity $1\in G$ is the dimension of the representation, as a representation sends the identity in the group to the identity matrix: $\chi (1_{G})=\operatorname {tr} \ I_{V}=\dim V.$ The other values $\chi (g)$ of the character can be viewed as "twisted" dimensions, and find analogs or generalizations of statements about dimensions to statements about characters or representations. A sophisticated example of this occurs in the theory of monstrous moonshine: the $j$ -invariant is the graded dimension of an infinite-dimensional graded representation of the monster group, and replacing the dimension with the character gives the McKay–Thompson series for each element of the Monster group.^[3]

Notes

^ if one assumes the axiom of choice
^ see dimension theorem for vector spaces

References

^ Itzkov, Mikhail (2009). Tensor Algebra and Tensor Analysis for Engineers: With Applications to Continuum Mechanics. Springer. p. 4. ISBN 978-3-540-93906-1.
^ Axler (2015) p. 44, §2.36
^ Gannon, Terry (2006), Moonshine beyond the Monster: The Bridge Connecting Algebra, Modular Forms and Physics, Cambridge University Press, ISBN 0-521-83531-3

Sources

Axler, Sheldon (2015). Linear Algebra Done Right. Undergraduate Texts in Mathematics (3rd ed.). Springer. ISBN 978-3-319-11079-0.

External links

MIT Linear Algebra Lecture on Independence, Basis, and Dimension by Gilbert Strang at MIT OpenCourseWare

[3] ssumes the axiom of choice

[4] see dimension theorem for vector spaces

[1] Itzkov, Mikhail (2009). Tensor Algebra and Tensor Analysis for Engineers: With Applications to Continuum Mechanics. Springer. p. 4. ISBN 978-3-540-93906-1.

[2] Axler (2015) p. 44, §2.36

[gannon-5] Gannon, Terry (2006), Moonshine beyond the Monster: The Bridge Connecting Algebra, Modular Forms and Physics, Cambridge University Press, ISBN 0-521-83531-3

[1]

[2]

[a]

[b]

[3]

v t e Dimension
Dimensional spaces	Vector space Euclidean space Affine space Projective space Free module Manifold Algebraic variety Spacetime
Other dimensions	Krull Lebesgue covering Inductive Hausdorff Minkowski Fractal Degrees of freedom
Polytopes and shapes	Hyperplane Hypersurface Hypercube Hyperrectangle Demihypercube Hypersphere Cross-polytope Simplex Hyperpyramid
Dimensions by number	Zero One Two Three Four Five Six Seven Eight n-dimensions
See also	Hyperspace Codimension
Category

v t e Linear algebra
Outline Glossary
Basic concepts	Scalar Vector Vector space Scalar multiplication Vector projection Linear span Linear map Linear projection Linear independence Linear combination Multilinear map Basis Change of basis Row and column vectors Row and column spaces Kernel Eigenvalues and eigenvectors Transpose Linear equations
Matrices	Block Decomposition Invertible Minor Multiplication Rank Transformation Cramer's rule Gaussian elimination
Bilinear	Orthogonality Dot product Hadamard product Inner product space Outer product Kronecker product Gram–Schmidt process
Multilinear algebra	Determinant Cross product Triple product Seven-dimensional cross product Geometric algebra Exterior algebra Bivector Multivector Tensor Outermorphism
Vector space constructions	Dual Direct sum Function space Quotient Subspace Tensor product
Numerical	Floating-point Numerical stability Basic Linear Algebra Subprograms Sparse matrix Comparison of linear algebra libraries
Category