Let $G$ be a finite group of order $p^n$, where $p$ is a prime number and $n$ is a positive integer.
Suppose that $H$ is a subgroup of $G$ with index $[G:P]=p$.
Then prove that $H$ is a normal subgroup of $G$.

(Michigan State University, Abstract Algebra Qualifying Exam)

Give an example of two groups $G$ and $H$ and a subgroup $K$ of the direct product $G\times H$ such that $K$ cannot be written as $K=G_1\times H_1$, where $G_1$ and $H_1$ are subgroups of $G$ and $H$, respectively.

Prove that the symmetric group $S_n$, $n\geq 3$ is a semi-direct product of the alternating group $A_n$ and the subgroup $\langle(1,2) \rangle$ generated by the element $(1,2)$.

Let $W=C^{\infty}(\R)$ be the vector space of all $C^{\infty}$ real-valued functions (smooth function, differentiable for all degrees of differentiation).
Let $V$ be the vector space of all linear transformations from $W$ to $W$.
The addition and the scalar multiplication of $V$ are given by those of linear transformations.

Let $T_1, T_2, T_3$ be the elements in $V$ defined by
\begin{align*}
T_1\left(\, f(x) \,\right)&=\frac{\mathrm{d}}{\mathrm{d}x}f(x)\\[6pt]
T_2\left(\, f(x) \,\right)&=\frac{\mathrm{d}^2}{\mathrm{d}x^2}f(x)\\[6pt]
T_3\left(\, f(x) \,\right)&=\int_{0}^x \! f(t)\,\mathrm{d}t.
\end{align*}
Then determine whether the set $\{T_1, T_2, T_3\}$ are linearly independent or linearly dependent.

Let
\[A=\begin{bmatrix}
1-a & a\\
-a& 1+a
\end{bmatrix}\]
be a $2\times 2$ matrix, where $a$ is a complex number.
Determine the values of $a$ such that the matrix $A$ is diagonalizable.

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)

Let $P_n$ be the vector space of all polynomials with real coefficients of degree $n$ or less.
Consider the differentiation linear transformation $T: P_n\to P_n$ defined by
\[T\left(\, f(x) \,\right)=\frac{d}{dx}f(x).\]

(a) Consider the case $n=2$. Let $B=\{1, x, x^2\}$ be a basis of $P_2$. Find the matrix representation $A$ of the linear transformation $T$ with respect to the basis $B$.

(b) Compute $A^3$, where $A$ is the matrix obtained in part (a).

(c) If you computed $A^3$ in part (b) directly, then is there any theoretical explanation of your result?

(d) Now we consider the general case. Let $B$ be any basis of the vector space of $P_n$ and let $A$ be the matrix representation of the linear transformation $T$ with respect to the basis $B$.
Prove that without any calculation that the matrix $A$ is nilpotent.

Let $A$ be an $n\times n$ complex matrix.
Let $S$ be an invertible matrix.

(a) If $SAS^{-1}=\lambda A$ for some complex number $\lambda$, then prove that either $\lambda^n=1$ or $A$ is a singular matrix.

(b) If $n$ is odd and $SAS^{-1}=-A$, then prove that $0$ is an eigenvalue of $A$.

(c) Suppose that all the eigenvalues of $A$ are integers and $\det(A) > 0$. If $n$ is odd and $SAS^{-1}=A^{-1}$, then prove that $1$ is an eigenvalue of $A$.

Let $A$ be an $n\times n$ real symmetric matrix.
Prove that there exists an eigenvalue $\lambda$ of $A$ such that for any vector $\mathbf{v}\in \R^n$, we have the inequality
\[\mathbf{v}\cdot A\mathbf{v} \leq \lambda \|\mathbf{v}\|^2.\]