Primitive Lattice Vectors (Primitive Translation Vectors)
Primitive Lattice Vectors (Primitive Translation Vectors)
Primitive Lattice Vectors (Primitive Translation Vectors)
lattice vectors
Q: How can we describe these lattice vectors (there are an infinite number of them)?
A: Using primitive lattice vectors (there are only d of them in a d-dimensional space).
For a 3D lattice, we can find three primitive lattice vectors (primitive translation vectors),
such that any translation vector can be written as
𝑡⃗ = 𝑛% 𝑎⃗% + 𝑛( 𝑎⃗( + 𝑛) 𝑎⃗)
where 𝑛% , 𝑛( and 𝑛) are three integers.
For a 2D lattice, we can find two primitive lattice vectors (primitive translation vectors), such
that any translation vector can be written as
𝑡⃗ = 𝑛% 𝑎⃗% + 𝑛( 𝑎⃗(
where 𝑛% and 𝑛( are two integers.
For a 1D lattice, we can find one primitive lattice vector (primitive translation vector), such
that any translation vector can be written as
𝑡⃗ = 𝑛% 𝑎⃗%
where 𝑛% is an integer.
Primitive lattice vectors
1
𝑏% = 2𝑎⃗% + 0 𝑎⃗( 𝑎⃗% = 𝑏 + 0𝑏(
2 %
http://en.wikipedia.org/wiki/Bravais_lattice
3D Bravais lattices
http://en.wikipedia.org/wiki/Bravais_lattice
Cubic system
Conventional cells
𝑅) 𝑅) 𝑅)
𝑁4 𝜋 4 𝜋 4 𝜋
𝑃𝑎𝑐𝑘𝑖𝑛𝑔 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛 = 3 = 3 = 3
𝑉 𝑉/𝑁 𝑉𝑜𝑙𝑢𝑚𝑒 𝑝𝑒𝑟 𝑠𝑖𝑡𝑒
)
𝑅
4 𝜋
= 3
𝑉𝑜𝑙𝑢𝑚𝑒 𝑜𝑓 𝑎 𝑝𝑟𝑖𝑚𝑖𝑡𝑖𝑣𝑒 𝑐𝑒𝑙𝑙
%
Lattice point per conventional cell: 2 = 8× + 1
E
)
Volume (conventional cell): 𝑎
Volume (primitive cell) : 𝑎) /2
Number of nearest neighbors: 8
a a a )
Nearest neighbor distance: ( )( +( )( +( )( = 𝑎 ≈ 0.866𝑎
( ( ( (
Number of second neighbors: 6
Second neighbor distance: 𝑎
)
Packing fraction: 𝜋 ≈ 0.680
E
𝑅) Nearest distance= 2 R
4 𝜋
𝑃𝑎𝑐𝑘𝑖𝑛𝑔 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛 = 3 )
R= Nearest distance/2= 𝑎
𝑉𝑜𝑙𝑢𝑚𝑒 𝑜𝑓 𝑎 𝑝𝑟𝑖𝑚𝑖𝑡𝑖𝑣𝑒 𝑐𝑒𝑙𝑙 b
𝑅) 3
4 𝜋 8𝜋 𝑅 8𝜋 𝑎 3𝜋
= ) 3 = )
( ) = ( 4 )
) = ≈ 0.680
𝑎 /2 3 𝑎 3 𝑎 8
% %
Lattice point per conventional cell: 4 = 8× + 6× = 1 + 3
E (
)
Volume (conventional cell): 𝑎
Volume (primitive cell) : 𝑎) /4
Number of nearest neighbors: 12
a a (
Nearest neighbor distance: ( )( +( )( +(0)( = 𝑎 ≈ 0.707𝑎
( ( (
Number of second neighbors: 6
Second neighbor distance: 𝑎
𝑅) Nearest distance= 2 R
4 𝜋
𝑃𝑎𝑐𝑘𝑖𝑛𝑔 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛 = 3 (
𝑉𝑜𝑙𝑢𝑚𝑒 𝑜𝑓 𝑎 𝑝𝑟𝑖𝑚𝑖𝑡𝑖𝑣𝑒 𝑐𝑒𝑙𝑙 R= Nearest distance/2= 𝑎
b
𝑅) 2
4 𝜋 16𝜋 𝑅 16𝜋 𝑎 2𝜋
= ) 3 = )
( ) = ( 4 )
) = ≈ 0.740
𝑎 /4 3 𝑎 3 𝑎 6
Ø About 74.0% of the space is really used by the sphere.
Ø About 26.0% of the space is empty.
0.740 is the highest packing fraction one can ever reach.
This structure is called “close packing”
There are other close packing structures (same packing fraction)
Cubic system
hexagonal
2D planes formed by equilateral triangles
Stack these planes on top of each other
Ø Now 3D:
Q: How to get 3D close packing?
A: Stack 2D close packing structures on top of each other.
Hexagonal Close-Packed Structure (hcp)
Coordinates of an atom:
We can mark any atom in a unit cell by three real numbers: 𝑥𝑦𝑧.
The location of this atom: 𝑥 𝑎⃗% + 𝑦 𝑎⃗( + 𝑧 𝑎⃗)
Notice that 0 ≤ 𝑥 < 1 and 0 ≤ 𝑦 < 1 and 0 ≤ 𝑧 < 1
Q: Why x cannot be 1?
A: Due to the periodic structure. 1 is just 0 in the next unit cell
Sodium Chloride structure
Sodium Chloride structure
Face-centered cubic lattice
Na+ ions form a face-centered cubic lattice
Cl- ions are located between each two
neighboring Na+ ions
Coordinates:
Cs: 000
%% %
Cl:
(( (
Diamond
(money carbon/love carbon)
Graphite (Pencil carbon)
Not all lattices are Bravais lattices: examples the
honeycomb lattice (graphene)
Diamond lattice is NOT a Bravais Lattice either
Diode
Matter
Matter
gas/liquid: solids:
Atoms/molecules Atoms/molecules
can move around cannot move