Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite spin blocks, spherical tensors and Clebsch–Gordan phases

Definition

A spin label is j∈{0,12,1,32,…}. Its magnetic labels are m=−j,−j+1,…,j. The spin-j block is Vj=C2j+1 with orthonormal basis ej,m and operators Jz(j)ej,m=mej,m and J±(j)ej,m=(j∓m)(j±m+1)ej,m±1, with the out-of-range endpoint vector interpreted as zero. Put Jx(j)=(J+(j)+J−(j))/2, Jy(j)=(J+(j)−J−(j))/(2i) and J(j)2=(Jx(j))2+(Jy(j))2+(Jz(j))2.

For an ordered coupling of spin labels s,t, use the ordered tensor product Vs⊗Vt, its orthonormal product basis es,m⊗et,n, and total operators Jatot=Ja(s)⊗I+I⊗Ja(t) for a=x,y,z, with J±tot=Jxtot±iJytot. For each j=∣s−t∣,∣s−t∣+1,…,s+t, choose and record a unit highest-weight vector uj in the spin-j summand: it has Jztotuj=juj and J+totuj=0. Set vj,M=(r!(2j)(2j−1)⋯(2j−r+1))−1/2(J−tot)ruj for M=j−r and r=0,1,…,2j, using the empty product 1 for r=0.

The Clebsch–Gordan coefficient Cs,m;t,nj,M is the coefficient of es,m⊗et,n in vj,M, so vj,M=∑m,nCs,m;t,nj,Mes,m⊗et,n. Equivalently, with the supplier's inner product linear in its first argument, Cs,m;t,nj,M=⟨vj,M,es,m⊗et,n⟩. The coupling order and the choice of each uj are part of this convention. Replacing uj by eiθjuj multiplies every coefficient for that j by eiθj; comparison with a table therefore requires matching its order and phases.

Let H=⨁α∈AVjα and K=⨁β∈BVℓβ be finite direct sums of specified spin blocks over C, with finite copy-index sets A,B; repeated spin labels designate distinct copies. The vector operations are coordinatewise, and the inner products are the sums of the block inner products. For a=x,y,z, define JaH(hα)α∈A=(Ja(jα)hα)α∈A and JaK(gβ)β∈B=(Ja(ℓβ)gβ)β∈B. Set J±H=JxH±iJyH and J±K=JxK±iJyK. For an integer k≥0, a rank-k spherical tensor family from H to K is a family of linear maps Tq:H→K indexed by q=−k,−k+1,…,k satisfying JzKTq−TqJzH=qTq and J±KTq−TqJ±H=(k∓q)(k±q+1)Tq±1. Here Tk+1=T−k−1=0. When H=K, these differences are ordinary commutators. No nonzero reduced matrix element or physical interpretation is included in this definition.

Justification

The finite-spin supplier constructs the stated matrices on each block and proves their ladder relations and J(j)2=j(j+1)I. The ordered-register supplier supplies the product inner product and basis. The tensor-spin composition supplier gives one invariant spin-j summand for each listed j and a normalized ladder basis from a chosen unit highest-weight vector. Thus the finite choices and displayed positive normalization factors define every vj,M and its unique product-basis coefficients. Multiplying the chosen highest-weight vector by a unit complex scalar gives the stated phase change by linearity. The direct-sum supplier gives coordinatewise vector operations by taking R=C and the indicated finite families, while the linear-map supplier defines the maps Tq. The blockwise operators preserve each coordinate space and are linear because the spin-block operators are linear; therefore JaKTq and TqJaH are linear maps from H to K, so each tensor-family equation is well typed. The sum of the block inner products is sesquilinear and positive definite because it is a finite sum of such pairings and is positive on every nonzero tuple. The zero family satisfies the equations, including at the endpoints. Finite spin matrices Tensor spin composition Ordered tensor registers, their inner product, and wire permutations The direct sum of an indexed family of modules Linear map between vector spaces over the same field

Depends on

Used by · 32

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.