Linear form

From Wikipedia, the free encyclopedia
  (Redirected from Linear functional)
Jump to: navigation, search

In linear algebra, a linear functional or linear form (also called a one-form or covector) is a linear map from a vector space to its field of scalars.  In Rn, if vectors are represented as column vectors, then linear functionals are represented as row vectors, and their action on vectors is given by the dot product, or the matrix product with the row vector on the left and the column vector on the right.  In general, if V is a vector space over a field k, then a linear functional f is a function from V to k that is linear:

f(\vec{v}+\vec{w}) = f(\vec{v})+f(\vec{w}) for all \vec{v}, \vec{w}\in V
f(a\vec{v}) = af(\vec{v}) for all \vec{v}\in V, a\in k.

The set of all linear functionals from V to k, Homk(V,k), forms a vector space over k with the addition of the operations of addition and scalar multiplication (defined pointwise).  This space is called the dual space of V, or sometimes the algebraic dual space, to distinguish it from the continuous dual space.  It is often written V or V′ when the field k is understood.

Continuous linear functionals[edit]

If V is a topological vector space, the space of continuous linear functionals — the continuous dual — is often simply called the dual space.  If V is a Banach space, then so is its (continuous) dual.  To distinguish the ordinary dual space from the continuous dual space, the former is sometimes called the algebraic dual.  In finite dimensions, every linear functional is continuous, so the continuous dual is the same as the algebraic dual, although this is not true in infinite dimensions.

Examples and applications[edit]

Linear functionals in Rn[edit]

Suppose that vectors in the real coordinate space Rn are represented as column vectors

\vec{x} = \begin{bmatrix}x_1\\ \vdots\\ x_n\end{bmatrix}.

Then any linear functional can be written in these coordinates as a sum of the form:

f(\vec{x}) = a_1x_1 + \cdots + a_n x_n.

This is just the matrix product of the row vector [a1 ... an] and the column vector \vec{x}:

f(\vec{x}) = [a_1 \dots a_n] \begin{bmatrix}x_1\\ \vdots\\ x_n\end{bmatrix}.

Integration[edit]

Linear functionals first appeared in functional analysis, the study of vector spaces of functions.  A typical example of a linear functional is integration: the linear transformation defined by the Riemann integral

I(f) = \int_a^b f(x)\, dx

is a linear functional from the vector space C[a,b] of continuous functions on the interval [ab] to the real numbers.  The linearity of I(f) follows from the standard facts about the integral:

I(f+g) = \int_a^b(f(x)+g(x))\, dx = \int_a^b f(x)\, dx + \int_a^b g(x)\, dx = I(f)+I(g)
I(\alpha f) = \int_a^b \alpha f(x)\, dx = \alpha\int_a^b f(x)\, dx = \alpha I(f).

Evaluation[edit]

Let Pn denote the vector space of real-valued polynomial functions of degree ≤n defined on an interval [a,b].  If c ∈ [ab], then let evc : Pn → R be the evaluation functional:

\operatorname{ev}_c f = f(c).

The mapping f → f(c) is linear since

(f+g)(c) = f(c) + g(c)
(\alpha f)(c) = \alpha f(c).

If x0, ..., xn are n+1 distinct points in [a,b], then the evaluation functionals evxi, i=0,1,...,n form a basis of the dual space of Pn.  (Lax (1996) proves this last fact using Lagrange interpolation.)

Application to quadrature[edit]

The integration functional I defined above defines a linear functional on the subspace Pn of polynomials of degree ≤ n.  If x0, …, xn are n+1 distinct points in [a,b], then there are coefficients a0, …, an for which

I(f) = a_0 f(x_0) + a_1 f(x_1) + \dots + a_n f(x_n)

for all f ∈ Pn.  This forms the foundation of the theory of numerical quadrature.

This follows from the fact that the linear functionals evxi : f → f(xi) defined above form a basis of the dual space of Pn (Lax 1996).

Linear functionals in quantum mechanics[edit]

Linear functionals are particularly important in quantum mechanics.  Quantum mechanical systems are represented by Hilbert spaces, which are antiisomorphic to their own dual spaces.  A state of a quantum mechanical system can be identified with a linear functional.  For more information see bra–ket notation.

Distributions[edit]

In the theory of generalized functions, certain kinds of generalized functions called distributions can be realized as linear functionals on spaces of test functions.

Properties[edit]

  • Any linear functional L is either trivial (equal to 0 everywhere) or surjective onto the scalar field.  Indeed, this follows since just as the image of a vector subspace under a linear transformation is a subspace, so is the image of V under L.  however, the only subspaces (i.e., k-subspaces) of k are {0} and k itself.
  • A linear functional is continuous if and only if its kernel is closed (Rudin 1991, Theorem 1.18).
  • Linear functionals with the same kernel are proportional.
  • The absolute value of any linear functional is a seminorm on its vector space.

Visualizing linear functionals[edit]

Geometric interpretation of a 1-form α as a stack of hyperplanes of constant value, each corresponding to those vectors that α maps to a given scalar value shown next to it along with the "sense" of increase. The zero plane (purple) is through the origin.

In finite dimensions, a linear functional can be visualized in terms of its level sets.  In three dimensions, the level sets of a linear functional are a family of mutually parallel planes; in higher dimensions, they are parallel hyperplanes.  This method of visualizing linear functionals is sometimes introduced in general relativity texts, such as Gravitation by Misner, Thorne & Wheeler (1973).

Dual vectors and bilinear forms[edit]

See also: Hodge dual
Linear functionals (1-forms) α, β and their sum σ and vectors u, v, w, in 3d Euclidean space. The number of (1-form) hyperplanes intersected by a vector equals the inner product.[1]

Every non-degenerate bilinear form on a finite-dimensional vector space V gives rise to an isomorphism from V to V*. Specifically, denoting the bilinear form on V by < , > (for instance in Euclidean space <v,w> = vw is the dot product of v and w), then there is a natural isomorphism V\to V^*:v\mapsto v^* given by

 v^*(w) := \langle v,  w\rangle.

The inverse isomorphism is given by V^* \to V : f \mapsto f^* where f* is the unique element of V for which for all w ∈ V

 \langle f^*, w\rangle = f(w).

The above defined vector v* ∈ V* is said to be the dual vector of v ∈ V.

In an infinite dimensional Hilbert space, analogous results hold by the Riesz representation theorem.  There is a mapping V → V* into the continuous dual space V*.  However, this mapping is antilinear rather than linear.

Bases in finite dimensions[edit]

Basis of the dual space in finite dimensions[edit]

Let the vector space V have a basis \vec{e}_1, \vec{e}_2,\dots,\vec{e}_n, not necessarily orthogonal.  Then the dual space V* has a basis \tilde{\omega}^1,\tilde{\omega}^2,\dots,\tilde{\omega}^n called the dual basis defined by the special property that

 \tilde{\omega}^i (\vec e_j) = \left\{\begin{matrix} 1 &\mathrm{if}\ i=j\\ 0 &\mathrm{if}\ i\not=j.\end{matrix}\right.

Or, more succinctly,

 \tilde{\omega}^i (\vec e_j) = \delta^i_j

where δ is the Kronecker delta.  Here the superscripts of the basis functionals are not exponents but are instead contravariant indices.

A linear functional \tilde{u} belonging to the dual space \tilde{V} can be expressed as a linear combination of basis functionals, with coefficients ("components") ui,

\tilde{u} = \sum_{i=1}^n u_i \, \tilde{\omega}^i.

Then, applying the functional \tilde{u} to a basis vector ej yields

\tilde{u}(\vec e_j) = \sum_{i=1}^n (u_i \, \tilde{\omega}^i) \vec e_j = \sum_i u_i (\tilde{\omega}^i (\vec e_j))

due to linearity of scalar multiples of functionals and pointwise linearity of sums of functionals.  Then

 \tilde{u}({\vec e}_j) = \sum_i u_i (\tilde{\omega}^i ({\vec e}_j)) = \sum_i u_i \delta^i {}_j = u_j

that is

\tilde{u} (\vec e_j) = u_j.

This last equation shows that an individual component of a linear functional can be extracted by applying the functional to a corresponding basis vector.

The dual basis and inner product[edit]

When the space V carries an inner product, then it is possible to write explicitly a formula for the dual basis of a given basis.  Let V have (not necessarily orthogonal) basis \vec{e}_1,\dots, \vec{e}_n.  In three dimensions (n = 3), the dual basis can be written explicitly

 \tilde{\omega}^i(\vec{v}) = {1 \over 2} \, \left\langle  { \sum_{j=1}^3\sum_{k=1}^3\varepsilon^{ijk} \, (\vec e_j \times \vec e_k) \over \vec  e_1 \cdot \vec e_2 \times \vec e_3} , \vec{v} \right\rangle.

for i = 1, 2, 3, where ε is the Levi-Civita symbol and \langle,\rangle the inner product (or dot product) on V.

In higher dimensions, this generalizes as follows

 \tilde{\omega}^i(\vec{v}) = \left\langle \frac{\underset{{}^{1\le i_2<i_3<\dots<i_n\le n}}{\sum}\varepsilon^{ii_2\dots i_n}(\star \vec{e}_{i_2}\wedge\dots\wedge\vec{e}_{i_n})}{\star(\vec{e}_1\wedge\dots\wedge\vec{e}_n)}, \vec{v} \right\rangle

where \star is the Hodge star operator.

See also[edit]

References[edit]

  1. ^ J.A. Wheeler, C. Misner, K.S. Thorne (1973). Gravitation. W.H. Freeman & Co. p. 57. ISBN 0-7167-0344-0.