Frame of a vector space: Information from Answers.com

Wikipedia: Frame of a vector space

This article is about a generalization of bases to linearly dependent sets of vectors. For a linearly independent set of vectors, see k-frame.

In linear algebra, a frame of a vector space V with an inner product can be seen as a generalization of the idea of a basis to sets which may be linearly dependent. The key issue related to the construction of a frame appears when we have a set of vectors $\{\mathbf{e}_{k}\}$ , with each $\mathbf{e}_{k} \in V$ and we want to express an arbitrary element $\mathbf{v} \in V$ as a linear combination of the vectors $\{\mathbf{e}_{k}\}$ :

$\mathbf{v} = \sum_{k} c_{k} \mathbf{e}_{k}$

and want to determine the coefficients $c k$ . If the set $\{ \mathbf{e}_{k} \}$ does not span $V$ , then these coefficients cannot be determined for all such $\mathbf{v}$ . If $\{ \mathbf{e}_{k} \}$ spans $V$ and also is linearly independent, this set form a basis of $V$ , and the coefficients $c k$ are the coordinates of $\mathbf{v}$ relative to this basis. If, however, $\{\mathbf{e}_{k}\}$ spans $V$ but is not linearly independent, the question of how to determine the coefficients becomes less apparent, in particular if $V$ is of infinite dimension.

Given that $\{\mathbf{e}_{k}\}$ spans $V$ and is linearly dependent, it may appear obvious that we should remove vectors from the set until it becomes linearly independent and forms a basis. There are some problems with strategy:

By removing vectors randomly from the set, it may lose its possibility to span $V$ before it becomes linearly independent.
Even if it is possible to devise a specific way to remove vectors from the set until it becomes a basis, this approach may become infeasible in practice if the set is large or infinite.
In some applications, it may be an advantage to use more vectors than necessary to represent $\mathbf{v}$ . This means that we want to find the coefficients $c k$ without removing elements in $\{\mathbf{e}_{k}\}$ .

In 1952, Duffin and Schaeffer gave a solution to this problem, by describing a condition on the set $\{ \mathbf{e}_{k} \}$ that makes it possible to compute the coefficients $c k$ in a simple way. More precisely, a frame is a set {e_k} of elements of V which satisfy the so-called frame condition:

There exist two real numbers, A and B such that $0 < A \leq B < \infty$ and

$A \| \mathbf{v} \|^{2} \leq \sum_{k} |\langle \mathbf{v} | \mathbf{e}_{k} \rangle|^{2} \leq B \| \mathbf{v} \|^{2} \text{ for all }\mathbf{v} \in V$ .

This means that the constants A and B can be chosen independently of v: they only depend on the set $\{\mathbf{e}_{k}\}$ .

The numbers A and B are called lower and upper frame bounds.

It can be shown that the frame condition is both necessary and sufficient to form a frame a set of dual frame vectors $\{ \mathbf{\tilde{e}}_{k} \}$ with the following property:

$\sum_{k} \langle \mathbf{v} | \mathbf{\tilde{e}}_{k} \rangle \mathbf{e}_{k} = \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle \mathbf{\tilde{e}}_{k} = \mathbf{v}$

for any $\mathbf{v} \in V$ . This implies that a frame together with its dual frame has the same properties as a basis and its dual basis in terms of reconstructing a vector from scalar products.

1 Relation to bases
2 Types of frames
- 2.1 Tight frames
- 2.2 Uniform frames
3 The dual frame
4 History
5 See also
6 References

Relation to bases

If the set $\{\mathbf{e}_{k}\}$ is a frame of V, it spans V. Otherwise there would exist at least one non-zero $\mathbf{v} \in V$ which would be orthogonal to all $\mathbf{e}_{k}$ . If we insert $\mathbf{v}$ into the frame condition, we obtain

$A \| \mathbf{v} \|^{2} \leq 0 \leq B \| \mathbf{v} \|^{2} ;$

therefore $A \leq 0$ , which is a violation of the initial assumptions on the lower frame bound.

If a set of vectors spans V, this is not a sufficient for calling the set a frame. As an example, consider $V = R 2$ and the infinite set $\{\mathbf{e}_{k}\}$ given by

$\left\{ (1,0) , \, (0,1), \, \left(0,\frac{1}{\sqrt{2}}\right) , \, \left(0,\frac{1}{\sqrt{3}}\right), \ldots \right\}.$

This set spans V but since $\sum_k |\langle \mathbf{e}_k|(0,1)\rangle|^2 = 0 + 1 + \frac{1}{2} + \frac{1}{3} +\cdots = \infty$ we cannot choose $B < \infty$ . Consequently, the set {e_k} is not a frame.

Types of frames

Tight frames

A frame is tight if the frame bounds $A$ and $B$ are equal. This means that the frame obeys a generalized Parseval's identity. A frame is normalized if $A = B = 1$ . A normalized tight frame is also called a Parseval frame.

Uniform frames

A frame is uniform if each element has the same norm: $\forall k\ \|\mathbf{e}_k\| = c$ where $c$ is a constant independent of $k$ . A uniform normalized tight frame ( $c = 1$ ) is an orthonormal basis.

The dual frame

The frame condition is both sufficient and necessary for allowing the construction of a dual or conjugate frame, $\{ \tilde{\mathbf{e}}_{k} \}$ , relative the original frame, $\{ \mathbf{e}_{k} \}$ . The duality of this frame implies that

$\sum_{k} \langle \mathbf{v} | \mathbf{\tilde{e}}_{k} \rangle \mathbf{e}_{k} = \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle \mathbf{\tilde{e}}_{k} = \mathbf{v}$

is satisfied for all $\mathbf{v} \in V$ . In order to construct the dual frame, we first need the linear mapping: $\mathbf{S} : V \rightarrow V$ defined as

$\mathbf{S} \mathbf{v} = \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle \mathbf{e}_{k}$

From this definition of $\mathbf{S}$ and the general properties of the scalar product, it now follows that

$\langle \mathbf{S} \mathbf{v} | \mathbf{v} \rangle = \sum_{k} |\langle \mathbf{v} | \mathbf{e}_{k} \rangle|^{2}$

which can be inserted into the frame condition to get

$A \| \mathbf{v} \|^{2} \leq \langle \mathbf{S} \mathbf{v} | \mathbf{v} \rangle \leq B \| \mathbf{v} \|^{2} \text{ for all }\mathbf{v} \in V$

The properties of $\mathbf{S}$ can be summarised as follows:

$\mathbf{S}$ is self-adjoint, positive definite, and has positive upper and lower bounds. This leads to
the inverse $\mathbf{S}^{-1}$ of $\mathbf{S}$ exists and it, too, is self-adjoint, positive definite, and has positive upper and lower bounds.

The dual frame is defined by mapping each element of the frame with $\mathbf{S}^{-1}$ :

$\tilde{\mathbf{e}}_{k} = \mathbf{S}^{-1} \mathbf{e}_{k}$

To see that this make sense, let $\mathbf{v} \in V$ be arbitary and set

$\mathbf{u} = \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle \tilde{\mathbf{e}}_{k}$

It is then the case that

$\mathbf{u} = \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle ( \mathbf{S}^{-1} \mathbf{e}_{k} ) = \mathbf{S}^{-1} \left ( \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle \mathbf{e}_{k} \right ) = \mathbf{S}^{-1} \mathbf{S} \mathbf{v} = \mathbf{v}$

which proves that

$\mathbf{v} = \sum_{k} \langle \mathbf{v} | \mathbf{e}_{k} \rangle \tilde{\mathbf{e}}_{k}$

Alternatively, we can set

$\mathbf{u} = \sum_{k} \langle \mathbf{v} | \tilde{\mathbf{e}}_{k} \rangle \mathbf{e}_{k}$

By inserting the above definition of $\tilde{\mathbf{e}}_{k}$ and applying known properties of $\mathbf{S}$ and its inverse, we get

$\mathbf{u} = \sum_{k} \langle \mathbf{v} | \mathbf{S}^{-1} \mathbf{e}_{k} \rangle \mathbf{e}_{k} = \sum_{k} \langle \mathbf{S}^{-1} \mathbf{v} | \mathbf{e}_{k} \rangle \mathbf{e}_{k} = \mathbf{S} (\mathbf{S}^{-1} \mathbf{v}) = \mathbf{v}$

which shows that

$\mathbf{v} = \sum_{k} \langle \mathbf{v} | \tilde{\mathbf{e}}_{k} \rangle \mathbf{e}_{k}$

This derivation of the dual frame is a summary of section 3 in the article by Duffin and Schaeffer. They use the term conjugate frame for what here is called dual frame.

History

Frames were introduced by Duffin and Schaeffer in their study on nonharmonic Fourier series. They remained obscure until Mallat, Daubechies, and others used them to analyze wavelets in the 1980s. Some practical uses of frames today include robust coding and design and analysis of filter banks.

References

Ole Christensen (2003). An Introduction to Frames and Riesz Bases. Birkhäuser.

R. J. Duffin and A. C. Schaeffer (1952). "A class of nonharmonic Fourier series". Trans. Amer. Math. Soc. vol. 72: 341--366. doi:10.2307/1990760.

Jelena Kovacevic, Pier Luigi Dragotti, and Vivek Goyal (June 2002). "Filter Bank Frame Expansions with Erasures". IEEE Trans. Information Theory 48 (6): 1439–1450. doi:10.1109/TIT.2002.1003832. http://citeseer.ist.psu.edu/cache/papers/cs/28168/http:zSzzSzlcavwww.epfl.chzSz~dragottizSzpublicationszSzIT_june02.pdf/kovacevic02filter.pdf.

This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)

Donate to Wikimedia

	In a 2 - dimensional cartesian coordinate system the y-component of a given vector is equal to the vector magnitude multiplied by which trigonometric function with respect to the angle between vector? Read answer...
	Suppose vector C equals vector A plus vector B so under what circumstances does C equal A plus B? Read answer...
	What is physical interpretation of vector space? Read answer...

	If y is a nonzero linear functional on a vector space V and if alpha is an arbitrary scalar does there necessarily exist a vector x in V such that x y equals alpha?
	Let H be a Hiblert space then prove that for any x y z belong to hilbert space then zero is the only vector orthognal to it self?
	If x 2t2 y 3t2 2t 3 then the find t position vector velocity vector acceleration vector as a function of the time find the magnitude direction of the position vector at t 2sec?

Frame of a vector space

Contents