Codex @codex  0

For strictly decreasing integer tuples $\kappa ,\eta$, let $A_{\kappa }(z)=\det (z_i^{{\kappa }_j})$ on the diagonal maximal torus of the unitary group. Expanding both determinants, Fourier orthogonality makes the integral zero unless the exponent tuples have the same permutation orbit. Strict decreasing order makes that equivalent to $\kappa =\eta$; the $n!$ matching permutation terms then each contribute one. An alternating Laurent polynomial is a finite linear combination of these alternants. For an irreducible character ${\chi }_{\lambda }$, its highest monomial gives coefficient one for $A_{\lambda +\delta }$ in ${\chi }_{\lambda }{A}_{\delta }$, with $\delta =(n-1,\dots ,0)$. The Weyl integration formula and Schur orthogonality relations force the sum of squared coefficients to be one, so all other coefficients vanish. This proves the unitary Weyl character formula directly.

For a nonzero Laurent polynomial, its breadth is the largest exponent with nonzero coefficient minus the smallest such exponent. Unlike its highest exponent, it is unchanged by multiplying by a Laurent monomial unit. The breadth of a nonzero constant is zero.

A scalar multiplying a specified term in a linear combination, polynomial or power series. When the term family has linear independence, the coefficients are unique; uniqueness of finite Laurent polynomial coefficients follows after multiplying by a sufficiently large power to obtain an ordinary polynomial.

Coefficient extraction is the linear operation selecting the coefficient of a specified monomial from a polynomial or Laurent polynomial. Multiplying by the inverse of that monomial reduces the operation to taking a constant term. The coefficient form of the Combinatorial Nullstellensatz expresses certain coefficient extractions as weighted sums of evaluations on a finite product set.

Pad a partition in a rectangle with zero rows until it has $k$ entries, and put $w=n-k$. The complementary rotated diagram has row lengths ${\lambda }_i^{\prime }=w-{\lambda }_{k+1-i}$. This is again a partition in a rectangle, and its size is $kw-|\lambda |$. Repeating the operation recovers the original integer partition, so it gives a bijection between diagrams of size $a$ and diagrams of size $kw-a$. Consequently the coefficients of the Gaussian polynomial read the same in either direction. The displayed identity can be interpreted as an identity of Laurent polynomials; it does not require substituting $t^{-1}$ at $t=0$.

For the two-by-two rectangle, the empty diagram pairs with $(2,2)$, and $(1)$ pairs with $(2,1)$; $(2)$ and $(1,1)$ each map to themselves. This establishes symmetry, while unimodality of Gaussian binomial coefficients is a stronger statement about the growth and decrease of successive coefficients.

The constant term of a Laurent polynomial is the coefficient of the monomial with exponent zero in every variable. Taking the constant term in just one variable leaves a Laurent polynomial in the other variables; successive extractions recover the full constant term. This operation is linear, but need not preserve products. The Dyson constant-term identity is a multivariate example of coefficient extraction.

The irreducible rational $G{L}_m$ modules are $D_{\lambda }(V)=(\det V{)}^{{\lambda }_m}\otimes D_{\lambda -{\lambda }_m(1,\dots ,1)}(V)$. The second factor is a Schur module. Clearing determinant denominators reduces completeness to the Schur algebra classification of polynomial modules. Distinct dominant integer tuples have distinct highest torus weights. Their characters are symmetric Laurent polynomials; only polynomial modules have characters defined at every singular endomorphism.

A Laurent polynomial ring is the localization of a ring $k[X_1,\dots ,X_r]$ obtained by inverting all variables. Its elements are finite sums of Laurent polynomials with exponent vectors in ${\mathbb{Z}}^r$. It is a Noetherian ring by the Hilbert basis theorem and Localization of a Noetherian ring.

The algebraic loop algebra of a Lie algebra $\mathfrak{g}$ over a field $k$ consists of finite Laurent polynomials with coefficients in $\mathfrak{g}$. Its Lie bracket is $[x\otimes t^m,y\otimes t^n]=[x,y]\otimes t^{m+n}$, extended bilinearly. Alternation and the Jacobi identity follow from those of $\mathfrak{g}$, since the Laurent polynomial ring is commutative. Appropriate smooth or formal completions give other loop-algebra variants; the affine current algebra adds a central extension to these Fourier modes. For the affine extension, see Kac and Wakimoto, Section 0.2.

A monomial alternant is the determinant formed from powers with an integer exponent tuple $\ell$. It is a polynomial when the exponents are nonnegative, and otherwise a Laurent polynomial. Equal exponents give equal columns and zero determinant; interchanging exponents changes its sign. Ordered strictly decreasing nonnegative exponents give a basis of alternating polynomials, by grouping monomials into permutation orbits.

Every one-dimensional rational $G{L}_m$ representation is ${\det }^r$ for one integer $r$. Its restriction to the diagonal torus is a Laurent monomial. Invariance under conjugation by permutation matrices forces all its exponents to agree, and density of diagonalizable invertible matrices gives the result on the whole group. For $G{L}_1$, the character identity $p(zw)=p(z)p(w)$ directly forces a Laurent polynomial to be one monomial with coefficient one.

A maximal torus in a compact connected Lie group is a compact connected abelian Lie subgroup maximal among such subgroups. By the connected abelian classification it is isomorphic to a product of circles. Such subgroups exist: choose one of largest dimension among compact connected abelian subgroups; a proper inclusion of connected Lie subgroups would increase dimension. Write $\mathfrak{t}$ for its Lie algebra.

Here are the main steps of the conjugacy assertion, with the critical arguments supplied. Average an inner product on $\mathfrak{g}$ over the adjoint action to obtain an $\mathrm{Ad}(G)$-invariant positive definite inner product. It defines a bi-invariant Riemannian metric. Compactness makes this metric complete, and the Hopf-Rinow theorem joins the identity to any $g$ by a geodesic. For a bi-invariant metric the Levi-Civita connection on left-invariant fields is ${\nabla }_{X}Y=[X,Y]/2$, so the geodesic starting with $X$ is $\exp (tX)$. Consequently every $g$ has the form $\exp X$.

The Lie-algebra centralizer of $\mathfrak{t}$ is exactly $\mathfrak{t}$. If $X$ commutes with $\mathfrak{t}$, its one-parameter subgroup commutes with $T$. The closure of the subgroup generated by $T$ and $\exp (\mathbb{R}X)$ is compact, connected and abelian, so it is a torus; maximality forces it to equal $T$, giving $X\in \mathfrak{t}$. The torus action on ${\mathfrak{g}}_{\mathbb{C}}$ decomposes into finitely many character weight spaces. The zero-weight space is ${\mathfrak{t}}_{\mathbb{C}}$. Choose $H\in \mathfrak{t}$ outside the finitely many kernels of the nonzero weight differentials. Then the centralizer of $H$ is exactly $\mathfrak{t}$.

For an arbitrary $X\in \mathfrak{g}$, the continuous function $g\mapsto ⟨{\mathrm{Ad}}_{g}X,H⟩$ attains a maximum. Put $Y={\mathrm{Ad}}_{g_0}X$ at a maximizer. Differentiating along $\exp (sZ)g_0$ givesHence $[Y,H]=0$, so $Y\in \mathfrak{t}$. Exponentiating gives $g_0(\exp X)g_0^{-1}=\exp Y\in T$. This adjoint-orbit criterion for maximal-torus conjugacy proves

Restriction of representations is a ring homomorphism $\mathrm{Res}:R(G)\to R(T)$. If a virtual representation restricts to zero, its character vanishes on $T$. Since characters are class functions and every element is conjugate into $T$, it vanishes on all of $G$. The injectivity of the character map proved in Question 3 then givesThe Weyl group is $W=N_G(T)/T$. For $n\in N_G(T)$, the operator $\rho (n)$ intertwines the restriction of $\rho$ with its twist by $t\mapsto nt{n}^{-1}$. Therefore every restricted representation, and every virtual difference of them, is fixed by $W$:

For the special orthogonal group $G=SO(2m+1)$, takewhere $R_{\theta }$ is a real planar rotation. It is a maximal torus: its Lie-algebra centralizer consists of the independent infinitesimal rotations in those planes. Its character lattice is ${\mathbb{Z}}^m$, so, writing $z_i=e^{i{\theta }_i}$,Indeed commuting unitary torus matrices diagonalize simultaneously into one-dimensional characters, and the characters of the circle are exactly the integral powers.

The normalizer permutes the real rotation planes and can reverse each angle independently. Permutations of whole two-dimensional blocks have determinant one. A reflection in one rotation plane reverses its angle and has determinant minus one; combining it with reflection of the remaining fixed line gives an element of $SO(2m+1)$. Thus all independent inversions occur. Conversely a normalizer must permute the distinct nontrivial torus character pairs $\{\pm e_i\}$ and preserve the fixed line, so there are no additional actions. The kernel of this action is exactly $T$, giving

It follows that the restriction identifies $R(SO(2m+1))$ with a subring of the signed-permutation-invariant Laurent polynomials. In this case we can prove equality. Invariance under individual inversions first givesFor one variable, every invariant is an integral combination of $1$ and $z^k+z^{-k}$, and these satisfy the recurrence $s_{k+1}=x{s}_k-s_{k-1}$. Applying this one coordinate at a time proves the assertion over the other Laurent coefficient rings. Permutation invariance and the Fundamental theorem of symmetric polynomials then givewhere $e_k$ are the elementary symmetric polynomials.

Let $V$ be the complexification of the defining $(2m+1)$-dimensional real representation. Its torus weights are $1,z_i,z_i^{-1}$. The characters of its exterior powers obeyFor $k\le m$, choosing $j$ linear terms and $r$ quadratic terms shows that the coefficient $c_k={\chi }_{{\Lambda }^{k}V}$ isIts leading term is $e_k$ with coefficient one; all other terms use $e_j$ with $j<k$. By induction $e_k$ lies in the restriction image, because $c_k$ is the character of a genuine representation and all smaller $e_j$ already lie in the image. Hence every invariant polynomial lies there, proving the representation ring of an odd-dimensional special orthogonal group descriptionThe triangular change of generators is integral, so $[{\Lambda }^{1}V],\dots ,[{\Lambda }^{m}V]$ are algebraically independent polynomial generators. For $m=1$, $c_1=1+z+z^{-1}$ and this reduces to $R(SO(3))=\mathbb{Z}[V_3]$, with the three-dimensional defining representation as generator. These are genuine representations of the orthogonal group, not the half-integral spin weights of its simply connected double cover.

Whenever the graded pieces $N_i$ are finitely generated over $S_0$, define the Poincare series of a graded module byAdditivity means $\lambda (B)=\lambda (A)+\lambda (C)$ for every short exact sequence $0\to A\to B\to C\to 0$ in the indicated category. Dimension over a field is a basic example; length is another when the modules have finite length.

The Hilbert-Serre theorem needs finite-generation hypotheses: take $S_0$ commutative Noetherian and $S$ generated over it by homogeneous $x_1,\dots ,x_r$ of positive degrees $d_1,\dots ,d_r$. For finitely generated graded $N$, every $N_i$ is then finite over $S_0$, andIf negative grading indices are allowed for the module, the numerator is a Laurent polynomial instead. In standard degree one, the coefficients are eventually polynomial functions of the index.

To prove this, regard $N$ as finite over the surjective polynomial presentation $S_0[X_1,\dots ,X_r]\to S$. Induct on $r$. At $r=0$ only finitely many homogeneous generator degrees occur, so the series is a polynomial. For the last variable $x$ of degree $d$, put $K=(0{:}_{N}x)$ and $Q=N/xN$. The polynomial ring is Noetherian by the Hilbert basis theorem, hence $K$ is finite; both $K$ and $Q$ are finite modules over the ring with that variable removed. The degree-$i$ exact sequence isAdditivity, followed by summing over $i$, givesThe induction hypothesis supplies the remaining denominator factors. This proves Hilbert-Serre theorem for an additive coefficient function. If all $d_i=1$, expanding $(1-t{)}^{-r}$ proves eventual polynomial coefficients directly.

An arbitrary positively graded ring in the introductory wording is not enough by itself. For example $S=k[X_1,X_2,\dots ]$ with every variable of degree one and $N=S$ is a cyclic graded module, but $N_1$ is not finite-dimensional over $k$, so the dimension-valued series is not even defined. The theorem above states the standard hypotheses that make the requested definition and rationality valid.

Assume $0\le k\le n$. Let $V=L_{n-1}$ be the $n$-dimensional irreducible sl2 Lie algebra representation. Choose a weight basis $v_0,\dots ,v_{n-1}$ with weights $2j-(n-1)$; this lists the usual irreducible weight string in increasing order. Its exterior power ${\Lambda }^{k}V$ has basis $v_{j_1}\wedge \cdots \wedge v_{j_k}$ for $0\le j_1<\cdots <j_k<n$, so its formal character isThe last sum is the Gaussian binomial coefficient $G_{n,k}(q^2)$. To verify the product identity, splitting the subsets according to whether they contain $n-1$ givesThe product ${\prod }_{j=1}^k(1-t^{n-k+j})/(1-t^j)$ satisfies the same recurrence, after putting both terms over their common denominator. Thus induction identifies it with the subset sum, proving it is a polynomial with nonnegative integer coefficients.

The quantum integer convention in the PDF hasMultiplying these factors in the factorial quotient givesThis establishes the required representation-theoretic interpretation.

By the Weyl complete reducibility theorem, write ${\Lambda }^{k}V\cong {⨁}_{m\ge 0}{r}_m{L}_m$, where $r_m$ are nonnegative integers. The classification of finite-dimensional sl2 representations givesEvery exterior-power weight has parity $N$ and lies between $-N$ and $N$. Therefore only $m\le N$ with $m\equiv N(\mathrm{mod}2)$ occur. For $j\ge 0$ with that parity, the coefficient $c_j$ of $q^j$ isThe coefficients consequently increase toward the middle of the occupied weight string and decrease afterward. If $G_{n,k}(t)={\sum }_{s=0}^N{a}_s{t}^s$, then $a_s=c_{-N+2s}$. HenceThis is the unimodality of Gaussian binomial coefficients, proved through parity unimodality of an sl2 character. It includes $k=0,n$, when the character is one.

There is a normalization qualification in the printed wording. The symmetric quantum-binomial quotient is a Laurent polynomial in $q$, with exponents spaced by two; the unimodality just proved is for that occupied parity, or equivalently for the ordinary polynomial $G_{n,k}(t)$ after setting $t=q^2$ and removing the monomial shift. If one instead includes every integer exponent of $q$, the literal coefficient claim is false: ${\left[\begin{array}{c}2\\ 1\end{array}\right]}_q=q+q^{-1}$ has coefficients $1,0,1$. The representation-theoretic conclusion is unimodality on the parity string, and ordinary unimodality of the Gaussian polynomial.

Write the diagonal maximal torus of $U(n)$ as $t=\mathrm{diag}(z_1,\dots ,z_n)$, $|z_i|=1$, and let $\delta =(n-1,n-2,\dots ,0)$. Irreducible complex representations are indexed by dominant integer tuples ${\lambda }_1\ge \cdots \ge {\lambda }_n$, their highest weights. The Weyl character formula in integer-exponent form isThe ratio initially uses distinct $z_i$, and extends to repeated eigenvalues by continuity. Every unitary matrix is conjugate to such a diagonal matrix, so this determines the character on the entire group. The shift $\delta$ differs from the usual Weyl vector $\rho =((n-1)/2,(n-3)/2,\dots ,(1-n)/2)$ by a multiple of $(1,\dots ,1)$; the corresponding determinant factors cancel between numerator and denominator.

We first justify the highest-weight information needed in the proof. Restriction to the torus splits a representation into integer weight spaces. In an irreducible representation choose a lexicographically largest weight $\lambda$ and a nonzero vector $v$ of that weight. A matrix unit $E_{ij}$ with $i<j$ raises the weight by $e_i-e_j$, so it annihilates $v$. The character is invariant under permutations of diagonal coordinates, because permutation matrices conjugate the torus. Hence permutations of $\lambda$ are also weights, and lexical maximality forces ${\lambda }_1\ge \cdots \ge {\lambda }_n$.

Irreducibility implies that $v$ generates the representation under the complexified Lie algebra. Indeed, a Lie-algebra invariant subspace is preserved by exponentials of skew-Hermitian matrices, which generate $U(n)$. Reorder any product of matrix units into lower-triangular units, diagonal units and upper-triangular units, usingInduction on length and on the number of out-of-order pairs gives the required spanning version of the Poincaré-Birkhoff-Witt theorem. Upper-triangular units kill $v$, and diagonal units act by scalars. Every nonempty product of lower-triangular units lowers its weight by a nonzero sum of positive roots. Therefore the top weight space is exactly $\mathbb{C}v$, and its multiplicity is one. This supplies the leading coefficient without assuming a character formula.

For completeness, every dominant integer tuple occurs. Put $d_j={\lambda }_j-{\lambda }_{j+1}\ge 0$ and form the representationIts lexicographically highest weight is $\lambda$, with one-dimensional highest space, represented by the tensor products of $e_1\wedge \cdots \wedge e_j$. A negative determinant exponent is a legitimate one-dimensional unitary-group character. Averaging an inner product over normalized Haar measure gives invariant orthogonal complements, so the tensor representation splits into irreducible summands. One of them has highest weight $\lambda$. Uniqueness will also follow from the formula and Schur orthogonality relations.

Define the alternant $A_{\kappa }(z)=\det (z_i^{{\kappa }_j})$ for a strictly decreasing integer tuple $\kappa$. The denominatoris the Vandermonde determinant, and its modulus is the denominator modulus in the Weyl integration formula. The Laurent polynomial ${\chi }_{\lambda }{A}_{\delta }$ is alternating. Any alternating Laurent polynomial decomposes as a finite summonomials with repeated exponents have zero coefficient, and the remaining permutation orbits are indexed uniquely by strictly decreasing tuples.

The lexicographically highest monomial in the product is $z^{\lambda +\delta }$ with coefficient one. Indeed, the highest monomial of the character is $z^{\lambda }$ with coefficient one, and the unique lexical maximum among permutations of $\delta$ is $\delta$ itself. It follows that $c_{\lambda +\delta }=1$.

Fourier orthogonality on the torus, whose probability measure is ${\prod }_{i}d{\theta }_i/(2\pi )$, gives alternant orthogonality on a unitary torus:Expand both determinants: an integral survives exactly when the two exponent tuples are identical up to permutation. Strict decreasing order then forces $\kappa =\eta$, and its $n!$ matching terms each contribute one.

Finally, Schur orthogonality relations give ${\int }_{U(n)}|{\chi }_{\lambda }{|}^2=1$. Applying the allowed Weyl integration formula to this class function givesSince the coefficient $c_{\lambda +\delta }$ already equals one, every other coefficient vanishes. Thus ${\chi }_{\lambda }{A}_{\delta }=A_{\lambda +\delta }$, proving the formula. If two irreducible representations had the same highest weight, their characters would now coincide; the Schur orthogonality relations imply that they are isomorphic. Apparent singularities at repeated diagonal eigenvalues are removable because the quotient equals the actual finite Laurent-polynomial character. No dimension formula has been assumed.

Put $\delta =-A^2-A^{-2}$. The reduced Kauffman bracket is the Laurent polynomial determined by $⟨◯⟩=1$, $⟨D\bigsqcup ◯⟩=\delta ⟨D⟩$, and the crossing expansion $⟨D⟩=A⟨D_A⟩+A^{-1}⟨D_B⟩$. Fix the A smoothing so that a positive curl has multiplier $-A^3$; rotating the local crossing interchanges the smoothing descriptions. Equivalently, its bracket smoothing states givewhere $a(s)$ and $b(s)$ count its A and B smoothings and $|s|$ is the number of state circles. Resolving all crossings proves that the recursive rules define the same polynomial independently of the order of expansion.

Under a positive Reidemeister move of type I, the two resolutions give $A\delta +A^{-1}=-A^3$ times the straight strand; the negative curl gives $A^{-1}\delta +A=-A^{-3}$. Thus the bracket itself is not an unframed link invariant. For type II, use the adjacent cap-cup generator $e$ of the Temperley-Lieb algebra, with $e^2=\delta e$. The crossing and its inverse are $R=A1+A^{-1}e$ and $R^{-1}=A^{-1}1+Ae$, andFor type III, $e_i{e}_{i+1}{e}_i=e_i$ and the analogous reversed relation giveHence the bracket is invariant under types II and III.

For an oriented diagram, let $w(D)$ be its writhe of a link diagram, the sum of its signed crossings. Types II and III preserve writhe of a link diagram, while a positive or negative curl changes it by one or minus one. The Jones polynomial is thereforeThe normalization cancels type I, so all Reidemeister moves preserve it. It is a Laurent polynomial in $t^{1/2}$; its breadth means the largest occurring t exponent minus the smallest, including half-integral exponents for links.

The Jones polynomial skein relation follows directly from the same normalization. Write $S$ for the bracket of the oriented smoothing and $H$ for the other smoothing. The local expansions are $⟨D_{+}⟩=AS+A^{-1}H$ and $⟨D_{-}⟩=A^{-1}S+AH$, while $w(D_{\pm })=w(D_0)\pm 1$. ConsequentlySubstituting $t=A^{-4}$ givesThe other smoothing has cancelled, so the identity applies with exactly the oriented local convention in the PDF.

The Hilbert basis theorem says that if $B$ is a commutative Noetherian ring, then $B[t]$ is Noetherian; iteration treats any finite number of variables. Here is a complete leading-coefficient proof. For an ideal $I\subseteq B[t]$, let $L_d$ be the set of degree-$d$ coefficients of its polynomials of degree at most $d$, including zero coefficients. These are ideals of $B$, and multiplication by $t$ gives $L_d\subseteq L_{d+1}$. The ascending chain condition makes the chain stationary from some $N$ onward. Choose finite generators for $L_0,\dots ,L_N$ and lift them to polynomials $f_{dj}\in I$ of degree at most $d$. If $f\in I$ has degree $m$, set $d=\min (m,N)$ and express its leading coefficient as ${\sum }_j{a}_{dj}{b}_j$, where $a_{dj}$ is the chosen degree-$d$ coefficient. Then $f-{\sum }_j{b}_j{t}^{m-d}{f}_{dj}$ has smaller degree. Induction proves that the finitely many lifts generate $I$. This proves the theorem, including coefficient rings with zero divisors.

Put $A=\mathbb{C}G$ and $L=\mathbb{C}[X,X^{-1}]$. The infinite dihedral group has normal forms $X^m$ and $X^{m}Y$. The relations move every $Y$ to the right and reduce its exponent modulo two; the action $X:n\mapsto n+1$, $Y:n\mapsto -n$ on $\mathbb{Z}$ shows that these forms are distinct. ThusThe Hilbert basis theorem makes $\mathbb{C}[X]$ Noetherian, and its localization $L$ is Noetherian: an ideal of a localization is generated by the images of the finite generators of its contraction. Since $A$ is free of rank two over $L$ on the left, it is a Noetherian module over $L$. Every left ideal of $A$ is an $L$-submodule, so all its ascending chains stabilize. Therefore $\mathbb{C}G$ is left Noetherian.

For the center of the infinite dihedral group algebra, write an element as $f(X)+g(X)Y$. Commuting it with $X$ gives $g(X)(X^{-1}-X)=0$ in the Laurent integral domain, forcing $g=0$. Commuting $f(X)$ with $Y$ then gives $f(X)=f(X^{-1})$. A symmetric Laurent polynomial is a linear combination of $1$ and $X^j+X^{-j}$, $j\ge 1$. With $z=X+X^{-1}$, the recursionexpresses $S_j=X^j+X^{-j}$ as a polynomial in $z$. Conversely every polynomial in $z$ is central. The highest Laurent exponent of a nonzero polynomial in $z$ shows that $z$ is transcendental. HenceThe identities $X^{-1}=z-X$ and $X^2-zX+1=0$ give $L=R+RX$. Independence follows by applying $X\mapsto X^{-1}$ to a relation $f(z)+Xg(z)=0$ and subtracting: $(X-X^{-1})g(z)=0$, so $g=f=0$. Consequentlyis a free $R$-module of rank four.

Let $M$ be a nonzero simple module on the left. For any $m\ne 0$, $M=Am$, so it is finite over $R$. Every central $r\notin P={\mathrm{Ann}}_R(M)$ acts bijectively: its kernel and image are $A$-submodules, and simplicity forces kernel zero and image $M$. To prove that $P$ is maximal, not merely prime, put $B=R/P$; then $M$ is a faithful finite $B$-module. For $0\ne b\in B$, $bM=M$. If $m_1,\dots ,m_d$ generate $M$, write $m_i=b{\sum }_j{c}_{ij}{m}_j$. The adjugate matrix identity for $I-bC$ shows that $\det (I-bC)$ annihilates every generator and hence $M$. Faithfulness makes this determinant zero in $B$. Its constant term is one, so it has form $1-bq$, proving $bq=1$. Thus $B$ is a field, and $P$ is a maximal ideal of $R$. This proves the general principle for simple modules over an algebra finite over its center in this instance.

Every maximal ideal of $\mathbb{C}[z]$ is $(z-\lambda )$ for some $\lambda \in \mathbb{C}$, by factorization of complex polynomials. The module $M=Am$ is therefore a quotient of the four-dimensional algebra $A/(z-\lambda )A$. In particular ${\dim }_{\mathbb{C}}M\le 4<\infty$, as required.

The actual simple dimensions are at most two. If $\lambda \ne \pm 2$, choose $u\ne \pm 1$ with $u+u^{-1}=\lambda$. The matrices $X=\mathrm{diag}(u,u^{-1})$ and $Y=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$ give a representation of $A/(z-\lambda )A$ onto $M_2(\mathbb{C})$: polynomial functions of $X$ give the two diagonal matrix units, and multiplication by $Y$ gives the off-diagonal ones. Both algebras have dimension four, so this is an isomorphism. If $\lambda =\pm 2$, the element $X\mp 1$ has square zero and is conjugated to its negative by $Y$; its generated two-sided ideal is square zero. It annihilates every simple module, since its action on a simple module is either zero or the whole module, and the latter contradicts its square being zero. The remaining quotient is $\mathbb{C}[C_2]$, whose two simple modules have $Y=\pm 1$. Thus the generic simple modules have dimension two, and the four exceptional one-dimensional characters have $X=\pm 1$, $Y=\pm 1$.

Put $\delta =-A^2-A^{-2}$. The reduced Kauffman bracket is the Laurent polynomial determined by $⟨◯⟩=1$, $⟨D\bigsqcup ◯⟩=\delta ⟨D⟩$, and the crossing expansion $⟨D⟩=A⟨D_A⟩+A^{-1}⟨D_B⟩$. Fix the A smoothing so that a positive curl has multiplier $-A^3$; rotating the local crossing interchanges the smoothing descriptions. Equivalently, its bracket smoothing states givewhere $a(s)$ and $b(s)$ count its A and B smoothings and $|s|$ is the number of state circles. Resolving all crossings proves that the recursive rules define the same polynomial independently of the order of expansion.

Under a positive Reidemeister move of type I, the two resolutions give $A\delta +A^{-1}=-A^3$ times the straight strand; the negative curl gives $A^{-1}\delta +A=-A^{-3}$. Thus the bracket itself is not an unframed link invariant. For type II, use the adjacent cap-cup generator $e$ of the Temperley-Lieb algebra, with $e^2=\delta e$. The crossing and its inverse are $R=A1+A^{-1}e$ and $R^{-1}=A^{-1}1+Ae$, andFor type III, $e_i{e}_{i+1}{e}_i=e_i$ and the analogous reversed relation giveHence the bracket is invariant under types II and III.

For an oriented diagram, let $w(D)$ be its writhe, the sum of its signed crossings. Types II and III preserve writhe, while a positive or negative curl changes it by one or minus one. The Jones polynomial is thereforeThe normalization cancels type I, so all Reidemeister moves preserve it. It is a Laurent polynomial in $t^{1/2}$; its breadth means the largest occurring t exponent minus the smallest, including half-integral exponents for links.

Write $s_A,s_B$ for the all-A and all-B circle counts of a diagram with $n$ crossings. A state obtained from the all-A state by $k$ smoothing changes has at most $s_A+k$ circles, because each change either joins two circles or splits one. Its largest A exponent is consequently at most $n-2k+2(s_A+k-1)=n+2s_A-2$. The symmetric argument from the all-B state bounds every exponent below by $-n-2s_B+2$. Thus the Kauffman bracket breadth bound isFor a connected diagram, construct the Turaev surface by placing A-state circles above the projection sphere, B-state circles below it, inserting one saddle at each crossing, and capping the state circles. This is a connected embedded closed orientable surface; its disks and saddles give $\chi =s_A+s_B-n$. Since $\chi =2-2g_T\le 2$, $s_A+s_B\le n+2$. Writhe normalization changes only a monomial, and $t=A^{-4}$ divides breadth by four. Therefore

For a connected reduced alternating diagram, checkerboard color its complementary regions. Alternation makes all-A circles the boundaries of one color and all-B circles the boundaries of the other. Euler's formula for the connected four-valent projection graph gives $s_A+s_B=n+2$. Its Tait graph and planar dual have no loops: a loop in either, equivalently a loop or bridge in one, gives a nugatory crossing cut off by a simple closed curve. Reducedness excludes precisely such crossings. Changing one smoothing in the all-A or all-B state therefore joins distinct circles, so the diagram is an adequate link diagram.

This also proves that the extreme coefficients cannot cancel. If $k\ge 1$ smoothings are changed from the all-A state, the first change lowers its circle count by one and the remaining $k-1$ changes increase it by at most $k-1$. The largest exponent of that state is at most $n+2s_A-6$, four below the all-A extreme $n+2s_A-2$, whose coefficient is $(-1{)}^{s_A-1}$. The all-B extreme is uniquely attained for the same reason. Consequently

For each alternating knot $K_i$, remove nugatory crossings from an alternating diagram. The equality just proved, together with the general breadth bound for any knot diagram, shows that its reduced crossing count is minimal: $c(K_i)=\mathrm{br}{V}_{K_i}$. Joining two knot diagrams by an orientation-compatible connected sum of knots gives $V_{K_1\#K_2}=V_{K_1}{V}_{K_2}$. Indeed the state circles joined along the sum arc become one, so the bracket state sums multiply, and writhe adds. Nonzero Laurent polynomials have additive breadth, because their extreme coefficients multiply. Hence every diagram of the sum has at least $c(K_1)+c(K_2)$ crossings, while joining the two minimal alternating diagrams achieves that count. Thus

Finally suppose that the two-component link is split. Its Jones polynomial satisfies $V_L=-(t^{1/2}+t^{-1/2})V_{K_1}{V}_{K_2}$, by the disjoint-union bracket rule, so $V_L(-1)=0$. If the given alternating diagram were connected, its Tait graph $G$ would be connected. Evaluate the bracket at $A=e^{\pi i/4}$, where $\delta =0$ and $t=-1$. Only one-circle states survive. These are exactly the spanning trees of $G$: a regular neighborhood of a chosen spanning subgraph has one boundary circle exactly when it is connected and has no cycle. All spanning trees use the same number of black-joining smoothings, $|V(G)|-1$. Since the crossing-to-checkerboard smoothing choice is uniform in an alternating diagram, all surviving state weights are the same nonzero power of $A$. Therefore $⟨D⟩$ is that power times the positive number of spanning trees, and $V_L(-1)\ne 0$, a contradiction.

The diagram is thus disconnected. Each of the two link components projects to a connected subset, so the two projection components can be separated by a boundary curve of a small regular neighborhood in the projection sphere. Hence a split two-component link represented by a reduced alternating diagram has a split diagram.