[SOLVED] ECE269 Homework 2

35.00 $

Category:
Click Category Button to View Your Next Assignment | Homework

You will receive the following solution file(s) instantly after successful payment:

zip file icon HW2-xqscdy.zip (2552.9 KB)
Assignment Instructions Updated Recently? Submit Below and we will provide new Solution!
Submit New Instructions
πŸ”’ Securely Powered by:
Secure Checkout
5/5 - (1 vote)
  1. Problem 1: Affine functions. A function f : Rn β†’ Rm is said to be affine if for any x, y ∈Rn and any Ξ±, β∈R with Ξ± + Ξ² = 1, we have

f(Ξ±x + Ξ²y) = Ξ±f(x) + Ξ²f(y).

Note that without the restriction Ξ± + Ξ² = 1, this would be the definition of linearity.

  • Suppose that A ∈RmΓ—n and b ∈Rm. Show that the function f(x) = Ax + b is affine.
  • Prove the converse, namely, show that any affine function f can be represented uniquely as f(x) = Ax + b for some A ∈RmΓ—n and b ∈Rm.
  1. Problem 2: Linear Maps and Differentiation of polynomials. Let Pn be the vector space consisting of all polynomials of degree ≀ n with real coefficients. (a) Consider the transformation T : Pn β†’Pn defined by

dp(x)

T(p(x)) =Β Β  .

dx

For example, T(1 + 3x + x2) = 3 + 2x. Show that T is linear.

(b) Using {1, x, . . . , xn} as a basis, represent the transformation in part (a) by a matrix A ∈R(n+1)Γ—(n+1). Find the rank of A.

  1. Problem 3: Matrix Rank Inequalities.

Show the following identities about rank. (a) If A ∈FmΓ—n,B ∈FnΓ—k then

rank(B) ≀ rank(AB) + dim(null(A))

  • If A ∈FmΓ—n,B ∈FmΓ—n then

rank(A + B) ≀ rank(A) + rank(B)

  • Suppose A, B ∈FmΓ—m. Then show that if AB = 0 then

rank(A) + rank(B) ≀ m

  • Suppose A ∈FmΓ—m. Then show A2 = A if and only if

rank(A) + rank(A βˆ’ I) = m

where I ∈FmΓ—m is the identity matrix.

  1. Problem 4: Solution of Linear System of Equations. Consider the system of linear equations

y = ABx

where A ∈RnΓ—n and B ∈RnΓ—m, m ≀ n. For each of the following cases, find conditions (in terms of null spaces and range spaces of A and B) under which there can be a unique solution, no solution, or infinite number of solutions.

  • rank(A) = n, and rank(B) = m.
  • rank(A) = n, and rank(B) < m. (c) rank(A) < n, and rank(B) = m.
  1. Problem 5: Infinite Dimensional Vector Spaces. Recall that C0([0,1]) is defined as the set of all continuous functions f : [0,1] β†’ R, is a vector space over R. Let S = {1, (x + 1), (x + 2)2, (x + 3)3, . . . , (x + i)i, . . . }.
    • Is there a vector in S which can be represented as a finite linear combination of other vectors in S?
    • Can any vector in C0([0,1]) be represented as a finite linear combination of vectors in S?

[Finite linear combination is a linear combination with finite number of terms]

  • HW2-xqscdy.zip