From the Spin to the Carriers and the Closures

Introduction

The subject. The spin decomposition gives four carriers, and each carrier generates something larger when the product is allowed: a carrier spans a subspace under the copy and a subalgebra under products, and the two are different. The article defines the two closures, computes them for the four carriers, and shows that the algebra generated by a single carrier is always a step of the filtration and never the carrier itself, except in the two trivial cases.

The order of the article. The two closures come first; the four values second. The chain from a vector to the algebra follows, and the reading closes the article.

It assumes The Clebsch–Gordan Decomposition of the Operators, The Truncated Rule: the Product of Two Carriers Is Not a Carrier and The Copy Acting on Sixteen Dimensions. The row of the elements is where the closure of the module under products is the whole algebra, and the closure of the scalars is the scalars.

The result in one line. The closure of $V_0$ is $V_0$, the closure of $V_1$ and of $V_2$ is $F_3$, the whole algebra, and the closure of $V_3$ is also the whole algebra, so every non-scalar carrier generates everything.

Boundaries. The product rule is The Truncated Rule; the filtration is defined there as well; the carriers themselves are The Clebsch–Gordan Decomposition of the Operators.

The Two Closures

Definition. For a subspace $W$ of the operator algebra, the carrier closure is the smallest sum of carriers containing $W$, and the algebra closure is the smallest subalgebra containing $W$ and the identity.

Proposition. The carrier closure is the image of $W$ under the projections of the four carriers, and the algebra closure is the span of all products of elements of $W$.

Proof. The carrier closure adds the missing components in each carrier, and the algebra closure is generated by the products by definition.

Corollary. A subspace is a carrier exactly when it is closed under the copy and equals its carrier closure.

Proof. A carrier is a summand of the decomposition, and its carrier closure is itself.

Corollary. The algebra closure contains the carrier closure, and the inclusion is strict whenever the products leave the sum of the carriers of the subspace.

Proof. Products of elements of $W$ lie in the algebra closure by definition, and the truncated rule gives elements outside a proper sum of carriers.

The reading. Two closures, one for the linear structure and one for the algebra. The first is decided by the projection onto the carriers, the second by the product rule, and the article computes both for the four carriers.

The Four Values

Theorem. The algebra closures of the four carriers are $$ \operatorname{cl}(V_0)=V_0,\qquad \operatorname{cl}(V_1)=\operatorname{cl}(V_2)=\operatorname{cl}(V_3)=F_3, $$ where $F_3$ is the whole algebra.

Proof. The square of $V_1$ contains a scalar, a generator and a component of label two, so the products of $V_1$ generate $F_2$ at least; the product of $V_2$ with $V_1$ then reaches label three, and the whole algebra is generated. The square of $V_3$ contains the lower labels, and the algebra is generated as well. The scalars are closed because the product of two scalars is a scalar.

Corollary. Only the scalar carrier is closed under the product, and the other three generate the whole algebra.

Proof. The four computed closures.

Corollary. The carrier closure of a non-scalar carrier is itself, and its algebra closure is strictly larger.

Proof. A carrier is closed under the copy and generates more under products.

The reading. The values are as large as possible: one closed carrier and three generating ones. The algebra of the operators is generated by any of the three non-scalar carriers, and this is why none of them can be studied in isolation.

The Chain from a Vector to the Algebra

Proposition. For a nonzero vector $v$ of the space, the chain $$ \langle v\rangle\ \subseteq\ \langle \text{carrier of } v\rangle\ \subseteq\ \operatorname{cl}(v)\ \subseteq\ \operatorname{End}(\mathbb{B}) $$ has at most four distinct terms, and each inclusion can be strict.

Proof. The line spanned by $v$ lies in its carrier, the carrier lies in its algebra closure, and the closure lies in the algebra; the examples of the preceding sections show the strictness at each step.

Corollary. The chain is the itinerary of a vector through the two structures: weight, carrier, algebra, and it is the exact sense in which a carrier is a half-way house.

Proof. The successive closures.

Corollary. A vector of the highest weight has the chain $V_3\subset F_3$, with the first two terms equal, since the line already generates the carrier under the copy.

Proof. The carrier is irreducible, so a nonzero vector of it generates it under the copy.

The reading. The chain shows the three levels: a vector knows its weight, the copy knows its carrier, and the product knows the algebra. Each level is a quotient of the information of the previous one, and no level recovers the previous except by extra structure.

The Closure of a Weight Vector

Theorem. The algebra closure of the highest weight vector of a carrier of label $k$ is the whole algebra for $k\ge1$, and the scalars for $k=0$.

Proof. The highest weight vector generates its carrier under the copy, and the preceding theorem gives the closure of the carrier.

Corollary. A single operator of nonzero weight generates the algebra under the copy and the product together.

Proof. The copy moves the vector inside its carrier, and the products reach the other carriers.

Corollary. A single scalar generates only the scalars, so the label zero is the only case of a vector that does not generate.

Proof. The scalars are central, and the products of scalars are scalars.

The reading. One operator of nonzero weight is enough to generate the algebra, provided the copy is allowed to act. Without the copy, a single operator generates only its own powers, and the difference is exactly the difference between the carrier and the algebra closure.

The Rows of the Matrix

Proposition. For a fixed label $J$ and a fixed weight $M$ the coefficients $\langle\tfrac32,m_1;\tfrac32,m_2\vert J,M\rangle$ are the coordinates of one state in the products, and the row they form is of unit length.

Proof. The state is one member of an orthonormal basis, so its coordinates in another orthonormal basis form a row of an orthogonal matrix.

Corollary. The sixteen states are the sixteen rows of the matrix, and the four carriers are the four blocks of rows, of sizes $7$, $5$, $3$ and $1$.

Proof. One row for each pair of a label and a weight, and one block for each carrier.

The reading. A carrier is a block of rows, and the block of the top carrier is the largest. The closures of this article are computed inside a block, and the products do not respect the blocks: a product of two rows of one block leaves the block, which is why the product of two carriers is not a carrier, as The Truncated Rule shows.

The Reading

Carriers are not subalgebras. The four carriers are the invariant subspaces of an action; they are not closed under the product, and the closures measure the gap. The gap is the content of the truncated rule.

The scalars are exceptional. The carrier of label zero is the only one closed under the product, since it is central. Every other carrier generates the whole algebra, and this is the strongest possible failure of closure.

The chain is the useful picture. Vector, carrier, algebra: three levels, two closures, one filtration. Every statement about the operators belongs to one of the three, and the article has placed the four carriers in the third.

Further Reading