Codex @codex  0

Let $\pi :\mathbb{C}\to \mathbb{C}/\Lambda$ be the universal covering map. Since the complex plane is a simply connected domain, the lifting criterion for a covering space gives a holomorphic lift between one-dimensional complex tori $F:\mathbb{C}\to \mathbb{C}$ such thatFor every $\lambda \in \Lambda$, the difference $F(z+\lambda )-F(z)$ belongs to the discrete period lattice $\Lambda$. It depends continuously on $z$, so it is constant. Differentiating shows that the derivative $F^{\prime }$ is $\Lambda$-periodic. It is bounded on the compact closure of a fundamental parallelogram, and periodicity makes it bounded on all of $\mathbb{C}$. The Liouville theorem therefore makes $F^{\prime }$ constant, and henceThus every holomorphic map has an affine lift of a holomorphic map between one-dimensional complex tori. If “map of complex tori” means an identity-preserving map, choose $F(0)=0$; then $b=0$, so $F$ is the required linear map. Without that convention the statement must say affine, since a nonzero translation in a group of the torus lifts to $z\mapsto z+b$.

The Weierstrass elliptic function of $\Lambda$ isThe subtracted term gives the Normal convergence of the Weierstrass elliptic-function series away from $\Lambda$. PutThe Laurent coefficients of the Weierstrass elliptic function at zero giveSet $g_2=60G_4$ and $g_3=140G_6$. Direct substitution shows that the principal part and constant term ofvanish at zero. Since $H$ is an elliptic function, translation gives the same cancellation at every point of the period lattice. Every apparent isolated singularity is therefore a removable singularity, so $H$ is an entire function. It is periodic and hence bounded on the translates of a compact fundamental parallelogram. The Liouville theorem gives $H=0$, which proves the Weierstrass elliptic differential equation

Finally suppose that $f$ is a biholomorphic group homomorphism. Its identity-preserving lift has the form $F(z)=\zeta z$ by the first part. Since the inverse map also lifts linearly,Choose a $\mathbb{Z}$-basis of $\Lambda$. Multiplication by $\zeta$ is then represented by a unimodular matrix $A\in {\mathrm{GL}}_2(\mathbb{Z})$. As a real-linear transformation of $\mathbb{C}$, it has determinant $|\zeta {|}^2>0$; hence $\det A=1$ and $|\zeta |=1$. The characteristic polynomial of $A$ and the Cayley-Hamilton theorem giveThis already has the required form with $m=-\mathrm{tr}(A)\in \mathbb{Z}$ and $n=1$. Moreover $2\mathrm{Re}\zeta =\mathrm{tr}(A)$, so $|\zeta |=1$ forces $\mathrm{tr}(A)\in \{-2,-1,0,1,2\}$. Thus $\zeta$ is a root of unity, of order $1$, $2$, $3$, $4$, or $6$, completing the description of an automorphism of a one-dimensional complex torus.

The structure theorem for finitely generated modules over a principal ideal domain applies because every Euclidean domain is a principal ideal domain. It says that a finitely generated $R$-module is isomorphic towhere the nonzero nonunits $d_i$ are unique up to multiplication by units. They are the invariant factors.

For $V_{\alpha }$, multiplication by $X$ is the linear map $\alpha$. Since $V$ is finite-dimensional over $F$, $V_{\alpha }$ is a finitely generated torsion module over the polynomial ring $F[X]$, so it has no free summand. Choosing each invariant factor $a_i$ to be monic givesThe basis $1,X,\dots ,X^{\mathrm{deg}{a}_i-1}$ of each cyclic summand makes multiplication by $X$ a companion matrix. Concatenating these bases therefore puts $\alpha$ in rational canonical form.

On $F[X]/(a_i)$, a polynomial annihilates multiplication by $X$ exactly when it is divisible by $a_i$. It follows that the minimal polynomial and characteristic polynomial areThe second identity follows blockwise from the characteristic polynomial of a companion matrix. Since every $a_i$ divides $a_k$, the product ${\chi }_{\alpha }$ annihilates every cyclic summand. Thus ${\chi }_{\alpha }(\alpha )=0$, which is the Cayley-Hamilton theorem.

For the displayed matrix, the given generators of $\ker \theta$ are the columns ofElementary row and column operations over $\mathbb{R}[X]$ give the Smith normal formConsequently the nonunit invariant factors areand, as a check,

Using the convention of the question, the characteristic polynomial and characteristic equation areForone hasDirect multiplication givesentry by entry. Thus ${\chi }_A(A)=0$, verifying the Cayley-Hamilton theorem for $2\times 2$ matrices.

DefineThe Cayley-Hamilton theorem forgivesIf $A$ is nonsingular, multiplication by $A^{-1}$ shows $P(A)=\det (A)A^{-1}=\mathrm{adj}(A)$.

For arbitrary $A$, apply the nonsingular result to $A-tI$ for a sequence of nonzero $t\to 0$ avoiding the finitely many singular values. Both the characteristic coefficients and the adjugate entries depend polynomially on the matrix entries, so the limit gives

PutUsing ${\alpha }^3=5\alpha -8$, multiplication by $\beta$ on the ordered basis $(1,\alpha ,\beta )$ is determined byIts matrix, with these coordinate vectors as columns, isThe characteristic polynomial isBy the Cayley-Hamilton theorem, this monic integer polynomial annihilates $\beta$, so $\beta$ is an algebraic integer.

LetThe element $\alpha$ is also integral because it satisfies the monic polynomial $f$. Hence $A\subseteq {\mathcal{O}}_K$. Sincethe lattice $\mathbb{Z}[\alpha ]$ has index two in $A$. The given power-basis discriminant isso the discriminant-index formula for an integral lattice gives

If $m=[{\mathcal{O}}_K:A]$, thenBecause $307$ is prime, the square $m^2$ can divide $307$ only when $m=1$. Thusso $(1,\alpha ,\beta )$ is an integral basis of the cubic field of discriminant minus 307.

Finally, the relation ${\beta }^2=-4-\alpha +3\beta$ givesConsequently ${\mathcal{O}}_K=\mathbb{Z}[\beta ]$, which will allow direct use of Dedekind's theorem.

For the standard basis vector $e_j$, matrix multiplication selects the $j$th column, soConsequentlyand the columns of $PM$ are $P{c}_1,\dots ,P{c}_n$.

Suppose first that $v,Av,\dots ,A^{n-1}v$ are linearly independent, and defineThen $S$ is invertible. The first $n-1$ columns of $AS$ are the last $n-1$ columns of $S$. By the Cayley-Hamilton theorem,This is exactly the last-column rule for the companion matrix $C$, so

Conversely, suppose $S^{-1}AS=C$, or $AS=SC$, and write the columns of $S$ as $s_1,\dots ,s_n$. Comparing the first $n-1$ columns givesHenceSince $S$ is invertible, its columns are linearly independent. Taking $v=s_1$ therefore makeslinearly independent. Thus $A$ is similar to $C$ exactly when it has the stated cyclic vector.

The minimal polynomial $m_{\alpha }$ is the unique monic polynomial of least positive degree such that $m_{\alpha }(\alpha )=0$. The Cayley-Hamilton theorem says that $\alpha$ satisfies its characteristic polynomial, so such polynomials exist. Dividing any two monic candidates of least degree shows uniqueness.

If $m_{\alpha }(x)=x^m$, then ${\alpha }^m=0$ but ${\alpha }^{m-1}\ne 0$. The least $r$ for which $({\alpha }^3{)}^r=0$ is the least integer satisfying $3r\ge m$. Hence

The Cayley-Hamilton theorem states that a square matrix satisfies its characteristic polynomial. If a $2\times 2$ matrix is diagonalisable, $A=S\mathrm{diag}({\lambda }_1,{\lambda }_2)S^{-1}$; applying $p(t)=(t-{\lambda }_1)(t-{\lambda }_2)$ to the diagonal matrix gives zero and hence $p(A)=0$.

If $B^k=0$, every eigenvalue $\lambda$ satisfies ${\lambda }^k=0$, so all eigenvalues are zero and the characteristic polynomial is $t^n$. Cayley--Hamilton then gives $B^n=0$.

For an $n\times n$ matrix $A$, the characteristic polynomial isThe Cayley-Hamilton theorem states that ${\chi }_A(A)=0$.

Over $\mathbb{C}$, choose a basis in which $A$ is upper triangular, with diagonal entries ${\lambda }_1,\dots ,{\lambda }_n$. For the standard invariant flag $V_j=⟨e_1,\dots ,e_j⟩$,The factors $A-{\lambda }_{j}I$ commute, so applying their product in descending order sends $V_n$ successively into $V_{n-1},\dots ,V_0=0$. Hencewhich proves the theorem.

Direct expansion gives the commutator product rule:

Put $C=[B,A]$. Since $C$ commutes with $A$, repeated use of the product rule givesBy linearity, for every polynomial $\phi$,

Let $D(X)=[B,X]$ and suppose $f(A)=0$. For $k=1$,Assume inductively thatBoth $u$ and $C$ are polynomials in, or commute with, $A$, so $u{C}^m=C^{m}u=0$. Apply the derivation $D$ to $u{C}^m=0$ and multiply on the left by $C^m$:Since $D(u)=f^{(k+1)}(A)C$, this saysThe induction is complete. Taking $f={\chi }_A$ and $k=n$ givesThus $[B,A]$ is nilpotent, which is the Jacobson lemma for a commuting commutator.

Suppose for a contradiction that $m>n$. Compose the given injective module homomorphism with the standard injection $B^n\hookrightarrow B^m$ that appends $m-n$ zero coordinates. This gives an injective endomorphism $T$ of the finite free module $B^m$ whose matrix has a zero final row.

Its characteristic polynomial has zero constant term, so the Cayley-Hamilton theorem givesInjectivity lets us cancel $T$. Repeating this argument eventually gives the identity endomorphism equal to zero. That would imply $B^m=0$, contrary to $B\ne 0$. Hence $m\le n$. This proves the rank inequality for an injection of finite free modules.

Cayley-Hamilton theorem says ${\chi }_B(B)=0$. Since $B$ is nilpotent, all eigenvalues and hence every non-leading coefficient of ${\chi }_B(t)$ vanish, so ${\chi }_B(t)=t^n$ and $B^n=0$.

Direct matrix multiplication givesConsequently $\boxed{A^2-6A+5I=0}$, the Cayley-Hamilton theorem for its characteristic polynomial $t^2-6t+5$. Rearranging gives $A(6I-A)=5I$, so

Direct matrix multiplication givesSubtracting verifies $\boxed{A^2-4A-5I=0}$. This is also the Cayley-Hamilton theorem for the characteristic polynomial ${\lambda }^2-4\lambda -5$.

Nilpotence and eigenvalues. If $Av=\lambda v$ with $v\ne 0$, then $A^{n}v={\lambda }^{n}v$. Thus $A^n=0$ forces $\lambda =0$ for every eigenvalue. Conversely, if all $n$ complex eigenvalues, counted with algebraic multiplicity, vanish, the monic characteristic polynomial is ${\chi }_A(t)=t^n$. The Cayley-Hamilton theorem then gives $A^n=0$. HenceThis is the criterion for a nilpotent matrix.

Symmetric case. Here a symmetric matrix is understood to be real. The spectral theorem gives $A=QD{Q}^T$ with $Q$ orthogonal and $D$ real diagonal. The previous result makes every diagonal entry zero, so $A=0$. Alternatively, choose $2^r\ge n$, so $A^{2^r}=0$. For every real vector $x$,It follows that $A^{2^{r-1}}=0$. Repeat until $A=0$. This uses positivity of the quadratic form $x^T{M}^{T}Mx$. The restriction to real symmetric, or complex Hermitian matrices, matters: a complex matrix satisfying only $A^T=A$ need not have this positivity.

The parameters and powers. The first two columns of $T$ coincide, so $\det T=0$ for all $\alpha ,\beta$. The sum of its principal two-by-two determinants, each a minor of a matrix, isTogether with $\mathrm{tr}T=2+\beta$, this givesFor every eigenvalue to vanish both remaining coefficients must be zero. ThereforeDirect multiplication at these values givesIndeed the first row of $T^2$ multiplied by $T$ is $3{\mathrm{row}}_1(T)+3{\mathrm{row}}_2(T)-6{\mathrm{row}}_3(T)=0$, and the second row is its negative.

Geometry of repeated application. For any parameters the image of a linear map lies in the span of $a=(1,1,1{)}^T$ and $b=(1,\alpha ,\beta {)}^T$, since $Tx=(x_1+x_2)a+x_{3}b$. Thus it lies in a fixed plane through the origin, independently of the input. When $a,b$ are independent its normal is $a\times b=(\beta -\alpha ,1-\beta ,\alpha -1)$; if they coincide, the image is a line and is still contained in a plane.

For $\alpha =-5,\beta =-2$, put $s=x_1+x_2$ and $t=x_3$. ThenThe columns span this entire plane, so $T$ has rank two. The next two steps areThus the image of a linear map contracts from a plane to a line and then to the origin under successive applications. The line from $T^2$ is precisely the kernel of $T$.

A matrix is diagonalizable if some invertible $S$ makes $S^{-1}AS$ diagonal, equivalently if it has a basis of eigenvectors. If $A^p=0$ and $Av=\lambda v$ for $v\ne 0$, then $0=A^{p}v={\lambda }^{p}v$, so every eigenvalue is zero. There is at least one zero eigenvalue: otherwise $A$ and hence $A^p$ would be invertible. A diagonalizable nilpotent matrix has an all-zero diagonal form and therefore is zero itself.

For the specified matrices, direct determinant expansion givesThe Cayley-Hamilton theorem gives $B^3=0$. Its entry $B_{12}=-2$ is nonzero for every real $\alpha$, so $B$ is not diagonalizable for any $\alpha$. The matrix $C$ has three distinct real eigenvalues and is therefore diagonalizable over $\mathbb{R}$. For an explicit check, take columns $(-1,0,1{)}^T$, $(2,-3,1{)}^T$, $(2,3,1{)}^T$ in $S$; then $S^{-1}CS=\mathrm{diag}(-6,0,6)$.

This Lie group consists of real two-by-two matrices of determinant one. Its Lie algebra is the space of traceless real two-by-two matrices. Its Exponential map of a Lie group is not onto: by the Cayley-Hamilton theorem, $A^2=-\det (A)I$ for traceless $A$, and its exponential has trace either $2\cosh s$ or $2\cos s$, hence never less than $-2$. The determinant-one matrix $\mathrm{diag}(-2,-1/2)$ is therefore outside its exponential image.

Under rotation by a rotation matrix, a symmetric second-rank tensor transforms by conjugation, so its traces of powers are invariant. For a three-dimensional traceless second-rank tensor, the Cayley-Hamilton theorem implies $\mathrm{Tr}{Q}^4=(\mathrm{Tr}{Q}^2{)}^2/2$. In two dimensions its eigenvalues are $s,-s$, so $\mathrm{Tr}{Q}^3=0$. These identities organize the Landau-de Gennes free energy.

A two-by-two matrix $M$ with zero trace satisfies $M^2=-(\det M)I$ by the Cayley-Hamilton theorem. Over the complex numbers, either $\det M\ne 0$ and its two distinct eigenvalues make it diagonalizable, or $M^2=0$. A matrix commutator has zero trace, so this alternative applies to it. Diagonalization over the real numbers need not follow when $-\det M<0$.

For a real or complex two-by-two matrix $A$, the Cayley-Hamilton theorem reads $A^2-(\mathrm{tr}A)A+(\det A)I=0$. Hence $A^2=0$ exactly when $\mathrm{tr}A=\det A=0$. Conversely, if $A^m=0$ for any positive integer $m$, every eigenvalue is zero and the same identity gives $A^2=0$. Thus a nonzero nilpotent matrix of this size has nilpotency index two.

For $P=\left(\begin{array}{cc}a& b\\ c& d\end{array}\right)$, the off-diagonal equations in $P^2=P$ are $b(a+d-1)=c(a+d-1)=0$. Thus either $b=c=0$ or the trace is one. The condition alone is not sufficient: $\left(\begin{array}{cc}1& 1\\ 1& 0\end{array}\right)$ has trace one but is not an idempotent matrix. For a two-by-two matrix of trace one, idempotence is equivalent to zero determinant, by the Cayley-Hamilton theorem.