- 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 Rmn 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 Rmn and b Rm.
- 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.
- Problem 3: Matrix Rank Inequalities.
Show the following identities about rank. (a) If A Fmn,B Fnk then
rank(B) rank(AB) + dim(null(A))
- If A Fmn,B Fmn then
rank(A + B) rank(A) + rank(B)
- Suppose A, B Fmm. Then show that if AB = 0 then
rank(A) + rank(B) m
- Suppose A Fmm. Then show A2 = A if and only if
rank(A) + rank(A I) = m
where I Fmm is the identity matrix.
- Problem 4: Solution of Linear System of Equations. Consider the system of linear equations
y = ABx
where A Rnn and B Rnm, 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.
- 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]

![[Solved] ECE269 Homework 2](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip.jpg)

![[Solved] ECE269 Homework 3](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip-1200x1200.jpg)
Reviews
There are no reviews yet.