Group Theory Character Table
Group Theory Character Table
1)
A one dimensional irreducible representation is labelled A if it is symmetric
with respect to rotation about the highest order axis Cn.
2)
A subscript 1 is given if the irreducible representation is symmetric with respect
to rotation about a C2 axis perpendicular to Cn or (in the absence of such an axis)
to reflection in a sv plane. An anti-symmetric representation is given the subscript 2.
Page 4
Mulliken symbols: Labelling
3)
Subscripts g (gerade) and u (ungerade) are given to irreducible representations
That are symmetric and anti-symmetric respectively, with respect to inversion
at a centre of symmetry.
4)
Superscripts ‘ and “ are given to irreducible representations that are symmetric
and anti-symmetric respectively with respect o reflection in a sh plane.
Page 5
Character Table (C2v)
Character Table (C2v)
A2g 1 1 -1 -1 1 1 -1 1 1 -1
Eg 2 -1 0 0 2 2 0 -1 2 0 (2z2 - x2 - y2,
x2 - y2)
T1g 3 0 -1 1 -1 3 1 0 -1 -1 (Rx, Ry,
Rz)
T2g 3 0 1 -1 -1 3 -1 0 -1 1 (xz, yz, xy)
A1u 1 1 1 1 1 -1 -1 -1 -1 -1
A2u 1 1 -1 -1 1 -1 1 -1 -1 1
Eu 2 -1 0 0 2 -2 0 1 -2 0
T1u 3 0 -1 1 -1 -3 -1 0 1 1 (x, y, z)
T2u 3 0 1 -1 -1 -3 1 0 1 -1
More notes about symmetry labels and characters:
-“T” indicates that the representation is triply-degenerate – this means that the functions grouped
in parentheses must be treated as a threesome and can not be considered individually.
-The subscripts g (gerade) and u (ungerade) in the symmetry representation label indicates
“symmetric” or “anti-symmetric” with respect to the inversion center, i.
Conversion of Reducible Representations
into Irreducible Representations
21
Generating Reducible Representations
Summarising we get that G3n for this molecule is:
C2v E C2 s(xz) s(yz)
G3n +9 -1 +1 3
To reduce this we need the character table for the point groups
C2v E C2 s(xz) s(yz)
A1 +1 +1 +1 +1 Tz x2, y2, z2
A2 +1 +1 -1 -1 Rz xy
B1 +1 -1 +1 -1 Tx , Rx xz
B2 +1 -1 -1 +1 Ty , Ry yz
Page 22
Reducing Reducible Representations
1
We need to use the reduction formula: a p n R .c ( R).c p R
g R
Where ap is the number of times the irreducible representation, p,
occurs in any reducible representation.
Page 23
C2 1E 1C2 1s(xz) 1s(yz)
v
A1 +1 +1 +1 +1 Tz x2, y2, z2 For C2v ; g = 4
A2 +1 +1 -1 -1 Rz xy and nR = 1 for
B1 +1 -1 +1 -1 Tx , Rx xz all operations
B2 +1 -1 -1 +1 Ty , Ry yz
Page 24
1 s(xz) s(yz)
a p nR . c ( R ). c p R
C2v E C2
g R G3n +9 -1 +1 3
Page 25