Tagged: Berkeley

Problem 457

Let $A$ be a real symmetric $n\times n$ matrix with $0$ as a simple eigenvalue (that is, the algebraic multiplicity of the eigenvalue $0$ is $1$), and let us fix a vector $\mathbf{v}\in \R^n$.

(a) Prove that for sufficiently small positive real $\epsilon$, the equation
$A\mathbf{x}+\epsilon\mathbf{x}=\mathbf{v}$ has a unique solution $\mathbf{x}=\mathbf{x}(\epsilon) \in \R^n$.

(b) Evaluate
$\lim_{\epsilon \to 0^+} \epsilon \mathbf{x}(\epsilon)$ in terms of $\mathbf{v}$, the eigenvectors of $A$, and the inner product $\langle\, ,\,\rangle$ on $\R^n$.

(University of California, Berkeley, Linear Algebra Qualifying Exam)

Problem 381

Consider the matrix
$A=\begin{bmatrix} 3/2 & 2\\ -1& -3/2 \end{bmatrix} \in M_{2\times 2}(\R).$

(a) Find the eigenvalues and corresponding eigenvectors of $A$.

(b) Show that for $\mathbf{v}=\begin{bmatrix} 1 \\ 0 \end{bmatrix}\in \R^2$, we can choose $n$ large enough so that the length $\|A^n\mathbf{v}\|$ is as small as we like.

(University of California, Berkeley, Linear Algebra Final Exam Problem)

Problem 317

Suppose that $A$ is a real $n\times n$ matrix.

(a) Is it true that $A$ must commute with its transpose?

(b) Suppose that the columns of $A$ (considered as vectors) form an orthonormal set.
Is it true that the rows of $A$ must also form an orthonormal set?

(University of California, Berkeley, Linear Algebra Qualifying Exam)

Problem 190

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)

Problem 133

Find a square root of the matrix
$A=\begin{bmatrix} 1 & 3 & -3 \\ 0 &4 &5 \\ 0 & 0 & 9 \end{bmatrix}.$

How many square roots does this matrix have?

(University of California, Berkeley Qualifying Exam)

Problem 58

Let $A$ be an $n \times n$ matrix over a field $K$. Prove that
$\rk(A^2)-\rk(A^3)\leq \rk(A)-\rk(A^2),$ where $\rk(B)$ denotes the rank of a matrix $B$.

(University of California, Berkeley, Qualifying Exam)

Problem 55

Let $A$ and $B$ are $n \times n$ matrices with real entries.
Assume that $A+B$ is invertible. Then show that
$A(A+B)^{-1}B=B(A+B)^{-1}A.$

(University of California, Berkeley Qualifying Exam)

Problem 35

Let $A$ be an $n$ by $n$ matrix with entries in complex numbers $\C$. Its only eigenvalues are $1,2,3,4,5$, possibly with multiplicities. What is the rank of the matrix $A+I_n$, where $I_n$ is the identity $n$ by $n$ matrix.

(UCB-University of California, Berkeley, Exam)

Problem 15

Let $p_1(x), p_2(x), p_3(x), p_4(x)$ be (real) polynomials of degree at most $3$. Which (if any) of the following two conditions is sufficient for the conclusion that these polynomials are linearly dependent?

(a) At $1$ each of the polynomials has the value $0$. Namely $p_i(1)=0$ for $i=1,2,3,4$.

(b) At $0$ each of the polynomials has the value $1$. Namely $p_i(0)=1$ for $i=1,2,3,4$.

(University of California, Berkeley)