Let A, B be n × n matrices. The following are two incorrect
proofs that ABhas...
Let A, B be n × n matrices. The following are two incorrect
proofs that ABhas the same non-zero eigenvalues as BA. For each,
state two things wrong with the proof: (i) We will prove that AB
and BA have the same characteristic equation. We have that
det(AB − λI) = det(ABAA−1 − λAA−1) = det(A(BA − λI)A−1)
= det(A) + det(BA − λI) − det(A)
= det(BA − λI)
Hence det(AB − λI) = det(BA − λI), and so...
Consider the following. A = −5 12 −2 5 , P = −2 −3 −1 −1...
Consider the following. A = −5 12 −2 5 , P = −2 −3 −1 −1 (a)
Verify that A is diagonalizable by computing P−1AP. P−1AP = (b) Use
the result of part (a) and the theorem below to find the
eigenvalues of A. Similar Matrices Have the Same Eigenvalues If A
and B are similar n × n matrices, then they have the same
eigenvalues. (λ1, λ2) =
Let A = {−5, −4, −3, −2, −1, 0, 1, 2, 3} and define a relation...
Let A = {−5, −4, −3, −2, −1, 0, 1, 2, 3} and define a relation R
on A as follows: For all (m, n) is in A, m R n ⇔ 5|(m2 − n2). It is
a fact that R is an equivalence relation on A. Use set-roster
notation to list the distinct equivalence classes of R. (Enter your
answer as a comma-separated list of sets.)
____________
Let X = {1, 2, 3, 4} and Y = {2, 3, 4, 5}. Define f...
Let X = {1, 2, 3, 4} and Y = {2, 3, 4, 5}. Define f : X → Y by
1, 2, 3, 4 → 4, 2, 5, 3. Check that f is one to one and onto and
find the inverse function f -1.
Let B = {(1, 3), (?2, ?2)} and B' = {(?12, 0), (?4, 4)} be bases...
Let B = {(1, 3), (?2, ?2)} and B' = {(?12, 0), (?4, 4)} be bases
for R2, and
let A =
3
2
0
4
be the matrix for T: R2 ? R2 relative to B.
(a) Find the transition matrix P from B' to B. P =
(b) Use the matrices P and A to find [v]B and [T(v)]B, where
[v]B' = [1 ?5]T. [v]B = [T(v)]B =
(c) Find P?1 and A' (the matrix for T relative...
Selection-Sort( A[1..n] )
1 2 3 4 5 6 7 8 9
10
// INPUT: A[1..n],...
Selection-Sort( A[1..n] )
1 2 3 4 5 6 7 8 9
10
// INPUT: A[1..n], an array of any n numbers in unknown order
integer i, j, m
fori=1ton−1
do
swap A[i] ↔ A[m]
// OUTPUT: A[1..n], its numbers now sorted in non-decreasing
order
m=i
for j = i to n
do if A[j] < A[m] then m = j
Give a proof that this algorithm sorts its input as
claimed.
Let p = (8, 10, 3, 11, 4, 0, 5, 1, 6, 2, 7, 9) and...
Let p = (8, 10, 3, 11, 4, 0, 5, 1, 6, 2, 7, 9) and let q = (2,
4, 9, 5, 10, 6, 11, 7, 0, 8, 1, 3) be tone rows. Verify that p =
Tk(R(I(q))) for some k, and find this value of k.