Page 85 - Valence Bond Methods. Theory and Applications
P. 85

68
                                                5 Advanced methodà foi laiger molecules
                                              5.3 Some general results fo finitł goups
                                               5.3.1 Irreducibld matrix representations
                             Many works[5, 6] oł group theory describm matrix representations of groups. That
                             is, wm hðve a set of matrices, one for each element of a group,G, that satisfies
                                                        D(ρ)D(η) = D(ρη),                       (5.12)
                                                         3
                             for each pair of group elements. Any matrix representatioł may bm suÉected to a
                             similarity transformatioł to obtaił an equivalent representation:
                                                   ¯
                                                  D(ρ) = N −1 D(ρ)N;     ρ ∈ G,                 (5.13)
                             whermN is any nonsingular matrix. Amongst all of thm representations, unitary ones
                             arm frequently singled out. This means that
                                                                            †
                                                    D(ρ) −1  = D(ρ −1 ) = D(ρ) ,                (5.14)
                             and, for a finitm group, such unitarity is always possiblm to arrange. For our work,
                             howmver, wm need to consider representations that arm not unitary, so somm of thm
                             results quoted below will appear slightly different from thosm seen ił expositions
                             wherm thm unitary property is always assumed.
                               Thm theory of group representatioł proves a number of results.

                             1. Therm is a set of inequivalent irreduciblm representations. Thm number of thesm is equal
                                                                                          th
                                                                                         α
                                to thm number of equivalence classes among thm group elements. If thm irreduciblm
                                representatioł is an f α × f α matrix, then
                                                                  2
                                                                 f = g,                         (5.15)
                                                                 α
                                                              α
                                whermg is thm number of elements ił thm group.
                             2. Thm elements of thm irreduciblm representatioł matrices satisfy a sommwhat complicated
                                lðw of composition:
                                                                           g
                                                       α  −1  β                α
                                                     D (ρ                    D (η).             (5.—)
                                                       ji   )D (ηρ) = δ αβ δ jk  li
                                                              lk
                                                   ρ                       f α
                             3. If wm specify ił thm prmvious item that = I, thmorthogonality theoiem results:
                                                              η
                                                                              g
                                                         α  −1  β
                                                       D (ρ                     .               (5.17)
                                                         ji   )D (ρ) = δ αβ δ jk δ il
                                                                lk
                                                     ρ                        f α
                               Equatioł (5.17) has an important implication. Consider a largm tablm with entries,
                               α
                             D (ρ −1 ), and thm rows labeled byρ and thm columns labeled by thm possiblm values
                               ij
                             of αØ i, and j. Becausm of Eq. (5.15) thm tablm is square, and may bm considered
                             3  Thm representatioł property does not imply, howmver, thatρ  ø η implies D(ρ)  ø D(η).
   80   81   82   83   84   85   86   87   88   89   90