Question

Prove that the quadratic form q(h) = h . Mh is indefinite if and only if...

Prove that the quadratic form q(h) = h . Mh is indefinite if and only if M has both positive and negative eigenvalues.

Homework Answers

Answer #1

Proof.

we prove it directly by using definition of indefinite form as folowing types:-
A quadratic form Q is indefinite if Q(x) assumes both positive and negative values

(BTB)T = BT(BT)T = BT B

then BTB is a symmetric matrix.
Now, if it is positive (semi)definite. For all x, then
xTBTBx = (Bx)T(Bx)

= (Bx) · (Bx) (by definition of inner product)

= ||Bx||2 ≥ 0, (by definition of norm)

Now , by the definition, BTB is positive semidefinite.

If B is invertible, for all x not equal to 0, we have Bx =not equal to 0, then xTBTBx = (Bx)T(Bx)

=(Bx) · (Bx)

= ||Bx||2 > 0, (by property of norm)

if x not equal to 0

Hence by definition, BTB is positive definite

So we can conclude that Q(x) will be indefinite iff M has both positive and negative eigenvalues

Please like ??

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove that the quadratic form q(h) = hMh is indefinite if and only if M has...
Prove that the quadratic form q(h) = hMh is indefinite if and only if M has both positive and negative eigenvalues.
Let H = X(X'X)^-1X' and M = In - X(X'X)^-1X' where X is a n x...
Let H = X(X'X)^-1X' and M = In - X(X'X)^-1X' where X is a n x k-dimensional matrix. Show that H is positive semi-definite and has rank k. Use that a symmetric matrix is positive semi-definite if and only if its eigenvalues are non-negative. You can use that rank(H) = trace(H).
Prove that the only ring homomorphism from Q (rational numbers) to Q (rational numbers) is the...
Prove that the only ring homomorphism from Q (rational numbers) to Q (rational numbers) is the identity map.
In each of the following, prove that the specified subset H is not a subgroup of...
In each of the following, prove that the specified subset H is not a subgroup of the given group G: (a) G = (Z, +), H is the set of positive and negative odd integers, along with 0. (b) G = (R, +), H is the set of real numbers whose square is a rational number. (c) G = (Dn, ◦), H is the set of all reflections in G.
Prove that any m ×n matrix A can be written in the form A = QR,...
Prove that any m ×n matrix A can be written in the form A = QR, where Q is an m × m orthogonal matrix and R is an m × n upper right triangular matrix.
Problem 8. Suppose that H has index 2 in G. Prove that H is normal in...
Problem 8. Suppose that H has index 2 in G. Prove that H is normal in G. (Hint: Usually to prove that a subgroup is normal, the conjugation criterion (Theorem 17.4) is easier to use than the definition, but this problem is a rare exception. Since H has index 2 in G, there are only two left cosets, one of which is H itself – use this to describe the other coset. Then do the same for right 1 cosets....
Let a, b be integers with not both 0. Prove that hcf(a, b) is the smallest...
Let a, b be integers with not both 0. Prove that hcf(a, b) is the smallest positive integer m of the form ra + sb where r and s are integers. Hint: Prove hcf(a, b) | m and then use the minimality condition to prove that m | hcf(a, b).
Prove (a). Events A and B are independent if and only if Ac and Bc are...
Prove (a). Events A and B are independent if and only if Ac and Bc are independent. (b). If events A and B both have a positive probability and are disjoint, then they cannot be independent.
Prove that a simple graph with p vertices and q edges is complete (has all possible...
Prove that a simple graph with p vertices and q edges is complete (has all possible edges) if and only if q=p(p-1)/2. please prove it step by step. thanks
5)Prove using Booth’s algorithm to show that -3 x 7 = -21. Consider the Multiplicand Q...
5)Prove using Booth’s algorithm to show that -3 x 7 = -21. Consider the Multiplicand Q as -3 and Multiplier M as 7. Show the step-by-step procedure in a neat tabular form