{"id":5975,"date":"2020-11-22T19:09:16","date_gmt":"2020-11-22T10:09:16","guid":{"rendered":"https:\/\/sasamath.com\/blog\/?p=5975"},"modified":"2021-04-08T09:57:15","modified_gmt":"2021-04-08T00:57:15","slug":"linear-algebra-review-problems-for-5-days","status":"publish","type":"post","link":"https:\/\/sasamath.com\/blog\/articles\/linear-algebra-review-problems-for-5-days\/","title":{"rendered":"Linear Algebra Review Problems for 5 Days"},"content":{"rendered":"<style type=\"text\/css\">\nol.questions li {\nmargin-bottom: 0.7em;\n}\ndiv.post-entry p.hrseparator {\ntext-align: center;\nmargin-top: 2.6em;\nmargin-bottom: 2em;\n}\np.hrseparator:after {\ncontent: \"**** **** ****\";\n}\ndiv.explanations p {\ntext-align: left;\n}\ndiv.explanations p a {\ndisplay: inline-block;\n}\n<\/style>\n<div style=\"display: none; visibility: hidden;\">\n\\[<br \/>\n\\newcommand{\\parallelsym}{\\mathbin{\\!\/\\mkern-5mu\/\\!}}<br \/>\n\\newcommand{\\tr}{\\operatorname{tr}}<br \/>\n\\]\n<\/div>\n<p>This is a set of problems with which you can take exercise on linear algebra.<\/p>\n<p><!-- ############################################################## --><\/p>\n<p><a name=\"day01\"><\/a><\/p>\n<p class=\"hrseparator\">\n<h3>Day 1.<\/h3>\n<div class=\"box explanations\">\n<p>The problems for the first day are related to:<br \/>\n<a href=\"\/blog\/articles\/linear-algebra-representation-of-linear-transformations\/\">Representation of Linear Transformations<\/a>.<\/p>\n<\/div>\n<ol class=\"questions\" start=\"1\">\n<li>Explain why every linear transformation between finite dimensional vector spaces can be regarded as a matrix.&nbsp; (Hint: Consider bases for domain and codomain of the transformation.)<\/li>\n<li>Use matrix multiplication to obtain the formula for \\(\\sin(\\alpha + \\beta)\\) and \\(\\cos(\\alpha + \\beta ).\\)&nbsp; (Hint: Consider the transformation of rotation.)<\/li>\n<li>Let \\(F : \\mathbb{R}^2 \\rightarrow \\mathbb{R}^2\\) be a linear transformation defined by \\(F(x,\\,y) = (2x+3y ,\\, 4x-5y).\\) Find the matrix representation of \\(F\\) relative to the basis \\(S\\) consisting of \\(u_1 = ( 1,\\,2)\\) and \\(u_2 = (2,\\,5).\\)<br \/>\n(See: Schaum&#8217;s outlines p.196 Example 6.1.)\n<\/li>\n<li>Let \\(F : \\mathbb{R}^2 \\rightarrow \\mathbb{R}^2\\) be a linear transformation defined by \\(F(x,\\,y) = (2x+3y ,\\, 4x-5y).\\) Find the matrix representation of \\(F\\) relative to the basis \\(S\\) consisting of \\(u_1 = ( 1,\\,-2)\\) and \\(u_2 = (2,\\,-5).\\)<br \/>\n(See: Schaum&#8217;s outlines p.197 Example 6.3.)<\/li>\n<li>Consider the following two bases of \\(\\mathbb{R}^2 :\\)<br \/>\n\\[S = \\left\\{ u_1 = (1,\\,2) ,\\,\\, u_2 = (3,\\,5)\\right\\} ,\\,\\, S &#8216; = \\left\\{ v_1 = (1,\\,-1) ,\\,\\, v_2 = (1,\\,-2) \\right\\}.\\]<br \/>\nFind the transition matrix \\(P\\) from \\(S\\) to \\(S &#8216; .\\)<br \/>\n(See: Schaum&#8217;s outlines p.200 Example 6.5.)<\/li>\n<li>Consider the following two bases of \\(\\mathbb{R}^3 :\\)<br \/>\n\\[\\begin{align}<br \/>\nE &#038;= \\left\\{ e_1 = (1,\\,0,\\,0),\\,\\, e_2 = (0,\\,1,\\,0) ,\\,\\, e_3 = (0,\\,0,\\,1) \\right\\} , \\\\[5pt]<br \/>\nS &#038;= \\left\\{ u_1 = (1,\\,0,\\,1),\\,\\, u_2 = (2,\\,1,\\,2) ,\\,\\, u_3 = (1,\\,2,\\,2) \\right\\}.<br \/>\n\\end{align}\\]<br \/>\nFind the transition matrix \\(P\\) from \\(E\\) to \\(S,\\) and find the transition matrix \\(Q\\) from \\(S\\) to \\(E.\\)<br \/>\n(See: Schaum&#8217;s outlines p.200 Example 6.6.)<\/li>\n<li>Read the \u2018Remark 1\u2019 and \u2018Remark 2\u2019 on p.201 of Schaum&#8217;s outlines, and explain why you are not so surprised.&nbsp; (Hint: Keep calm and call \u2018them\u2019.)<\/li>\n<li>Let \\(V\\) be a vector space and \\(V^{**}\\) be the double dual space of \\(V.\\) Explain why they say \\(V\\) and \\(V^{**}\\) are canonically isomorphic.&nbsp; (Hint: Forget basis.)<\/li>\n<li>Let \\(V\\) and \\(W\\) be finite dimensional vector spaces, \\(T : V \\rightarrow W\\) be a linear transformation, and \\(T^*\\) be the transpose map of \\(T.\\) Prove:<br \/>\n(a) If \\(T\\) is one to one, then \\(T^*\\) is onto.<br \/>\n(b) If \\(T\\) is onto, then \\(T^*\\) is one to one.<br \/>\n(Hint: Keep calm and consider the definitions of \u2018transpose\u2019, \u2018one to one\u2019 and \u2018onto\u2019.)\n<\/li>\n<li>Let \\(A,\\) \\(B\\) be \\(n\\times n\\) matrices with \\(A \\ne B.\\) Show that \\(A\\) is similar to \\(B\\) if and only if there exist a vector space \\(V\\) and an endomorphism \\(T\\) of \\(V\\) such that both \\(A\\) and \\(B\\) represent \\(T\\) with respect to different bases. (Hint: Consider the definition of \u2018similar matrices\u2019.)<\/li>\n<\/ol>\n<p><!-- ############################################################## --><\/p>\n<p><a name=\"day02\"><\/a><\/p>\n<p class=\"hrseparator\">\n<h3>Day 2.<\/h3>\n<div class=\"box explanations\">\n<p>The problems for the second day are related to<br \/>\n<a href=\"\/blog\/articles\/linear-algebra-inner-product-spaces\">Inner Product Spaces<\/a>.<\/p>\n<\/div>\n<ol class=\"questions\" start=\"1\">\n<li>Find \\(\\langle f ,\\, g \\rangle,\\) \\(\\langle f,\\,h\\rangle\\) and \\(\\lVert f \\rVert\\) for<br \/>\n\\[f(t) = t+2 ,\\,\\, g(t) =3t-2 ,\\,\\, h(t) = t^2 -2t-3\\]<br \/>\nwhere<br \/>\n\\[\\langle f,\\,g\\rangle = \\int_0^1 f(t) g(t) dt.\\]<br \/>\n(See: Schaum&#8217;s outlines p.244 Problem 7.5.)\n<\/li>\n<li>Apply the Gram-Schmidt orthogonalization process to find an orthonormal basis for the subspace \\(V\\) of \\(\\mathbb{R}^4\\) spanned by<br \/>\n\\[v_1 = (1,\\,1,\\,1,\\,1),\\,\\, v_2 = (1,\\,2,\\,4,\\,5) ,\\,\\, v_3 = (1,\\,-3,\\,-4,\\,-2).\\]<br \/>\n(See: Schaum&#8217;s outlines p.236 Example 7.10.)\n<\/li>\n<li>Let \\(V\\) be an inner product space and \\(u_1,\\) \\(u_2,\\) \\(\\cdots,\\) \\(u_n\\) be an orthonormal basis. Show that for \\(v\\in V,\\)<br \/>\n\\[v = \\sum_{j=1}^n \\langle v\\,\\vert\\, u_j \\rangle u_j .\\]<br \/>\nIn this case, \\(\\langle v \\,\\vert\\, u_j \\rangle\\) are called <span class=\"defined\">Fourier coefficients<\/span>. One of the important process to develop the Fourier theory is to show that this formula is valid for the Schauder bases.\n<\/li>\n<li>Let \\(V\\) be a finite inner product space, and \\(W\\) be a subspace of \\(V.\\) Show that \\(V = W \\oplus W^\\bot.\\)<\/li>\n<li>Show that the <span class=\"defined\">parallelogram law<\/span> holds in inner product spaces:<br \/>\n\\[\\lVert u+v \\rVert^2 + \\lVert u-v \\rVert^2 = 2 \\lVert u\\rVert^2 + 2\\lVert v\\rVert^2.\\]<br \/>\n(See: Schaum&#8217;s outlines p.245 Problem 7.7.)<br \/>\nIn general, not every normed linear space is an inner product space. But if a normed linear space satisfies the parallelogram law, then the norm can be arise in the usual way from some inner product: \\(\\langle x \\,\\vert\\, y \\rangle = \\frac{1}{4} ( \\lVert x+y \\rVert^2 &#8211; \\lVert x-y \\rVert^2 ).\\)\n<\/li>\n<li>Suppose that \\(S_1,\\) \\(S_2\\) and \\(S_3\\) are subsets of \\(V.\\) Prove that:<br \/>\n(a) \\(S\\subseteq S^{\\bot \\bot}.\\) <br \/>\n(b) If \\(S_1 \\subseteq S_2 ,\\) then \\(S_2 ^{\\bot} \\subseteq S_1 ^{\\bot}.\\)<br \/>\n(c) \\(S^\\bot = (\\operatorname{span} (S))^\\bot.\\)<br \/>\n(See: Schaum&#8217;s outlines p.247 Problem 7.14.)\n<\/li>\n<li>Show that<br \/>\n\\[A = \\left[\\begin{array}{cc} a &#038; b \\\\ b &#038; d \\end{array}\\right]\\]<br \/>\nis positive definite if and only if<br \/>\n\\[a > 0, \\,\\, d > 0 \\,\\, \\text{and} \\,\\, ad-b^2 > 0.\\]<br \/>\n(See: Schaum&#8217;s outlines p.255 Problem 7.43.)<br \/>\nThis means that a \\(2\\times 2\\) symmetric matrix \\(A\\) is positive definite if and only if all eigenvalues of \\(A\\) are positive. This statement is true for any square matrix.\n<\/li>\n<li>Verify that the following defines an inner product in \\(\\mathbb{R}^2.\\)<br \/>\n\\[\\langle x ,\\, y \\rangle = x_1 y_1 &#8211; x_1 y_2 &#8211; x_2 y_1 + 3x_2 y_2\\]<br \/>\nwhere \\(x = (x_1 ,\\, x_2 )\\) and \\(y = (y_1 ,\\, y_2 ).\\)<br \/>\n(See: Schaum&#8217;s outlines p.244 Problem 7.3.)\n<\/li>\n<li>Prove: Suppose \\(w_1,\\) \\(w_2,\\) \\(\\cdots,\\) \\(w_r\\) form an orthogonal set of nonzero vectors in \\(V.\\) Let \\(v\\) be any vector in \\(V\\) and let \\(c_i\\) be the component of \\(v\\) along \\(w_i,\\) that is, \\(c_i w_i\\) is the vector projection of \\(v\\) onto \\(w_i.\\)<br \/>\n<!--\n\\[v = c_1 w_1 + c_2 w_2 + \\cdots + c_r w_r.\\]\n--><br \/>\nThen, for any scalars \\(a_1,\\) \\(a_2,\\) \\(\\cdots,\\) \\(a_r,\\) we have<br \/>\n\\[\\left\\lVert v- \\sum_{k=1}^r c_k w_k \\right\\rVert \\le \\left\\lVert v-\\sum_{k=1}^r a_k w_k \\right\\rVert .\\]<br \/>\nThat is, \\(\\sum c_i w_i\\) is the best approximation to \\(v\\) as a linear combination of \\(w_1,\\) \\(w_2 ,\\) \\(\\cdots ,\\) \\(w_r .\\)<br \/>\n(See: Schaum&#8217;s outlines p.251 Problem 7.30. Or, see: <a href=\"\/blog\/articles\/linear-algebra-inner-product-spaces\/\">\ub0b4\uc801\uacf5\uac04<\/a> Corollary 11.)\n<\/li>\n<li>Let \\(V\\) be a vector space with a complex inner product \\(\\langle \\,\\vert\\, \\rangle.\\) Explain why the conjugation in the formula<br \/>\n\\[\\langle v\\,\\vert\\,w \\rangle = \\overline{\\langle w\\,\\vert\\,v \\rangle}\\]<br \/>\nis necessary, instead of<br \/>\n\\[\\langle v\\,\\vert\\,w \\rangle = \\langle w\\,\\vert\\,v \\rangle.\\]<br \/>\n(Hint: Consider the simplest case \\(\\lVert v \\rVert\\) for \\(v\\in V = \\mathbb{C}.\\))\n<\/li>\n<\/ol>\n<p><!-- ############################################################## --><\/p>\n<p><a name=\"day03\"><\/a><\/p>\n<p class=\"hrseparator\">\n<h3>Day 3.<\/h3>\n<div class=\"box explanations\">\n<p>The problems for the third day are related to<br \/>\n<a href=\"\/blog\/articles\/linear-algebra-determinants\">Determinants<\/a>.<\/p>\n<\/div>\n<ol class=\"questions\" start=\"1\">\n<li>Evaluate the determinant of each of the following matrices.<br \/>\n\\[<br \/>\nA = \\left[\\begin{array}{ccc} 2&#038;3&#038;4 \\\\ 5&#038;4&#038;3 \\\\ 1&#038;2&#038;1 \\end{array}\\right], \\,\\,\\,<br \/>\nB = \\left[\\begin{array}{crr} 1&#038;3&#038;-5 \\\\ 3&#038;-1&#038;2 \\\\ 1&#038;-2&#038;1  \\end{array}\\right] .<br \/>\n\\]<br \/>\n(See: Schaum&#8217;s outlines p.276 Problem 8.1.)\n<\/li>\n<li>Evaluate the determinant of each of the following matrices.<br \/>\n\\[<br \/>\nA = \\left[\\begin{array}{rrrr} 2 &#038; 5 &#038; -3 &#038; -2 \\\\ -2 &#038; -3 &#038; 2 &#038; -5 \\\\ 1 &#038; 3 &#038; -2 &#038; 2 \\\\ -1 &#038; -6 &#038; 4 &#038; 3 \\end{array}\\right], \\,\\,\\,<br \/>\nB = \\left[\\begin{array}{rrrrr} 6 &#038; 2 &#038; 1 &#038; 0 &#038; 5 \\\\ 2 &#038; 1 &#038; 1 &#038; -2 &#038; 1 \\\\ 1 &#038; 1 &#038; 2 &#038; -2 &#038; 3 \\\\ 3 &#038; 0 &#038; 2 &#038; 3 &#038; -1 \\\\ -1 &#038; -1 &#038; -3 &#038; 4 &#038; 2 \\end{array}\\right] .<br \/>\n\\]<br \/>\n(See: Schaum&#8217;s outlines p.277  Problem 8.4.)\n<\/li>\n<li>Use the adjoint matrix to find the inverse matrix of<br \/>\n\\[<br \/>\nB = \\left[\\begin{array}{ccc} 1 &#038; 1 &#038; 1 \\\\ 2 &#038; 3 &#038; 4 \\\\ 5 &#038; 8 &#038; 9 \\end{array}\\right] .<br \/>\n\\]<br \/>\n(See: Schaum&#8217;s outlines p.278  Problem 8.6.)\n<\/li>\n<li>Consider the system<br \/>\n\\[\\begin{cases}<br \/>\nkx + y + z = 1 \\\\[5pt]<br \/>\nx + ky + z = 1 \\\\[5pt]<br \/>\nx + y + kz = 1.<br \/>\n\\end{cases}\\]<br \/>\nUse determinant to find those values of \\(k\\) for which the system has (i) a unique solution; (b) more than one solution; (c) no solutions.<br \/>\n(See: Schaum&#8217;s outlines p.280  Problem 8.10.)\n<\/li>\n<li>Find the determinant of the matrix<br \/>\n\\[M=\\left[\\begin{array}{ccccc}<br \/>\n3 &#038; 4 &#038; 0 &#038; 0 &#038; 0 \\\\<br \/>\n2 &#038; 5 &#038; 0 &#038; 0 &#038; 0 \\\\<br \/>\n0 &#038; 9 &#038; 2 &#038; 0 &#038; 0 \\\\<br \/>\n0 &#038; 5 &#038; 0 &#038; 6 &#038; 7 \\\\<br \/>\n0 &#038; 0 &#038; 4 &#038; 3 &#038; 4<br \/>\n\\end{array}\\right].\\]<br \/>\n(See: Schaum&#8217;s outlines p.280  Problem 8.12.)\n<\/li>\n<li>Find the determinant of \\(F : \\mathbb{R}^3 \\rightarrow \\mathbb{R}^3\\) defined by<br \/>\n\\[F(x,\\,y,\\,z) = (x+3y-4z ,\\, 2y+7z ,\\, x+5y-3z),\\]<br \/>\nand explain that \\(F\\) is an isomorphism.<br \/>\n(See: Schaum&#8217;s outlines p.280  Problem 8.13.)\n<\/li>\n<li>Solve the system by using Cramer&#8217;s rule.<br \/>\n\\[\\begin{cases} x+y+z = 5 \\\\[5pt] x-2y-3z = -1 \\\\[5pt] 2x+y-z = 3 \\end{cases}\\]<br \/>\n(See: Schaum&#8217;s outlines p.273  Example 8.12.)\n<\/li>\n<li>Let \\(A\\) be a square matrix. Show that the collection of column vectors of \\(A\\) is linearly independent if and only if \\(\\det (A) \\ne 0.\\)<\/li>\n<li>A matrix \\(A\\) is called an <span class=\"defined\">integer matrix<\/span> if all of whose entries are integers. Let \\(A\\) be a square integer matrix. Show that \\(A^{-1}\\) is an integer matrix if and only if \\(\\lvert \\det(A) \\rvert = 1.\\)&nbsp; (Hint: Use Cramer&#8217;s rule.)\n<\/li>\n<li>Let \\(A\\) be a square matrix of the form(upper triangular block matrix)<br \/>\n\\[A= \\left( \\begin{array}{ccccc}<br \/>\nP_1 &#038; Q_{12} &#038; Q_{13} &#038; \\cdots &#038; Q_{1n} \\\\<br \/>\nO &#038; P_2 &#038; Q_{23} &#038; \\cdots &#038; Q_{2n} \\\\<br \/>\nO &#038; O &#038; P_3 &#038; \\cdots &#038; Q_{3n} \\\\<br \/>\n\\vdots &#038; \\vdots &#038; \\vdots &#038; \\ddots &#038; \\vdots \\\\<br \/>\nO &#038; O &#038; O &#038; \\cdots &#038; P_n<br \/>\n\\end{array} \\right)\\]<\/p>\n<p><!--\n\\[A= \\left( \\begin{array}{c|c|c|c|c}\nP_1 & Q_{12} & Q_{13} & \\cdots & Q_{1n} \\\\\n\\hline\nO & P_2 & Q_{23} & \\cdots & Q_{2n} \\\\\n\\hline\nO & O & P_3 & \\cdots & Q_{3n} \\\\\n\\hline\n\\vdots & \\vdots & \\vdots & \\ddots & \\vdots \\\\\n\\hline\nO & O & O & \\cdots & P_n\n\\end{array} \\right)\\]\n--><\/p>\n<p>where all \\(P_j\\) are square matrices, \\(O\\) are matrices with zero entries and \\(Q_{ij}\\) are any matrices of suitable sizes. Show that<br \/>\n\\[\\det (A) = \\det (P_1) \\, \\det(P_2) \\, \\det(P_3) \\cdots \\det(P_n) .\\]\n<\/li>\n<\/ol>\n<p><!-- ############################################################## --><\/p>\n<p><a name=\"day04\"><\/a><\/p>\n<p class=\"hrseparator\">\n<h3>Day 4.<\/h3>\n<div class=\"box explanations\">\n<p>The problems for the fourth day are related to<br \/>\n<a href=\"\/blog\/articles\/linear-algebra-eigen-values-and-eigen-vectors\">Eigenvalues and Eigenvectors<\/a> and <a href=\"\/blog\/articles\/linear-algebra-cayley-hamilton-theorem-and-triangulation-of-endomorphisms\">Cayley-Hamilton Theorem<\/a>.\n<\/p>\n<\/div>\n<ol class=\"questions\" start=\"1\">\n<li>Let \\(f(t) = 2t^2 -t \\) and \\(g(t) = -t^2 +t -1.\\) Find \\(f(A)\\) and \\(g(A)\\) for<br \/>\n\\[A = \\left[ \\begin{array}{cc} 1 &#038; 2 \\\\ 3 &#038; 0\\end{array} \\right].\\]\n<\/li>\n<li>Show that if<br \/>\n\\[A = \\left[\\begin{array}{cc} a_{11} &#038; a_{12} \\\\ a_{21} &#038; a_{22} \\end{array}\\right],\\]<br \/>\nthen the characteristic polynomials of \\(A\\) is<br \/>\n\\[p_A (t) = t^2 &#8211; (a_{11} + a_{22})t + \\det(A) = t^2 &#8211; \\tr(A) t + \\det (A).\\]<br \/>\nUsing this formula, find the characteristic polynomial of each of the matrices:<br \/>\n\\[<br \/>\nA_1 = \\left[\\begin{array}{rr} 5 &#038; 3 \\\\ 2 &#038; 10 \\end{array}\\right],\\,\\,\\,<br \/>\nA_2 = \\left[\\begin{array}{rr} 7 &#038; -1 \\\\ 6 &#038; 2 \\end{array}\\right],\\,\\,\\,<br \/>\nA_3 = \\left[\\begin{array}{rr} 5 &#038; -2 \\\\ 4 &#038; -4 \\end{array}\\right].<br \/>\n\\]<br \/>\n(See: Schaum&#8217;s outlines p.294 for the proof, and p.295 Example 9.3.)\n<\/li>\n<li>Find the characteristic polynomial of<br \/>\n\\[A=<br \/>\n\\left[\\begin{array}{rrr} 1&#038;1&#038;2 \\\\ 0&#038;3&#038;2 \\\\ 1&#038;3&#038;9 \\end{array}\\right]<br \/>\n\\]<br \/>\n(See: Schaum&#8217;s outlines p.295 Example 9.4.)\n<\/li>\n<li>Let<br \/>\n\\[A = \\left[\\begin{array}{cc} 3 &#038; 1 \\\\ 2 &#038; 2 \\end{array}\\right]. \\]<br \/>\nFind all eigenvalues of \\(A,\\) and corresponding eigenvalues.\n<\/li>\n<li>Let \\(A\\) be the matrix in the previous problem. Show that \\(A\\) is diagonalizable, and find the diagonalization of \\(A,\\) that is, find an diagonal matrix \\(D\\) and invertible matrix \\(P\\) that satisfies \\(A = P^{-1} DP.\\)<br \/>\n(See: Schaum&#8217;s outlines p.297 Example 9.5.)\n<\/li>\n<li>Let<br \/>\n\\[A = \\left[\\begin{array}{cr} 3 &#038; -4 \\\\ 2 &#038; -6 \\end{array}\\right]. \\]<br \/>\nFind all eigenvalues of \\(A,\\) and corresponding eigenvalues.\n<\/li>\n<li>Let \\(A\\) be the matrix in the previous problem. Find a diagonal matrix \\(D\\) and invertible matrix \\(P\\) that satisfies \\(D = P^{-1} AP.\\) Furthermore, find \\(A^n\\) for a natural number \\(n.\\)<br \/>\n(See: Schaum&#8217;s outlines p.309 Problem 9.9.)\n<\/li>\n<li>Let<br \/>\n\\[A = \\left[\\begin{array}{cr} 2 &#038; 2 \\\\ 1 &#038; 3 \\end{array}\\right]. \\]<br \/>\nFind a nonsingular matrix \\(P\\) such that \\(D = P^{-1} AP\\) is diagonal.<br \/>\n(See: Schaum&#8217;s outlines p.309 Problem 9.10.)\n<\/li>\n<li>Let \\(A\\) be the matrix in the previous problem. Find \\(f(A)\\) for \\(f(t) = t^{12} &#8211; t^6 + t^3 .\\)<\/li>\n<li>Let \\(\\left\\{ f_n \\right\\}\\) be the Fibonacci sequence, that is<br \/>\n\\[f_1 = f_2 = 1 ,\\,\\, f_{n+2} = f_n + f_{n+1} \\, (n \\ge 1).\\]<br \/>\nUse diagonalization of matrix to find the general term for the Fibonacci sequence.<br \/>\n(Hint: <a href=\"https:\/\/austinrochford.com\/posts\/2014-04-23-diagonalization-fibonacci.html\">Matrix Diagonalization and the Fibonacci Numbers<\/a>.)\n<\/li>\n<\/ol>\n<p><!-- ############################################################## --><\/p>\n<p><a name=\"day05\"><\/a><\/p>\n<p class=\"hrseparator\">\n<h3>Day 5.<\/h3>\n<div class=\"box explanations\">\n<p>The problems for the fifth day are related to<br \/>\n<a href=\"\/blog\/articles\/linear-algebra-eigen-values-and-eigen-vectors\">Eigenvalues and Eigenvectors<\/a>, <a href=\"\/blog\/articles\/linear-algebra-cayley-hamilton-theorem-and-triangulation-of-endomorphisms\">Cayley-Hamilton Theorem<\/a> and <a href=\"\/blog\/articles\/linear-algebra-characteristic-subspaces-and-jordan-normal-form\">Jordan Normal Form<\/a>.\n<\/p>\n<\/div>\n<ol class=\"questions\" start=\"1\">\n<li>Let \\(T\\) be an endomorphism. Show that the scalar \\(0\\) is an eigenvalue of \\(T\\) if and only if \\(T\\) is singular(non-invertible).<br \/>\n(See: Schaum&#8217;s outlines p.314 Problem 9.18.)<\/li>\n<li>Let \\(T\\) be an endomorphism. Show that if \\(\\lambda\\) is an eigenvalue of \\(T\\) and \\(T\\) is invertible, then \\(\\lambda^{-1}\\) is an eigenvalue of \\(T^{-1}.\\)<br \/>\n(See: Schaum&#8217;s outlines p.314 Problem 9.18.)<\/li>\n<li>Let \\(V\\) be finite dimensional inner product space, \\(B = \\left\\{ u_1 ,\\, u_2 ,\\, \\cdots ,\\, u_n \\right\\}\\) be an orthonormal basis for \\(V\\) and \\(T\\) be an endomorphism of \\(V.\\) (i) Describe the definitions of Hermitian transformation and Hermitian matrix. (ii) Show that \\(T\\) is Hermitian transformation if and only if the matrix \\(T = \\left(a_{ij}\\right)\\) of \\(T\\) with respect to \\(B\\) is Hermitian matrix.<br \/>\n(See <a href=\"https:\/\/sasamath.com\/blog\/articles\/linear-algebra-eigen-values-and-eigen-vectors\/\">this article<\/a>, theorem 7.)\n<\/li>\n<li>Let \\(U\\) be a unitary transformation on \\(V,\\) and let \\(W\\) be a subspace invariant under \\(U.\\) Show that \\(W^\\bot\\) is also invariant under \\(U.\\)<br \/>\n(See: Schaum&#8217;s outlines p.387 Problem 13.11.)\n<\/li>\n<li>Describe the definition of multiplicity of an eigenvalue.<\/li>\n<li>Describe the definition of characteristic subspace of \\(V\\) respect to an endomorphism \\(T.\\)<\/li>\n<li>Describe the definitions of nilpotent and index of nilpotency.<\/li>\n<li>Describe the definitions of diagonal part and nilpotent part.<\/li>\n<li>Describe the theorem of Jordan&#8217;s Normal Form.<\/li>\n<li>Search for and describe: Primary decomposition of a vector space.<\/li>\n<\/ol>\n<p><!-- --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\\( \\newcommand{\\parallelsym}{\\mathbin{\\!\/\\mkern-5mu\/\\!}} \\newcommand{\\tr}{\\operatorname{tr}} \\) This is a set of problems with which you can take exercise on linear algebra. Day 1. The problems for the first day are related to: Representation of Linear Transformations. Explain why every linear transformation between finite dimensional vector spaces can be regarded as a matrix.&nbsp; (Hint: Consider bases for domain and codomain of the transformation.) Use matrix multiplication to&hellip;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_lmt_disableupdate":"","_lmt_disable":"","footnotes":""},"categories":[57],"tags":[482,540,418,419,542,416,538,412,539,541],"class_list":["post-5975","post","type-post","status-publish","format-standard","hentry","category-linear-algebra","tag-cayley-hamilton","tag-determinants","tag-eigenvalue","tag-eigenvector","tag-hermitian-matrix","tag-inner-product","tag-jordan-normal-form","tag-linear-transformation","tag-parallelogram-law","tag-unitary-matrix"],"_links":{"self":[{"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/posts\/5975","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/comments?post=5975"}],"version-history":[{"count":59,"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/posts\/5975\/revisions"}],"predecessor-version":[{"id":6147,"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/posts\/5975\/revisions\/6147"}],"wp:attachment":[{"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/media?parent=5975"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/categories?post=5975"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sasamath.com\/blog\/wp-json\/wp\/v2\/tags?post=5975"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}