Question #121754
Please, this is urgent , solve it as soon as possible.

Suppose V is finite-dimensional and phi is a linear functional on V. Then
there is a unique vector u in V such that
phi(v)=< v, u> for every v in V.
1
Expert's answer
2020-06-15T18:57:28-0400

The vector uu  is unique. Let u1u_1  and u2u_2  be such that ϕ(v)=v,u1\phi(v) = \langle v, u_1\rangle  and ϕ(v)=v,u2\phi(v) = \langle v, u_2\rangle  for every vVv\in V. Then v,u1u2=v,u1v,u2=ϕ(v)ϕ(v)=0\langle v, u_1-u_2\rangle = \langle v, u_1\rangle - \langle v, u_2\rangle = \phi(v) - \phi(v) = 0  for every vVv\in V . Substituting u1u2u_1-u_2  for vv , we get u1u2,u1u2=0\langle u_1-u_2, u_1-u_2\rangle = 0 , hence u1u2=0u_1-u_2 = 0 .




The vector uu  exists. Since VV is finite-dimensional, the Gram-Schmidt procedure gives an orthonormal basis {ei}i\{e_i\}_i  of VV. Choose u=iϕ(ei)eiu = \sum_i \overline{\phi(e_i)} e_i .


Let vVv\in V. Since {ei}i\{e_i\}_i  is a basis, there are scalars {ai}i\{a_i\}_i  such that v=iaieiv = \sum_i a_i e_i . Hence


ϕ(v)=ϕ(iaiei)=iaiϕ(ei).\phi(v) = \phi\left(\sum_i a_i e_i\right) = \sum_i a_i \phi(e_i).

On the other hand,


v,u=iaiei,iϕ(ei)ei=ijaiϕ(ej)ei,ej=iaiϕ(ei)\langle v, u\rangle = \left\langle \sum_i a_i e_i, \sum_i \overline{\phi(e_i)} e_i\right\rangle \\= \sum_i \sum_j a_i \phi(e_j) \langle e_i, e_j\rangle = \sum_i a_i \phi(e_i)

where the last equality follows from the orthonormality of {ei}i\{e_i\}_i . Therefore, ϕ(v)=v,u\phi(v) = \langle v, u\rangle for every vVv\in V.


The expression a\overline{a}  denotes the complex conjugate of a complex scalar aa  and is used for complex vector spaces. For real vector spaces, the proof is the same as above except that complex conjugation should be eliminated.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

Assignment Expert
11.06.20, 23:30

Dear Henry, please kindly wait for a solution of the question. If you need meeting specific requirements, then you can submit an order.

Henry
11.06.20, 19:29

Can you please solve at the earliest as it's urgent.

LATEST TUTORIALS
APPROVED BY CLIENTS