Processing math: 100%

Thursday, 2 May 2013

Maths on Steroids: Tute 7

I have no idea why inner products are so named. But I do know that there's something called an outer product...they're probably related.

In any case, inner products give us a notion of length and angle on a vector space. The former is given by taking the distance between two vectors u and v to be ||uv||:=uv,uv. And the latter is defined by taking u,v||u||||v||
to be cosθ, where θ is the angle between u and v. Of course, in order for this to make sense, we'd need |u,v|||u||||v||,
which is precisely the Cauchy-Schwarz inequality.

Usually it's not all that hard to prove that something is an inner product: the linearity and symmetry conditions are fairly straight-forward to check, and positivity is often a matter of doing completing the square in the right way. Having said that, consider the following inner product , on the vector space C0([0,1],R) of continuous real-valued functions on [0,1]: f,g:=10f(x)g(x)dx.
In this case, the positivity condition is intuitively obvious, if a function f:[0,1]R is not the constant zero function, its square is a non-negative function and should have positive integral over [0,1]. But to make this precise, we're going to do a wee bit of analysis. The maths here is, in some sense, fairly easy - it's all in the language. Then again, this language did take some very smart mathematicians ages to formulate, so it's probably not entirely trivial?

Time to think positive!

We just need to show the second part of positivity, the first part is pretty obvious. So, we need to show that if fC0([0,1],R) is not the constant zero function, thenf,f=10f(x)2dx>0.
Now, we know that f is not everywhere zero, so for some (interior) point x0[0,1], the function f spits out some number f(x0)0. By the ϵδ definition of continuity, for any positive number ϵ there's a small neighbourhood (x0δ,x0+δ) around x0 so that f spits out numbers between f(x0)ϵ and f(x0)+ϵ on this neighbourhood. So if we take ϵ to be small enough, then on (x0δ,x0+δ), the magnitude of f will be greater than some constant c>0. Therefore:f,f=10f(x)2dxx0+δx0δf(x)2dx>x0+δx0δc2dx=2δc2>0.
And we're done.

So ugh...that was totes not on the course syllabus, although it used to be...sorta...a few years ago. But if you decide to do any maths next year you're pretty likely to bump into this ϵδ stuff again. So umm...here's something-else that's not quite on the syllabus: well, okay, it's more of a parting thought than anything-else. In playing around with these inner products, sometimes we encounter something that doesn't quite satisfy the second part of the positivity condition. For example: the following symmetric (bi)linear function on R3 does not satisfy the positivity condition that says that ||u||=0 if and only if u=0,(x1,x2,x3),(y1,y2,y3):=2(x1+2x2+x3)(y1+2y2+y3)+e(x2x3)(y2y3)+π(x1+3x3)(y1+3y3).
Well, there're two ways of fixing this problem so that we end up with a vector space with a legit inner product. The first is to restrict ourselves to a vector subspace on which our inner product does satisfy the final positivity condition. And there are many many such choices of a vector space in this particular case - such as:V:={(x,y,z)R3|3x+y+z=0}.
And the second method is to equate certain vectors in our vector space R3, and thereby creating a new vector space called a quotient space R3/W, where W:=SpanR([3,1,1])={vectors whose ``length" is zero}.
Note that althought you might find quotient spaces a tad intimidating the first time that you see them, quotienting just means that we think of two vectors u and v that differ by some element in W (that is: uvW) as being the same vector. In fact, this is how we do modular arithmetic! E.g.: one way of defining Z2 is to take all the integers and regard the ones that differ by even numbers as being the "same". So, 1 is the same as 3 is the same as 5232320009 (modulo 2).

Now, this quotient space idea has the slight advantage that there's really just one way of doing it. Although we do need to show that for some some nearly-inner product space (V,,), the set W:={vectors whose ``length" is zero}
is always a vector subspace. Soooo...Subspace Theorem time!
  • Axiom 0: W is non-empty because the vector 0 is always length zero.
  • Axiom 2: Since αw,αw=α2w,w=0, W is closed under scalar multiplication.
  • Axiom 1: This is slightly trickier, we need to show that for two vectors w1,w2W, their sum w1+w2 is in W. Well, we know that w1+w2,w1+w2=w1,w1+2w1,w2+w2,w2=2w1,w2,
    so all we need to do is show that this last term is also zero - so, we just need some weaker version of the Cauchy-Schwarz inequality that applies to a nearly-inner product. Here's a proof: our result is obviously true if either w1 or w2 is the zero vector, so let's ignore that case. Then we know from the first part of positivity that:0w1||w1||±w2||w2||,w1||w1||±w2||w2||=1±2w1||w1||,w2||w2||+1||w1||||w2||±w1,w2||w1||||w2|||w1,w2|.
    So yea, |w1,w2| is less than 0=00, and we've shown that W is closed under vector addition.
You might think that this is all pretty useless, but oddly enough this sort of stuff keeps cropping up in maths, often for perfectly legitimate reasons. Like, that inner product that we defined on the space of continuous functions? Well, if you try to ditch the word continuous and replace it with something like square-integrable (and this is a perfectly pragmatic thing to do - sometimes you want to integrate functions which aren't continuous, like car acceleration...etc.), you'll suddenly find that our integral based inner product now fails the last positivity condition. So peeps actually use this quotient space technology to fix this problem and do some functional analysis and stuff...and stuff.

Okay okay okay, we're done. =)

No comments:

Post a Comment