Professional Documents
Culture Documents
Suppose that the {vj }j=1 are a nite-dimensional orthobasis. In this case we have
N N
x=
j=1
x, vj vj .
x=
j=1
x, vj vj
for all x V . This is often called the reproducing formula. In innite dimensions, if V has an orthobasis {vj }j=1 and x V has
| x, vj | <
j=1
x, vj vj .
j=1
In other words, x is perfectly captured by the list of numbers x, v1 , x, v2 , . . . Sound familiar? Examples: V = Cn , {vk } is the standard basis. xk = x, vk vk . V = L2 [, ], vk (t) = For any f V we have f (t) =
k= 1 ejkt 2
cx vx
where
1 ck = f, vk = 2
The general lesson is that we can recreate a vector x in an inner product space from the coecients { x, vk }. We can think of { x, vk } as transform coecients.
So x, y
V
= ,
This is Plancherels theorem. Parsevals theorem follows since x, x V = , 2 2 2 which implies that x V = x 2 . Thus, an orthobasis makes every inner product space equivalent to 2 !
xx
2 V
=
k>10
x, vk vk
V
=
k>10
| x, vk |2
Since we also have that x 2 = k=1 | x, vk |2 , the approximation x will be V good if the rst 10 transform coecients contain most of the total energy. Constructing these types of approximations is exactly what is done in image compression.