More from my site

• Ascending Chain of Submodules and Union of its Submodules Let $R$ be a ring with $1$. Let $M$ be an $R$-module. Consider an ascending chain \[N_1 \subset N_2 \subset \cdots\] of submodules of $M$. Prove that the union \[\cup_{i=1}^{\infty} N_i\] is a submodule of $M$.   Proof. To simplify the notation, let us […]
• True or False Problems on Midterm Exam 1 at OSU Spring 2018 The following problems are True or False. Let $A$ and $B$ be $n\times n$ matrices. (a) If $AB=B$, then $B$ is the identity matrix. (b) If the coefficient matrix $A$ of the system $A\mathbf{x}=\mathbf{b}$ is invertible, then the system has infinitely many solutions. (c) If $A$ […]
• Null Space, Nullity, Range, Rank of a Projection Linear Transformation Let $\mathbf{u}=\begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix}$ and $T:\R^3 \to \R^3$ be the linear transformation \[T(\mathbf{x})=\proj_{\mathbf{u}}\mathbf{x}=\left(\, \frac{\mathbf{u}\cdot \mathbf{x}}{\mathbf{u}\cdot \mathbf{u}} \,\right)\mathbf{u}.\] (a) […]
• Matrix of Linear Transformation with respect to a Basis Consisting of Eigenvectors Let $T$ be the linear transformation from the vector space $\R^2$ to $\R^2$ itself given by \[T\left( \begin{bmatrix} x_1 \\ x_2 \end{bmatrix} \right)= \begin{bmatrix} 3x_1+x_2 \\ x_1+3x_2 \end{bmatrix}.\] (a) Verify that the […]
• Using Properties of Inverse Matrices, Simplify the Expression Let $A, B, C$ be $n\times n$ invertible matrices. When you simplify the expression \[C^{-1}(AB^{-1})^{-1}(CA^{-1})^{-1}C^2,\] which matrix do you get? (a) $A$ (b) $C^{-1}A^{-1}BC^{-1}AC^2$ (c) $B$ (d) $C^2$ (e) $C^{-1}BC$ (f) $C$   Solution. In this problem, we […]
• A Module $M$ is Irreducible if and only if $M$ is isomorphic to $R/I$ for a Maximal Ideal $I$. Let $R$ be a commutative ring with $1$ and let $M$ be an $R$-module. Prove that the $R$-module $M$ is irreducible if and only if $M$ is isomorphic to $R/I$, where $I$ is a maximal ideal of $R$, as an $R$-module.     Definition (Irreducible module). An […]
• A Matrix Having One Positive Eigenvalue and One Negative Eigenvalue Prove that the matrix \[A=\begin{bmatrix} 1 & 1.00001 & 1 \\ 1.00001 &1 &1.00001 \\ 1 & 1.00001 & 1 \end{bmatrix}\] has one positive eigenvalue and one negative eigenvalue. (University of California, Berkeley Qualifying Exam Problem)   Solution. Let us put […]
• Construction of a Symmetric Matrix whose Inverse Matrix is Itself Let $\mathbf{v}$ be a nonzero vector in $\R^n$. Then the dot product $\mathbf{v}\cdot \mathbf{v}=\mathbf{v}^{\trans}\mathbf{v}\neq 0$. Set $a:=\frac{2}{\mathbf{v}^{\trans}\mathbf{v}}$ and define the $n\times n$ matrix $A$ by \[A=I-a\mathbf{v}\mathbf{v}^{\trans},\] where […]