• Aucun résultat trouvé

S-FUNCTIONS AND SYMMETRY IN PHYSICS

N/A
N/A
Protected

Academic year: 2021

Partager "S-FUNCTIONS AND SYMMETRY IN PHYSICS"

Copied!
5
0
0

Texte intégral

(1)

HAL Id: jpa-00213863

https://hal.archives-ouvertes.fr/jpa-00213863

Submitted on 1 Jan 1970

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

S-FUNCTIONS AND SYMMETRY IN PHYSICS

P. Butler

To cite this version:

P. Butler. S-FUNCTIONS AND SYMMETRY IN PHYSICS. Journal de Physique Colloques, 1970, 31 (C4), pp.C4-47-C4-50. �10.1051/jphyscol:1970408�. �jpa-00213863�

(2)

S-FUNCTIONS AND SYMMETRY IN PHYSICS (*)

P. H. B U T L E R

Physics Department, University of Canterbury, Christchurch, New Zealand

Résumé. — Nous avons développé une chaîne complète de programmes pour le calcul extensif des caractères dans la théorie des groupes. En utilisant l'algèbre des fonctions S, nous pouvons calculer les produits de Kronecker ou les règles de branchement à l'intérieur des groupes continus compact Un, O,,, R„, Sp„ et G2. On discute une méthode systématique simple de calcul deplé- thysmes externes et leur emploi dans les calculs des propriétés des groupes continus. L'opération de pléthysme interne peut être employée pour calculer les propriétés similaires de groupes finis.

On discute aussi l'évaluation systématique de cette opération par une méthode qui n'exige pas l'usage des tables de caractères.

Abstract. — We have developed a comprehensive set of computer programmes for the extensive calculation of the character theory of groups. Using the algebra of S-functions we may calculate Kronecker products or branching rules within the compact continuous groups U», On, Rn, Sp»

and G2. This paper discusses a straightforward systematic method of calculating outer plethysms and its use in calculating continuous group properties. The operation of inner plethysm may be used to calculate similar properties of finite groups. This paper also discusses the systematic evalua- tion of this operation by a method that does not require the use of character tables.

1. Introduction. •— There has been much interest in recent years in. the properties of both finite and continuous groups. Physicists have approached the continuous groups from the standpoint of infinitesimal operators [1], and indeed there have been sugges- tions [2] to approach the algebra of finite groups from this direction also. Lately, however, interest is being revived [3-6] in the character theory of continuous groups owing to the fact that many results of group theory may be calculated very simply using such ideas. Selection rules and the labelling schemes for atoms and nuclei follow from considerations of cha- racter theory, without the need to construct explicit operator bases.

Littlewood's approach [7] to the theory of group characters emphasizes the correspondences between unitary and symmetric groups but does not require the use of character tables of the symmetric group.

Instead he uses S-functions, which are functions on the characteristic roots of the representation matrices.

S-functions may be multiplied together either by taking an algebraic product of two functions of diffe- rent degrees on the same set of variables, or by taking a product of two functions of the same degree on different sets of variables. In both cases the product, termed the outer (or ordinary) and inner product

respectively, m a y be resolved as a direct sum S- functions.

(1«)

(lb)

The outer or inner square may be resolved into symmetric and antisymmetric parts, and indeed any /7-th order product m a y be resolved into terms occurring according to the symmetries related to representations of the symmetric group S„.

(2d)

(2b) where the sum is over all partitions (j.i) of n and the coefficient ffl is the degree of the representation { /; } of S„ [8].

The sets of terms { X } ® { \i } and { A } © { /.i } are termed the outer and inner plethysms. Littlewood introduced the outer plethysm as an immanant of an i m m a n a n t from matrix theory [9]. When calculating branching rules [3, 4] it is useful to observe [10, 11]

that outer plethysm is equal to the substitution of the terms of t h e S-function { X } into the function { /.i} as the basic variables.

It is the purpose of this paper to give systematic methods for resolving the two operations into direct sums of S-functions.

4

(*) Research sponsored in part by the Air Force Office of Scientific Research, Office of Aerospace Research, United States Air Force, under AFOSR Grant No. 1275-67.

Article published online by EDP Sciences and available at http://dx.doi.org/10.1051/jphyscol:1970408

(3)

C4-48 P. H. BUTLER 2. Properties of plethysms. - From the definitions

of plethysms it follows that the operation is distributed on the right

The last equation brings out a difficulty with the notation. We have written the operation as a product, although it is more akin to a substitution. The inner product on the right of eq. (4b) appears since both sides are partitions of 0 7 , if { ) is a partition of rn.

Similarly, although outer plethysm n a y be carried out in any order :

inner plethysm may not :

For operations on the left, cross terms appear in the products of eq. (2), and we obtain

where the sums are over all { p } a partition of all p, except in eq. (8) where the sum is restricted to parti- tions of 17 only. We use also the operation of division of S-functions defined in a previous paper [4] as the inverse to outer multiplication. If we have eq. ( l a ) then we write

Conjugate relations for plethysm may be derived ; /

{ A > @ { P } = { X > @ { P > n even

= { I > @ { i }

n odd (IOU)

3. Dimensional relations. - The operations may be checked dimensionally by the relations [8]

( { A } ) (116)

f ( V )

O { e i ) =

where (i) and ( p ) are partitions of rn and n respecti- vely, f { A } is the degree of representation { A ) of S,,,, and

( p ) being a partition of r parts.

4. The calculation of outer plethysms. - Much work in the 1950's went into finding a systematic method of calculating plethysms. Ibrahim [2] has calculated tables for n7n

<

18 by a recursive method using the theorem

({ 2 } 8 { 11

I)/{

1

1

=

= ({ 2

1

63 ({ /i

I/{

1

1))

({ 2

I/{

1

1)

(13)

The right hand side of eq. (13) is calculated first and various terms in the product tried until the one and only consistent set is found.

The method uses the general results

{ i, } @ { 0 } = { 0 }, {A } of one part only

= 0 otherwise .

However two theorems due to Murnaghan [13, 141 lead to a simpler recursive method where the choices in the method above d o not occur. We denote by

[{ A

I l k

the S-function obtained by subtracting 1 from each part of the S-function { 1, }, if { 1 } is of k parts, 01.

zero if { A } is not of k parts.

e . g . [{G}

+

( 5 1 )

+

( 4 2 )

+

(411

}I,

=

= ( 4 )

+

( 3 1 : Murnaghan's theorems state :

[{ 173 } @ { n

)Ik

=

n - k

=

1

(- I)'-' { m } @ { ~ ~ ' ) [ { m } @ { n -

1.11~ +

r = 1

+

(- I>.-"{ rn - 1 } @ { 1'' }) { n - k } (140)

[I

In

> o

{ 1" I l k =

11 - k

=

1

(- ~ > ' - ' { m } @ { ~ . ) [ { m } @ { l n - r } ] a

+

r = 1

omitting all terms in the products of more than k parts.

We use roman letters to indicate S-functions of one part.

= { ~ } o { ~ } n o d d . (lob)

(4)

Using a table of { 111 j. @ { 11 ) and { 111

3

@ { 1" ) generated by the above method it is a straightforward, if lengthy, process to build up any outer plethysm using eqs (3a-8a). The method of doing this is similar to the method of building up inner products described in a previous paper [4]. We first express ( E. ) as a sum of products of S-functions of one part by means of the determinant

{

I

= I 11j..,-.>+t I (15)

where k, = ( r ), r 3 0, 11, = 0, r. < 0. This method has two distinct advantages over Ibrahim's method for machine calculations other than ease of computa- tion. It only requires a small table of recursively computed results, and if plethysms are required 011 a restricted number of basis variables, and this is usually the case in physics, one may omit null terms when they first make their appearance. We have used this method for calculations on the University's IBM 360144 Computer.

5. The calculation of inner plethysms. - Little- wood [15] gives the special result :

{ I - 1 } { l k= ( 1 - / , 1 ~ ) (16)

It is clear that a calculation of inner plethysms could proceed for all plethysms ( n7 - 1, 1 ) 0 { ~i ) , by using the conjugate relation to eq. (15), and eq. (3b) and (4b). Also eq. (5b) leads to

{ m - k , l k ) Q { ~ ) = ( { ~ n - 1 , 1 } 0 ( l k ) ) Q { P ~

= {I'll - 1, 1 ] Q ({ l k ) 8 { P } ) ( 1 7) and thus we may evaluate such inner plethysms, using outer plethysms. F o r a more general S-function { A ) on the left we require t o express it in terms of inner products of terms { 177 - k, l k ) . This may be done by the following procedure :

THEOREM : I t is always possible to write an S- function { /l ) in terms of (/-fold inner products { I ) = { m - a , l a ) o { n 7 ~ ~ - b, I b } o

o { n z - c , l c ) o . - . o { ~ ? ? - d , l ~ ) (18) To prove this, we define a new ordering among the S-functions { A ), { p ), partitions of 111, that differs from the usual ordering. We say { 1. ) preceeds { p ) if,

(i) > PI

or if their first rows are equal, by the length of the first column :

(ii)

(Xh

> (;I,

.

If both first row and first column are equal we order with respect to the smallness of their lowest rows

We may replace { i. ), { } not of the form { Ill - k, l k ) ,

by the set of S-functions given by

{ ; . " ) o { / i )

- Z { \ J )

(19) where { I" ) o { 11 ) = { A )

+ 1

{ v ) and we are to prove thatall the terms {A"), { p } and { v ) preceed {A) in the above ordering.

If

{ i ) = {A,, 12, ..., Ar 1 " ) and

we take { 2" ) = { A,

+

a, iL2,

..., A_,,

1"" ) ( p ) = { H I - a , a )

It is clear that both {

A"

) and { p ) preceed { I ) in the ordering.

We may write

and by Littlewood's inner product theorem [4] : { I."

1

0 { P

1

= ({ 2"

I/{

5"

1)

{5,1 -

- {

I/{

t o - I

1)

{ t n - I

1

(21 1

where { 5, ) is summed over all partitions of a. All terms { 1" )/{ 5, ), { 1" )I{ 5 , - , ) will have at least

I,

+

1

cells in the first row except one term of { I." f / { a ).

This one term of { I" )/{ a ) is { iL1, A2, ..., , l " + l } .

All the { r ) arising from the products of the other terms with their respective {

5

) must preceed { I } in our ordering on account of condition I . One term in

{ iL1, iL2, ..., 2,- ,, 11'+' } { a ) =

2

{ 11 )

is {I. ), all other terms will have vr < a

+

1 , i. e.

1; < I,, (condition 3). This proves that by use of eq. (16) we may systematically replace the lowest { A j

in an inner product expression by terms higher )) in this ordering.

e . g . ( 3 2 1 ) ~ ( 1 1 ) = ( { 4 1 2 ) o { 5 1 ) -

- { 5 1 > 0 { 5 1 ) - ( 3 1 3 )

+

{ 6 ) ) 0 f 1 1 ) by eq. (6b, 7b)

= ( { 4 1 2 ) o { 5 1 ) ) ~ { 1 1 ) ) +

+

( { 5 1 1 0 { ~ ~ 1 ) ~ { 2 1

+

{ 3 1 3 ) 0 { 2 )

+

{ 6 ) 0 { 1 1 )

- { 4 1 2 ) o { 5 1 ) o { 5 1 } o { 5 1 )

+

{ 4 1 1 ) 0 { 5 1 ) o { 3 1 3 )

+

{ 4 1 2 ) o { 5 1 )

+

{ 5 1 ) 0 { 5 1 ) 0 { 3 1 ~ ) -

- { 5 1 ) 0 { 5 1 ) - { 3 1 3 }

(5)

C4-50 P. H. BUTLER

but we have also by eq. (8b) a n d

( { 4 1 2 ) o { 5 1 } ) Q { 1 1 ) =

= { 4 1 2 ) ~ { 2 ) ~ { 5 1 } Q { 1 1 )

+ +

( 4 1 ' ) Q { 1 1 ) 0 { 5 1 } 0 { 2 } and

( { 5 1 ) 0 ( 5 1 } 0 { 2 } =

= ( ( 5 1 ) 0 ( 2 ) ) '

+

( ( 5 1 } 0 { 11

}I2.

Use of eq. (3b, 4b) and eq. (16) gives ( 5 1 ) 0 { 1 1 } = { 4 1 2 )

{ 5 1 ) 0 { 2 ) = { 5 1 } 0 { 5 1 } - { 4 1 2 } . Using also eq. (15) we also obtain

{ 3 1 3 } 0 { 2 } =

= { 4 1 2 ) 0 { 4 1 2 ) - { 5 1 ) 0 { 4 1 2 }

+

( 5 1 )

( 4 1 ' ) 0 ( 1 1 ) = ( 5 1 } 0 { 3 l 3 )

-

{ 2 1 4 } (41" Q ( 2 ) =

= { 4 1 2 ) 0 { 4 1 2 )

-

{ 5 1 } o { 3 1 3 )

+

( 2 1 4 ) a n d finally using { 6 } 0 { 11 } = 0 leads t o the result :

( 3 2 1 ) Q { 1 1 } = 3 { 4 1 2 }

+

( 3 ' )

+

2 { 3 2 1 )

+

+ 3 { 3 i 3 ) + 2 { 2 2 i 2 ) + { 2 i 4 ) verifying the result given by Robinson [8] by other means.

Acknowledgement. - I would like t o thank Pro- fessor B. G. Wybourne for his continued interest and encouragement.

References

111 See for example, WEYL (H.), (( The Tlleory of Groups and Quarrt~rrn Mecharrics )) (translated by H. P. Robertson, Dover Publications, New York) ; JUDD (B. R.), (( Operator Teclrr~iq~res in Atomic Spectroscopy )) (McGraw Hill Co. Inc., 1963).

[2] GAMBA (A.), J. Math. Phys., 1969, 10, 872.

[3] SMITH (P. R.) & WYBOURNE (B. G.), J . Math. Phys., 1968,8,2434 ; 1968,9, 1040.

[4] BUTLER (P. H.) & WYBOURNE (B. G.), J . Plrysique, 1969, 30, 181 ; 1969, 30, 795 ; 1969, 30, 655.

[5] WYBOURNE (B. G.), (( Symmetry Principles aiid Atomic Spectroscopy 1) with an appendix of tables by P. H. Butler. (J. Wiley & Sons, New York, 1970).

[6] KING (R. C.), J. Math. Phys., 1970.

171 LITTLEWOOD (D. E.), (( The Theory of Group Charac- ters )), 2 nd ed. (Oxford University Press, Oxford, 1958).

[8] ROBINSON (G. de B.), (( Representation Theory of the Symmetric Gro~rp (Edinburgh University Press, Edinburgh 1961).

[9] LITTLEWOOD (D. E.), Trans. Roy. Soc. (London), 1943, A 239, 305 ; 1943, A 238, 387.

[lo] LITTLEWOOD (D. E.), (( A Ulriversity Algebra (Wil- liam Heinemann Ltd, London, 1950).

[ I l l READ (R. C.), Can. J. Math., 1968, 20, 808.

[I21 IBRAHIM (E. M.), (( Tables for the Pletl1.1;sm of S- F~rrrctiorrs D. Royal Society (London), Depository of Unpublished Tables.

[13] MURNAGHAN (F. D.), Proc. Nat. Acnd. Sci., 37, 51 ; 1951, 37, 439 ; 1954, 40, 721.

[14] MURNAGHAN (F. D.), Ann. Acad. Brasileira Ci., 1951, 23, 2 ; 1951, 23, 348.

[15] LIITLEWOOD (D. E.), Can. J. Math., 1958, 10, 1.

Références

Documents relatifs

As part of its ongoing efforts to eliminate barriers to work and to help social assistance recipients to become self-reliant, your government will

A Hardware Platform is a family of architectures that satisfy A Hardware Platform is a family of architectures that satisfy a set of architectural constraints imposed to allow the re-

Applications may use PF_INET6 sockets to open TCP connections to IPv4 nodes, or send UDP packets to IPv4 nodes, by simply encoding the destination’s IPv4 address as an

In other words, following any deviation, the firms of the cartel conform to a stick, or punishment, phase in which they produce a very high quantity (the punishment output level)

9 Diabetic foot experts, 74,75 including the authors of the most recent IDSA 16 and IWGDF 18 guidelines on DFI, the European Wound Management Association policy document, 65 and

transformed, not only in the direct practical way of becoming cultivated, or shaped into objects of use in the embodied artifacts we call tools…it becomes transformed as an object

Chairperson of the first session of the General Assembly of the States Parties to the 2003 Convention for the Safeguarding of the Intangible Cultural Heritage,.. Your Excellency

In order to complete the discussion about the same table within different schemas, Listing 8 shows a simple population of each different table and the count of each