Dual vector space
Contents
[hide]Definition
Given a vector space (V,F) we define the dual or conjugate vector space[1] (which we denote V∗) as:
- V∗=Hom(V,F) (recall this the set of all homomorphisms (specifically linear ones) from V to F)
- That is V∗={f:V→F| f is linear} (which is to say f(αx+βy)=αf(x)+βf(y) ∀x,y∈V ∀α,β∈F)
We usually denote the elements of V∗ with ∗s after them, that is something like f∗∈V∗
We call the elements of V∗:
- Covectors
- Dual vectors
- Linear form
- Linear functional (and V∗ the set of linear functionals)[2]
Covectors and Dual vectors are interchangeable and I find myself using both without a second thought.
Equality of covectors
We say two covectors, f∗,g∗:V→F are equal if[1]:
- ∀v∈V[f∗(v)=g∗(v)][note 1] - that is they agree on their domain (as is usual for function equality)
The zero covector
The zero covector:V→F with v↦0[1] {{Todo|Confirm it is written 0∗ before writing that here
Examples
Dual vectors of R2
Consider (for v∈R2: f∗(v)=2x and g∗(v)=y−x - it is easy to see these are linear and thus are covectors![note 2][1]
Dual vectors of R[x]≤2
(Recall that R[x]≤2 denotes all polynomials up to order 2, that is: α+βx+γx2 for α,β,γ∈R in this case)
Consider $p\in\mathbb{R}[x]_{\le 2}$ and f∗,g∗:R[x]≤2→R given by:
- f∗(p)=∫+∞0e−xp(x)dx - this is a covector
- To see this notice: f∗(αp+βq)=∫+∞0e−x[αp(x)+βq(x)]dx=α∫+∞0e−xp(x)dx+β∫+∞0e−xq(x)dx
- g∗(p)=dpdx|x=1 (note that: g∗(α+βx+γx2)=β+2γ - so this isn't just projecting to coefficients) is also a covector[note 2][1]
Dual basis
Theorem: Given a basis {e1,⋯,en} of a vector space (V,F) there is a corresponding basis to V∗, {e∗1,⋯,e∗n} where each e∗i is the ith coordinate of a vector v∈V (that is the coefficient of ei when v is expressed as ∑nj=1vjej). That is to say that e∗i projects v onto it's ethi coordinate.
Notes
- Jump up ↑ I avoid the short form: f∗v=f∗(v) because the ∗ looks too much like an operator
- ↑ Jump up to: 2.0 2.1 Example shamelessly ripped