MSE8013 Chapter01 Structure and Symmetry of Crystal
MSE8013 Chapter01 Structure and Symmetry of Crystal
MSE8013 Chapter01 Structure and Symmetry of Crystal
Crystal binding
Short-range order
Ordering only extends to the atom’s nearest
neighbors.
E.g.: water vapor (covalent bond between the hydrogen and
oxygen atoms, 104.5o), nitrogen gas, silicate glass (硅酸盐玻璃).
Long-range order
Ordering extends over a large length scale
(typically > 100 nm) or even through the
whole material.
E.g.: metals, ceramics, some polymers
3
Classification of Materials in Terms of Atomic
Arrangement
6
*C. Kittel, Introduction to solid state physics (8th edition), Page 2
Bravais lattice: physical picture
An ideal crystal is constructed by an infinite repetition of
identical groups of atoms. The group is called a basis. It may be a
single atom, or a group of atoms, molecules, or ions, etc.
The set of mathematical points to which the basis is attached is
called the lattice or Bravais lattice. Therefore, a crystal structure
is the combination of basis and Bravais lattice.
8
Primitive vectors and primitive cell
The vectors 𝐚𝟏 , 𝐚𝟐 and 𝐚𝟑 defined in the last slide are the so-
called primitive vectors.
A volume of space that, when translated through all the vectors
in a Bravais lattice, just fills all the space without either
overlapping itself or leaving voids is called a primitive cell*.
* The adjacent axes of a primitive cell are formed by primitive
vectors.
A primitive cell defined by primitive axes is a minimum-volume
periodic cell. The volume of the parallelepiped (平行六面体)
defined by primitive vector 𝐚𝟏 , 𝐚𝟐 and 𝐚𝟑 in a three-dimensional
lattice is given as
𝑉c = 𝐚𝟏 ∙ 𝐚𝟐 × 𝐚𝟑
9
Primitive cell vs. Unit cell
Unit cell: The smallest group of particles in the crystal that
constitutes the repeating pattern is the unit cell. The unit cell
completely reflects the symmetry and structure of the entire
crystal.
• In 3D, the unit cell is a parallelepiped whose vertices are lattice
points; In 2D it is a parallelogram whose vertices are lattice
points.
• A unit cell may be primitive or non-primitive.
= Primitive Cell
11
https://cnx.org/contents/[email protected]:EWNgknft@4/Lattice-Structures-in-Crystalline-Solids
Primitive vectors and primitive cell
A primitive cell defined by primitive vectors
is usually a parallelogram (平行四边形) with
4 points, where each point is shared by
adjacent 4 cells for a two-dimensional lattice.
2D Wigner-Seitz cell Wigner-Seitz cell for body- Wigner-Seitz cell for face-
centered cubic lattice centered cubic lattice
https://www.physics-in-a-nutshell.com/article/5/unit-cell-primitive-cell-and-wigner-seitz-cell 14
http://lamp.tu-graz.ac.at/~hadley/ss1/studentpresentations/script/Aschl09.pdf
2D lattices: 5 types
Restrictions on
Lattice type axes and angles Unit cell
Oblique 𝐚𝟏 ≠ 𝐚𝟐 ; 𝜑 ≠ 90°
Square 𝐚𝟏 = 𝐚𝟐 ; 𝜑 = 90°
Rectangular 𝐚𝟏 ≠ 𝐚𝟐 ; 𝜑 = 90°
Centered 𝐚𝟏 ≠ 𝐚𝟐 ; 𝜑 = 90°
rectangular
Hexagonal 𝐚𝟏 = 𝐚𝟐 ; 𝜑 = 120°
The primitive cell of the centered rectangular lattice is essentially an oblique cell such that it can be
included in the category of oblique lattice. Therefore, it may be classified to four systems for 2D 15
lattices in some textbooks.
3D lattice: 14 types Primitive Base-
(Simple) centered
Body- Face-
centered centered
𝐚𝟏 ≠ 𝐚𝟐 ≠ 𝐚𝟑
Triclinic 𝛼≠𝛽≠𝛾
𝐚𝟏 ≠ 𝐚𝟐 ≠ 𝐚𝟑
Monoclinic 𝛼 = 𝛾 = 90° ≠ 𝛽
𝐚𝟏 = 𝐚𝟐 ≠ 𝐚𝟑
Tetragonal 𝛼 = 𝛽 = 𝛾 = 90°
Cubic 𝐚𝟏 = 𝐚𝟐 = 𝐚𝟑
𝛼 = 𝛽 = 𝛾 = 90°
17
Cubic lattice: unit cell
Unit cells of a three-dimensional lattice are not often primitive
cells. Here we discuss cubic lattice as an illustration.
18
https://cnx.org/contents/[email protected]:EWNgknft@4/Lattice-Structures-in-Crystalline-Solids
Cubic lattice: coordination number
Simple cubic (SC)
19
https://cnx.org/contents/[email protected]:EWNgknft@4/Lattice-Structures-in-Crystalline-Solids
Body-centered cubic lattice: unit cell
Body-centered cubic (BCC)
20
https://cnx.org/contents/[email protected]:EWNgknft@4/Lattice-Structures-in-Crystalline-Solids
BCC lattice: coordination no.
Body-centered cubic (BCC)
• The coordination number is 8. The distance
3
of nearest neighbors is 𝑎, where 𝑎 is the
2
edge length of the cube.
• Three primitive vectors are:
1
𝐚𝟏 = 𝑎 𝒙 + 𝒚 − 𝒛 ;
2
1
𝐚𝟐 = 𝑎 −𝒙 + 𝒚 + 𝒛 ;
2
1
𝐚𝟑 = 𝑎 𝒙 − 𝒚 + 𝒛 , x
2 y
where 𝒙, 𝒚, 𝒛 are unit vectors of Cartesian
coordinates.
• The shaded region is the primitive cell of
the BCC lattice. 21
*C. Kittel, Introduction to solid state physics (8th edition), Page 10
Face-centered cubic lattice: unit cell
Face-centered cubic (FCC)
22
https://cnx.org/contents/[email protected]:EWNgknft@4/Lattice-Structures-in-Crystalline-Solids
Face-centered cubic lattice: primitive vectors
Face-centered cubic (FCC)
• The coordination number is 12.
• Three primitive vectors are:
1
𝐚𝟏 = 𝑎 𝒙 + 𝒚 ;
2
1
𝐚𝟐 = 𝑎 𝒚 + 𝒛 ,
2
1
𝐚𝟑 = 𝑎 𝒛 + 𝒙 ;
2
where 𝒙, 𝒚, 𝒛 are unit vectors of Cartesian
coordinates.
• The shaded region is the primitive cell
of an FCC lattice.
https://www.physics-in-a-nutshell.com/article/11/close-packed-structures-fcc-and-hcp
Ventura, Michael James. Fabrication and characterisation of three-dimensional passive and active photonic crystals.
Swinburne University of Technology, Faculty of Engineering and Industrial Sciences, Centre for Micro-Photonics, 2008.
Cubic lattice: Hard sphere model
Hard sphere model:
Atoms are thought of as being solid spheres having well-
defined diameters when describing crystal structures.
https://www.researchgate.net/publication/251151526_Modelling_of_particle_wall- 24
deposition_in_two-phase_gas-solid_flows/figures
Calculation of packing factor
For a simple cubic lattice, the packing factor can be
calculated by
4 3
𝑁sphere𝑉sphere 𝑁 ⋅ 𝜋𝑟
𝑃𝐹 = = 3
𝑉unit cell 𝑎3
𝑎
where 𝑟 = is the maximum radius of hard spheres.
2
2
In an FCC lattice, the sphere radius 𝑟 = 𝑎, the number of
4
spheres 𝑁sphere = 4, the packing factor is
3
4 3 4 2
𝑁 ⋅ 3 𝜋𝑟 4 ∙ 3𝜋 4 𝑎
𝑃𝐹 = 3
= ≅ 0.74
𝑎 𝑎3
25
http://poh101.com/index3/mems.html
Cubic lattice
SC BCC FCC
Volume, unit cell 𝑎3 𝑎3 𝑎3
28
https://pt.slideshare.net/kareemtharaa/crystallization-42686987
Hexagonal close-packed structure (HCP)
• If the sequence of close-packed layers goes in ABABAB…, the
structure is hexagonal close-packed. If it goes in ABCABCABC…,
the structure is face-centered cubic.
• The packing factors of HCP and FCC are both 0.74. No
structure has denser packing.
29
https://www.slideserve.com/moana/crystalline-solids
Hexagonal close-packed structure (HCP)
Problem: How to calculate the packing factor of an HCP structure?
1 1
The total number of atoms in the hcp cell is 3 + × 2 + × 6 ×
2 6
2 = 6. As the cell is filled by hard spheres, the side length and
sphere radius have the relation of 𝑎 = 2𝑟, and the height 𝑐 =
2
4 𝑟. So the packing factor is
3
4 3 4 3
𝑁sphere𝑉sphere 6 ∙ 3 𝜋𝑟 6 ∙ 3 𝜋𝑟
𝑃𝐹 = = = ≅ 0.74
𝑉unit cell 3 3 2
𝑎 𝑐 3 3 (2𝑟)2 2 ∙ 4𝑟
2 2 3
35
Index systems for crystals: direction indices
Indices of the direction
The indices [ℎ𝑘𝑙] of a direction in a crystal are a set of the smallest
integers (in a square bracket) that have the ratio of the coordinates
of a vector in the desired direction, referred to the axes.
The 𝐚𝟏 axis (i.e. the a axis in the below schematics) is the [100]
ത direction.
direction, and the −𝐚𝟐 axis (i.e. the b axis) is the [010]
37
Index systems for crystals: Miller indices
Indices of the plane (Miller indices)
As shown below, this shaded plane intercepts the axes 𝐚𝟏 , 𝐚𝟐 ,
𝐚𝟑 at 3𝐚𝟏 , 2𝐚𝟐 and 2𝐚𝟑 . The reciprocals of these numbers are
𝟏 𝟏 𝟏
, , . The smallest three integers having the same ratio are
𝟑 𝟐 𝟐
2,3,3, and thus the indices of the plane are (233).
Indices of some planes in a cubic crystal. The plane (200) is parallel to (100).
39
*C. Kittel, Introduction to solid state physics (8th edition), Page 12
Symmetry of crystal structure
Point group
In geometry, a point group is a group of geometric symmetries
(isometries) that keep at least one point fixed in a Euclidean space.
In crystallography, a fixed number of dimensions has only a finite
number of point groups that are symmetric over some lattices or
grid of that number. Therefore, we may group together atoms that
possess the same symmetry elements and classify them according
to their symmetry. These are the so-called crystallographic point
groups.
Crystallographic restriction theorem (晶體局限定理)
Crystals are modeled as discrete lattices, generated by a list of
independent finite translations. Because discreteness requires
that the spacings between lattice points have a lower bound, the
group of rotational symmetries for a lattice at any point must be a
finite group (有限群). 40
https://en.wikipedia.org/wiki/Point_group
Symmetry of crystal structure
Point group
The strength of the theorem is that not all finite groups are
compatible with a discrete lattice in any dimension. Therefore, we
will only have a finite number of compatible groups.
• There are only two point groups for one spatial dimension, the
identity group (𝐶1) and the reflection group (𝐶2).
• 2D point groups can be classified into two infinite families:
(1) Cyclic groups (循环群) 𝐶𝑛 of n-fold rotation groups;
(2) Dihedral groups (二面体群) 𝐷𝑛 of n-fold rotation and
reflection groups.
• Three-dimensional point groups come into 7 infinite families of
axial or prismatic groups, and 7 additional polyhedral or Platonic
groups. Applying the crystallographic restriction theorem to
these groups yields 32 crystallographic point groups as shown
later. 41
Symmetry of crystal structure
Symmetry operation
If an object can be (1) rotated, (2) reflected, or (3) inversed,
without changing the distances between its material points and so
that it comes into self-coincidence, then that object is symmetric.
A transformation of type (1), (2) or (3) or combinations thereof that
preserve distances and bring the object into coincidence is called a
symmetry operation.
There are three basic symmetry operations (point groups): rotation,
reflection and inversion.
The Bravais lattice of a crystal also has to fulfill the translation
symmetry.
42
Rotation symmetry Reflection symmetry Inversion symmetry Translation symmetry
Symmetry operation: Transformation matrix
Generally, a transformation can be given by a transformation matrix
𝐴, where
𝑥′ 𝑥 𝑎11 𝑎12 𝑎13 𝑥
𝑦 ′ = 𝐴 𝑦 = 𝑎21 𝑎22 𝑎23 𝑦
𝑧′ 𝑧 𝑎31 𝑎32 𝑎33 𝑧
Obviously, either symmetry operation 𝐴 or 𝐴−1 (inverse matrix)
should preserve lengths of vectors and angles in between.
If we take 1 0 0 𝑇 (transposed matrix, row vector -> column
vector), 0 1 0 𝑇 and 0 0 1 𝑇 as examples, we have
2 2 2
𝑎11 + 𝑎21 + 𝑎31 = 12 + 02 + 02 = 1
2 2 2
𝑎12 + 𝑎22 + 𝑎32 = 02 + 12 + 02 = 1
2 2 2
𝑎13 + 𝑎23 + 𝑎33 = 02 + 02 + 12 = 1
43
Therefore, each column of 𝐴 is a unit vector.
Symmetry operation: Transformation matrix
Furthermore, if we take 1 1 0 𝑇 , 0 1 1 𝑇 and 1 0 1 𝑇
as examples, we can obtain (HW: Why?)
𝑎11 𝑎12 + 𝑎21 𝑎22 + 𝑎31 𝑎32 = 0
𝑎11 𝑎13 + 𝑎21 𝑎23 + 𝑎31 𝑎33 = 0
𝑎12 𝑎13 + 𝑎22 𝑎23 + 𝑎32 𝑎33 = 0
The three columns of 𝐴 are orthogonal unit vectors. It is easy to
obtain that the rows of 𝐴 are orthogonal unit vectors, too. In other
words, 𝐴 is an orthogonal matrix. As a result (HW: Why?),
𝐴𝐴𝑇 = 𝐼 ⇔ 𝐴𝑇 = 𝐴−1 .
All 𝑛 × 𝑛 orthogonal matrices form a group, 𝑂 𝑛 , known as the
orthogonal group. In a finite-dimensional space, an orthogonal
matrix represents an orthogonal transformation.
Orthogonal transformations in two- or three-dimensional Euclidean
space (欧几里得空间) includes only rigid rotations, reflections, or
combinations of a rotation and a reflection. 44
Symmetry operation: Rotation in 2D
Rotation (𝑶 𝒏 )
Considering a two-dimensional (2D) space, a general point 𝑃 with
the position vector 𝐫 and coordinates (𝑥, 𝑦), is rotated to the
position 𝑃′, with position vector 𝐫′ and coordinates (𝑥′, 𝑦′). From
the drawing, we find that the coordinates of the new position
vector are given by:
𝑥 ′ = 𝑟 ′ cos 𝜃 + 𝛼
𝑦 ′ = 𝑟 ′ sin 𝜃 + 𝛼
where 𝑟 ′ = 𝐫 = 𝐫′ = 𝑟.
Obviously, we have
𝑥 = 𝑟 cos 𝛼
𝑦 = 𝑟 sin 𝛼
Therefore we obtain
𝑥 ′ = 𝑟 ′ cos 𝜃 + 𝛼 = 𝑟 ′ cos 𝜃 cos 𝛼 − sin 𝜃 sin 𝛼
= 𝑟 cos 𝛼 cos 𝜃 − 𝑟 sin 𝛼 sin 𝜃 = 𝑥 cos 𝜃 − 𝑦 sin 𝜃 45
Symmetry operation: Rotation in 2D
Rotation (𝑪𝒏)
Similarly, we have
𝑦 ′ = 𝑟 ′ sin 𝜃 + 𝛼 = 𝑟 ′ sin 𝜃 cos 𝛼 + cos 𝜃 sin 𝛼
= 𝑟 cos 𝛼 sin 𝜃 + 𝑟 sin 𝛼 cos 𝜃 = 𝑥 sin 𝜃 + 𝑦 cos 𝜃
We can thus describe the transformation operation in matrix form
as:
𝑥′ cos 𝜃 − sin 𝜃 𝑥
= 𝑦
𝑦′ sin 𝜃 cos 𝜃
Some 2D geometries
with 5 different
rotation axes.
47
https://www.tulane.edu/~sanelson/eens211/introsymmetry.htm
Symmetry operation: proof of rotation angle
Proof of the limited number of rotation axes
Considering a Bravais lattice and the coordinates are referred to
primitive vectors, the coordinates must be integers for both the
original point and the rotated point. The coordinates of the
rotated point are given by:
𝑥 ′ = 𝑥 cos 𝜃 − 𝑦 sin 𝜃;
𝑦 ′ = 𝑥 sin 𝜃 + 𝑦 cos 𝜃;
𝑧′ = 𝑧 .
Since 𝑥 ′ + 𝑦 ′ + 𝑧 ′ must be an integer, we can obtain that
𝑥 − 𝑦 sin 𝜃 + 𝑥 + 𝑦 cos 𝜃 + 𝑧 must be an integer,
applicable to arbitrary 𝑥, 𝑦, 𝑧. Set 𝑥 = 𝑦 = 𝑧 = 1, then 1 +
2 cos 𝜃 should be an integer.
As −1 ≤ 1 + 2 cos 𝜃 ≤ 3, the integer must be one of -1, 0, 1, 2,
3. Correspondingly, the allowed rotation angles are limited to
2𝜋 𝜋 𝜋
those of 2𝜋, 𝜋, , , .
3 2 3
Symmetry operation: mirror/reflection
Mirror (Reflection) (𝝈/𝒎)
Mirror operation is a point by point transformation as drawn
below.
The mirror operation (x-y mirror plane) can be described in the
matrix form as:
𝑎11 𝑎12 𝑎13 1 0 0
𝜎 = 𝑎21 𝑎22 𝑎23 = 0 1 0
𝑎31 𝑎32 𝑎33 0 0 −1
51
Symmetry operation: combined operation
Combined operation
In some crystals, there are symmetry operations based on a
combination of basic symmetry operations.
2𝜋
The denotation S𝑛 or 𝑛ത describes the rotation of followed by
𝑛
a reflection symmetry operation with respect to the plane
perpendicular to the rotation axis.
S𝑛 = 𝐶𝑛 𝜎
• The existence of combined symmetry operations in crystals
does not mean the existence of basic operations consisting
of the combined operations.
• On the contrary, the existence of basic operations means the
existence of their combined operations.
52
Symmetry operation: Schönflies notations
𝐶𝑛 : 𝑛-fold rotation axis.
𝐶𝑛ℎ : 𝐶𝑛 with the addition of a mirror (reflection) plane perpendicular to the axis of
rotation (horizontal plane).
𝐶𝑛𝑣 : 𝐶𝑛 with the addition of 𝑛 mirror planes containing the axis of rotation (vertical
planes).
𝑆𝑛 : 𝑛-fold rotation-reflection axis.
𝐶𝑛𝑖 : Rotoinversion axis. For odd 𝑛, 𝐶𝑛𝑖 = 𝑆2𝑛 ; for even 𝑛, 𝐶2𝑛𝑖 = 𝑆𝑛 = 𝐶𝑛ℎ .
𝐷𝑛 : 𝑛-fold rotation axis plus 𝑛 2-fold axes perpendicular to that axis.
𝐷𝑛ℎ : 𝐷𝑛 with a horizontal mirror plane and, therefore, also 𝑛 vertical mirror planes
each containing the 𝑛-fold axis and one of the 2-fold axes.
𝐷𝑛𝑑 : 𝐷𝑛 with 𝑛 vertical mirror planes passing between the 2-fold axes.
𝑇: rotation axes of a tetrahedron (three 2-fold axes and four 3-fold axes).
𝑇𝑑 : 𝑇 with diagonal mirror planes, each of which contains only one 2-fold axes and
passes between two other 2-fold axes.
𝑇ℎ : 𝑇 with three horizontal mirror planes, each of which contains two 2-fold axes and
is perpendicular to the third 2-fold axes.
𝑂: rotation axes of an octahedron or cube.
53
𝑂ℎ : 𝑂 with horizontal mirror planes. https://en.wikipedia.org/wiki/Schoenflies_notation
Symmetry operation
32 crystallographic point groups
Crystal System Point groups (Schönflies notation)
Triclinic 𝐶1 , 𝐶𝑖 (𝑆2 )
Monoclinic 𝐶2 , 𝐶1ℎ , 𝐶2ℎ
Orthorhombic 𝐷2 , 𝐶2𝑣 , 𝐷2ℎ
Tetragonal 𝐶4 , 𝑆4 , 𝐶4ℎ , 𝐷4 , 𝐶4𝑣 , 𝐷2𝑑 , 𝐷4ℎ
Trigonal 𝐶3 , 𝑆6 , 𝐷3 , 𝐶3𝑣 , 𝐷3𝑑
Hexagonal 𝐶6 , 𝐶3ℎ , 𝐶6ℎ , 𝐷6 , 𝐶6𝑣 , 𝐷3ℎ , 𝐷6ℎ
Cubic 𝑇, 𝑇𝑑 , 𝑇ℎ , 𝑂, 𝑂ℎ