Let X\mathbb{X} be a set. A binary operation on X\mathbb{X} is a function X×X→X\mathbb{X} \times \mathbb{X} \rightarrow \mathbb{X} that maps each ordered pair of elements of X\mathbb{X} to an element of X.\mathbb{X}.

A field F\mathbb{F} is a set with two binary operations, called addition a+ba+b and multiplication a⋅b,a \cdot b, that satisfy the field axioms for all a,b,c∈F:a,b,c \in \mathbb{F}:

  • Associativity of addition and multiplication: a+(b+c)=(a+b)+ca + (b + c) = (a + b) + c and a⋅(b⋅c)=(a⋅b)⋅c.a \cdot (b \cdot c) = (a \cdot b) \cdot c.
  • Commutativity of addition and multiplication: a+b=b+aa + b = b + a and a⋅b=b⋅a.a \cdot b = b \cdot a.
  • Distributivity of multiplication over addition: a⋅(b+c)=(a⋅b)+(a⋅c).a \cdot (b + c) = (a \cdot b) + (a \cdot c).
  • Additive and multiplicative identity: ∃ 0,1∈F\exists \, 0, 1 \in \mathbb{F} with 0≠10 \neq 1 such that a+0=aa + 0 = a and a⋅1=a  ∀ a∈F.a \cdot 1 = a \,\, \forall \, a \in \mathbb{F}.
  • Additive and multiplicative inverse: ∀ a∈F  ∃ −a∈F:a+(−a)=0\forall \, a \in \mathbb{F} \,\, \exists \, {-}a \in \mathbb{F} : a+(-a)=0 and ∀ a∈F∖{0}  ∃ a−1∈F:a⋅a−1=1.\forall \, a \in \mathbb{F}\setminus \{0\} \,\, \exists \, a^{-1} \in \mathbb{F} : a \cdot a^{-1} = 1.

Let F\mathbb{F} be a field. An element λ∈F\lambda \in \mathbb{F} is a scalar. The real numbers R\mathbb{R} and the complex numbers C\mathbb{C} are fields, and usually F=R\mathbb{F}=\mathbb{R} or F=C.\mathbb{F}=\mathbb{C}.

Let F\mathbb{F} be a field and V\mathcal{V} be a set with a binary operation called addition u‾+v‾\underline{u} + \underline{v} and a function called scalar multiplication F×V→V,\mathbb{F} \times \mathcal{V} \rightarrow \mathcal{V}, written λ⋅u‾.\lambda \cdot \underline{u}. The set V\mathcal{V} is a vector space over F\mathbb{F} if and only if the vector space axioms hold for all u‾,v‾,w‾∈V\underline{u}, \underline{v}, \underline{w} \in \mathcal{V} and all λ,μ∈F:\lambda, \mu \in \mathbb{F}:

  • Associativity of addition and scalar multiplication: u‾+(v‾+w‾)=(u‾+v‾)+w‾\underline{u}+(\underline{v}+\underline{w})=(\underline{u}+\underline{v})+\underline{w} and λ⋅(μ⋅u‾)=(λμ)⋅u‾.\lambda\cdot(\mu\cdot\underline{u})=(\lambda\mu)\cdot\underline{u}.
  • Commutativity of addition: u‾+v‾=v‾+u‾.\underline{u}+\underline{v}=\underline{v}+\underline{u}.
  • Distributivity of scalar multiplication over addition: (λ+μ)⋅u‾=λ⋅u‾+μ⋅u‾(\lambda+\mu)\cdot\underline{u}=\lambda\cdot\underline{u}+\mu\cdot\underline{u} and λ⋅(u‾+v‾)=λ⋅u‾+λ⋅v‾.\lambda\cdot(\underline{u}+\underline{v})=\lambda\cdot\underline{u}+\lambda\cdot\underline{v}.
  • Additive identity: ∃ 0‾∈V:u‾+0‾=u‾.\exists \, \underline{0} \in \mathcal{V} : \underline{u}+\underline{0}=\underline{u}.
  • Scalar multiplicative identity: 1⋅u‾=u‾1\cdot\underline{u}=\underline{u} where 11 is the multiplicative identity of F.\mathbb{F}.
  • Additive inverse: ∃ −u‾∈V:u‾+(−u‾)=0‾.\exists \, {-}\underline{u} \in \mathcal{V} : \underline{u}+({-}\underline{u})=\underline{0}.

Let V\mathcal{V} be a vector space over the field F.\mathbb{F}. An element v‾∈V\underline{v} \in \mathcal{V} is a vector. Usually V=Rn\mathcal{V}=\mathbb{R}^n or V=Cn,\mathcal{V}=\mathbb{C}^n, the set of nn-tuples v‾=(v1,…,vn)\underline{v}=(v_1,\ldots,v_n) with v1,…,vn∈Rv_1,\ldots,v_n \in \mathbb{R} or v1,…,vn∈Cv_1,\ldots,v_n \in \mathbb{C} respectively, with element-wise addition and scalar multiplication.

Let V\mathcal{V} be a vector space over the field F.\mathbb{F}. A subspace of V\mathcal{V} is a subset U⊆V\mathcal{U} \subseteq \mathcal{V} that is itself a vector space over F\mathbb{F} under the addition and scalar multiplication of V.\mathcal{V}. A subset of V\mathcal{V} that does not satisfy all of the vector space axioms is not a subspace.

Let V\mathcal{V} be a vector space over the field F,\mathbb{F}, u‾1,…,u‾n∈V\underline{u}_1,\ldots,\underline{u}_n \in \mathcal{V} and α1,…,αn∈F.\alpha_1,\ldots,\alpha_n \in \mathbb{F}. The vector α1u‾1+…+αnu‾n\alpha_1\underline{u}_1+\ldots+\alpha_n\underline{u}_n is a linear combination of u‾1,…,u‾n\underline{u}_1,\ldots,\underline{u}_n with coefficients α1,…,αn.\alpha_1,\ldots,\alpha_n.

Let V\mathcal{V} be a vector space over the field F\mathbb{F} and U={u‾1,…,u‾n}U=\{\underline{u}_1,\ldots,\underline{u}_n\} be a finite subset of V.\mathcal{V}. The vectors in UU are linearly dependent if and only if at least one vector u‾k\underline{u}_k is a linear combination of the other vectors in U.U.

u‾k=∑i=1,i≠knαiu‾i\underline{u}_k = \sum_{i=1, i\neq k}^n \alpha_i\underline{u}_i

Let V\mathcal{V} be a vector space over the field F\mathbb{F} and U={u‾1,…,u‾n}U=\{\underline{u}_1,\ldots,\underline{u}_n\} be a finite subset of V.\mathcal{V}. The vectors in UU are linearly independent if and only if they are not linearly dependent. Equivalently, the vectors in UU are linearly independent if and only if the only solution to α1u‾1+…+αnu‾n=0‾\alpha_1\underline{u}_1+\ldots+\alpha_n\underline{u}_n=\underline{0} is α1=…=αn=0.\alpha_1=\ldots=\alpha_n=0. An infinite subset UU of V\mathcal{V} is linearly independent if and only if every finite subset of UU is linearly independent.

Let V\mathcal{V} be a vector space over the field F\mathbb{F} and UU be a subset of V.\mathcal{V}. The set UU spans V\mathcal{V} if and only if every vector in V\mathcal{V} is a linear combination of vectors in U.U.

Let V\mathcal{V} be a vector space over the field F\mathbb{F} and UU be a subset of V.\mathcal{V}. The set UU is a basis of V\mathcal{V} if and only if UU spans V\mathcal{V} and the vectors in UU are linearly independent.

Let V\mathcal{V} be a vector space over the field F\mathbb{F} with a basis U.U. The dimension of V,\mathcal{V}, written dim(V),\mathrm{dim}(\mathcal{V}), is the number of vectors in U.U. Every vector space spanned by a finite set has a basis, and all bases of a vector space have the same number of vectors, so the dimension of a vector space is uniquely defined. A vector space with a finite basis is finite dimensional.

Let F\mathbb{F} be a field, n≥1n \geq 1 and i∈{1,…,n}.i\in\{1,\ldots,n\}. The standard basis vector e‾i∈Fn\underline{e}_i\in\mathbb{F}^n is the nn-tuple with 11 in position ii and 00 elsewhere. The standard basis of Fn\mathbb{F}^n is the set {e‾1,…,e‾n},\{\underline{e}_1,\ldots,\underline{e}_n\}, which is a basis of Fn,\mathbb{F}^n, so dim(Fn)=n.\mathrm{dim}(\mathbb{F}^n)=n.