Question

Let x be a vector in Rn written as a column, and define U = {Ax:A∈Mmn}....

Let x be a vector in Rn written as a column, and define U = {Ax:A∈Mmn}.

Show that U is a subspace of Rm.

Homework Answers

Answer #1

Clearly the vector U is defined as the multiplication of matirix of order mxn by a matrix of order nx1 and so this results in a matrix of order mx1 and hence a vector in Rm

Now let U1 , U2 be two vectors in U such that :

U1 = Ax and U2 = Bx, where A and B are matrices in Mmn

Now U1 + U2 = Ax + Bx = (A+B)x (By distributive property of matrix addition when they are of same order)

Here A+B is again a matric of order mxn and hence in Mmn

So U1 +U2 is in U

Now consider a in R

Then aU1 = a(Ax) = (aA)x

As a is a scalar and so aA is again a matrix in Mmn

Hence aU1 is in U

So U is a subspace of Rm

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
Let E be an n×n matrix, and letU= {xE:x∈Rn} (where x∈Rn is written as arow vector)....
Let E be an n×n matrix, and letU= {xE:x∈Rn} (where x∈Rn is written as arow vector). Show that the following are equivalent. (a) E^2 = E = E^T (T means transpose). (b) (u − uE) · (vE) = 0 for all u, v ∈ Rn. (c) projU(v) = vE for all v ∈ Rn.
Let A be an m×n matrix, x a vector in Rn, and b a vector in...
Let A be an m×n matrix, x a vector in Rn, and b a vector in Rm. Show that if x1 in Rn is a solution to Ax=b and x2 is a solution to Ax=⃗0, then x1 +x2 is a solution to Ax=b.
Let P(u) be the linear function mapping vector x ∈ Rn to the difference between x...
Let P(u) be the linear function mapping vector x ∈ Rn to the difference between x and the projection of xon the line L(0,u) (the line through zero with direction u.) What is the smallest and second smallest eigenvalue of P(u)?
Let U, V be a pair of subspaces of Rn and U +V the summationspace. Suppose...
Let U, V be a pair of subspaces of Rn and U +V the summationspace. Suppose that U ∩ V = {0}. Prove that from every vector U + V can be written as the sum of a vector from U and a vector from V.
Let f : Rn → Rm be such that the inverse of f(U) is open for...
Let f : Rn → Rm be such that the inverse of f(U) is open for all open sets U ⊆ Rm. Prove that f is continuous on Rn.
Let U be a vector space and V a subspace of U. (a) Assume dim(U) <...
Let U be a vector space and V a subspace of U. (a) Assume dim(U) < ∞. Show that if dim(V ) = dim(U) then V = U. (b) Assume dim(U) = ∞ and dim(V ) = ∞. Give an example to show that it may happen that V 6= U.
Problem 3.2 Let H ∈ Rn×n be symmetric and idempotent, hence a projection matrix. Let x...
Problem 3.2 Let H ∈ Rn×n be symmetric and idempotent, hence a projection matrix. Let x ∼ N(0,In). (a) Let σ > 0 be a positive number. Find the distribution of σx. (b) Let u = Hx and v = (I −H)x and find the joint distribution of (u,v). 1 (c) Someone claims that u and v are independent. Is that true? (d) Let µ ∈ Im(H). Show that Hµ = µ. (e) Assume that 1 ∈ Im(H) and find...
Let U and W be subspaces of a finite dimensional vector space V such that V=U⊕W....
Let U and W be subspaces of a finite dimensional vector space V such that V=U⊕W. For any x∈V write x=u+w where u∈U and w∈W. Let R:U→U and S:W→W be linear transformations and define T:V→V by Tx=Ru+Sw . Show that detT=detRdetS .
Let V be a subspace of Rn and let T : Rn → Rn be the...
Let V be a subspace of Rn and let T : Rn → Rn be the orthogonal projection onto V . Use geometric arguments to find all eigenvectors and eigenvalues of T . Is T diagonalisable?
let A be a subset of Rn and let x be a point in Rn. Show...
let A be a subset of Rn and let x be a point in Rn. Show that x is a limit point of A if and only if every open ball about x contains a point of A that is not equal to x