How Do You Prove the Variance Formula for a Linear Combination of Variables?

  • Thread starter Thread starter cse63146
  • Start date Start date
  • Tags Tags
    Matrix
cse63146
Messages
435
Reaction score
0

Homework Statement



Let \Sigma =
( var(X1) cov(X1, X2) )
( cov (X2. X1) var(X2) )

Show that Var (a_1 X_1 + a_2 X_2) = a^T \Sigma a

where a^T = [a_1 a_2] is the transpose of the of the column vector a

Homework Equations





The Attempt at a Solution



I got this far:

Var (a_1 X_1 + a_2 X_2) = a_1^2 Var(X_1) + a_2^2 Var(X_2) + 2a_1 a_2 Cov (X_1, X_2) = a_1^2 Var(X_1) + a_2^2 Var(X_2) + a_1 a_2 Cov (X_1, X_2) + a_1 a_2 Cov (X_2, X_1)

Thats all I got so far, any hints
 
Physics news on Phys.org
Aren't you done? Isn't that what a^T \Sigma a is?
 
Thought there was more to it than that.

There's another part of the question that says: Using Var (a_1 X_1 + a_2 X_2) show that for every choice of a1 and a2 that a^T \Sigma a \geq 0

Can I assume that \Sigma is always positive?
 
Var (a_1 X_1 + a_2 X_2)\ge0 always, since it's variance! And you just showed it equals a^T \Sigma a
 
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