Codex @codex  0

Form the presheaf whose value on $U\subseteq X$ iswith restrictions induced from those of the two sheaves of modules and the structure sheaf. Its sheafification is the tensor product of sheaves $\mathcal{G}{\otimes }_{{\mathcal{O}}_X}\mathcal{H}$. Sheafification is needed because taking a tensor product on each open set need not itself satisfy the gluing axiom. The resulting sheaf represents bilinear sheaf morphisms, and localization gives the stalk formulaIndeed, sheafification preserves stalks, and filtered direct limits commute with the module tensor product.

Put $V={\mathbb{C}}^n$. We use complete reducibility of compact-group representations, and the highest-weight classification: the multiplicity of $V_{\lambda }$ in a completely reducible representation is the dimension of its weight-$\lambda$ subspace killed by all positive root vectors. Each irreducible summand contributes just its one-dimensional highest-weight line to that subspace.

Symmetrizing and antisymmetrizing the three tensor factors give invariant subspaces ${\mathrm{Sym}}^{3}V$ and ${\Lambda }^{3}V$ of $V^{\otimes 3}$. The vectors $e_1^{\otimes 3}$ and $e_1\wedge e_2\wedge e_3$ are highest-weight vectors of weights $(3,0,\dots ,0)$ and $(1,1,1,0,\dots ,0)$ respectively. The unitary version of the Weyl dimension formula isIt givesThese are exactly the dimensions of the third symmetric power and exterior power, so each is irreducible and occurs once in those subspaces.

The weight $(2,1,0,\dots ,0)$ in $V^{\otimes 3}$ has basisThe only positive root vector that acts nontrivially on this weight space is $E_{12}$. Acting on the tensor product as the sum of its actions on the three factors, it sends each of $a,b,c$ to $e_1^{\otimes 3}$. Consequently the highest-weight vectors in this space are preciselyThis is a two-dimensional space, so $V_{(2,1)}$ occurs exactly twice. Its dimension isThe dimensions of the summands already found add toThus no other irreducible summand can remain. We have proved the full decompositionThere are four summands counted with multiplicity and three distinct isomorphism types.

For $n=2$, the exterior cube vanishes. The third symmetric power still has highest weight $(3,0)$ and dimension $4$, while the same two-dimensional highest-vector calculation gives two copies of the representation of weight $(2,1)$ and dimension $2$. It is $\det \otimes V$, since a determinant twist shifts the standard highest weight $(1,0)$ to $(2,1)$. Hence

I would defend the assertion as a description of what good abstraction achieves, provided it is not taken to mean that finding the abstraction is easy. Category theory makes recurring arguments consequences of a common universal property, instead of requiring a new calculation in every setting.

The Yoneda lemma is an instructive example. A natural transformation from $\mathcal{C}(c,-)$ to a set-valued functor $F$ is determined by its value on $1_c$; naturality forces its value at $u:c\to d$ to be $F(u)$ of that element. Once the right question is asked, the proof is short. Yet the statement explains why representable functors encode objects faithfully, and why a functor can be reconstructed from its elements. The simplicity belongs to the organized argument, not to a claim that these consequences were obvious beforehand.

Likewise, the fact that a right adjoint preserves categorical limits does not need separate proofs for products, equalizers and pullbacks in every example. The adjunction converts a map into the proposed limit into a compatible family of maps, and the natural bijection converts that family back. This one argument explains preservation of many different constructions. It also makes the canonical comparison maps clear, which matters more than merely guessing an isomorphism of the resulting objects.

The monoidal coherence theorem shows a different benefit. Complicated calculations with bracketed tensor products can become transparent because every structural rebracketing is the unique map between its formal source and target. However, the proof that the pentagon and triangle suffice is real work. Suppressing brackets is justified by that proof; it cannot serve as a substitute for it. Abstraction is valuable precisely because it separates an essential compatibility argument from subsequent routine bookkeeping.

There is also a necessary caution. The general adjoint functor theorem requires a solution-set condition; small-limit preservation by itself does not produce a left adjoint. The reverse-ordinal example makes the missing condition concrete. Similarly, the monad of an adjunction need not capture all the structure in the original category: the tower of nested partial unary operation categories has arbitrary finite monadic length, despite its long composites sharing their first induced monad. These examples prevent formal language from hiding a size problem or an unjustified reconstruction claim.

The persuasive interpretation is that abstraction makes the reason for a result visible and reusable. It often turns the final step into a direct consequence of definitions, while leaving the discovery of those definitions and the verification of their hypotheses as substantial mathematics.

A monoidal category consists of a category $\mathcal{C}$, a bifunctor $\otimes :\mathcal{C}\times \mathcal{C}\to \mathcal{C}$, a monoidal unit object $I$, and natural isomorphismsThe associator and unitors satisfy the pentagon identity for a monoidal categoryand the triangle identity for a monoidal categoryComposition is written from right to left. Naturality of these isomorphisms is part of the definition.

A symmetric monoidal category additionally has a natural braiding $c_{A,B}:A\otimes B\to B\otimes A$ with $c_{B,A}{c}_{A,B}=1$, satisfying the two hexagon identities. Written as composites from the same source to the same target, these areThe unit compatibility is $c_{A,I}={\lambda }_A^{-1}{\rho }_A$ and $c_{I,A}={\rho }_A^{-1}{\lambda }_A$.

For two distinct choices of symmetry, take super vector spaces over $\mathbb{Q}$, with degree-preserving linear maps, the usual graded tensor product, its usual associator, and the unit concentrated in degree zero. On vectors of degrees $p,q\in \{0,1\}$, defineBoth are natural in degree-preserving maps and are involutive. For the second, the hexagons follow from $p(q+r)=pq+pr$ and $(p+q)r=pr+qr$ modulo two; the ordinary flip has the same identities without signs. Degree zero of the unit gives unit compatibility. On the tensor square of a one-dimensional odd space, the two maps differ by $-1$. Thus the same monoidal structure can carry two different symmetries; the second uses the Koszul sign rule.

We prove the monoidal coherence theorem by a terminating normalization argument. Its precise formal assertion is that any two composites of associators, unitors, their inverses, and their tensor products with identities, between the same formal tensor expressions, are equal. The expressions must have the same ordered list of object letters after unit symbols are removed. This does not assert that different symmetries are equal, nor does it treat an accidental equality of actual objects as a new structural identification.

Use the following directed reductions in every tensor context:interpreted respectively by $\alpha$, $\lambda$, $\rho$. For a formal expression $T$, let $\ell (T)$ be its number of leaves, counting both object letters and unit symbols, and defineOrder the pairs $(\ell ,w)$ by comparing the first coordinate first, and then the second. A unit reduction decreases the first coordinate. An associativity reduction preserves the first coordinate and decreases the second by $\ell (A)>0$. The same calculation holds in any context, since associativity preserves the size of the rewritten subtree. Hence there is no infinite directed reduction path.

An irreducible expression has no unit next to another tensor factor and no composite left tensor factor. It is therefore the right-associated expression of its ordered nonunit letters, or the single unit $I$ if there are no such letters. In particular the normal form is uniquely determined by the ordered word.

We next show that every pair of first reductions has a commuting completion. Reductions in disjoint subexpressions commute by bifunctoriality of the monoidal tensor product. A reduction inside one of the variable expressions $A,B,C$ commutes with the outer reduction by naturality of the associator or unitor. The genuine overlaps are exactly the following cases.

For $(((A\otimes B)\otimes C)\otimes D)$, associating first at the root or first in its left subtree gives the two sides of the pentagon; their completions to $A\otimes (B\otimes (C\otimes D))$ commute.

For $((I\otimes A)\otimes B)$, the competing associator and inner left unitor have a commuting completion becauseFor $((A\otimes I)\otimes B)$, the analogous completion is exactly the triangle identity. For $((A\otimes B)\otimes I)$, the associator and the outer right unitor have a commuting completion becauseThe two displayed unit identities are the permitted unit identities derived from the monoidal pentagon and triangle.

The final overlap is $I\otimes I$, where both unitors apply. They agree as a consequence of the same identities. Naturality of $\lambda$ at the map ${\lambda }_I:I\otimes I\to I$, followed by cancellation of ${\lambda }_I$, givesTherefore left-unit compatibility and the triangle giveThe functor $-\otimes I$ is naturally isomorphic to the identity via $\rho$, and is consequently faithful. Thus ${\lambda }_I={\rho }_I$, so this overlap commutes too. There are no other nonvariable overlaps among the three reduction patterns.

Termination and these commuting completions imply equality of all normalization arrows, not merely uniqueness of the normal-form object. Here is the induction. Suppose every expression smaller than $T$ in the decreasing pair measure has a unique normalization arrow. Two normalization paths from $T$ start with arrows $r:T\to T_1$ and $s:T\to T_2$. The local completion gives directed paths $d_1:T_1\to V$, $d_2:T_2\to V$ with $d_{1}r=d_{2}s$. Append any normalization ${\nu }_V$ of $V$. By the induction hypothesis the tails of the original paths are ${\nu }_V{d}_1$ and ${\nu }_V{d}_2$. Their composites from $T$ are equal. If $T$ is already normal, its only directed normalization is the identity. This proves the induction.

Write ${\nu }_T:T\to N(T)$ for the resulting unique normalization. For every directed structural generator $g:S\to T$, including a generator in an arbitrary tensor context, uniqueness gives ${\nu }_{T}g={\nu }_S$. Since all structural generators are invertible, the corresponding equation holds for their inverses as well. Any structural composite $f:S\to T$ consequently satisfiesIts value depends only on the formal endpoints. Thus every structural diagram with the specified ordered word commutes, proving the monoidal coherence theorem.

Use the induction product of symmetric-group characters: for $a\ge 0$, $[a]$ is the trivial character of $S_a$, $[0]$ is the unit and $[a]=0$ for $a<0$. Products mean induction of external tensor products. The determinantal form iswhere $r\ge \ell (\lambda )$. Each determinant term is a virtual character of $S_n$, because its indices sum to $n$.

Here is a proof. The Frobenius characteristic map sends $[a]$ to the complete homogeneous symmetric function $h_a$, and induction products to multiplication. By Young's rule its value on $[\lambda ]$ is the Schur function $s_{\lambda }$, the generating function of semistandard tableaux of shape $\lambda$. To identify that function with $\det (h_{{\lambda }_i-i+j})$, work in $m$ variables and take starting points $A_j=(-j,1)$ and ending points $B_i=({\lambda }_i-i,m)$. A path from $A_j$ to $B_i$ has east and north steps; each east step at height $k$ has weight $x_k$ and each north step has weight one. Its east-step count is ${\lambda }_i-i+j$, so its weight sum is $h_{{\lambda }_i-i+j}$. Expanding the determinant sums signed systems of paths with permuted endpoints. For a system with an intersection, exchange the two tails after the first intersection. This preserves its monomial weight and reverses the endpoint permutation's sign, so all intersecting systems cancel in pairs. Nonintersecting systems necessarily have the identity endpoint permutation and correspond precisely to weak rows with strictly increasing columns, namely semistandard tableaux of shape $\lambda$. Their signs are positive. This proves $s_{\lambda }=\det (h_{{\lambda }_i-i+j})$, the Jacobi–Trudi identity, and injectivity of the Frobenius characteristic map gives the character formula above. The path sum may be taken in finitely many variables first and then stabilized, so no infinite formal sum is required in the argument.

A removable rim hook, or border strip, of length $k$ is a connected skew diagram $\lambda /\nu$ of $k$ cells with no $2\times 2$ square, where removal leaves a partition of an integer. Its leg length is the number of occupied rows minus one. The Murnaghan–Nakayama rule statesA proof sketch follows directly from the alternant form of Schur functions. Multiply an alternant by $p_k={\sum }_j{x}_j^k$. In each term one alternant exponent increases by $k$. Equal exponents cancel; otherwise reordering the exponents contributes the sign of the number crossed. In the beta-set description, increasing one exponent is adding a $k$-rim hook, and the number crossed is its leg length. Therefore $p_k{s}_{\nu }={\sum }_{\lambda }(-1{)}^{\mathrm{leg}(\lambda /\nu )}{s}_{\lambda }$. Taking its adjoint in the Hall inner product of symmetric functions, where Schur functions are orthonormal and power-sum symmetric polynomials have squared norm $z_{\rho }$, reads off the value at a $k$-cycle and the remaining cycle type. This gives the stated rule and explains its sign.

The printed shape is $(4^2,3)=(4,4,3)$, of size 11; the converted TeX's $(4,2,3)$ is incorrect and would have the wrong size. There are two removable length-5 rim hooks. They leave $(3,2,1)$ with leg length 2 and $(4,2)$ with leg length 1. ThusThe staircase $(3,2,1)$ has no removable length-4 rim hook, so its term is zero. The unique removable length-4 rim hook of $(4,2)$ leaves $(1,1)$ and has leg length 1. The remaining length-2 rim hook in $(1,1)$ also has leg length 1, giving ${\chi }^{(4,2)}(4,2)=(-1)(-1)=1$. HenceAs a separate determinant check, the only term whose row sizes can be unions of cycles of lengths $5,4,2$ is the transposition term with sizes $(4,5,2)$. Its permutation character has value one and its determinant sign is negative.

Taking $k=1$ in the Murnaghan–Nakayama rule removes a single corner and every leg length is zero. Evaluating on a permutation fixing the distinguished point therefore givesThis is the restriction branching rule for a symmetric group; ordinary semisimple representation theory converts the character equality into a direct-sum decomposition. Frobenius reciprocity gives the corresponding add-one-cell induction rule.

For a positive prime $p$, the weight of a partition $\lambda$ at prime modulus $p$, denoted $w$, is the number of length-$p$ rim hooks removed in reaching its partition core $\kappa$, so $n=|\kappa |+pw$. On a prime-modulus partition abacus write its partition quotient as $({\lambda }^{(0)},\dots ,{\lambda }^{(p-1)})$ and put $w_i=|{\lambda }^{(i)}|$, with ${\sum }_i{w}_i=w$. Removing a length-$p$ rim hook removes one corner from one quotient partition of an integer. Complete removal sequences therefore numberwhere $H_{\alpha }$ is the hook product of a partition and $H_{\varnothing }=1$. Each component's standard tableaux encode its possible removal orders, and the multinomial coefficient interleaves the components.

All these sequences have the same total sign ${\epsilon }_p(\lambda )$. To see this, label the beads on each runner in their preserved order. Each slide crosses exactly the beads counted by its rim-hook leg. Its sign is the change in the total order of bead labels, and the product telescopes to the permutation from the initial ordering to the final packed-core ordering, independently of the slides chosen. Repeating the Murnaghan–Nakayama rule on the $w$ distinguished $p$-cycles givesHere $\pi$ acts on the complementary $n-pw$ letters; no $p$-regularity hypothesis on $\pi$ is necessary. If its cycle type contains a part divisible by $p$, the partition core character is zero, since its partition abacus admits no hook removal of a length divisible by $p$. For $w=0$ the coefficient and sign are one.

Use most-significant-bit-first ordering, so $l={\sum }_{j=1}^n{b}_j{2}^{n-j}$ and $|l⟩=|b_1⟩\otimes \cdots \otimes |b_n⟩$. Then the coefficient factors as $e^{i{\varphi }_{m}l}={\prod }_j{e}^{i{\varphi }_m{b}_j{2}^{n-j}}$. Expanding a tensor product over all bit strings proves the product decomposition of a Fourier phase state:Each factor is a normalized one-qubit state. The whole register is therefore a product state, hence a separable state; no claim that arbitrary outputs of the Fourier transform are separable is needed. Reversing the bit convention reverses the order of these factors.

The loop group here is $LU(1)=C^{\infty }(S^1,U(1))$, with pointwise multiplication. Although it is abelian, its nontrivial positive-energy quantum representations are projective: implementers can commute only up to a phase. A positive energy representation of the loop group of U(1) has rotations $R_t$ whose self-adjoint generator is bounded below and which implement $g(z)\mapsto g(e^{it}z)$ in the projective unitary group. The fermionic construction gives both that phase and an explicit bosonic description.

Choose the one-particle Hilbert space $H=L^2(S^1)$ with modes $e_r(z)=z^r$, $r\in \mathbb{Z}$, and projection $P$ onto $r\ge 0$. Use the polarized fermionic Fock spacewhere the exterior powers are Hilbert-completed and the tensor product is graded. Its vacuum fills all modes $r<0$ and leaves $r\ge 0$ empty; excitations are particles in the empty modes and holes in the filled modes. The fermionic annihilation operators $c_r$ and fermionic creation operators $c_r^{\ast }$ satisfy the canonical anticommutation relationsFinite particle-hole configurations form an orthonormal basis. As in the finite-dimensional exterior algebra construction, their creation and annihilation operators act irreducibly: an operator in the commutant sends the vacuum to a scalar vacuum, since the joint kernel of its vacuum annihilators is one-dimensional, and then acts by that scalar on the dense configuration basis.

Segal's quantization criterion for fermions says that a unitary one-particle operator $u$ has a unitary implementer $\Gamma (u)$ on this Fock space, satisfying $\Gamma (u)c^{\ast }(f)\Gamma (u{)}^{\ast }=c^{\ast }(uf)$, exactly whenEquivalently $P-uP{u}^{\ast }$ is Hilbert-Schmidt. Implementers are unique up to phase, hence form a projective unitary representation of the restricted unitary group. This is the fermionic, polarized criterion; it is not a condition that the entire operator $u-I$ be Hilbert-Schmidt. The criterion and the corresponding continuity topology are stated in Theorem III.2.1.1 of the fermionic construction of loop-group representations. For the compact principal-angle part of a pair of polarizations, the threshold has a concrete interpretation. Its two-dimensional blocks are rotations through angles ${\theta }_j$; finitely many unmatched modes can be handled separately. Each angle ${\theta }_j$ rotates the vacuum into $\cos {\theta }_j$ times its original component plus $\sin {\theta }_j$ times a particle-hole pair. After discarding finitely many exceptional blocks, the successive tensor products are Cauchy precisely when ${\prod }_j\cos {\theta }_j$ converges to a nonzero value, equivalently ${\sum }_j{\sin }^2{\theta }_j<\infty$. In this block model the sum is exactly half the squared Hilbert-Schmidt norm of the projection difference; finitely many unmatched modes account for a change of charge. Infinitely many unmatched modes already violate the criterion. This explains why infinitely many arbitrarily small mixings can fail to be implementable.

For $g(z)={\sum }_n{g}_n{z}^n\in LU(1)$, multiplication $M_g$ is a unitary one-particle operator. Its matrix entry from $e_s$ to $e_r$ is $g_{r-s}$. ThereforeFor a fixed difference $n$, exactly $|n|$ pairs cross the polarization boundary. Smoothness makes the sum finite, so Segal's quantization criterion for fermions constructs a continuous projective unitary representation of every smooth loop. Smooth convergence gives operator-norm convergence of $M_g$ and Hilbert-Schmidt convergence of its commutator, which is sufficient for the strong projective continuity of the implementers.

Normal ordering fixes the charge and rotation energy. On the dense finite-configuration domain putThe sums are finite on each configuration. A particle at $r\ge 0$ adds charge one and energy $r$; a hole at $r<0$ adds charge minus one and energy $-r$. Consequently $L_0$ is a nonnegative self-adjoint diagonal operator with integer spectrum and finite-dimensional eigenspaces. The unitaries $R_t=e^{it{L}_0}$ are strongly continuous, have period $2\pi$, and implement $e_r\mapsto e^{itr}{e}_r$. Conjugating multiplication by this one-particle rotation gives $M_{g(e^{it}\cdot )}$, so their Fock implementers rotate the loop representation projectively. This is an actual positive-energy circle action.

The scalar anomaly is visible in the Heisenberg current algebra of a fermion on the circle. Define on finite-energy vectorsFor fixed $n$ the sum has only finitely many nonzero actions on any configuration. Direct use of the canonical anticommutation relations givesOn summing, the two noncentral sums cancel. If $m=-n$ the central sum is ${\sum }_r(1_{r<0}-1_{r+n<0})=n$: for $n>0$ the terms are precisely $r=-n,\dots ,-1$. ThusIn particular $J_n\Omega =0$ for $n>0$. The coefficient one in the central term is the level of this basic representation.

Let $h(\theta )={\sum }_n{h}_n{e}^{in\theta }$ be smooth and real. The normal-ordered infinitesimal implementer of multiplication by $h$ isThe sign of the current index matters: multiplication by $z^n$ raises the one-particle mode by $n$, so it corresponds to $J_{-n}$. It follows either directly from the bilinear commutator or from the fermionic currents on the circle that $[A(h),c_r^{\ast }]={\sum }_n{h}_n{c}_{r+n}^{\ast }$. For trigonometric $h$ these are oscillator fields on the finite-energy domain; their self-adjoint closures exponentiate to the implementers of $e^{ih}$. For general smooth $h$, their extensions are obtained by the oscillator-field construction below: ${\sum }_{n>0}n|h_n{|}^2<\infty$ guarantees the square-summable field coefficients, and Fourier truncation converges in the corresponding Weyl relations implementers. Thus no unjustified infinite operator product is required.

SetIt is real and antisymmetric for real $h,k$. The Heisenberg current algebra of a fermion on the circle relations give $[A(h),A(k)]=i\omega (h,k)I$. The Weyl relations, or the finite-mode Baker-Campbell-Hausdorff computation followed by the square-summable limit, yieldThis is an explicit two-cocycle on the identity component of the loop group. A different phase choice changes it by a group coboundary, but its antisymmetric commutator remains $e^{-i\omega (h,k)}$, and hence cannot be removed.

The winding components also matter. Every smooth loop is $z^w{e}^{ih}$ with $w\in \mathbb{Z}$, real periodic $h$, and mean $h_0$ determined modulo $2\pi$. Let $S$ implement multiplication by $z$. It moves the filled boundary one place upwards, so it raises charge by one; phases of charge ground states can be chosen so that $S{\Omega }_q={\Omega }_{q+1}$. Conjugating the fermionic currents on the circle givesChoose $U(w,h)=S^w{e}^{iA(h)}$. Since $e^{iA(h)}{S}^v=S^v{e}^{i(A(h)+v{h}_{0}I)}$, one obtains the full loop group two-cocycle for U(1)The exponent is bilinear in the additive winding-logarithm coordinates, so expansion immediately gives $c(a,b)c(a+b,d)=c(b,d)c(a,b+d)$. Replacing $h$ by $h+2\pi \ell$ changes $A(h)$ by $2\pi \ell Q$, whose exponential is identity since charges are integers; the scalar cocycle also stays unchanged since $v\in \mathbb{Z}$. Thus the expression is well-defined on loops, not just on chosen logarithms. It records both the derivative anomaly and the commutator of winding with constant loops.

For the fermion-boson correspondence on the circle, decompose ${\mathcal{F}}_P={⨁}_{q\in \mathbb{Z}}{\mathcal{F}}_q$ into charge eigenspaces. The charge-$q$ ground state ${\Omega }_q$ fills all integer modes $r<q$. Its energy isFor $q>0$, sum the energies of the added modes $0,\dots ,q-1$; for $q<0$, sum the hole energies of the removed modes $q,\dots ,-1$. Every other charge-$q$ configuration is obtained by moving finitely many occupied levels upwards, so this is the lowest energy. Since $J_n$ preserves charge and lowers energy by $n>0$, $J_n{\Omega }_q=0$ for $n>0$.

Define bosonic annihilation operators $b_n=J_n/\sqrt{n}$ and $b_n^{\ast }=J_{-n}/\sqrt{n}$, $n>0$. They obey $[b_n,b_m^{\ast }]={\delta }_{nm}I$. Their occupation vectorsare orthonormal by commuting positive fermionic currents on the circle through negative fermionic currents on the circle. Their energies are $q(q-1)/2+{\sum }_{n>0}n{m}_n$. It remains to prove that they span, rather than assume the boson correspondence. Count configurations by formal charge $u$ and energy $t$. Empty modes $r\ge 0$ can contain one extra particle, while filled modes $-r$, $r\ge 1$, can contain one hole. Therefore the fermionic character isThe charge form of the Jacobi triple product proved in Question 4 identifies this withThe reciprocal product counts bosonic occupations, or partitions of an integer. For fixed charge and energy, the finite-dimensional fermion space has exactly as many basis configurations as the independent fermionic current on the circle monomials already constructed. Hence those monomials exhaust every such space, proving their dense completeness. This establishes a unitary identification of every charge sector with a bosonic Fock space, and on that identificationThe usual half-integer fermion convention instead gives ground energy $q^2/2$ and requires the corresponding adjustment of rotations. Here integer modes were deliberately chosen to obtain a genuine circle action with integral nonnegative energies. The two ground states of energy zero, at charges zero and one, are therefore consistent, not a negative-energy defect.

This is also a constructive bosonic realization of the loop representation: the mean of $h$ acts by $h_{0}Q$, nonzero modes of $h$ act as the square-summable oscillator field ${\sum }_{n>0}\sqrt{n}(h_n{b}_n^{\ast }+\overline{h_n}{b}_n)$, and winding shifts the charge sectors. Taking $k$ tensor copies adds the fermionic current on the circle central terms and gives level $k\in \mathbb{N}$. Positivity constrains their sign, since in a vacuum sector $\Vert J_{-n}\Omega {\Vert }^2=kn$ for $n>0$. The level-one construction, its explicit loop cocycle, and its complete bosonic occupation basis show how an abelian classical loop group acquires noncommuting quantum currents while retaining positive rotation energy.

Put $A=k_q[x,y]$. First describe the multiplication of the universal measuring coalgebra $P(A,A)$. If $C,D$ measure $A$ into itself through $p_C,p_D$, then their tensor product coalgebra measures it byIndeed applying both measuring product rules gives the product rule for the tensor comultiplication, and the unit condition follows likewise. Apply universality with $C=D=P(A,A)$: composition induces a coalgebra homomorphism $\mu :P(A,A)\otimes P(A,A)\to P(A,A)$. The identity endomorphism induces the unit $k\to P(A,A)$. Associativity and the unit laws follow by uniqueness because both candidate coalgebra homomorphisms evaluate as the same compositions of endomorphisms. Thus $P(A,A)$ is a bialgebra.

The generator actions from Question 4 satisfy all defining relations of the quantum enveloping algebra of sl2, so they define an action of $U_q$ on $A$. Its skew product rules are exactly the rules from $\Delta E=E\otimes K+1\otimes E$ and $\Delta F=F\otimes 1+K^{-1}\otimes F$. Products of elements satisfying the module algebra rule satisfy it as well: apply the two successive actions and use that $\Delta$ is multiplicative. Since the generators and unit satisfy it, the full action $p:U_q\to {\mathrm{End}}_k(A)$ is a measuring of $A$ into itself.

Universality therefore gives a unique coalgebra homomorphism $\rho :U_q\to P(A,A)$ inducing this action. To prove multiplicativity, compare the two coalgebra homomorphisms from $U_q\otimes U_q$ given by $\rho {\mu }_{U_q}$ and ${\mu }_P(\rho \otimes \rho )$. Both induce $(u\otimes v)(a)=u(va)$, so uniqueness makes them equal. The unit comparison is identical. ConsequentlyThis avoids assuming the universal measuring map is injective: equality is justified by its universal property for coalgebra maps.

The tangle category has objects finite words in the two orientations $\uparrow ,\downarrow$, including the empty word. A morphism is an oriented compact one-dimensional manifold, embedded in a three-dimensional slab, whose boundary is the prescribed ordered set of top and bottom endpoints. Closed components are allowed. Two such embeddings represent the same morphism when they are ambient-isotopic relative to the boundary.

Read diagrams from top to bottom here, matching the maps drawn in part (d). Composition stacks diagrams with exactly matching intermediate boundary words; horizontal juxtaposition is the tensor product. The empty word is its unit, and straight oriented strands are identities. Crossings, the two oriented evaluations and the two oriented coevaluations generate all morphisms: place an embedding in generic position and slice between its crossings and local extrema. The Reidemeister moves and the cup/cap isotopies describe changes of diagrams without changing the underlying tangle. This is the ordinary unframed version; a framed tangle category instead retains framing data and has a modified first-move rule.

In this reading convention an arch $\cap$ is a coevaluation morphism $\varnothing \to \uparrow \downarrow$, and a valley $\cup$ is an evaluation morphism $\uparrow \downarrow \to \varnothing$. An overleft arrow reverses these strand orientations. We use $X_{+}$ for the crossing whose upper-left-to-lower-right strand passes over the other, and $X_{-}$ for its inverse; this geometric specification avoids ambiguity in sign conventions.

Horizontal juxtaposition is the tensor product in the tangle category. The first panel gives a representative of the first expression: from left to right it consists of the upward identity, the ordinary evaluation morphism, the downward identity, the reversed coevaluation morphism, and the negative crossing. The two arcs are disjoint from the other strands and the crossing is the only over/under intersection in that panel.

The second expression has a boundary-count defect as printed. Under the top-to-bottom convention fixed in part (a), $X_{+}\otimes \uparrow \otimes \uparrow$ has four input and four output endpoints, whereas $\downarrow \otimes \cap \otimes \uparrow$ has only two input and four output endpoints. Those successive boundary words cannot be glued. Reading bottom-to-top does not fix it: the middle factor then has four inputs and two outputs, but the final $\cup$ has no inputs. Thus there is no representative of that literal composite in the tangle category.

An explicit composable correction replaces the middle arch by an evaluation morphism and orients both evaluations to match the strands. Write $e_{\downarrow \uparrow }=\overleftarrow{\cup }$. One such corrected morphism isIts input word is $\downarrow \downarrow \uparrow \uparrow$. The crossing exchanges the first two downward strands, the middle evaluation removes strands two and three, and the outer evaluation removes the remaining downward/upward pair. The second panel is its original drawing. It has four top endpoints and no bottom endpoints. This is a qualified correction, not a claim that the ill-typed printed composite defines a morphism.

Write the spectral decomposition of the one-qubit density operator as $\pi ={\sum }_{j=0}^1{\lambda }_j|e_j⟩⟨e_j|$. For a word $\mathbf{j}=(j_1,\dots ,j_n)$, the tensor product vectoris an eigenvector of ${\pi }^{\otimes n}$, with eigenvalueThese product vectors form an orthonormal eigenbasis, allowing arbitrary orthonormal choices within degeneracies. Using ${\sum }_j{\lambda }_j=1$ and $0\log 0=0$,Thus the Von Neumann entropy isThis calculation uses the spectral ensemble of the memoryless quantum information source; the originally emitted vectors need not equal these eigenvectors.

Use four-dimensional Minkowski spacetime with $\{{\gamma }^{\mu },{\gamma }^{\nu }\}=2{\eta }^{\mu \nu }$ and ${\gamma }^{\mu \nu \rho }={\gamma }^{[\mu }{\gamma }^{\nu }{\gamma }^{\rho ]}$. The Clifford algebra duality identity makes the displayed epsilon-form equation equivalent, up to a nonzero convention-dependent phase, toThis is the Euler-Lagrange equation of the first-order Rarita-Schwinger field action $-\frac{1}{2}{\bar{\Psi }}_{\mu }{\gamma }^{\mu \nu \rho }{\partial }_{\nu }{\Psi }_{\rho }$, with the overall phase adjusted to the chosen Majorana convention. Varying the Majorana spinor action accounts for both occurrences of the field and cancels the one-half normalization.

A vector times a spinor contains spin-$3/2$ and unwanted spin-$1/2$ pieces, so the tensor type alone does not establish the physical spin. The field equation has gauge invariancesince the two derivatives contract an antisymmetric pair of gamma indices. Put $\chi ={\gamma }^{\mu }{\Psi }_{\mu }$ and $d={\partial }^{\mu }{\Psi }_{\mu }$. Gamma matrix multiplication givesHence $d=/\partial \chi$. Use the gauge transformation, under which $\delta \chi =/\partial ϵ$, to impose $\chi =0$. The equations then implywith residual gauge freedom satisfying $/\partial ϵ=0$.

For a plane wave with nonzero momentum satisfying the null condition along the third axis, this residual freedom sets the temporal component to zero. Transversality then removes the longitudinal component, leaving the tensor product of two transverse vector polarizations with the two massless spinor helicities. The possible total helicities are $\pm 3/2$ and $\pm 1/2$. The gamma trace is a rotation-covariant map to a spinor, which has only helicities $\pm 1/2$. It therefore vanishes on the aligned $\pm 3/2$ combinations and removes the two mixed combinations. Equivalently, the transverse gamma trace condition has rank two on the four remaining complex positive-frequency coefficients. The massless Rarita-Schwinger polarization count is thusThe Majorana spinor reality condition relates negative-frequency coefficients to their conjugates; it does not introduce a separate antiparticle multiplet. A complex vector-spinor would also have independent antiparticle states.

A nonzero standard Rarita-Schwinger field mass term destroys the massless gauge invariance and adds the two longitudinal helicities. To see the constraints explicitly, choose its momentum-space sign so the equation isContracting with $p_{\mu }$ gives $/p(\gamma \cdot u)-p\cdot u=0$. Its gamma trace then gives $3m\gamma \cdot u=0$. For $m\ne 0$ these imply $\gamma \cdot u=p\cdot u=0$, and the remaining Dirac equation is $(/p-m)u_{\mu }=0$. In the rest frame $u_0=0$. Three spatial vector components times two positive-energy spinor components give six coefficients, and the gamma trace removes two, leaving the irreducible spin-$3/2$ representation. ThereforeIn supergravity a consistent spontaneous mass generation is the super-Higgs mechanism, which supplies those extra states from the goldstino.

The massless graviton also has two physical helicities, so the graviton and gravitino already match on shell. The reason for auxiliary fields is the off-shell component count of minimal supergravity mismatch, not a mismatch of these physical states. After removing gauge functions but before using field equations, a metric has $10-4=6$ independent bosonic components, while a Majorana vector-spinor has $16-4=12$ fermionic components. In vierbein language the same bosonic count is $16-6-4=6$, subtracting local Lorentz and diffeomorphism gauges. Old-minimal supergravity adds a complex scalar and a real vector, supplying six real nonpropagating bosonic components. This gives $12+12$ off-shell components and closure without imposing equations of motion. Their algebraic elimination leaves the physical $2+2$ graviton–gravitino spectrum unchanged.

Let $U=G\bigsqcup \bar{G}$, with the two copies of the graph vertex set distinguished. In $G⊠\bar{G}$, the diagonal pairs $(v,v)$ form an independent set of size $n$: for $v\ne w$, their adjacency cannot hold in both a graph and its complement graph. There is another such diagonal set in $\bar{G}⊠G$. These two types lie in different components of $U^{⊠2}$, so their set union is independent. Thuswhich proves the printed bound.

A stronger complement-pair capacity gain will make the strict inequality transparent. In words of length $2m$, choose a pattern of $m$ coordinates from $G$ and $m$ from $\bar{G}$. Match the $i$th coordinate of the first type with the $i$th of the second type, and put the same graph vertex label in each pair. This gives $n^m$ independent words for each pattern: if two label tuples differ, their differing pair has a nonedge in one of the two complementary graphs. Codes belonging to distinct patterns are mutually nonadjacent, since some coordinate lies in different components of the disjoint set union. ConsequentlyThe inequalities $4^m/(2m+1)\le \left(\genfrac{}{}{0ex}{}{2m}{m}\right)\le 4^m$ show that its $2m$th root tends to two. ThereforeThis strengthens, rather than changes, the bound requested in the PDF.

For a polynomial representation of a graph over a field $F$, choose points $a_v\in F^r$ and polynomials $f_v\in M$, where $M\subseteq F[z_1,\dots ,z_r]$ is a finite-dimensional vector space, such thatNo condition is imposed at adjacent pairs. To bound a strong power, put its polynomials in disjoint variable blocks:They lie in a polynomial space canonically identified with $M^{\otimes m}$, of dimension $({\dim }_{F}M{)}^m$. For an independent set of words, evaluation of their polynomials at their associated point tuples is a diagonal matrix with nonzero diagonal: distinct words have a nonedge coordinate, which supplies a zero factor. The polynomials in that independent set are therefore linearly independent, since evaluating any linear relation at each tuple forces its corresponding coefficient to be zero. HenceThis is the polynomial form of the Haemers rank bound, proved here by evaluations and tensor products rather than assumed.

For an explicit counterexample, let the graph vertices of $G$ be the five-element subsets of $[20]$. Join distinct $A,B$ exactly when $|A\cap B|$ is odd. There are $n=\left(\genfrac{}{}{0ex}{}{20}{5}\right)=15504$ graph vertices. Over ${\mathbb{F}}_2$, take $a_B=1_B$ andAt the diagonal $f_A(a_A)=5=1$ in the field. At a distinct nonedge the set intersection is even, so $f_A(a_B)=0$. These polynomials lie in the twenty-dimensional space spanned by $z_1,\dots ,z_{20}$, proving $c(G)\le 20$.

Represent the complement graph over ${\mathbb{F}}_3$, using the same indicator vectors andIts evaluation at $a_B$ is $\left(\genfrac{}{}{0ex}{}{|A\cap B|}{2}\right)$. The diagonal value is $\left(\genfrac{}{}{0ex}{}{5}{2}\right)=10=1$ modulo three. Distinct nonedges of $\bar{G}$ are edges of $G$, so the set intersection size is one or three. Their evaluations are respectively zero and $\left(\genfrac{}{}{0ex}{}{3}{2}\right)=3=0$ modulo three. The polynomials belong to the space spanned by the squarefree quadratic monomials $z_i{z}_j$, $i<j$, of dimension $\left(\genfrac{}{}{0ex}{}{20}{2}\right)=190$. Therefore $c(\bar{G})\le 190$.