Proving a function is an inner product

Vespero
Messages
26
Reaction score
0

Homework Statement



I'm supposed to show that a function is an inner product if and only if b^2 - ac < 0 and a > 0.

I have proven all of the properties except that <x,x> > 0 if x!= 0. I would write the function out, but can't seem to get matrices to work.

The function is the product of a 1x2 matrix with entries x1 and x2, a 2x2 matrix with entries a, b, b, c, (filling in the top row, then moving to the bottom row), and a 2x1 matrix with entries y1, y2.

After multiplication, I arrive at
<x,x> = a(x1)^2 + 2b(x1)(x2) + c(x2)^2 > 0.

Now I must prove that this is true if and only if b^2 - ac < 0 and a > 0, but am not sure how to go about this.


Homework Equations





The Attempt at a Solution



I thought about different ways of inserting the conditions into the inequality or assuming that they were false and trying to arrive at a contradiction, but I can't seem to utilize them in a useful way.
 
Physics news on Phys.org
Some other things to try are:

Plugging in specific values for x1 and x2 to get a system of inequalities involving only a, b, and c.

Using the power of linear algebra to analyze the matrix and see if you can simply the problem or otherwise transform it into an easier one.

Using the power of high-school algebra to study and simplify a quadratic equation.
 
I'm guessing your function is:
\langle \mathbf{x},\mathbf{y}\rangle = \left( \begin{array}{c c} x_1 &amp; x_2 \end{array}\right) \left( \begin{array}{c c} a &amp; b\\ b &amp; c\end{array}\right)\left(\begin{array}{c} y_1\\y_2 \end{array}\right)

I think your best bet is to complete the square on the quadratic. Treat it as a quadratic polynomial in x1.

Recall the process of completing the square:
x^2 + 2Bx+C = x^2 + 2Bx + B^2 - B^2 + C = (x+B)^2 -B^2 + C
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top