Orthogonal functions

From Class Wiki
Revision as of 20:08, 3 October 2006 by Nathan (talk | contribs) (Vectors)

Jump to: navigation, search


In this article we will examine another viewpoint for functions than that traditionally taken. Normally we think of a function  f(t) as a complicated entity -  f() in a simple environment (one dimension, or along the t axis). Now we want to think of a function as a vector or point (a simple thing) in a very complicated environment (possibly an infinite dimensional space).


Recall that vectors consist of an ordered set of numbers. Often the numbers are Real numbers, but we shall allow them to be Complex for our purposes. The numbers represent the amount of the vector in the direction denoted by the position of the number in the list. Each position in the list is associated with a direction. For example, the vector  \vec \bold v = <1, 4, 3> means that the vector  \vec \bold v is one unit in the first direction (often the x direction), four units in the second direction (often the y direction), and three units in the last direction (often the z direction). We say the component of  \vec \bold v in the second direction is 4. This is often written as  v_y = 4 .

Vector notation

We don't have to use x, y, and z as the direction names; we can use numbers, like 1, 2, and 3 instead. The advantage of this is that it leads to more compact notation, and extends to more than three dimensions much better. For example we could say  v_2 = 4 instead of  v_y = 4 . Instead of writing  \vec \bold v = <1, 4, 3> we can write  \vec \bold v = \sum_{k=1}^3 v_k \hat \bold a_k where the \hat \bold a_k denotes a basis vector in the kth direction, v_1 = 1,  v_2 = 4, and  v_3 = 3. The idea of basis vectors was implicit in the notation  \vec \bold v = <1, 4, 3> .

Inner products for vectors

When vectors are real, inner products (sometimes called dot products) give the component of one vector in another vector's direction, scaled by the magnitude (length) of the second vector. Inner products are useful to find components of vectors. We commonly use a dot as the symbol for inner product. For example, the inner product of  \vec \bold v and  \vec \bold a_n is written:

 \vec \bold v \bullet \vec \bold a_n

Orthogonality for vectors

It is quite handy to pick the directions used so that they are perpendicular (or orthogonal). With this arrangement the basis vectors have no components in each other's directions, which means that

\vec \bold a_k \bullet \vec \bold a_n = w_k \delta_{k,n}

where the  w_k is the square of the length of  \vec \bold a_k and the symbol  \delta_{k,n} , known as the Kronecker delta, is one when k = n and zero otherwise.


When the  w_k = 1 we have an orthonormal basis set, meaning that it is both orthogonal and that the basis vectors are normalized to unity (or have length one). Orthonormal vector systems are very popular. In fact they are the most common vector systems you will find. The reason they are so handy is each direction is uncoupled from the others.

For example, to find  v_n , we take the inner product of the vector  \vec \bold v with a unit vector in the nth direction,  \vec \bold a_n . We write this operation like this:

 \vec \bold v \bullet \vec \bold a_n = \sum_{k=1}^3 v_k \vec \bold a_k \bullet \vec \bold a_n = \sum_{k=1}^3 v_k \delta_{k,n} =  v_n

Suppose we have two vectors from an orthonormal system,  \vec \bold u and  \vec \bold v . Taking the inner product of these vectors, we get

 \vec \bold u \bullet \vec \bold v = \sum_{k=1}^3 u_k \vec \bold a_k \bullet \sum_{m=1}^3 v_m \vec \bold a_m  = \sum_{k=1}^3 u_k \sum_{m=1}^3  v_m \vec \bold a_k \bullet  \vec \bold a_m = \sum_{k=1}^3 u_k \sum_{m=1}^3  v_m \delta_{k,m} = \sum_{k=1}^3 v_k u_k

This shows that when we have an orthonormal vector space, inner products boil down to summing the products of like components. Also note that if we take the inner product of  \vec \bold v with itself, we get

 \vec \bold v \bullet \vec \bold v = \sum_{k=1}^3 v_k \vec \bold a_k \bullet \sum_{m=1}^3 v_m \vec \bold a_m  = \sum_{k=1}^3 v_k \sum_{m=1}^3  v_m \vec \bold a_k \bullet  \vec \bold a_m = \sum_{k=1}^3 v_k \sum_{m=1}^3  v_m \delta_{k,m} = \sum_{k=1}^3 v_k^2

which is the magnitude of the vector  \vec \bold v squared ( | \vec \bold v |^2 ) from the Pythagorean Theorem.

Changing vector basis sets

Sometimes in our studies we find it useful to change basis sets. For example, when solving a physics problem with cylindrical symmetry, it is often easier to use cylindrical coordinates, and the basis vectors that go with that system, rather than the more usual Cartesian coordinates and basis vectors.

So, how do I change the basis set?

If the new basis set is orthonormal, it is really pretty simple. You need to project the vector you want changed onto each of the new basis vectors. This means that the new components are just the inner product of the vector and the appropriate basis function. If the new basis set is not orthonormal, and if there are n dimensions in each basis set, you will have n linear coupled equations in n unknowns to solve.

More vector questions

What if the vectors have complex components?

What if not all components of the vectors have the same units?

What if there are more than three dimensions?

Functions and vectors, an analogy

We may think of the number of the direction,  k , as the independent variable of a vector and the component in that direction,  v_k as the dependent variable of the vector  \vec \bold  v in a similar way to the way we think of t as the independent variable of a function f(), where f(t) is the dependent variable of f. Probably the biggest difference here is that t often takes on real values from  - \infty to  \infty , and  k \in {1, 2, 3} . Using this analogy, we may think of a function as a vector having an uncountably infinite number of dimensions.

Can we write functions in an analogous way to the way we write vectors?

Remember we wrote  \vec \bold v = \sum_{k=1}^3 v_k \hat \bold a_k . Can we write something similar for a function, f(t) defined for t an element of the reals? Well maybe.... If the sum over the dummy index k becomes an integral over the dummy variable, x, and the unit vectors  \vec \bold a_k are replaced with something like  \delta(x-t) , the Dirac delta function. The result would look something like this:

 f(t) = \int_{- \infty}^\infty f(x) \delta (x-t) dx .

This works! The Dirac delta functions, playing the roll of the basis vectors, are called basis functions. The function f(x) plays the roll of the vector coefficients v_k. This gives us another way to think of the function f().

Inner products for functions

Above we found that a vector inner product between \vec \bold u and \vec \bold v could be written as  \vec \bold u \bullet \vec \bold v = \sum_{k=1}^3 u_k v_k . If we follow our above analogy, we should be able to replace the sum over k with an integral over x. There is one little notational problem, and that is we don't want to confuse the functional inner product with a simple muliply, so we need some new notation to denote this new inner product. In quantum mechanics, physicists use the bra-ket notation. Let's borrow that.

 <u|v> = \int_{-\infty}^\infty u^*(x) v(x) dx

Note the complex conjugate on the function u(x). That is in case u(x) is a complex valued function. For the analogous case with vectors see Complex vector inner products.

Orthogonality for functions

Two functions, u(t) and v(t) are said to be orthogonal on the interval  (a,b) with respect to the weighting function  w(t) if and only if \int_a^b w(x) u^*(x) v(x) dx = 0 . The weighting function is often unity, but it is included so that different values of t can be weighted appropriately in analogy to the way the w_k weight was used when the vector basis set was orthogonal, but not orthonormal (that is, different basis vectors had different numerical lengths), as we discussed here. Unless otherwise noted we will use  w(t) = 1 , so that the defining relation for orthogonality of functions  u and  v becomes \int_a^b  u^*(x) v(x) dx = 0 .

Changing basis sets with functions


Other resources on orthogonality

Wikipedia inner product

Principle author of this page: Rob Frohne