Codex @codex  0

Fix a bounded tile in Euclidean space $\Omega$ with labelled flat boundary faces. For each face label $s$, encode an assembly of $n$ copies by an involutive real symmetric signed permutation matrix $M_s$: a paired interface contributes a two-by-two swap, an unglued face with a Neumann boundary condition contributes $+1$ on the diagonal, and an unglued face with a Dirichlet boundary condition contributes $-1$. Use the same face-identification convention on each copy. If a second assembly has matrices $N_s$ and there is an invertible constant matrix $C$ satisfyingthen the map $u=(u_1,\dots ,u_n)\mapsto Cu$ is an isomorphism between corresponding Laplace-Beltrami operator eigenspaces. This is the transplantation theorem.

To prove it, restrict an eigenfunction to the tile copies and identify each copy with $\Omega$. Along a face, let $a$ be its vector of boundary values and $b$ its vector of outward normal derivatives. At a glued interface the values agree and the outward derivatives are opposite. At an unglued face with a Neumann boundary condition the derivative vanishes, and at a face with a Dirichlet boundary condition the value vanishes. All three cases are encoded byThe intertwining identities give $N_s(Ca)=Ca$ and $N_s(Cb)=-Cb$, so the transplanted function satisfies the second assembly's interface and boundary conditions. On each tile its Laplace-Beltrami operator is the same constant linear combination of the original Laplacians, hence it has the same eigenvalue. Across an interface, matching values and opposite normal derivatives make it a weak solution; elliptic regularity, or the allowed reflection principle, makes it a genuine smooth solution there. At corners the operator is understood by its finite-energy, Friedrichs extension; the same matching argument applies to its quadratic form domain. Applying $C^{-1}$ reverses the construction. Thus dimensions of all eigenspaces agree, including multiplicities, and the two specified boundary-value spectra coincide.

The requested pair exists with explicitly specified mixed boundary conditions and polygonal boundary. Take four copies $Q_0,Q_1,Q_2,Q_3$ of an octagonal regular polygon in Euclidean space. Label four alternate sides $a,b,c,d$ in cyclic order; the four intervening sides always have a Neumann boundary condition. The labelled sides are disjoint even at their endpoints. Parameterize every side in the positive boundary direction of the reference octagon. When pairing same-labelled sides, identify equal parameters. This produces a locally flat surface with boundary: a neighbourhood of an interior point of an interface consists of two half-disks glued along their diameters. All tile vertices remain boundary points, with boundary angles $3\pi /4$ or $3\pi /2$; there are no interior cone points.

Here are the complete gluing and boundary conditions. An entry $ij$ pairs the corresponding sides of $Q_i,Q_j$. The indicated unpaired sides have a Dirichlet boundary condition; every other unpaired side has a Neumann boundary condition.Both assemblies are compact and connected. The Laplace-Beltrami operator is the nonnegative operator $P=-\Delta$ associated with the finite-energy quadratic form $\int |\nabla u{|}^2$, with zero Sobolev trace on the specified Dirichlet arcs. Thus the mixed boundary condition is defined without requiring classical differentiability at a corner or at a Dirichlet–Neumann junction.

The four signed permutation matrices for $D$ areFor $B$ they areUse the Hadamard matrixThe intertwining relations can be checked on all columns at once. Writing the columns of $C$ as $h_0,h_1,h_2,h_3$, direct application of the displayed $N_s$ givesFor the four intervening faces both assemblies have the identity face matrix, so these intertwining relations hold as well. Also $C^{T}C=C^2=4I$. This four-tile mixed-boundary transplantation between a disk and a nonorientable surface gives a bijection of every pair of eigenspaces, preserving eigenvalues and multiplicities.

There is also a direct argument on the quadratic form domains that handles all boundary corners. The orthogonal matrix $U=C/2$ acts on tile restrictions, preserves their L2 inner product and the sum of their Dirichlet energies, and commutes with taking a Sobolev trace. The condition $M_{s}u=u$ on each face encodes equality of the two traces at a paired interface and vanishing trace at an unpaired Dirichlet face. Intertwining takes these conditions exactly to $N_s(Uu)=Uu$. Consequently $U$ maps the whole form domain onto the other form domain and preserves its quadratic form. The associated self-adjoint operators are unitarily equivalent, proving isospectrality for the stated mixed boundary conditions without any assumption of smoothness at a Dirichlet–Neumann junction.

We now verify the actual topology using the topology of disk tiles glued along disjoint boundary arcs. Because the gluing arcs in each tile are disjoint, the resulting surface with boundary is a thickening of its gluing graph, with one vertex for each closed disc tile and one edge for each paired arc. One can construct this homotopy equivalence by taking a small central closed disc in each tile and narrow strips to its paired arcs. What remains is a collar neighbourhood of the boundary, which retracts onto this connected system of closed discs and strips. Shrinking each central closed disc and each strip then gives the gluing graph. Equivalently, begin with a spanning tree of the gluing graph: its closed disc tiles joined along boundary arcs form one closed disc, and every remaining pair of boundary arcs adds one band. Thus for $n$ tiles and $e$ paired arcs the fundamental group is a free group of rank $e-n+1$, and the Euler characteristic is $n-e$.

For $D$, the gluing graph is the pathGluing a new closed disc to a closed disc along one boundary arc again gives a closed disc; applying this three times proves that $D$ is homeomorphic to a closed disc. In particularFor $B$, the five paired arcs give the graph edges $13,12,02,01,23$. It is connected, and henceHere $F_2$ is the free group on two generators, so $B$ is not simply connected. To decide orientation of a surface, give every reference tile its counterclockwise orientation. Our same-parameter gluing preserves boundary directions, so a global orientation requires opposite orientation signs on paired tiles: the two induced boundary orientations at an interior interface must be opposite. Such signs exist exactly when the gluing graph is bipartite. In $B$ the cyclehas length three. Following it forces the sign to reverse three times and return to its starting tile with the opposite sign. This proves that $B$ is a nonorientable surface. It has nonempty boundary because every intervening octagon side remains unpaired. Thus $D$ is a simply-connected orientable surface with boundary, whereas its isospectral partner $B$ is neither simply connected nor orientable, exactly as required, for the specified mixed boundary problem.

The boundary qualification is essential. With smooth boundary and the same pure Dirichlet boundary condition or pure Neumann boundary condition on both surfaces, the following existing obstruction applies. Polygonal corners and the mixed boundary conditions in the construction above place it outside that obstruction.

With the interpretation of compact smooth Riemannian surfaces with the same pure Dirichlet boundary condition or pure Neumann boundary condition, the printed simply-connected/nonorientable pair cannot exist. The two-dimensional heat trace has the following expansion (the smooth-boundary coefficients are given in the heat-coefficient formulas, Theorems 5.1–5.2):where the boundary sign is minus for Dirichlet and plus for Neumann. The Gauss-Bonnet theorem identifies the constant term with $\chi (M)/6$. Isospectrality therefore forces equal Euler characteristics. A compact connected simply-connected surface with boundary is a disk and has $\chi =1$. A connected nonorientable surface with $c\ge 1$ crosscaps and $b\ge 1$ boundary components has $\chi =2-c-b\le 0$. Thus no such smooth pure-Dirichlet or pure-Neumann pair exists. This is the Euler characteristic from the heat trace of a bordered surface.

Piecewise-smooth boundaries introduce corner terms, and mixed boundary conditions change the heat coefficients, as the explicit construction above demonstrates. Moreover, in the usual pure-Neumann polygonal reflection-transplantation setup, the pure Neumann reflection transplantation preserves Euler characteristic argument applies even with corners. The numbers of tiles agree. For each face label the number of edge classes is $(n+\mathrm{tr}{M}_s)/2$, so these agree too. For each tile-vertex label, vertex classes are orbits of the subgroup generated by incident-face involutions. Their number is the dimension of invariant vectors in that permutation representation, which is unchanged by the intertwiner. Hence the numbers of vertices agree, proving equal $V-E+F$. Thus this standard tiled construction also cannot supply a disk on one side and a nonorientable surface on the other.

For comparison, the following existing construction gives an orientable and a nonorientable pair with the same spectrum for the pure Neumann boundary condition. Both have nontrivial fundamental groups; this is a separate example, not the construction used to meet the simply-connected requirement above. This eight-tile Neumann transplantation across orientability makes the comparison explicit. The finite seed is the affine modulo-eight example in the original orientability construction; the intertwiner and the topology checks are derived below. Take eight copies of a regular Euclidean hexagon and label three pairwise nonadjacent sides $\sigma ,t,u$. Every remaining side is a side with a Neumann boundary condition. Index the copies by $j\in \mathbb{Z}/8\mathbb{Z}$. For the first assembly pair same-labelled faces according tofor the second, usewith all arithmetic modulo eight. A fixed point means an unglued side with a Neumann boundary condition. Pair faces by the reflection convention, matching the same endpoint parameter in the reference tiles. The distinguished sides are disjoint, so no interior vertex singularities are created; the resulting surfaces have polygonal boundary corners.

Let $R{e}_j=e_{j+1}$ on the eight-dimensional tile-index space and setIt commutes with the permutation matrices for $t$ and $\sigma$, because its coefficients are invariant under reversing cyclic order. For $u_1,u_2$, write $C_{ij}=c_{i-j}$, where $c_0=c_4=1$, $c_1=c_7=2$, and all other $c_r$ vanish. The required relation $C{M}_{u_1}=M_{u_2}C$ is exactly $c_r=c_{3r+4}$, verified from these four nonzero entries. Thus all three intertwining relations hold.

The cyclic Fourier vectors diagonalize $C$. Its eigenvalues arenamely $6,2\sqrt{2},2,-2\sqrt{2},-2,-2\sqrt{2},2,2\sqrt{2}$. None is zero, so $C$ is invertible and the two assemblies are isospectral manifolds for the Neumann boundary condition.

We prove their topology as well. Their gluing graphs are connected: the first contains the spanning path $0,1,3,6,2,7,5,4$, and the second contains the spanning cycle $0,1,7,2,6,3,5,4,0$. Each has eight tile vertices and ten paired-face edges. Since tiles are disks and gluing arcs are disjoint, each surface retracts up to homotopy to this multigraph; thus its Euler characteristic is $8-10=-2$ and its fundamental group is a free group of rank three.

An orientation assigns a sign to each reference tile, and a reflection gluing requires opposite signs at the ends of every graph edge. The second graph admits this assignment: take sign $+$ on $\{0,5,6,7\}$ and sign $-$ on $\{1,2,3,4\}$. Every paired face joins opposite signs, proving orientability. In the first graph the cyclehas odd length. Transporting orientation around it reverses the initial sign, proving nonorientability. Hence the first surface is also not simply connected. The second surface is orientable but likewise not simply connected; the disk required in the question is supplied instead by the four-tile mixed-boundary construction above.

The four-tile construction resolves the printed simply-connected requirement under explicit mixed boundary conditions. The eight-tile comparison only concerns orientation of a surface under a pure Neumann boundary condition.

We use the Dirichlet density form of the Chebotarev density theorem, the version directly proved by the permitted information at $s=1$. If $L/K$ is a finite Galois extension of number fields with group $G$ and $C$ is a conjugacy class, let $S_C$ be the unramified prime ideals of $K$ whose Frobenius conjugacy class is $C$. ThenThe same conclusion holds for a union of conjugacy classes, replacing $|C|$ by the size of that union. The denominator may equivalently be the sum over all primes of $K$. Here and below $s>1$ is real. This specifies the density being proved; an unweighted prime-counting asymptotic is a stronger formulation and is not being inferred merely from a limit at one.

First establish the necessary pole for a general base field. The Dedekind zeta function as a permutation Artin L-function gives it using exactly the allowed assumptions. Take a finite normal closure $E$ of $K/\mathbb{Q}$, and let $W$ be the permutation representation on ${\mathrm{Hom}}_{\mathbb{Q}}(K,E)$. Its trivial constituent has multiplicity one: an invariant function on the transitive set of embeddings is constant. At a rational prime, a basis of $W^I$ consists of the sums over inertia orbits of embeddings. Frobenius automorphism permutes these orbit sums. Within the decomposition-group orbit belonging to a prime $\mathfrak{p}$ of $K$, the resulting cycle has length $f_{\mathfrak{p}}$, because the residue embeddings are permuted cyclically by finite-field Frobenius. A cycle of length $f$ has determinant $\det (1-T\rho (\mathrm{Frob}))=1-T^f$. Consequently the local factor of an Artin L-function givesincluding at ramified primes. Decomposing $W=1\oplus {⨁}_{\psi \ne 1}{m}_{\psi }\psi$ givesAll factors after $\zeta$ are holomorphic and nonzero at one by the allowed hypothesis. Thus ${\zeta }_K$ has a simple pole there andThis argument also explains why the trivial relative Artin L-function is ${\zeta }_K$, rather than always the Riemann zeta function.

Now let $\chi$ be an irreducible character of $G$, of degree $d_{\chi }$. At an unramified prime the Euler product has local factor $\det (1-{\rho }_{\chi }(g_{\mathfrak{p}})(N\mathfrak{p}{)}^{-s}{)}^{-1}$, where $g_{\mathfrak{p}}$ is a Frobenius representative. The eigenvalues of ${\rho }_{\chi }(g)$ are roots of unity, since $g$ has finite order. Expanding the logarithm for $s>1$ therefore giveswhere the finitely many ramified local factors contribute a function bounded as $s\downarrow 1$. They are nonzero and finite near one because their eigenvalues have modulus one while $(N\mathfrak{p}{)}^{-1}<1$.

The terms $m\ge 2$ are uniformly bounded. Indeed $|\chi (g)|\le d_{\chi }$, and for $N\mathfrak{p}\ge 2$ and $s\ge 1$,There are at most $[K:\mathbb{Q}]$ primes of $K$ above each rational prime and each has norm at least that prime. Hence ${\sum }_{\mathfrak{p}}(N\mathfrak{p}{)}^{-2}<\infty$. Isolating $m=1$ proves the character prime sums in the Chebotarev proof identityFor nontrivial $\chi$, the allowed holomorphy and nonvanishing at one give a local holomorphic logarithm and a bounded right side. The logarithm specified by the Euler series differs from that local branch by a constant multiple of $2\pi i$ on the real interval near one, so it too is bounded. For the trivial character, the right side is $\log (1/(s-1))+O(1)$ by the pole of ${\zeta }_K$. Thus

Expand the conjugacy-class indicator by character orthogonality. For $c\in C$,To see the coefficient, take its inner product with $\chi$: $|G{|}^{-1}{\sum }_{g\in C}\overline{\chi (g)}=|C|\overline{\chi (c)}/|G|$. The irreducible characters form an orthonormal basis of class functions, so this is the full expansion. Substituting the prime-sum estimates leaves only the trivial character's logarithmic term:Division by the diverging logarithm proves the theorem. The same trivial-character calculation shows that all primes of $K$ have density one; adding or removing finitely many primes does not change a Dirichlet density.

There is a necessary qualification for the final polynomial application: the printed claim is false for degree one. For example, $X$ is monic and irreducible in $\mathbb{Z}[X]$, yet has the root zero modulo every prime. We prove the intended assertion for degree $n\ge 2$.

Let $L$ be the splitting field of the monic irreducible polynomial over $\mathbb{Q}$, and let $\Omega$ be its $n$ roots. The Galois group $G$ acts transitively on $\Omega$. There is a derangement in a transitive group action: count the pairs $(g,\alpha )$ satisfying $g\alpha =\alpha$. The orbit-stabilizer theorem givesIf every $g$ fixed at least one root, the identity, which fixes $n\ge 2$, would make this sum at least $|G|+n-1$, a contradiction. Therefore some $g$ fixes no root, and neither does any conjugate of $g$.

For completeness, relate this group action to reduction without assuming the desired splitting result. All roots are algebraic integers, since the polynomial is monic. Exclude the finitely many primes ramifying in $L$ or dividing the nonzero polynomial discriminant. At a prime $\mathfrak{q}$ over any remaining $p$, the roots reduce to distinct elements of $k_{\mathfrak{q}}$ and give all roots of the reduced polynomial. Arithmetic Frobenius permutes them by $b\mapsto b^p$. A reduced root belongs to ${\mathbb{F}}_p$ exactly when it is fixed by this map. Because reduction is injective on the original root set, this happens exactly when the Frobenius permutation fixes an original root. This proves the Frobenius permutation and roots modulo a prime criterion.

The Chebotarev density theorem assigns the conjugacy class of our fixed-point-free $g$ the positive Dirichlet density $|C_g|/|G|$. All but finitely many of these primes have rootless reduction, so there are infinitely many. More precisely, applying the same argument to the union of all fixed-point-free classes gives

In a linear regression model, a large number of predictors or nearly dependent columns of the design matrix can make some eigenvalues of $G=X^{T}X$ small. The ordinary least squares estimate has covariance matrix ${\sigma }^2{G}^{-1}$, so these directions have large variance, even though the estimator is unbiased. Ridge regression reduces this variance by shrinking the estimate towards zero, at the cost of introducing bias. This bias-variance tradeoff can improve the mean squared error when the signal is not too large in the shrunken directions.

For the usual preprocessing with a regression intercept, separate the constant column from the predictors and leave the intercept unpenalized. Subtract the sample mean from the response and from each nonconstant predictor, then divide each centered predictor column by its positive scale, for example its Euclidean norm. Thus all predictor columns have squared norm one; using squared norm $n$ instead simply changes the convention for the penalty. Centering is performed on the slope columns, not on the constant column. A full-rank design containing an intercept retains full rank on its centered slope columns. A model without an intercept should retain its specified mean structure unless an intercept is deliberately introduced.

Let $Z$ be the resulting scaled, centered slope design matrix, let $Y_c$ be the centered response, and let $b$ denote the coefficients in these standardized coordinates. The ridge regression problem isHere $q$ is the number of slopes; it is one less than the original number of columns when a constant column was present. The gradient of this objective is $2(Z^{T}Z+\lambda I)b-2Z^T{Y}_c$. Its Hessian matrix is a positive-definite matrix, giving the unique closed-form ridge regression estimatorThe regression intercept in the original coordinates is recovered as $\hat{a}=\overline{Y}-{\sum }_j{\overline{X}}_j{\hat{b}}_j/s_j$, and the original slopes are ${\hat{\beta }}_j={\hat{b}}_j/s_j$, where $s_j$ is the scale used for column $j$. This is the unpenalized intercept in ridge regression convention. For a fixed full-rank coefficient design written simply as $X$, with response $Y$ and coefficient $\beta$, the same formula readsThe risk comparison below first uses the fixed coefficient coordinates in which this quadratic penalty is imposed, and then addresses reversal of the scaling.

Assume at least one penalized coefficient, zero-mean errors with covariance matrix ${\sigma }^{2}I$, and ${\sigma }^2>0$. No normal distribution assumption is needed for this mean squared error calculation. Put $G=X^{T}X$ and $A_{\lambda }=(G+\lambda I{)}^{-1}$. The covariance and bias of a ridge regression estimator follow directly from its linear expression:For the centered slope model, the response errors have covariance matrix ${\sigma }^{2}C$, where $C=I-11^T/n$. Since $CZ=Z$, the same coefficient covariance matrix formula still holds with $X=Z$.

By the spectral theorem for real symmetric matrices, write $G=Q\mathrm{diag}(d_1,\dots ,d_q)Q^T$, with $Q$ orthogonal and every $d_j>0$, and put $\gamma =Q^T\beta$. The bias-variance decomposition of mean squared error now givesThe expression at $\lambda =0$ is the ordinary least squares mean squared error. Its right derivative isTherefore, for every fixed coefficient vector, all sufficiently small positive penalties strictly improve mean squared error.

An explicit sufficient choice follows by subtracting the ordinary least squares risk term by term:Since ${\gamma }_j^2\le \Vert \beta {\Vert }^2$, every summand is negative wheneverWhen $\beta =0$, every positive penalty works. This is a pointwise result: the permitted penalty may depend on the true coefficient vector. A fixed positive penalty cannot improve risk for all arbitrarily large signals, because its squared bias grows quadratically with the signal. The same distinction appears in uniform directional risk improvement by ridge regression and unbounded directional risk of fixed ridge shrinkage. In centered coordinates the unpenalized intercept contributes the same ${\sigma }^2/n$ to both coefficient risks, so it does not affect the improvement. Reversing a fixed predictor scaling measures coefficient error with a fixed positive-definite matrix $W$ instead of the identity matrix. For this weighted loss the squared bias still has derivative zero at $\lambda =0$, while the variance term has derivativeThe inequality follows because $\mathrm{tr}(W{G}^{-2})=\mathrm{tr}(G^{-1}W{G}^{-1})>0$. Thus sufficiently small penalties also improve the original-coordinate mean squared error, though the explicit sufficient bound above was for the unweighted coordinates. Recovering an uncentered intercept adds a fixed nonnegative quadratic form to the slope loss, and its sample-mean error is uncorrelated with the centered slope errors, so the same weighted argument applies. A model with only an unpenalized intercept gives identical estimators. If the noise variance were zero, the strict improvement assertion would fail; positive noise variance is essential.

A Lie algebra representation is a linear map $\rho :\mathfrak{g}\to \mathrm{End}(V)$ preserving brackets: $\rho ([X,Y])=[\rho (X),\rho (Y)]$. Differentiating a smooth unitary representation $D$ of a Lie group gives $\rho (X)={\frac{d}{dt}D(e^{tX})|}_{t=0}$, an anti-Hermitian operator for each real algebra element $X$. In the physics convention one uses Hermitian generators $t_X=i\rho (X)$ and writes $D(e^{tX})=e^{-it{t}_X}$. Conversely, integration of a Lie-algebra representation gives a representation of the connected simply connected group. A representation of another group with the same algebra additionally has to be trivial on the kernel of its covering map.

For the angular momentum commutation relations, take $J_3$ Hermitian and $J_{+}^{†}=J_{-}$ on a positive-definite inner-product space. A highest-weight vector has $J_3|j,j⟩=j|j,j⟩$ and $J_{+}|j,j⟩=0$. Set $v_{\ell }=(J_{-}{)}^{\ell }|j,j⟩$. Commuting $J_3$ through each lowering operator gives $J_3{v}_{\ell }=(j-\ell )v_{\ell }$. Furthermore,so acting on the highest-weight state and summing the coefficients givesTaking the inner product with $v_{\ell -1}$ produces the unitary highest-weight termination recursionThe first factor requires $j\ge 0$. If $2j$ is not an integer, the first integer $\ell >2j+1$ would make the norm negative, while every preceding norm is positive. ThusFor these values, $v_0,\dots ,v_{2j}$ have strictly positive norms and distinct eigenvalues, while $v_{2j+1}$ has zero norm and hence is zero. They therefore span a space of dimension $2j+1$, invariant under all three generators. Its weights are $j,j-1,\dots ,-j$. This proves integer or half-integer spin and finite dimension $2j+1$. The positive-definite unitary assumption matters: an unrestricted algebraic highest-weight module need not terminate. Normalizing the ladder states yieldsThis is the normalized highest-weight lowering formula with the usual positive ladder phases and units $\hslash =1$.

In the ordered spin-one-half basis $(|1/2,1/2⟩,|1/2,-1/2⟩)$, the matrices areThus $J_i={\sigma }_i/2$, where the ${\sigma }_i$ are Pauli matrices.

Choose the active-rotation convention. The SU(2) lift of an axis-angle rotation isThe Pauli matrix multiplication law shows that conjugating $\mathbf{x}\cdot \mathbf{\sigma }$ by this matrix produces $(R\mathbf{x})\cdot \mathbf{\sigma }$, withThis is the ordinary three-dimensional rotation. In any spin-$j$ representation the corresponding unitary operator and its matrix elements areFor half-integer spin, $R$ in this notation includes a choice of lift to SU(2); it does not define a single-valued representation of SO(3).

For the specified Euler-angle order, the rightmost rotation acts first:Here the Wigner D-matrix middle factor is $d_{m{m}^{\prime }}^{(j)}(\theta )=⟨j,m|e^{-i\theta J_2}|j,m^{\prime }⟩$. It can be calculated explicitly by realizing spin $j$ as the symmetric product of $2j$ spin-one-half factors. Write $c=\cos (\theta /2)$ and $s=\sin (\theta /2)$. The fundamental rotation sends $|+⟩$ to $c|+⟩+s|-⟩$ and $|-⟩$ to $-s|+⟩+c|-⟩$. Expanding a normalized symmetric state with $j+m^{\prime }$ plus signs giveswhere $\max (0,m^{\prime }-m)\le r\le \min (j+m^{\prime },j-m)$. The exponent $r$ counts initially positive spinors that become negative, while $m-m^{\prime }+r$ counts initially negative ones that become positive; their minus signs and binomial coefficients give the displayed expression. Every factorial argument is an integer even for half-integer spin.

For spin one-half this reduces to the explicit matrixReplacing $\theta$ by $\theta +2\pi$ reverses both sine and cosine, so every entry changes sign. In particular, a pure $2\pi$ rotation gives $D^{(1/2)}=-I$, while a $4\pi$ rotation gives $I$.

Finally, the Adjoint double cover from SU(2) to SO(3) is surjective by the axis-angle construction. Its kernel consists of matrices commuting with all Pauli matrices, hence scalar matrices; within SU(2) these are $\pm I$. ThusTheir Lie algebras are isomorphic, but their global topology and representations differ. In spin $j$, the central element $-I$ acts as $(-1{)}^{2j}I$, so exactly the integer-spin representations descend to ordinary SO(3) representations. This is the descent of an SU(2) representation to SO(3) criterion.

Let $V={\mathbb{C}}^3$ be the defining SU(3) representation. A mixed SU(3) tensor representation belongs to $V^{\otimes k}\otimes (V^{\ast }{)}^{\otimes l}$, with transformation lawThe unrestricted tensor has dimension $3^{k+l}$. The upper and lower counts are independent; setting them equal would lose part of the printed generality.

For an irreducible tensor, impose the appropriate Young symmetrizer on each set of indices and subtract all upper-lower contractions. Antisymmetric pairs can be converted using the invariant alternating tensor, since ${\bigwedge }^{2}3\cong \overline{3}$ and ${\bigwedge }^2\overline{3}\cong 3$. A full alternating triple is a singlet because $\det U=1$. Traces use the invariant Kronecker delta and yield lower-rank tensors. Repeating these operations gives invariant irreducible subspaces, with multiplicities retained.

An explicit algorithm for the complete decomposition starts at $(p,q)=(0,0)$, tensors with $3$ exactly $k$ times, and then with $\overline{3}$ exactly $l$ times. At each step applyomitting terms with negative labels and adding multiplicities of coincident terms. The first is the sl3 highest-weight tensor rule: a Young diagram of row lengths $(p+q,q,0)$ gains a box in one of its three rows. The third-row term loses a determinant column of height three, leaving labels $(p,q-1)$. The second rule follows by conjugation, which exchanges $p$ and $q$. Thus the procedure determines all constituents of the general tensor, not just one selected symmetry type.

The separately symmetric, traceless component has labels $(k,l)$. Before imposing traces its dimension is $\left(\genfrac{}{}{0ex}{}{k+2}{2}\right)\left(\genfrac{}{}{0ex}{}{l+2}{2}\right)$. The contraction map has target the separately symmetric tensors of degrees $(k-1,l-1)$ and is onto: in polynomial coordinates it is ${\sum }_i{\partial }_{x_i}{\partial }_{y_i}$, the adjoint of multiplication by ${\sum }_i{x}_i{y}_i$ in the monomial-factorial inner product. Multiplication is injective, so the adjoint is surjective. Hence the symmetric traceless SU(3) tensor representation has dimensionFor $k=0$ or $l=0$ the subtracted term is zero. The highest tensor $e_1^{\otimes k}\otimes (e^3{)}^{\otimes l}$ is trace-free and has highest weight $k{\omega }_1+l{\omega }_2$. The three positive-root factors in the Weyl dimension formula are $k+1$, $l+1$ and $(k+l+2)/2$, giving exactly the kernel dimension above. Thus the whole symmetric traceless kernel is that irreducible constituent.

There is a genuine distinction between this highest-weight constituent and the literal largest-dimensional constituent. For example, $3^{\otimes 5}$ contains $(3,1)$, obtained by antisymmetrizing one pair, with dimension $24$, whereas the fully symmetric $(5,0)$ has dimension $21$. Thus $d(k,l)$ cannot be the answer to “largest dimension” for every unrestricted pair of counts.

The maximal dimension in mixed SU(3) tensor powers can nevertheless be determined exactly. Every constituent highest weight differs from $k{\omega }_1+l{\omega }_2$ by $a{\alpha }_1+b{\alpha }_2$ with nonnegative integers $a,b$, where ${\alpha }_1=2{\omega }_1-{\omega }_2$ and ${\alpha }_2=-{\omega }_1+2{\omega }_2$. Its labels therefore satisfyIf both $a,b$ are positive, subtracting $c=\min (a,b)$ from both increases the labels to $(p+c,q+c)$, whose dimension is strictly larger. The resulting boundary labels occur in the tensor: use $a$ disjoint antisymmetric upper pairs or $b$ disjoint antisymmetric lower pairs, and then take the separately symmetric traceless component. Consequently the exact answer is the finite formulaThis supplies a practical closed finite computation for arbitrary $k,l$. To reduce it to at most four evaluations, put $K=k+1$, $L=l+1$ and $r=1+\sqrt{3}$. The first continuous maximum is at $a_{\ast }=(K-rL)/(2+r)$, clipped to $[0,k/2]$; test its two neighbouring allowed integers. The second is similarly at $b_{\ast }=(L-rK)/(2+r)$, clipped to $[0,l/2]$. Indeed differentiating the first cubic gives a derivative with the sign of $(K-2a{)}^2-2(K-2a)(L+a)-2(L+a{)}^2$, which changes sign once at that root. For equal upper and lower counts, both maxima are at zero and the familiar result is $(k+1{)}^3$.

For three quarks, the unconstrained flavour product isThe brackets indicate permutation symmetry: symmetric, mixed, and alternating. The three-quark colour singlet is proportional to ${ϵ}_{abc}$ and is alternating. The fermion wavefunction must be alternating overall. In the usual spatially symmetric ground-state S-wave, the spin-flavour part must therefore be symmetric.

The three-spin-one-half space has a symmetric spin-$3/2$ sector and mixed-symmetry spin-$1/2$ sectors; it has no fully alternating sector because ${\bigwedge }^3{\mathbb{C}}^2=0$. Symmetric flavour can pair with symmetric spin, giving the baryon decuplet of spin $3/2$. The flavour-octet multiplicity space and the spin-$1/2$ multiplicity space both transform as the two-dimensional standard representation of the symmetric group. Their product contains exactly one symmetric combination: its characters at the identity, a transposition and a three-cycle are $4,0,1$, so the symmetric multiplicity is $(4+3\cdot 0+2\cdot 1)/6=1$. This gives one baryon octet of spin $1/2$. Alternating singlet flavour would need alternating spin to make the spin-flavour part symmetric, and that sector does not exist. Therefore the Pauli constraint on three-quark flavour multiplets yieldsThe spin-flavour dimension check is $8\cdot 2+10\cdot 4=56=\dim {\mathrm{Sym}}^3{\mathbb{C}}^6$, the symmetric spin-flavour SU6 representation.

The spatial-symmetry qualification matters if the wording is interpreted as total $L=0$ alone. Rotationally scalar excited orbital functions can have mixed permutation symmetry. For example, the two independent differences among $r_{12}^2,r_{23}^2,r_{31}^2$, multiplied by a symmetric radial factor, span such a space while remaining rotational scalars. Combining this standard permutation representation with the spin-$1/2$ standard representation gives an alternating spin-orbital combination; multiplying by alternating singlet flavour makes it symmetric, and the colour factor restores overall fermionic antisymmetry. Thus total $L=0$ without a symmetric ground-state orbital assumption would not by itself exclude a singlet.

For a quark-antiquark pair, colour singletness selects the contraction ${\delta }^a{}_b$, and the independent flavour product givesQuark and antiquark are distinguishable, so there is no three-identical-quark exclusion of either flavour multiplet or either spin. Both the octet and singlet admit spin singlets and spin triplets. Their baryon number is zero. The flavour octet has rows $(Y,I)=(1,1/2),(0,1),(0,0),(-1,1/2)$, while the singlet has $(Y,I)=(0,0)$. The octet's zero-isospin state is $(u\bar{u}+d\bar{d}-2s\bar{s})/\sqrt{6}$, and the singlet is $(u\bar{u}+d\bar{d}+s\bar{s})/\sqrt{3}$. Each row contains all $I_3=-I,\dots ,I$, and electric charge is $Q=I_3+Y/2$.

For ground-state mesons with $L=0$, opposite intrinsic quark-antiquark parities give $P=-1$. The neutral self-conjugate states have charge conjugation $C=(-1{)}^{L+S}$, so both flavour multiplets occur as $0^{-+}$ pseudoscalar mesons and $1^{--}$ vector mesons, forming a flavour nonet in each channel. Charged and open-flavour states have no individual charge-conjugation eigenvalue. The meson request does not restrict orbital excitation: in general $J=|L-S|,\dots ,L+S$, $P=(-1{)}^{L+1}$, and the same formula for $C$ applies where defined. Thus the flavour representations stay $1\oplus 8$, with these additional orbital-spin quantum numbers.

Use logarithms to base two, so all Von Neumann entropies and Shannon entropies are measured in bits. Write the nonzero eigenvalues of ${\rho }_i$ as ${\lambda }_{ij}$. Orthogonality of the supports makes the mixture a block diagonal matrix, with eigenvalues $p_i{\lambda }_{ij}$. ThereforeEach ${\rho }_i$ has trace one. Terms with zero probability or zero eigenvalue vanish under the convention $0\log 0=0$. This proves the entropy of an orthogonal quantum mixture.

Introduce the orthonormal local vectors $|+⟩=(|1⟩+|2⟩)/\sqrt{2}$ and $|-⟩=(|1⟩-|2⟩)/\sqrt{2}$. Reexpressing the second state's factors in this basis gives its Schmidt decompositionThe squared Schmidt coefficients are therefore $1/3,2/3$, whereas those of the first state are $1/2,1/2$.

To see directly why these distinguish the states, a local unitary operation $U_A\otimes U_B$ changes the reduced density matrix toThis is local-unitary invariance of reduced-state spectra: the unitary on the traced subsystem cancels, and conjugation on $A$ leaves its eigenvalues unchanged. Here the reductions areTheir spectra differ. Hence no pair of local unitary operations carries the first state to the second. More generally, normalized bipartite pure states are locally unitarily equivalent exactly when their squared Schmidt coefficients agree, including multiplicities; sufficiency follows by mapping one pair of Schmidt bases to the other.

An upper bound follows directly from the Schmidt-tail entanglement monotonewhere ${\rho }_A^{\chi }$ is the reduced density matrix of a bipartite pure state. On these two-qubit states, this is the smaller squared Schmidt coefficient, so $E_2(\psi )=s$ and $E_2(\varphi )=t$.

Here is the average-monotonicity argument needed for all LOCC strategies. The largest eigenvalue is convex: for any unit vector $v$, $⟨v|{\sum }_r{p}_r{\rho }_r|v⟩\le {\sum }_r{p}_r{\lambda }_{\max }({\rho }_r)$, and maximizing the left side gives the claim. Hence $1-{\lambda }_{\max }$ is concave. If Alice makes a local measurement, Bob's conditional reductions average to his original reduction. Concavity therefore gives ${\sum }_r{p}_r{E}_2({\chi }_r)\le E_2(\chi )$. If Bob measures, use Alice's reductions instead. The two reductions of a pure state have the same nonzero eigenvalues by the Schmidt decomposition. Refining all measurement outcomes into individual Kraus operators keeps conditional states pure; iterating the inequality covers adaptive rounds of classical communication. The same bound persists for limits of such protocols.