basic bilinear forms

**Dandelion** · May 3rd 2010, 02:30 PM

Let f:V × V → F be a bilinear form on a vector space V, where F is the field of scalars. 3 conditions must be fulfilled:
1. f(u1+u2,v)=f(u1,v)+f(u2,v)
2. f(u,v1+v2)=f(u,v1)+f(u,v2)
3.f(u,tv)= f(tu,v)=tf(u,v)

If F=Q (as the set of rational numbers) then if f fulfills 1. and 2. then it must fulfill 3.
I was wondering how to prove that?
Another question is to find an example of a function/map that is not a bilinear form (and precise on which field it is) because it fulfills 1. and 2. but not 3.

Thanks a lot for any help or suggestions!

**nimon** · May 4th 2010, 02:40 AM

Hey there,

I had an exam question on this the other day! To show that 1.,2. imply 3. on $\mathbb{Q}$ it's easiest to show it for $\mathbb{N}$ first, then $\mathbb{Z}$ , and then $\mathbb{Q}$ . I'll give you some hints!

(n) Try induction to show that $f(nu,v) = nf(u,v)$ . This is obvious for $n=1$ , and so assume it is true for $n\in\mathbb{N}$ . Then $f((n+1)u,v) = f(nu + u,v) = \ldots$ From here you can use 1. and the inductive hypothesis. The symmetric case, i.e. for $f(u,nv)$ follows from 2.

(z) Then for $\mathbb{Z}$ , it suffices to show that $f(-u,v) = -f(u,v)$ (why?). Consider $f(u-u,v)$ and use 1. Again use 2. for the symmetric case.

(q) Now for $\mathbb{Q}$ , it suffices to show $f(\frac{1}{n}u,v) = \frac{1}{n}f(u,v)$ (why?). Now consider $f(u,v) = f(n\frac{1}{n}u,v) = \ldots$ and use (n).

Hope this is helpful, write back if you get stuck

(I don't know why I just used a smiley I think they're stupid but I was endeared by the yellowness.)

Thread: basic bilinear forms

LinkBack

Thread Tools

Display

basic bilinear forms

Similar Math Help Forum Discussions

Bilinear Forms and Linear Transformations

bilinear forms

Bilinear Forms

Bilinear Forms

Diagonalizing Symmetric Bilinear Forms

Search Tags