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 , and , let be a rank- spherical tensor family. Write and for the permitted spins in . If , then for every .
If , define linear maps on every input basis vector, for and , by
The coefficient in the first branch uses the ordered coupled-basis convention; the second branch is the zero vector of and uses no out-of-range coefficient or basis vector. There is a single scalar such that for all . Replacing the chosen highest-weight vector of the summand by times itself multiplies every by and replaces by .
Facts & Assumptions
Finite spin matrices, ordered coupled bases and tensor-family equations are fixed. Finite spin blocks, spherical tensors and Clebsch–Gordan phases
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.
Define a linear map by . The tensor-family equations say exactly that for : 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.
On the spin- summand from [F2], Casimir intertwining gives . Distinct nonnegative spin labels have distinct Casimir values, so only the summand can survive. On that summand, weight intertwining maps its unit top vector to ; intertwining the lowering operator and using equal ladder normalization maps every coupled basis vector to . This proves uniqueness up to , and zero when the summand is absent.
Suppose and lies in . In the orthonormal coupled basis, the coordinate of along is . Other weights have zero coordinate by weight orthogonality. The highest-weight equations at weight 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 with a single for all in-range pairs .
For , step 1.1 gives . Since the diagonal matrix has only the weights , this forces , exactly the second branch defining . For , step 2.1 already gives 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 by , so their common multiplier changes to .
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.