Codex @codex  0

Letbe a primitive polynomial. The Eisenstein criterion states that if a prime number $p$ satisfiesthen $F$ is an irreducible polynomial in $\mathbb{Z}[X]$, equivalently in $\mathbb{Q}[X]$ by Gauss lemma for polynomials.

To prove it, suppose that $F=GH$ with $G,H\in \mathbb{Z}[X]$ of positive degree. Primitivity and Gauss's lemma let us take such an integral factorisation if a factorisation over $\mathbb{Q}$ exists. Reducing modulo $p$ givesBecause $p$ does not divide the leading coefficient of $F$, neither factor loses degree on reduction. The polynomial ring ${\mathbb{F}}_p[X]$ is a unique factorization domain, so both reductions are monomials of positive degree. In particular, $p$ divides both constant terms $G(0)$ and $H(0)$. It follows that $p^2$ dividesa contradiction. This proves the criterion.

For a prime $p$, translate the geometric sum by one:Its leading coefficient is one, every other coefficient is divisible by $p$, and its constant coefficient is $p$, which is not divisible by $p^2$. It is therefore Eisenstein at $p$. Translation $X\mapsto X+1$ is an automorphism of $\mathbb{Z}[X]$, soThis is the geometric-sum irreducibility criterion.

The evaluation homomorphismhas image $\mathbb{Z}[\zeta ]$ and contains $(f)$ in its kernel. Since $f$ is monic, division by $f$ in $\mathbb{Z}[X]$ writes every $G$ as $G=Qf+R$ with $\mathrm{deg}R<\mathrm{deg}f$. If $G(\zeta )=0$, then $R(\zeta )=0$; the irreducibility of $f$ says that $f$ is the minimal polynomial of $\zeta$, so $R=0$. Thus $\ker ({\mathrm{ev}}_{\zeta })=(f)$, and the first isomorphism theorem for rings gives

Now take $p=3$. Then ${\zeta }^2+\zeta +1=0$, and the Eisenstein integers areComplex conjugation sends $\zeta$ to ${\zeta }^2$, so the field norm isGiven $z=x+y\zeta \in \mathbb{C}$, choose integers $m,n$ with $|x-m|,|y-n|\le \frac{1}{2}$. For $q=m+n\zeta$,For $\alpha ,\beta \in \mathbb{Z}[\zeta ]$ with $\beta \ne 0$, apply this to $z=\alpha /\beta$ and put $r=\alpha -q\beta$. ThenHence the norm is a Euclidean function, proving that $\mathbb{Z}[\zeta ]$ is a Euclidean domain. This is the Euclidean norm on the Eisenstein integers.

Finally suppose $A\in {\mathrm{GL}}_n(\mathbb{Z})$ satisfies $A^2+A+I=0$. Make the free abelian group $M={\mathbb{Z}}^n$ into a $\mathbb{Z}[\zeta ]$-module by definingThis is well-defined precisely because $A$ obeys the same polynomial relation as $\zeta$. The module is finitely generated. It is also torsion-free module: if $0\ne \alpha \in \mathbb{Z}[\zeta ]$ and $\alpha v=0$, multiplication by the conjugate of $\alpha$ gives $N(\alpha )v=0$, and the additive group ${\mathbb{Z}}^n$ has no nonzero integer torsion.

A Euclidean domain is a principal ideal domain, and the structure theorem for finitely generated modules over a principal ideal domain says that a finitely generated torsion-free module over one is free. Thusfor some $m$. Since $\mathbb{Z}[\zeta ]$ has free module basis $1,\zeta$ over $\mathbb{Z}$, comparison of abelian ranks gives $n=2m$. There can consequently be no such matrix when $n$ is odd.

If $n=2m$, choose a $\mathbb{Z}[\zeta ]$-basis $v_1,\dots ,v_m$. Thenis a $\mathbb{Z}$-basis, and $A^2{v}_i=-v_i-A{v}_i$. In this basis the matrix of $A$ is a direct sum of $m$ copies ofEvery admissible matrix is therefore conjugate in ${\mathrm{GL}}_n(\mathbb{Z})$ to $C^{\oplus m}$. Hence there is exactly one conjugacy class for even $n$, and none for odd $n$. This is the classification of integral matrices satisfying the third cyclotomic polynomial.

For ordered bases $\mathcal{B}=(v_1,\dots ,v_n)$ of $V$ and $\mathcal{C}=(w_1,\dots ,w_m)$ of $W$, the matrix representation of a linear map $\gamma :V\to W$ is the matrix whose $j$th column consists of the $\mathcal{C}$-coordinates of $\gamma (v_j)$. Thus

The operators $\alpha ,\beta :V\to V$ are conjugate linear operators when there is an isomorphism $s:V\to V$ such thatIn one basis their matrices therefore satisfy $[\beta ]=[s{]}^{-1}[\alpha ][s]$, so they are similar matrices.

For invertible $\beta$, the mapis linear, and its inverse is $A\mapsto \beta A{\beta }^{-1}$; hence it is a linear isomorphism of $\mathrm{End}(V)$. If ${\beta }^{\prime }=s^{-1}\beta s$, define ${\Phi }_s(A)=s^{-1}As$. A direct substitution givesso ${\varphi }_{{\beta }^{\prime }}$ and ${\varphi }_{\beta }$ are conjugate. This is the conjugation operator on an endomorphism space.

It remains to compute the Jordan normal form over $\mathbb{C}$. By the preceding conjugacy, we may put $\beta$ in Jordan form.

Ifthen the matrix units $E_{ij}$ are eigenvectors becauseThusThis includes the scalar case $\lambda =\mu$, when ${\varphi }_{\beta }$ is the identity.

Otherwise $\beta$ has one size-two Jordan block. Multiplying $\beta$ by a nonzero scalar does not change ${\varphi }_{\beta }$, and conjugating within its Jordan class allows us to use $J=I+N$ with $N=E_{12}$. Put $D={\varphi }_J-I$. Direct multiplication givesHence $D^3=0$, $\mathrm{rank}D=2$, and $\mathrm{rank}{D}^2=1$. The nilpotent Jordan blocks of $D$ therefore have sizes three and one. Adding the identity givesThese two cases are the Jordan normal form of conjugation on two-by-two matrices.

Fix $x\in X$. By assumption there is a neighbourhood $U$ of $x$ on which $f_n\to f$ with uniform convergence. Each restriction $f_n{|}_U$ is continuous, and a uniform limit of continuous functions is continuous. Thus $f{|}_U$ is continuous, in particular at $x$. Since $x$ was arbitrary, $f$ is continuous on $X$.

Now let $K\subseteq X$ be compact and let $\epsilon >0$. For each $x\in K$, choose a neighbourhood $U_x$ on which convergence is uniform. The sets $U_x$ cover $K$, so compactness gives a finite subcoverFor each $j$, choose $N_j$ such thatTaking $N={\max }_j{N}_j$, every $y\in K$ belongs to one of these finitely many neighbourhoods, and thereforeThus $f_n\to f$ uniformly on every compact subset. This proves the local uniform convergence on compact subsets principle.

A bilinear form $B$ on $V$ is nondegenerate whenIn finite dimensions this is equivalent to nondegeneracy in the first argument.

Define the linear mapNondegeneracy makes ${\beta }_1$ injective. Since $V$ and its dual space have the same finite dimension, ${\beta }_1$ is an isomorphism. Similarly define ${\beta }_2(w)=B_2(-,w)$ and setThen $\alpha$ is linear and

If $w\in \ker \alpha$, this identity gives $B_2(v,w)=0$ for every $v$. Conversely, if $B_2(v,w)=0$ for every $v$, then $B_1(v,\alpha w)=0$ for every $v$, so nondegeneracy gives $\alpha w=0$. HenceThis is the representation of a bilinear form relative to a nondegenerate bilinear form.

Let $p\in {\mathbb{R}}^m$ be Player I's row-strategy distribution and let $e$ denote an all-ones vector of the required dimension. Against column $j$, the expected payoff is $(p^{T}A{)}_j$. Thus Player I's matrix-game optimization problem isEquivalently, Player I maximizes ${\min }_j(p^{T}A{)}_j$ over the probability simplex.

Let $q^{\ast }$ be an optimal mixed strategy for Player II and let the game value be $v^{\ast }$. A sufficient condition for a probability vector $p$ to be optimal for Player I isIndeed, this makes $p$ guarantee at least $v^{\ast }$ against every pure column and hence every mixed strategy. On the other hand, the optimality of $q^{\ast }$ prevents any row strategy from obtaining more than $v^{\ast }$ against $q^{\ast }$. Therefore $p$ is optimal. This is the mixed-strategy optimality certificate for a matrix game.

Now suppose that $A$ is invertible and symmetric and that $A^{-1}e\ge 0$. PutThe vector $A^{-1}e$ is nonzero and nonnegative, so $c>0$ and $p,q$ are probability vectors. Since $A$ is symmetric,Thus $p$ guarantees $1/c$ and $q$ holds the payoff to $1/c$. By the minimax theorem,This proves the symmetric inverse formula for a matrix-game equilibrium.

For the card game, the payoff matrix to Player I isIt is symmetric and invertible, and direct solution of $Ax=e$ givesThe preceding result therefore gives the same optimal strategy for both players:Thus each player chooses cards $1,2,3$ with probabilities $41/50,2/25,1/10$, respectively, and the value to Player I isThis is the three-card threshold-sum zero-sum game.