**1. The affine group behind the wavelet transform **

Continuing my previous post on the uncertainty principle for the windowed Fourier transform, we now come to another integral transform: The wavelet transform.

In contrast to the windowed Fourier transform (which analyzes a function with respect to position and frequency) the wavelet transform analyzes a function with respect to position and *scale*. For a given analyzing function and a signal , the wavelet transform is (for , ):

In the same way, the windowed Fourier transform could be written as inner products of with a translated and modulated window function, the wavelet transform can be written as inner products of with translated and scaled functions . And again, these modifications which happen to the analyzing function come from a group.

Definition 1The affine group is the set endowed with the operation

Indeed this is group (with identity and inverse ). The name affine group stems from the fact that the group operation behaves like the composition of one dimensional affine linear functions: For and we have .

The affine group admits a representation on the space of unitary operators on :

(note the normalizing factor ).

**2. The affine uncertainty principle **

I am not sure who has to credited for the group theoretical background behind wavelets however, the two-part paper “Transforms associated to square integrable group representations” by Grossmann, Morlet and Paul has been influential (and can be found, e.g. in the compilation “Fundamental papers in wavelet theory” by Heil and Walnut.

As done by Stephan Dahlke and Peter Maass in “The Affine Uncertainty Principle in One and Two Dimensions” and can proceed in analogy to the windowed Fourier transform and the corresponding Weyl-Heisenberg group and compute the infinitesimal operators: Take the derivative of the representation with the respect to the group parameters and evaluate at the identity:

and

Again, these operators are skew adjoint and hence, multiplying by gives self-adjoint operators.

These operators and do not commute and hence, applying Robertson’s uncertainty principle gives an inequality. The commutator of and is

Robertson’s uncertainty principle reads as

and with some manipulation this turn to (for )

Again, one can derive the functions for which equality in attained and these are the functions of the form

for real . (By the way, these functions are indeed wavelets and sometimes called Cauchy-wavelets because of their analogy with the Cauchy kernel from complex analysis.)

By the way: These functions are necessarily complex valued. If one restricts oneself to real valued functions there is a simpler inequality, which one may call “real valued affine uncertainty”. First, observe that for real valued , and hence, the left hand side in (1) is zero (which make the inequality a bit pointless). Using that for real valued we have , and that together with for we obtain (with ) from (1)

Since we know that equality is only attained for the Cauchy wavelets (which are not real valued we can state:

Corollary 2 (Real valued affine uncertainty)For any real valued function which is in the domain of it holds that

As some strange curiosity, one can derive this “real valued affine uncertainty principle” by formal integration by parts and Cauchy-Schwarz inequality totally similar to the Heisenberg uncertainty principle (as I’ve done in my previous post):

Dividing by gives the “real valued affine uncertainty” (but only in the non-strict way).

September 26, 2011 at 8:51 am

[…] principle is fixed (for normed ). However, the lower bound in the affine uncertainty (equation (1) in my previous post) is not fixed (for normed ). Indeed can be arbitrarily small. Hence, a […]