We now look at how well
can be approximated by
functions in the dictionary
.
We define the error of
-term approximation
of
by the elements of the dictionary
as
We also define the class of
-smooth signals in
as
,
with the corresponding norm
.
In general, the larger
is, the 'smoother' the function
. Note also that
if
. Given
,
let
be a measure of the
"smoothness" of
, i.e. a quantification of compressibility.
Let
, a Hilbert space
A Hilbert space is a
complete inner product space with the norm induced by the innerproduct
such as
, and assume
- an orthonormal basis on
; i.e. if
, then
, where
is the Kronecker delta. This
also means that each
has an expansion
, where
. We
also have
.
Recall the definition of
spaces: let
; then
if
with
for
and
for
. We also recall
that for
spaces on compact sets,
if
. The opposite is true for
spaces:
if
. Hence, the smaller the value of
is, the “smaller”
is.
Does there exist a sequence
with
but with
for all
? Consider the sequence
. We see that
but
for all
.
A sequence
is in
if the sorted magnitudes of the
decay faster than
.
Define
as the element of the sequence
with the
largest magnitude, and denote
as the
decreasing rearrangement of
. It is easy to show that
for all
; also, if
, then
.
A sequence
is in weak
, denoted
, if
. We also
define the quasinorm
A quasinorm is has the properties of
a norm except thatthe triangle inequality is replaced by the condition
for some absolute constant
.
as the
smallest
such that
for each
.
The sequence
is in weak
but not in
.
For
,
such that
, we have
.
Let
be an orthonormal basis for the Hilbert space
. For
with representation in
as
, we have
if and only if the sequence
, with
.
Moreover, there exist
such that
.
Let
.
if and only if
,
i.e. if
.
We prove the converse statement; the forward
statement proof is left to the reader. We would like to show thatif
, then
, with
. The best
-term approximation of
in
is of the form
. Therefore, we have:
where
.
We prove the converse statement; the forward
statement proof is left to the reader. We would like to show thatif
, then
, with
. The best
-term approximation of
in
is of the form
. Therefore, we have:
where we define
. Using this result in the
earlier statement, we get
this implies by definition that
.