



Problem 3, Let X ~ Mn(Dß, σ2V) for sonne known positive definite dispersion matrix V, some...
3.52 Let A be an mxm positive definite matrix and B be an mxm
nonnegative definite matrix.
3.51 Show mal Il A IS à nonnegative definite matrix and a 0 for some z, then ai,-G3 = 0 for all j definite matrix. (a) Use the spectral decomposition of A to show that 3.52 Let A be an m x m positive definite matrix and B be an m × m nonnegative with equality if and only if B (0). (b)...
3.52 Let A be an mxm positive definite matrix and B be an mxm
nonnegative definite matrix.
3.51 Show mal Il A IS à nonnegative definite matrix and a 0 for some z, then ai,-G3 = 0 for all j definite matrix. (a) Use the spectral decomposition of A to show that 3.52 Let A be an m x m positive definite matrix and B be an m × m nonnegative with equality if and only if B (0). (b)...
3. For n 2 2, let X have n-dimensional normal distribution MN(i, V). For any 1 3 m < n, let X1 denote the vector consisting of the last n - m coordinates of X < n, let 1 (a). Find the mean vector and the variance-covariance matrix of X1. (b). Show that Xi is a (n- m)-dimensional normal random vector.
Let X1, ..., Xn be a random sample from a distribution with pdf 2πσχ (a) If σ and μ are both unknown, find a minimal sufficient statistic T. (b) If σ is known and μ is unknown, is T from last part a sufficient statistic? Is it a minimal sufficient statistic? Prove your answer. (c) Let V (II1 X)/m, what is the distribution of V? Are V andindependently distributed?
Let X1, ..., Xn be a random sample from a distribution...
Let A be an m x n matrix of unspecified rank. Let b e Rm, and let Prove that this infimum is attained. In other words, prove the existence of an ax for which l|Ax bll p. In this problem, the norm is an arbitrary one defined on Rm.
Let A be an m x n matrix of unspecified rank. Let b e Rm, and let Prove that this infimum is attained. In other words, prove the existence of an...
Problem 3. Let V and W be vector spaces of dimensions n and m, respectively, and let T : V -> W be a linear transformation. (a) Prove that for every pair of ordered bases B = exists a unique m x n matrix A such that [T(E)]c = A[r3 for all e V. The matrix A is called the (B,C)-matrix of T, written A = c[T]b. (b) For each n E N, let Pm be the vector space of...
Problem 3. Let V and W be vector spaces of dimensions n and m, respectively, and let T : V -> V be a linear transformation (a) Prove that for every pair of ordered bases B = (Ti,...,T,) of V and C = (Wi, ..., Wm) of W, then exists a unique (B, C)-matrix of T, written A = c[T]g. (b) For each n e N, let Pn be the vector space of polynomials of degree at mostn in the...
Hello, please help solve problem and show all work thank
you.
(Linear models) Suppose we have a vector of n observations Y (response), which has distribution Nn(XB.ση where x is an n × p matrix of known values (indepedent variables), which has full column rank p, and β is a p x 1 vector of unknown parameters. The least squares estimator of ß is 4. a. Determine the distribution of β. xB. Determine the distribution of Y b. Let Y...
Let A be an m × n matrix, let x Rn and let 0 be the zero vector in Rm. (a) Let u, v є Rn be any two solutions of Ax 0, and let c E R. Use the properties of matrix-vector multiplication to show that u+v and cu are also solutions of Ax O. (b) Extend the result of (a) to show that the linear combination cu + dv is a solution of Ax 0 for any c,d...
Problem 2 (22+ poits). Consider some unknown vi, ., V/n E Rd with d < n and you are given the corresponding distance matrix Dij = llui-villa (a) Prove that D is not a positive semi-definite matrix unless Dij 0 for all i,j. (b) Show that we cannot recover v\, ...,Vn exactly given D. (c) Design a polynomial time algorithm to recover points x1, ,x,e Rd such that Dij la-x112.
Problem 2 (22+ poits). Consider some unknown vi, ., V/n...