Search results
Results from the WOW.Com Content Network
In either case, one needs to choose the three lattice vectors a 1, a 2, and a 3 that define the unit cell (note that the conventional unit cell may be larger than the primitive cell of the Bravais lattice, as the examples below illustrate). Given these, the three primitive reciprocal lattice vectors are also determined (denoted b 1, b 2, and b 3).
Let ,, be primitive translation vectors (shortly called primitive vectors) of a crystal lattice, where atoms are located at lattice points described by = + + with , , and as any integers. (So x {\displaystyle \mathbf {x} } indicating each lattice point is an integer linear combination of the primitive vectors.)
In differential geometry, parallel transport (or parallel translation [a]) is a way of transporting geometrical data along smooth curves in a manifold. If the manifold is equipped with an affine connection (a covariant derivative or connection on the tangent bundle ), then this connection allows one to transport vectors of the manifold along ...
If the lattice or crystal is 2-dimensional, the primitive cell has a minimum area; likewise in 3 dimensions the primitive cell has a minimum volume. Despite this rigid minimum-size requirement, there is not one unique choice of primitive unit cell. In fact, all cells whose borders are primitive translation vectors will be primitive unit cells.
Vectors and are primitive translation vectors. The honeycomb point set is a special case of the hexagonal lattice with a two-atom basis. [ 1 ] The centers of the hexagons of a honeycomb form a hexagonal lattice, and the honeycomb point set can be seen as the union of two offset hexagonal lattices.
This crystallography -related article is a stub. You can help Wikipedia by expanding it.
The smallest area enclosed in this way is called the Wigner–Seitz primitive cell. For a 3-dimensional lattice, the steps are analogous, but in step 2 instead of drawing perpendicular lines, perpendicular planes are drawn at the midpoint of the lines between the lattice points.
For each Bravais lattice vector we define a translation operator ^ which, when operating on any function () shifts the argument by : ^ = (+) Since all translations form an Abelian group, the result of applying two successive translations does not depend on the order in which they are applied, i.e. ^ ^ = ^ ^ = ^ + In addition, as the Hamiltonian ...