Direct product of two representations

Click For Summary

Discussion Overview

The discussion revolves around the direct product of two representations in group theory, specifically the decomposition of the product of the representations ##10 \otimes 5^*## into its components and how to assign these components to the representations ##5## and ##45## without redundancy. The scope includes theoretical aspects of representation theory and branching rules.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant presents a decomposition of the product ##10 \otimes 5^*## and questions how to determine which components belong to the ##5## or ##45## representations to avoid redundancy in degrees of freedom.
  • Another participant suggests working out the ##SU(5)## product in components and reducing indices according to branching rules to match irreducible representations of ##SU(3) \times SU(2) \times U(1)##.
  • A participant requests further clarification on branching rules, indicating a lack of familiarity with the concept.
  • Another participant provides a definition of branching rules and suggests that the participant should find the corresponding rules for the ##5## and ##45## representations to assist in matching components.

Areas of Agreement / Disagreement

Participants express differing levels of understanding regarding branching rules, and there is no consensus on how to approach the problem of assigning components to the ##5## and ##45## representations without redundancy.

Contextual Notes

There are limitations in the discussion regarding the participants' familiarity with branching rules and the specific details of the representations involved, which may affect the clarity of the proposed approaches.

Safinaz
Messages
255
Reaction score
8
Hi their,

It's a group theory question .. it's known that

## 10 \otimes 5^* = 45 \oplus 5, ##

Make the direct product by components:

##[ (1,1)^{ab}_{1} \oplus (3,2)^{ib}_{1/6} \oplus (3^*,1)^{ij}_{-2/3} ] \otimes [ (1,2)_{ c~-1/2} \oplus (3^*,1)_{ k~1/3} ] = (1,2)^{ab}_{ c~1/2} \oplus (3^*,1)^{ab}_{ k~4/3} \oplus (3,1)^{ib}_{ c ~ -1/3} \oplus (3,3)^{ib}_{ c~-1/3} \oplus (1,2)^{ib}_{ k~1/2} \oplus (8,2)^{ib}_{ k ~ 1/2} \oplus (3^*,2)^{ij}_{ c~-7/6} \oplus (3,1)^{ij}_{ k~-1/3} \oplus (6^*,1)^{ij}_{ k ~ -1/3} ##,

Where a,b,c =1,2, I,j,k= 1,..,3 and ## [5 \otimes 5]_{antisymmetric } = 10 ##. Now there are in the 10 x 5* product two doublets (1,2) and two triplets (3,1), in which have different indices and so different interactions...

According to the number of the degrees of freedom, one doublet and one triplet should go to 5 representation ( in 10 x 5* product ), while the last scalars goes to 45 representation..

The Question is how to know which doublet or each triplet should belongs to 5 or 45 to avoid redandunce in the degrees of freedom?

Or we say for example a doublet ## (1,2,1/2) \equiv (1,2)^{ab}_{ c~1/2} \oplus (1,2)^{ib}_{ k~1/2} ## is found in both 5 and 45 decompositions ? won't be here redundancy..

Bests,
S.
 
Last edited:
Physics news on Phys.org
I'd suggest working the ##SU(5)## product out in components and then reducing indices along the branching rules. This should let you match up to the ##SU(3)\times SU(2)\times U(1)## irreps the way that you want.
 
May you give me further clarification or an example, because I'm not familiar with branching rules to know what do you mean..

Thanx
 
Safinaz said:
May you give me further clarification or an example, because I'm not familiar with branching rules to know what do you mean..

Thanx

A branching rule is the description of how the representation of a group decomposes into irreps of a subgroup (usually maximal). In your second equation you have the branching rules for the ##\mathbf{10}## and ##\mathbf{5^*}##. You need the corresponding branching rules for the ##\mathbf{5}## and ##\mathbf{45}## (they should be in the Slansky review). By following indices through the products you should be able to do the matching that you want to do.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 23 ·
Replies
23
Views
5K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
6K
  • · Replies 9 ·
Replies
9
Views
9K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 31 ·
2
Replies
31
Views
3K
  • · Replies 15 ·
Replies
15
Views
2K