Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Tensor-family components equal coherent Clebsch–Gordan transition maps

Statement

For J=4, k∈{0,1} and J′∈{3,4,5}, let Tq:V4→VJ′ be a rank-k spherical tensor family. Write S0={4} and S1={3,4,5} for the permitted spins in V4⊗Vk. If J′∉Sk, then Tq=0 for every q.

If J′∈Sk, define linear maps Aq:V4→VJ′ on every input basis vector, for m=−4,−3,…,4 and q=−k,−k+1,…,k, by

Aqe4,m={C4,m;k,qJ′,m+qeJ′,m+q,∣m+q∣≤J′,0,∣m+q∣>J′.

The coefficient in the first branch uses the ordered coupled-basis convention; the second branch is the zero vector of VJ′ and uses no out-of-range coefficient or basis vector. There is a single scalar λ∈C such that Tq=λAq for all q. Replacing the chosen highest-weight vector of the J′ summand by eiθ times itself multiplies every Aq by eiθ and replaces λ by e−iθλ.

Facts & Assumptions

[F1]

Finite spin matrices, ordered coupled bases and tensor-family equations are fixed. Finite spin blocks, spherical tensors and Clebsch–Gordan phases

[F2]

The ordered product splits into one copy of each permitted spin, with the normalized ladder bases. Tensor spin composition

Proof

Given: The finite objects and conventions in the Statement.

Goal: Establish the stated identities and implications.

1.1F1algebra

Define a linear map Φ:V4⊗Vk→VJ′ by Φ(x⊗ek,q)=Tqx. The tensor-family equations say exactly that Ja(J′)Φ=ΦJatot for a=z,+,−: the second tensor-factor ladder coefficient is the coefficient appearing in the tensor-family equation. Thus Φ also intertwines the Casimir, the sum of squares of the three Cartesian generators.

2.1F1F2step 1.1algebra

On the spin-j summand from [F2], Casimir intertwining gives (J′(J′+1)−j(j+1))Φ=0. Distinct nonnegative spin labels have distinct Casimir values, so only the j=J′ summand can survive. On that summand, weight intertwining maps its unit top vector to ceJ′,J′; intertwining the lowering operator and using equal ladder normalization maps every coupled basis vector to ceJ′,M. This proves uniqueness up to c, and zero when the summand is absent.

3.1F1F2step 2.1algebra

Suppose J′∈Sk and M=m+q lies in [−J′,J′]. In the orthonormal coupled basis, the coordinate of e4,m⊗ek,q along vJ′,M is C4,m;k,qJ′,M‾. Other weights have zero coordinate by weight orthogonality. The highest-weight equations at weight J′ have real matrices and a one-dimensional complex solution space by [F2], so they admit a real unit solution: the real or imaginary part of any nonzero solution is a nonzero real solution and can be normalized. The lowering matrices and their normalization factors are real. Hence one phase choice gives real coefficients at every weight, and every other allowed choice multiplies all these coefficients by one common phase. Their conjugates are therefore one common scalar times the coefficients themselves. Applying step 2.1 gives Tqe4,m=λC4,m;k,qJ′,MeJ′,M with a single λ for all in-range pairs (m,q).

4.1F1step 1.1step 2.1step 3.1algebra∎

For ∣m+q∣>J′, step 1.1 gives Jz(J′)Tqe4,m=(m+q)Tqe4,m. Since the diagonal matrix Jz(J′) has only the weights −J′,−J′+1,…,J′, this forces Tqe4,m=0, exactly the second branch defining Aq. For J′∉Sk, step 2.1 already gives Tq=0 without using a Clebsch–Gordan coefficient. Together with step 3.1 this proves every asserted component identity. The phase law for the coefficients in [F1] multiplies all the maps Aq by eiθ, so their common multiplier changes to e−iθλ.

Depends on

Used by · 1

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.