0% found this document useful (0 votes)
52 views11 pages

Transformation Matrices Geometric and Otherwise

The document discusses transformation matrices for different coordinate systems and basis sets. It provides examples of transformation matrices for the C3v point group in both Cartesian and spherical orbital bases. It also shows how d-orbitals transform under rotations, expressing them in terms of spherical harmonics and Cartesian d-orbital functions.

Uploaded by

smiling person
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views11 pages

Transformation Matrices Geometric and Otherwise

The document discusses transformation matrices for different coordinate systems and basis sets. It provides examples of transformation matrices for the C3v point group in both Cartesian and spherical orbital bases. It also shows how d-orbitals transform under rotations, expressing them in terms of spherical harmonics and Cartesian d-orbital functions.

Uploaded by

smiling person
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Transformation Matrices;

Geometric and Otherwise


• As examples, consider the transformation
matrices of the C3v group. The form of
these matrices depends on the basis we
choose. Examples:
• Cartesian vectors: xˆ , yˆ , ˆz
⎡ 1 ⎤ ⎡ 0 ⎤ ⎡ 0 ⎤
x̂ = ⎢ 0 ⎥ ŷ = ⎢ 1 ⎥ ẑ = ⎢ 0 ⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎢⎣ 0 ⎥⎦ ⎢⎣ 0 ⎥⎦ ⎢⎣ 1 ⎥⎦
• p orbitals on the N atom of NH3
• the three 1s orbitals on the hydrogen atoms of NH3

⎡ 1 ⎤ x z : up
x̂ = ⎢ 0 ⎥ y
⎢ ⎥
⎢⎣ 0 ⎥⎦ φ1 φ3
⎡ 0 ⎤ N x σv2 σv1
ŷ = ⎢ 1 ⎥ H φ3 2
C3
⎢ ⎥ y φ2
⎢⎣ 0 ⎥⎦ φ2 φ1
σv3
C3
⎡ 0 ⎤
ẑ = ⎢ 0 ⎥
Cartesian basis:
⎢ ⎥
⎢⎣ 1 ⎥⎦ ⎡ −1
⎡ 1 0 0 ⎤ − 3
0 ⎤ ⎡ −1 3
0 ⎤
⎢ 2 2 ⎥ ⎢ 2 2 ⎥
⎢ ⎥
E=⎢ 0 1 0 ⎥ C3 = ⎢ 23 − 12 0 ⎥ C32 = ⎢ − 3 − 12 0 ⎥
⎢ ⎥ ⎢ 2

⎢⎣ 0 0 1 ⎦⎥ ⎢⎣ 0 0 1 ⎥⎦ ⎢⎣ 0 0 1 ⎥⎦
⎡ −1 − 3
0 ⎤ ⎡ −1 3
0 ⎤ ⎡ 1 0 0 ⎤
⎢ 2 2
⎥ ⎢ 2 2

σ v1 = ⎢ − 3 1
0 ⎥ σ v2 =⎢ 3 1
0 ⎥ σ v 3 = ⎢ 0 −1 0 ⎥
2 2 2 2 ⎢ ⎥
⎢ ⎥ ⎢ ⎥ ⎢⎣ 0 0 1 ⎥⎦
⎢⎣ 0 0 1 ⎥⎦ ⎢⎣ 0 0 1 ⎥⎦
x z : up
Example y
φ1 φ3
N x σv2 σv1
H φ3 C3
2

φ2 y φ1 φ2
σv3
C3

Three 1s orbitals on the hydrogen atoms of NH3

Example, φ1 φ3
N σv1
Answers H φ3
σv2
C3
2

φ1 φ2
φ2
σv3
C3

⎡ 1 0 0 ⎤ ⎡ 0 0 1 ⎤ ⎡ 0 1 0 ⎤
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
E=⎢ 0 1 0 ⎥ C3 = ⎢ 1 0 0 ⎥ C32 = ⎢ 0 0 1 ⎥
⎢⎣ 0 0 1 ⎥⎦ ⎢⎣ 0 1 0 ⎥⎦ ⎢⎣ 1 0 0 ⎥⎦
⎡ 1 0 0 ⎤ ⎡ 0 0 1 ⎤ ⎡ 0 1 0 ⎤
σ v1 = ⎢⎢ 0 0 1 ⎥⎥ σ v2 ⎢
=⎢ 0 1 0 ⎥

σ v 3 = ⎢⎢ 1 0 0 ⎥⎥
⎢⎣ 0 1 0 ⎥⎦ ⎢⎣ 1 0 0 ⎥⎦ ⎢⎣ 0 0 1 ⎥⎦
Transformation of d orbitals
d0 (l = 2, ml = 0) ∝ ⎫ 1 5
(3cos 2 θ − 1)
⎪ 4 π
±iϕ ⎪ see, e.g., Atkins & de Paula,
d±1 (l = 2, ml = ±1) ∝ (∓) 2 2 π sin θ cosθ e
1 15

⎪ Physical Chemistry
±2iϕ
d±2 (l = 2, m = ±2) ∝ 1 15
sin θ e
2

4 2π

iϕ −iϕ
d xz = 2 [−d1 + d−1 ] ∝ 2 π sin θ cosθ 2 [e + e ] = 12 15π sin θ cosθ cosϕ ∝ 14 15π × 2xz
1 1 15 1

−1
d yz = i 2
[d1 + d−1 ] ∝ 12 15
π
sin θ cosθ 2i1 [eiϕ − e−iϕ ] = 1
2
15
π
sin θ cosθ sin ϕ ∝ 14 15
π
× 2yz
dx 2 − y 2 = 1
2
[d2 + d−2 ] ∝ 14 15
π
sin 2 θ 12 [e2iϕ + e−2iϕ ] = 1
4
15
π
sin 2 θ cos 2ϕ ∝ 14 15
π
× (x 2
− y2 )
d xy = 1
i 2
[d2 − d−2 ] ∝ 14 15
π
sin 2 θ 2i1 [e2iϕ − e−2iϕ ] = 1
2
15
π
sin 2 θ sin 2ϕ ∝ 14 15
π
× 2xy
dz 2 = d0 ∝Y20 ∝ 14 5
π
( 3cos θ − 1) ∝
2 1
4
15
π
×
1
3 ( 3z 2
− r2 )
d1 = − 1
2
[d xz + id yz ] ; d−1 = 1
2
[d xz − id yz ]
d2 = 1
2
[d x 2 − y 2 + id xy ] ; d−2 = 1
2
[d x 2 − y 2 − id xy ]

Group Representations
• Representation: A set of matrices that
“represent” the group. That is, they behave
in the same way as group elements when
products are taken.
• A representation is in correspondence with
the group multiplication table.
• Many representations are in general possible.
• The order (rank) of the matrices of a
representation can vary.
Example - show that the matrices
found earlier are a representation

⎡0 0 1 ⎤ ⎡0 1 0 ⎤ ⎡1 0 0 ⎤
eg., C3C32 = ⎢⎢ 1 0 0 ⎥⎥ ⎢⎢ 0 0 1 ⎥⎥ = ⎢⎢ 0 1 0 ⎥⎥ = E
⎢⎣ 0 1 0 ⎥⎦ ⎢⎣ 1 0 0 ⎥⎦ ⎢⎣ 0 0 1 ⎥⎦

⎡1 0 0 ⎤ ⎡0 0 1 ⎤ ⎡1 0 0 ⎤ ⎡0 1 0 ⎤
(σ v1 )−1 C3σ v1 = ⎢⎢ 0 0 1 ⎥⎥ ⎢⎢ 1 0 0 ⎥⎥ ⎢⎢ 0 0 1 ⎥⎥ = ⎢⎢ 0 0 1 ⎥⎥ = C32
⎢⎣ 0 1 0 ⎥⎦ ⎢⎣ 0 1 0 ⎥⎦ ⎢⎣ 0 1 0 ⎥⎦ ⎢⎣ 1 0 0 ⎥⎦

Reducible and Irreducible Reps.


• If we have a set of matrices, {A, B, C, ...}, that
form a representation of a group and we can
find a transformation matrix, say Q, that
serves to “block factor” all the matrices of
this representation in the same block form
by similarity transformations, then {A, B,
C, ...} is a reducible representation. If no
such similarity transformation is possible
then {A, B, C, ...} is an irreducible
representation.
Similarity Transformation
maintains a Representation
Suppose the group multiplication rules are
such that AB = D, BC = F , etc ...
• Now perform similarity transforms using
the transformation matrix Q:
A´ = Q-1AQ, B´ = Q–1BQ, C´ = Q–1CQ, etc.
• Multiplication rules preserved:

A´B´ = (Q–1AQ)(Q–1BQ) = (Q–1DQ) = D´


B´C´ = (Q–1BQ)(Q–1CQ) = (Q–1FQ) = F´, etc.

Reducing a Representation by
Similarity Transformations
⎡ A1 ⎤
⎢ A2 ⎥
⎢ ⎥
Q−1AQ = ⎢ ⎥
⎢ ⎥ ⎡C1 ⎤
⎢ A3 ⎥ ⎢ ⎥
⎢⎣ ⎥⎦ ⎢
C2

Q CQ = ⎢
−1

⎢ ⎥
⎢ C3 ⎥
⎡ B1 ⎤ ⎢⎣ ⎥⎦
⎢ B2 ⎥
⎢ ⎥
Q BQ = ⎢
−1

⎢ ⎥
⎢ B3 ⎥
⎢⎣ ⎥⎦
“Blocks” of a Reduced Rep. are
also Representations
This must be true because any group
multiplication property is obeyed by the
subblocks. If, for example, AB = C, then
A1B1 = C1, A2B2 = C2 and A3B3 = C3.
Example: Show that the ⎡ 1 −1 1 ⎤
matrix at left, Q , can reduce ⎢ 2 6 3⎥
the matrices we found for the Q = ⎢ −1 −1 1 ⎥
⎢ 2 6 3⎥
representation given earlier. ⎢ 0 2 1 ⎥
⎣ 6 3⎦

A Block Factoring Example

⎡ 1 ⎡ 0 0 1⎤
−1 0 ⎤⎢ ⎡
⎥ ⎢ 1 2 −1 6 1 ⎤
⎢ 2 2 ⎥ 3⎥
⎢ −1 −1 ⎥⎢ ⎥⎢ ⎥
−1
Q C 3Q = ⎢ 2 ⎢1 0 0 ⎥ ⎢ −1 −1 1
6 6 6⎥⎢ ⎥⎢ 2 6 3⎥
⎢ 1 ⎥ ⎥
⎢⎣ 3 1 1 ⎢ ⎥⎢ 0 2 1
3 3 ⎥⎦ ⎢⎣ 0 1 0 ⎥⎦ ⎣ 6 3 ⎥⎦

⎡ −1 3 0⎤ ⎡ 1 − 3 0⎤
⎢ 2 2 ⎥ ⎢ 2 2 ⎥
⎢ ⎥ ⎢ ⎥
Q−1C 3Q = ⎢ − 3 2 −1
2
0⎥ Q−1σ v1Q = ⎢ − 3 2 −1
2
0⎥
⎢ 0 0 1⎥ ⎢ 0 0 1⎥
⎢⎣ ⎥⎦ ⎢⎣ ⎥⎦
Significance of Transformations
★ Irreducible Representations are of pivotal
importance
★ Chosen properly, similarity transformations can
reduce a reducible representation into its
irreducible representations
★ With the proper first choice of basis, the
transformation would not be necessary
★ Important Future goal: finding the basis functions
for irreducible representations

Great Orthogonality Theorem


∗ h
∑ [Γ i (R)mn ][Γ j (R)m′n′ ] = δ ijδ mm′δ nn′
R li l j
2 Proofs: Eyring, H.; Walter, J.; Kimball, G.E. Quantum Chemistry; Wiley, 1944.
http://www.cmth.ph.ic.ac.uk/people/d.vvedensky/groups/Chapter4.pdf

Γ i (R) — matrix that represents the operation R in the i th representation.


Its form can depend on the basis for the representation.
[Γ i (R) mn ] — matrix element in mth row and n th column of Γ i (R)
li — the dimension of the i th representation
h — the order of the group (the number of operations)
δ ij = 1 if i=j, 0 otherwise
Great Orthogonality Theorem - again
• Vectors formed from matrix elements from the
mth rows and nth columns of different irreducible
representations are orthogonal:

∑[Γ i (R)mn ][Γ j (R)mn ] = 0 if i ≠ j
R
• Such vectors formed from different row-column
sets of the same irreducible representation are
orthogonal and have magnitude h/li :

∑[Γ i (R)mn ][Γ i (R)m′n′ ] = (h li )δ mm′δ nn′
R

The First Sum Rule


The sum of the squares of the dimensions
of the irreducible representations of a
group is equal to the order of the group,
that is,
∑ 2
li
2
= l1
2
+ l2
2
+ l3 + ⋅⋅⋅ = h
i
this is equivalent to:
∑ [ χi (E)]
2
=h
i
Second Sum Rule
The sum of the squares of the characters in
any irreducible representation equals h, the
order of the group ∑ [ χ i (R)]2 = h
R

“Proof”— From the GOT:



∑ [Γ i (R)mn ][Γ i (R)m′n′ ] = (h li )δ mm′δ nn′
R


let m=m’=n=n’: ∑ [Γi (R)mm ][Γi (R)mm ] = (h li )
R

Characters of Different Irreducible


Representations are Orthogonal

The vectors whose components are the


characters of two different irreducible
representations are orthogonal, that is,

∑ χ (R)χ (R) = 0 when i ≠ j


i j
R
Proof
Setting m = n in first GOT statement:

∑ Γ (R)
i mm Γ j (R)mm = 0 if i ≠ j
R

compare this to the statement (i ≠ j):

⎧⎡ ⎤⎡ ⎤⎫
∑ χ (R)χ (R) = ∑ ⎨⎢∑ Γ (R)
i j i mm ⎥ ⎢ ∑ Γ j (R)mm ⎥ ⎬
R R ⎩⎣ m ⎦⎣ m ⎦⎭

⎡ ⎤
= ∑ ⎢ ∑ Γ i (R)mm Γ j (R)mm ⎥ = 0
m ⎣ R ⎦

Matrices in the Same Class have


Equal Characters
• This statement is true whether the
representation is reducible or irreducible
• This follows from the fact that all
elements in the same class are conjugate
and conjugate matrices have equal
characters.
# of Classes = # of Irred. Reps.
The number of irreducible
representations of a group is equal to
the number of classes in the group.

∑ χ (R)χ (R) = hδ
i j ij
R

if the number of elements in the mth class


is gm and there are k classes,
k

∑ χ (R )χ (R )g
i p j p p = hδ ij
p =1

You might also like