SU(2) symmetric/antisymmetric combination using young tableaux

Click For Summary
SUMMARY

The discussion centers on constructing symmetric and antisymmetric combinations of states for SU(2) using Young tableaux. Participants analyze the decomposition of three spin-half particles into irreducible representations, specifically addressing the combinations of indices and their symmetries. Key equations include the symmetric combination [[a, b], c] and the antisymmetric combination [{a, b}, c], with participants clarifying the correct forms and addressing discrepancies in calculations. The conversation highlights the importance of understanding the notation and the implications of symmetry in constructing these states.

PREREQUISITES
  • Understanding of SU(2) representations and spin-half particles
  • Familiarity with Young tableaux and their application in quantum mechanics
  • Knowledge of symmetric and antisymmetric combinations in quantum states
  • Basic grasp of Clebsch-Gordan coefficients and their role in state decomposition
NEXT STEPS
  • Study the construction of SU(2) representations using Young tableaux
  • Learn about the properties of symmetric and antisymmetric tensors in quantum mechanics
  • Explore the application of Clebsch-Gordan coefficients in combining quantum states
  • Investigate the implications of different symmetries in particle physics
USEFUL FOR

Quantum physicists, students of particle physics, and researchers working with SU(2) representations and symmetry in quantum mechanics will benefit from this discussion.

hjlim
Messages
4
Reaction score
0
I am pretty confused about how to construct states to make symmetric / anti-symmetric combination so I would like to ask some questions.

For example, for SU(2), states of three spin-half particles can be decomposed as 2 x 2 x 2 = 4 + 2 + 2, 3 irreducible combination with dim 4, 2, 2.

-if I combine three boxes in a row(in young tableaux), making a total symmetric combination,
then [[a, b], c] = (ab + ba) c + c (ab + ba) = abc + bac + bac + cba (right?) (here the large bracket represents symmetric index)
And there should be four in general non-vanishing independent index: 111, 112=211, 221=122, 222(right?)
But as I see, [[1,1],2] != [[1,2],1] for [[1,1],2] = 112 + 112 + 211 + 211 while [[1,2],1] = 121 + 211 + 112 + 121 and [[2,2],1] != [[1,2],2] for similar reason. (it's because c is symmetric only with [a, b], not with the individual a and b). So there seems to be six non-vanishing index.
I wonder what is wrong with my calculation.

-And as I understand, [{a, b}, c] = (ab - ba) c + c(ab - ba) can have two non-vanishing index:
[{1, 2}, 1], [{1, 2}, 2]
And for {[a, b], c} = (ab + ba) c - c (ab + ba), there are two independent non-vanishing index:
{[1,1],2}, {[2,2],1} (or equivalently {[1,2],2})
Is this correct?

-And if I calculate {[1,1],2} of |+>|->|+>, it's 0. But as I calculated directly using CG table, |+>|->|+> is a part of the state whose {[1,1],2} only is 1. So I guess it shouldn't be zero. Is something wrong with this?

Actually there are many other things I get confused but first I would like to know these and then figure out the next.

Thank you very much.
 
Last edited:
Physics news on Phys.org
You wrote:
-if I combine three boxes in a row(in young tableaux), making a total symmetric combination,
then [[a, b], c] = (ab + ba) c + c (ab + ba) = abc + bac + bac + bca (right?)

First you should explain your nomenclature. The brackets, are they anti-commutators?
Why should a totally symmetric representation have the form of the multiple anti-commutators in the form given by you? I also don't understand the right hand side of your equation. I get
abc+bac+cab+cba, so the c never stands in the middle position. Hence it cannot be a totally symmetric combination.
 
You are right. They are my mistakes and I corrected them. But I still don't understand. I'll really appreciate if u can give me some hints.
 
Hm, but you still did not explain why you think that a totally symmetric Young tableaux should have to do anything with [[a, b], c].
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K