Problem 4. Let n E N, and let V be an n-dimensional vector space. Let(, ,):...
4. Consider R2x2 with inner product (A, B) tr(ATB), and let V CR2x2 be the subspace 1 1 1 0 This is consisting of upper-triangular matrices. Let B= a basis for V. (You do not need to prove this.) (a) (8 points) Use the Gram-Schmidt procedure on 3 to find an orthonormal basis for V. Find projy (B) (b) (4 points) Let B= 4. Consider R2x2 with inner product (A, B) tr(ATB), and let V CR2x2 be the subspace 1...
Problem 5. Let n N. The goal of this problem is to show that if two real n x n matrices are similar over C, then they are also similar over IK (a) Prove that for all X, y є Rnxn, the function f(t) det (X + ty) is a polynomial in t. (b) Prove that if X and Y are real n × n matrices such that X + ừ is an invertible complex matrix, then there exists a...
Problem 6. Let V be a vector space (a) Let (--) : V x V --> R be an inner product. Prove that (-, -) is a bilinear form on V. (b) Let B = (1, ... ,T,) be a basis of V. Prove that there exists a unique inner product on V making Borthonormal. (c) Let (V) be the set of all inner products on V. By part (a), J(V) C B(V). Is J(V) a vector subspace of B(V)?...
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...
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...
3. Let V be a finite dimensional vector space with a positive definite scalar product. Let A: V-> V be a symmetric linear map. We say that A is positive definite if (Av, v) > 0 for all ve V and v 0. Prove: (a) if A is positive definite, then all eigenvalues are > 0. (b) If A is positive definite, then there exists a symmetric linear map B such that B2 = A and BA = AB. What...
Help on Questions 1-3 Math 311 Orthogonal & Symmetric Matrix Proofs 1. Let the n x n matrices A and B be orthogonal. Prove that the sum A + B is orthogonal, or provide counterexample to show it isn't 2. Let the n x n matrix A be orthogonal. Prove A is invertible and the inverse A-1 is orthogonal, or provide a counterexample to show it isn't. 3. Suppose A is an n x n matrix. Prove that A +...
Let A be an invertible linear operator on a finite-dimensional complex vector space V. Recall that we have shown in class that in this case, there exists a unique unitary operator U such that A=UA. The point of this exercise is to prove the following result: an invertible operator A is normal if and only if U|A= |AU. a) Show that if UA = |A|U, then AA* = A*A. Now, we want to show the other direction, i.e. if AA*...
Problem 1. Let A be an m x m matrix. (a) Prove by induction that if A is invertible, then for every n N, An is invertible. (b) Prove that if there exists n N such that An is invertible, then A is invertible. (c) Let Ai, . . . , An be m x m matrices. Prove that if the product Ai … An is an invertible matrix, then Ak is invertible for each 1 < k< n. (d)...
just part c,d, and e please!! Let V be a finite-dimensional vector space over F. For every subset SCV, define Sº = {f eV" f(s) = 0 Vs ES}. (a) Prove that sº is a subspace of V* (S may not be a subspace!) (b) If W is a subspace of V and r & W, prove that there exists an few with f(x) +0. (c) If v inV, define u:V* → F by 0(f) = f(v). (This is linear...