Abstract
This article provides a rigorous proof of a conjecture by E. C. Bain in 1924 on the optimality of the so-called Bain strain based on a criterion of least atomic movement. A general framework that explores several such optimality criteria is introduced and employed to show the existence of optimal transformations between any two Bravais lattices. A precise algorithm and a graphical user interface to determine this optimal transformation is provided. Apart from the Bain conjecture concerning the transformation from face-centred cubic to body-centred cubic, applications include the face-centred cubic to body-centred tetragonal transition as well as the transformation between two triclinic phases of terephthalic acid.
Keywords: lattice transformation, least atomic movement, Bravais lattices, Bain strain in steel, fcc to bcc, terephthalic acid
1. Introduction
In his seminal article on ‘The nature of martensite’, Bain [1] proposed a mechanism that transforms the face-centred cubic (fcc) lattice to the body-centred cubic (bcc) lattice, a phase transformation most importantly manifested in low-carbon steels. Bain [1] writes
It is reasonable, also, that the atoms them- selves will rearrange [⋯ ] by a method that will require least temporary motion. [⋯ ] A mode of atomic shift requiring minimum motion was conceived by the author [⋯ ]
The key observation that led to his famous corres- pondence was that ‘If one regards the centers of faces as corners of a new unit, a body-centered structure is already at hand; however, it is tetragonal instead of cubic.’ He remarks that this is not surprising ‘as it is the only easy method of constructing a bcc atomic structure from the fcc atomic structure.’
Even though it is now widely accepted, his mechanism, which he illustrated with a model made of cork balls and needles (figure 1), was not without criticism from his contemporaries. In their fundamental paper, Kurdjumov & Sachs [2] wrote (free translation from German) that ‘nothing certain about the mechanism of the martensite transformation is known. Bain imagines that a tetragonal unit cell within the fcc lattice transforms into a bcc unit cell through compression along one direction and expansion along the two other. However a proof of this hypothesis is still missing.’1 Interestingly, without being aware of it, the authors implicitly used the Bain mechanism in their derivation of the Kurdjumov and Sachs orientation relationships (see [3] for details).
Figure 1.

From E. C. Bain: the small models show the fcc and bcc unit cells; the large models represent 35 atoms in an fcc and bcc arrangement, respectively.
With the years passing and a number of supporting experimental results (for a discussion, see, for example, [4]), the Bain mechanism rose from a conjecture to a widely accepted fact. Nevertheless, for almost a century after Bain first announced his correspondence, a rigorous proof based on the assumption of minimal atom movement has been missing. Of course, the transformation from fcc to bcc is not the only instance where the determination of the transformation strain is of interest. The overall question remains the same: Which transformation strain(s), out of all the possible deformations mapping the lattice of the parent phase to the lattice of the product phase, require(s) the least atomic movement?
To provide a definite answer to this question, one first needs to quantify the notion of least atomic movement in such a way that it does not require additional input from experiments. Then, one needs to establish a framework that singles out the optimal transformation among the infinite number of possible lattice transformation strains. One way to appropriately quantify least atomic movement is the criterion of smallest principal strains as suggested by Lomer [5]. In his paper, Lomer compared 1600 different lattice correspondences for the β to α phase transition in uranium and concluded that only one of them involved strains of less than 10%. More recently, in [6], an algorithm is proposed to determine the transformation strain based on a similar minimality criterion (see remark 4.7) that also allows for the consideration of different sublattices. The present paper considers a criterion of least atomic movement in terms of a family of different strain measures and, for each such strain measure, rigorously proves the existence of an optimal lattice transformation between any two Bravais lattices.2 As a main application, it is shown that the Bain strain is the optimal lattice transformation from fcc to bcc with respect to three of the most commonly used strain measures.
The structure of the paper is as follows: after stating some preliminaries in §2, we explore in more detail some mathematical aspects of lattices in §3. This section is mainly intended for the mathematically inclined reader and may be skipped on first reading without inhibiting the understanding of §4, which constitutes the main part of this paper. In this section, we establish a geometric criterion of optimality and prove the existence of optimal lattice transformations for any displacive phase transition between two Bravais lattices. Additionally, a precise algorithm to compute these optimal strains is provided. In the remaining sections, the general theory is applied to prove the optimality of the Bain strain in an fcc-to-bcc transformation, to show that the Bain strain remains optimal in an fcc to body-centred tetragonal (bct) transformation and, finally, to derive the optimal transformation strain between two triclinic phases of terephthalic acid. Similar to the fcc-to-bcc transition, this phase transformation is of particular interest as it involves large stretches, and thus the lattice transformation requiring least atomic movement is not clear.
2. Preliminaries
Throughout the paper, it is assumed that both the parent and product lattices are Bravais lattices (see definition 2.8) and that the transformation strain, i.e. the deformation that maps a unit cell of the parent lattice to a unit cell of the product lattice, is homogeneous.
The following definitions are standard and will be used throughout.
Definition 2.1 —
Let denote the set of integer or real numbers, respectively, and define
— vector space of matrices with entries in .
— orientation-preserving matrices with entries in .
— (general linear group).
— : set of orientation-preserving invertible 3×3 matrices with entries in .
— (special linear group).
— (group of proper rotations).
— (symmetry group of a cube)—see lemma 2.2.
Further define the multiplication of a matrix F and a set of matrices by .
Lemma 2.2 establishes a characterization of the group , i.e. the set of all rotations that map a cube to itself.
Lemma 2.2 —
Let Q=[−1,1]3 be the cube of side length 2 centred at 0 and define . Then, and .
Proof. —
Suppose that and let {ei}i=1,2,3 denote the standard basis of . By linearity, P maps the face centres of Q to face centres, i.e. for each i=1,2,3 there exists j∈{1,2,3} such that Pei=±ej. Therefore, Pki=Pei⋅ek=±δkj∈{−1,0,1} and thus .
Conversely, if then its columns form an orthonormal basis and, because P has integer entries, the columns have to be in the set {±ei}i=1,2,3. Hence, P is of the form
and Pei=±(ei⋅ej)ekj. Thus, P maps face centres of Q to face centres and, by linearity, the cube to itself. Further, there are precisely six choices (3×2) for the first column ±ek1, four choices (2×2) for ±ek2 and two choices for ±ek3. Thus, taking into account the determinant constraint, there are 24 elements in . ▪
Remark 2.3 —
Essentially, the same proof can be used to show that , where with Nn=2n−1n! denotes the symmetry group of an n-dimensional cube. As shown earlier, the value of Nn arises from having 2×n choices for the first column of Q, then 2×(n−1) choices for the second column of Q,…, and the last column of Q is already fully determined by the determinant constraint.
Definition 2.4 (pseudo-metric and metric). —
Let X be a vector space and x, y, z∈X. A map is a pseudo-metric if
(i) d(x,x)=0,
(ii) d(x,y)=d(y,x) (symmetry),
(iii) d(x,z)≤d(x,y)+d(y,z) (triangle inequality).
If, in addition, d is positive definite, i.e. d(x,y)=0⇔x=y, then we call d a metric.
Definition 2.5 (matrix normsmatrix norms). —
For a given matrix , we define the following norms.
— Frobenius norm:
— Spectral norm:where for i=1,2,3, νi(A) are the principal stretches/singular values of A and λi(ATA) are the eigenvalues of ATA.
— Column max norm:where {a1,a2,a3} are the columns of A.
Unless otherwise specified, here and throughout the rest of the paper, |⋅| always denotes the Euclidean norm if the argument is a vector in , and the Frobenius norm if the argument is a matrix in . Additionally, we henceforth denote by col[A]:={a1,a2,a3} the columns of the matrix A and then write A=[a1,a2,a3].
The proofs of the following statements are elementary and can be found in standard textbooks on linear algebra [7].
Lemma 2.6 (properties of matrix norms). —
Both the Frobenius norm and the spectral norm are unitarily equivalent, i.e.
2.1 for any R,S∈SO(3). Furthermore, both norms are submultiplicative, i.e. given then |ABC|≤|A||B||C|and thus in particular if |A||C|≠0 then
2.2 Further, the spectral norm is compatible with the Euclidean norm on i.e.
2.3
The following sets will be of particular importance when proving the optimality of lattice transformations.
Definition 2.7 (). —
For define
and
Clearly, and for all . For example, we have and .
In the following, we recall some basic definitions and results from crystallography.
Definition 2.8 (Bravais lattice [8, ch. 3]). —
Let where col[F]={f1,f2,f3} are the columns of F. We define the Bravais lattice generated by F as the lattice generated by col[F], i.e.
Thus, by definition, a Bravais lattice is together with an orientation.
Definition 2.9 (primitive, base-, body- and face-centred unit cells). —
Let be generated by . We call the parallelepiped spanned by col[F] with one atom at each vertex a primitive unit cell of the lattice. We call a primitive unit cell with additional atoms in the centre of the bases a base-centred unit cell; we call a primitive unit cell with one additional atom in the body centre a body-centred (bc) unit cell; and we call a primitive unit cell with additional atoms in the centre of each of the faces a face-centred (fc) unit cell.
Remark 2.10 —
For any lattice generated by a base-, body- or face-centred unit cell, there is a primitive unit cell that generates the same lattice. Table 1 gives the lattice vectors that generate the equivalent primitive unit cell for a given base-centred (C), body-centred (I) or face-centred (F) unit cell spanned by the vectors .
For our purposes, all unit cells that generate the same lattice are equivalent and, in order to keep the presentation as simple as possible, we will always work with the primitive description of a lattice. However, we note that often in the literature the unit cell is chosen such that it has maximal symmetry.
For example, for a face-centred cubic lattice, the unit cell would be chosen as face-centred and spanned by , so that it has the maximal symmetry. However, if one considers primitive unit cells that span the same fcc lattice, then the one with maximal symmetry is given by the last entry in table 1 and thus spanned by col[F], where
and has only sixfold symmetry.
Table 1.
Lattice vectors of a primitive unit cell that generates the same lattice.
| primitive (P) | base-centred (C) | body-centred (I) | face-centred (F) |
|---|---|---|---|
| {a,b,c} |
Lemma 2.11 (identical lattice bases [8, result 3.1]). —
Let be generated by F= [f1,f2,f3] and be generated by G=[g1,g2,g3]. Then
for some . The same result holds for a face-, base- and body-centred unit cell.
Definition 2.12 (lattice transformation). —
Given two lattices and generated by we call any matrix such that a lattice transformation from to .
Remark 2.13 —
In the terminology of Ericksen (see, for example, [9], p. 62ff.), if (i.e. G=Fμ), then the matrices H in definition 2.12 are precisely all the orientation-preserving elements in the global symmetry group of F. Additionally, the matrices H that are also rotations constitute the point group of the lattice. We point out that, in this terminology, is the point group of any cubic lattice.
We end this section by defining the atom density of the lattice and relating it to the determinant of F.
Definition 2.14 (atom density). —
For a given lattice , we define the atom density by
where QN=[0,N]3 is the cube with side-length N and # counts the number of elements in a discrete set. Thus, is the average number of atoms per unit volume.
Lemma 2.15 —
Let be generated by then
In particular, a transformation H=GF−1 from to does not change the atom density if and only if it is volume preserving, i.e. . Further, the atom density is well defined.
Proof. —
Denote by the unit cell spanned by col[F], so that the volume of is given by . Taking n distinct points , we find that , because all elements are disjoint (up to zero measure). Let l denote the side length of the smallest cube that contains . Further, as in definition 2.14, let QN=[0,N]3 denote a cube of side-length N and define . Then
and thus, by taking the volumes of the sets, we obtain
Dividing by N3 and taking the limit yields the result. Because this limit exists for all sequences , the density is well defined. ▪
3. Metrics and equivalence on matrices and lattices
Definition 3.1 (equivalent matrices and lattices). —
We define an equivalence relation between matrices F,G in by
so that the equivalence class [F] of F is given by . We denote the quotient space, i.e. the space of all equivalence classes, by
Furthermore, we define an equivalence relation between two lattices and by
We are now in a position to define a metric on the quotient spaces.
Lemma and definition 3.2 (induced metric). —
Any pseudo-metric with the property
naturally induces a metric on via
Proof. —
The quantity is clearly well defined, so that in particular and we may henceforth drop the [⋅] in the arguments of . We first show that is a metric on . Positivity and symmetry are obvious from the definition. For definiteness note that if then, by (*), we have S*G=T*R*F for some R*,S*,T*∈SO(3) and thus . It remains to show the triangle inequality. We have
where we have used the triangle inequality, symmetry of d and (*). ▪
Example 3.3 —
The family of maps given by
are pseudo-metrics such that (*) holds. In particular, each of them induces a metric on the quotient space .
Proof. —
Positivity is obvious. The triangle inequality follows from the corresponding property of the Frobenius norm, i.e.
and the property (*) follows from
▪
Remark 3.4 —
The metric d2 has previously been used in [8], ch. 3, where it was defined as the distance between the metric CF=FTF=(fi⋅fj)ij of a set of lattice vectors col[F]={f1,f2,f3} and the metric CG=GTG=(gi⋅gj)ij of a set of lattice vectors col[G]={g1,g2,g3}. The use of the term ‘metric’ in [8] is not to be confused with the use of ‘metric’ in this paper.
4. Optimal lattice transformations
This section embodies the main part of this paper. We first establish what we mean by an optimal transformation from one lattice to another and then, for a family of such criteria, show the existence of optimal transformations between any two Bravais lattices.
Lemma 4.1 —
Let and be generated by . Then, all possible lattice transformations from to are given by . In particular, the lattices coincide if and only if there exists such that and they are equivalent, i.e. if and only if there exists such that GμF−1∈SO(3).
Proof. —
Let . Then
where we used that μ is invertible over , so that . Thus, Hμ is a lattice transformation from to . For the reverse direction, we know by lemma 2.11 that if and only if and if and only if , so that all possible generators for are given by , and all possible generators for are given by . Thus, any lattice transformation from to is given by
But, by the group property, we may set with . ▪
Definition 4.2 (d-optimal lattice transformations). —
Given two lattices and with and a metric d, we call a lattice transformation (cf. lemma 4.1) d-optimal if it minimizes the distance to with respect to d, i.e. where
4.1 If d is a pseudo-metric satisfying (*), we call a transformation d-optimal if it is optimal with respect to the induced metric on the quotient space i.e. the d-optimal transformation is the one that is d-closest to being a pure rotation and maps to a lattice in the equivalence class of .
Example 4.3 —
For the pseudo-metrics dr from example 3.3, the explicit expressions for the distance in (4.1) read
4.2 where νi, i=1,2,3, are the principal stretches/singular values of H. The quantities are clearly measures of principal strain and are known as the Doyle–Ericksen strain tensors (see [10], p. 65). For r=1, it is simple to verify that
Remark 4.4 —
For a general metric d as in definition 4.2, the optimal transformation between and is unchanged under actions of the point groups of both lattices, i.e.
for any P in the point group of and Q in the point group of . Throughout the rest of the paper, we use only pseudo-metrics satisfying (*). In this case, the notion of optimality is invariant not only under actions of the respective point groups, but also under rigid body rotations of the product lattice. Thus, definition 4.2 returns an equivalence class of d-optimal transformations. By the polar decomposition theorem, we may, and henceforth always will, pick the symmetric representative
i.e. the pure stretch component of the transformation . Note that, in general, the set of minimizing equivalence classes may contain more than one element. In such a case, different regions of the parent lattice may transform according to any of these optimal strains, giving rise to, for example, twinning.
The pseudo-metrics dr are additionally invariant under rotations from the right, i.e. for all S∈SO(3). For any such pseudo-metric, a rigid body rotation R of the parent lattice results in an optimal transformation with stretch component , where is the stretch component of the optimal transformation from to . Note that is simply expressed in a different basis and in particular, even though the coordinate representation is different, the underlying transformation mechanism is unchanged.
Our main theorem says that a dr-optimal lattice transformation always exists and lemma 4.5 will be the crucial tool in the proof.
Key lemma 4.5 —
Let H be a lattice transformation from to and consider a lattice vector that is transformed by H to g=Hf. Then
where denote, respectively, the smallest and largest principal stretches/singular values of H. In particular, for any s>0,
4.3
4.4 where col[F]={f1,f2,f3} and col[G]={g1,g2,g3}.
Proof. —
Consider the singular value decomposition of H=UDV , where D= diag(ν1,ν2,ν3) and U,V ∈SO(3). Then,
and analogously for the lower bound. ▪
Theorem 4.6 —
Given two lattices and generated by , respectively, there exists a dr-optimal lattice transformation for any . For s>0, all optimal changes of basis are contained in the finite compact sets
4.5
4.6 where denotes the smallest principal stretch/singular value of A and
Proof. —
As the minimization is over the discrete set it suffices to show that the minimum is attained in a (compact) finite subset of given by (4.5) and (4.6). Let be a lattice transformation from to . Then, letting {ei}i=1,2,3 denote the standard basis vectors of ,
and thus, by using the key lemma 4.5 and (2.3), we obtain
where in the equality we have used that {νi(A−1)}i=1,2,3={(νi(A))−1}i=1,2,3. Thus, for all μ in the complement of the respective sets given by (4.5) and (4.6) and, therefore, Hμ cannot be dr-optimal. ▪
Remark 4.7 —
The distance seems to be the most natural candidate to determine the transformation requiring least atomic movement. The quantities νi−1 measure precisely the displacement along the principal axes and thus their use is in line with the criterion of smallest principal strains as in, for example, [4,5,11]. The distance seems natural from a mathematical perspective as the tensor HTH corresponds to the flat metric induced by the deformation H and it has also been used to define the Ericksen–Pitteri neighbourhood of a lattice (see, for example, (2.17) in [12]). Finally, the distance has recently been used in [6] in order to avoid singular behaviour when considering sublattices.
In the following, we illustrate the differences between d1,d2 and d−2 through a simple but instructive one-dimensional example.
Example 4.8 (a comparison of different optimality conditions). —
We consider two atoms A,B that are originally at unit distance, i.e. |A−B|=1, and then move the atom B to its deformed position B′. Thus, H is simply a scalar quantity given by H=|A−B′|/|A−B|=|A−B′|.
It can be seen from table 2 that d1 depends only on the distance between B and B′; an expansion by 100% has the same d1 distance to as a contraction to 0, i.e. moving A onto B. The metric d2 penalizes expansions more than contractions; for example, an expansion by ≈ 141% has the same d2 distance to 1 as a contraction to 0. The metric d−2 penalizes contractions significantly more than expansions; for example, an expansion by has the same d−2 distance to as a contraction to ≈70%, i.e. reducing the distance between A and B by ≈30%.
Table 2.
Comparison of different distances.
| B′−B=0.5, | B′−B=−0.5, | deformation y such that | |
|---|---|---|---|
| r | H=|A−B′|=1.5 | H=|A−B′|=0.5 | |
| 1 | y=2−x | ||
| 2 | |||
| −2 |
A remark on the computation of the optimal transformation
Theorem 4.6 provides the necessary compactness result to reduce the original minimization problem over the infinite set to a finite subset given by (4.5) and (4.6), respectively. To this end, it is worth noting that the smaller the deformation distance of the initial lattice basis the smaller the radius of the ball in that contains the optimal μ. However, in specific cases, where better estimates are available, it might be advantageous to start with an initial lattice basis that is not optimal.
Nevertheless, in order to explicitly determine the optimal transformations, one still needs to compare the distances for all elements contained in the finite sets given by (4.5) and (4.6), respectively. This can easily be carried out with any modern computer algebra program, and possible implementations can be found in appendices A and B.
In order to ensure that the solution of this finite minimization problem is correct one needs to verify that the difference Δ between the minimal and the second to minimal deformation distance is large compared with possible rounding errors (if any). The computations in §§4a and 4b for the Bain strain from fcc to bcc/bct are exact and thus without rounding errors. In §4c, regarding the optimal transformation in terephthalic acid, we find that Δ>0.015, which is large compared with machine precision.
(a). The Bain strain in fcc to bcc
Having established the general theory of optimal lattice transformations, we apply these results to prove the optimality of the Bain strain with respect to the three different lattice metrics dr, r=−2,1,2, from the previous example. In these cases, we rigorously prove the optimality of the Bain strain first proposed in [1].
Theorem 4.9 (Bain optimality). —
In a transformation from an fcc to a bcc lattice with no change in atom density, there are three distinct equivalence classes of dr-optimal lattice transformations for r=1,2,−2. The stretch components are given by
i.e. the three Bain strains are the dr-optimal lattice transformations in a volume-preserving fcc-to-bcc transformation for r=1,2,−2. The respective minimal metric distances are
Proof. —
Let denote the fcc lattice, where the fcc unit cell has unit volume, and let denote the bcc lattice with the same atom density (figure 2). Then, and , where
4.7 and, in particular, . Let denote the lattice transformation from to (cf. lemma 4.1). By definition, Hμ is optimal if μ satisfies (4.1). We first show the optimality with respect to d1 and d2. We may find an upper bound on the minimum by only considering (cf. definition 2.7). With the help of a computer, we find exactly 72 such μ's, and all corresponding deformations are (volume-preserving) Bain strains. To complete the proof, we employ our key lemma 4.5 to show that any cannot be optimal with respect to either d1 or d2. Let be given by
4.8 Then, bμ,i=Hμfi=Bμei=αib1+βib2+γib3 and, after dropping the index i, we obtain
4.9 where we have used that |bi|=|bj| and 〈bi,bj〉=〈bk,bl〉 for all i≠j and k≠l. We compute |fi|=2−1/2, |bi|2=3⋅2−8/3 and 〈bi,bj〉=−2−8/3. By (4.3), we estimate
4.10
4.11 where ρ(α,β,γ):=α2+β2+γ2+(α−β)2+(β−γ)2+(α−γ)2. If then ρ(α,β,γ)≥8 and thus
To show d−2-optimality, we consider Hμ=B(Fμ−1)−1 and use the ansatz (4.8) for μ−1 instead of μ. We compute
and we note that bi=HμFμ−1ei. Thus, by (4.4), we can estimate
4.12 where σ(α,β,γ):=(α+β)2+(β+γ)2+(α+γ)2 and we have used that σ(α,β,γ)≥6 for . Therefore, the d−2-optimal μ is contained in . ▪
Figure 2.

Face-centred cubic and body-centred cubic unit cells with equal atom density.
Corollary 4.10 —
The three Bain strains remain the dr-optimal lattice transformations, r=1,2,−2, from fcc to bcc if the volume changes by λ3, provided that λ>0.84 for r=1, λ>0.64 for r=2 and λ<1.19 for r=−2. The stretch components of the three optimal equivalence classes are given by
The minimal metric distances are given by
Proof. —
Replace in (4.8) in the proof of theorem 4.9. Then, (4.10)–(4.12), respectively, read
If as above then and thus for λ>0.84 and for λ>0.64 and so that for λ<1.19. ▪
Remark 4.11 (relations between the minimal deformations for fcc to bcc). —
Let and be the fcc and bcc lattices, respectively. Let μ0 be one of the optimal changes of lattice basis and , denote the 72 optimal lattice deformations associated with the optimal changes of basis given by theorem 4.9. Then, all optimal Hi's and corresponding μi's are given by
where We note that the latter equation holds because is the point group of both cubic lattices and thus B−1PB and F−1QF are contained in . Because there are only three equivalence classes of optimal lattice transformations, the 72 optimal changes of lattice basis split into three sets of 24 μPQ's such that the 24 corresponding HPQ's lie in the same equivalence class.
(b). Stability of the Bain strain
Theorem 4.9 showed that the Bain strain is optimal in an fcc-to-bcc phase transformation. In this section, we restrict our attention to r=1,2 and show that the Bain strain remains optimal for a range of lattice parameters in an fcc-to-bct phase transformation. This type of transformation is found, for example, in steels with higher carbon content. The strategy of the proof is to treat the bct phase as a perturbation of the bcc phase. To this end, for B as in (4.7), let the bct lattice be generated by
| 4.13 |
so that C denotes the elongation (or shortening) of the bcc cell in the z-direction and A the elongation (or shortening) in the x- and y-direction. We note that, because , the lattice is equivalent to the lattices and . Further, we define .
Proposition 4.12 provides the most important ingredient.
Proposition 4.12 (‘the first excited state’). —
In a volume-preserving transformation from an fcc to a bcc lattice, the second to minimal deformation distances are given by
In particular, all Hμ with have distance strictly larger than r=1,2.
Proof. —
For brevity, let us call any deformation Hμ and the corresponding change of basis μ that has deformation distance , an excited state. The proof follows along the same lines as the proof of theorem 4.9. First, we show with the help of a computer that the second to minimal deformation distance within is given by the above, and by (4.10) and (4.11), respectively, applied on we know that there cannot be any excited states in . ▪
Corollary 4.13 (‘the first excited state’ with volume change). —
In a transformation from an fcc to a bcc lattice with volume change λ3, the second to minimal deformation distances are given by
In particular, all with have distance strictly larger than r=1,2.
Theorem 4.14 —
The Bain strain is a d1- and d2-optimal lattice transformation from fcc to bct with lattice parameters A,C in the range
(cf. figure 3). For C>A, the stretch components of the optimal lattice transformations are given by in the set
The respective minimal metric distances are
4.14
4.15 and are achieved by exactly 24 distinct . The case C=A corresponds to an fcc-to-bcc transformation with volume change λ3 with λ=A=C, and we refer to corollary 4.10.
Figure 3.
The range of A,C where the Bain strain remains d1-optimal (a) and d2-optimal (b). (Online version in colour.)
Example 4.15 —
A=C=1 recovers theorem 4.9. C>A corresponds to the fcc-to-bct transformation found in, for example, steels with higher carbon content. is the bct lattice that is contained in the fcc lattice, i.e. .
Proof of theorem 4.14. —
We will show that precisely 24 of the 72 μ's that were optimal in the fcc-to-bcc transition remain optimal. Let us start from one of those optimal transformations from fcc to bcc given by, for example,
We know that HACμ0=BACμ0F−1 is optimal for A=C=1, where BAC is given by (4.13). The deformation distance is with given by (4.14) and (4.15), respectively. Further there exist 24 different μ's and corresponding HACμ's that have the same distance. This follows as in remark 4.11 with the only difference being that the point group of the bct lattice has only eight elements. Then, owing to the invariance of d1 and d2 under multiplication from the left or right by any rotation, the 24 matrices HACμ trivially have the same distance to and one may easily verify that these HACμ's are equally split into the three equivalence classes as in the statement of the theorem.
The remaining 48 μ's that were optimal for fcc to bcc lead to a larger deformation distance. One of these non-optimal lattices is generated by
with
4.16 and
4.17 which holds true for all C>A in the range under consideration. The remaining 47 non-optimal deformations are all related and thus have the same distance; in particular, larger than .
To show the minimality of the 24 HACμ's, we make use of our result on the first excited state to compare their distance to against all the remaining μ's that were non-optimal in the fcc-to-bcc transition. In particular, we need to show that
where and is any of the 72 minimizing μ's from theorem 4.9. Let us set and estimate using the properties of dr (cf. example 3.3)
4.18 where denotes the first excited state (cf. proposition 4.12). We estimate
and, with the help of a computer, we calculate . Thus, a sufficient condition that the Bain strain is d1-optimal within is that 0.75<A≤C satisfy
yielding the area drawn in figure 3a. To exclude any we replace b by bAC=diag(A,A,C)b in (4.9) in the proof of theorem 4.9 and estimate |bAC|≥A|b|. Concluding as in (4.10), we arrive at
4.19 which needs to be larger than . This holds true, for example, for A∈[0.85,1.7] and C∈[A,1.7]. The proof of the d2-optimality proceeds analogously. To obtain d2-optimality within , we need to satisfy
for all 0.75<A≤C, which yields the area drawn in figure 3b. To exclude all elements in the complement of , we have to ensure that , which holds true, for example, for A∈[0.75,1.5] and C∈[A,1.5]. ▪
Remark 4.16 —
By employing corollaries 4.10 and 4.13, we may extend the range of optimal parameters A and C in theorem 4.14 (cf. figure 3) by shifting the reference point from A=C=1 to A=C=λ. This enables us to show that the Bain strain remains the d1- and d2-optimal lattice deformation from fcc to bct in a much larger range of lattice parameters C≥A. The shaded regions in figure 4 show the values of A,C such that the deformation remains d1- and d2-optimal.
Figure 4.
Extended d1-optimality (a) and d2-optimality (b) range for A and C. The dark-shaded regions are obtained by a perturbation argument about the fixed optimal transformations , λ0=0.9,1.1,1.3. The light-shaded regions are obtained by a perturbation argument about the (A,C)-dependent optimal transformation with . (Online version in colour.)
Proof. —
The main idea of the proof is to consider the element which is optimal in an fcc-to-bcc transformation with volume change (cf. corollary 4.10) and ‘closest’ to HACμ. Thus, in (4.18), we write
and for d1 we estimate
To obtain the d1-optimality in , we again use so that . Condition (4.19) regarding d1-optimality outside remains unchanged. Both conditions combined yield the area shown in figure 4a. Analogously, in order to show d2-optimality, we estimate
and again use to show d2-optimality within . The condition to be d2-optimal outside remains unchanged. Both conditions combined yield the area shown in figure 4b. ▪
Remark 4.17 —
The previous estimates can be iterated, i.e. instead of picking the that is closest to one may pick any that is in the range indicated in figure 4 that is closest to .
If C≤A, following the proof of theorem 4.14, one finds that the optimal strain becomes
at least if A and C are in the regions specified in the statement of theorem 4.14 with C≥A replaced by A≥C.
(c). Terephthalic acid
Terephthalic acid is a material that has two triclinic phases (type I and II) which are very different from each other (cf. [13], p. 46 ff.). Thus, any lattice transformation necessarily requires large principal stretches and, unlike in the Bain setting, it is not clear what a good candidate for the optimal transformation would be. However, with the help of the proposed framework the dr-optimal lattice transformation can easily be determined. The only required input parameters are the lattice parameters of the two triclinic unit cells (cf. [14]) listed in table 3.
Table 3.
Lattice parameters of the triclinic unit cells of terephthalic acid.
| form | a/A° | b/A° | c/A° | α/° | β/° | γ/° |
|---|---|---|---|---|---|---|
| I | 7.730 | 6.443 | 3.749 | 92.75 | 109.15 | 95.95 |
| II | 7.452 | 6.856 | 5.020 | 116.6 | 119.2 | 96.5 |
To apply our analysis, we first ought to convert the triclinic to the primitive description.
Lemma 4.18 (conversion from triclinic to primitive unit cell). —
The triclinic unit cell with lattice parameters a,b,c and α,β,γ generates up to an overall rotation the same lattice as
Proof. —
Let col[F]={f1,f2,f3}. It is easy to verify that |f1|=a, |f2|=b, |f3|=c and that , , . ▪
Example 4.19 (primitive cells of terephthalic acid). —
Application of lemma 4.18 to the lattice parameters in table 3 leads to
4.20 (all measures in A°).
Theorem 4.20 (optimal lattice transformations in terephthalic acid). —
The unique equivalence class of d1- and d2-optimal transformations between terephthalic acid form I and terephthalic acid form II has a stretch component given by
4.21 with principal stretches ν1=0.725, ν2=1.033 and ν3=1.385. The minimal distances are given by and .
Proof. —
We apply theorem 4.6 with F=FI and G=FII. We calculate , , m0,1=0.529<0.55 and m0,2=1.197<1.2. Further, we note that if then . Therefore, by (4.5), any d1-optimal μ satisfies
and is thus contained in and, by (4.5), any d2-optimal μ satisfies
and is thus also contained in . With the help of a computer, we check that, within the set the minimum is in both cases attained at
with corresponding as in (4.21), and . ▪
Remark 4.21 —
We have shown that the d1- and d2-optimal transformations from form I to form II of terephthalic acid are the same. However, the d−2-optimal transformation is different and given by
with principal stretches ν1=0.743, ν2=0.977 and ν3=1.429. As expected, the smallest principal stretch ν1 is bigger than before, because d−2 penalizes contractions significantly more than expansions. To obtain the required analytical bounds, one calculates , and m0,−2=1.080<1.1 to get (cf. (4.6)) and thus the optimal μ lies in . We note that the calculated principal stretches differ from the ones in [6]—possibly owing to the use of sublattices.
5. Concluding remarks
This paper provides a rigorous proof for the existence of an optimal lattice transformation between any two given Bravais lattices with respect to a large number of optimality criteria. Furthermore, a precise algorithm and a graphical user interface (GUI) to determine this optimal transformation is provided (see appendices A and B). As possible applications, the optimal transformations in steels, i.e. the transformation from fcc to bcc/bct, and in terephthalic acid were determined. Through theorem 4.6 and with the help of the provided algorithm/program, one is able to rigorously determine the optimal phase transformation in any material undergoing a displacive phase transformation from one Bravais lattice to another.
If the parent or product phases are multi-lattices, the proposed framework is not a priori applicable. Nevertheless, one may still consider Bravais sublattices of these multi-lattices and proceed as before. The choice of these sublattices may come from physical consideration. However, in order to rigorously determine the optimal transformation between two given multi-lattices, one would need to measure the movement of all atoms consistently, i.e. one would need to take into account both the overall periodic deformation of the unit cell and the shuffle movement of atoms within the unit cell. Establishing such a criterion would be of great interest but lies beyond the scope of this paper.
Supplementary Material
Supplementary Material
Acknowledgements
We thank R. D. James and X. Chen for helpful discussions.
Appendix A. MATHEMATICA
The following Mathematica code3 determines for a given the optimal lattice transformation within the set for any given and for any distance measure , r>0. The case r<0 is analogous.
For the transformation from fcc to bcc, F and G would be given by (4.7), and for the transformation from terephthalic acid I to II, F and G would be given by (4.20).
First, we generate the set (=SL): SL = Select[Flatten[Table[{a,b,c,d,e,f,g,h,i}, {a,-k,k},{b,-k,k},{c,-k,k},{d,-k,k},{e,-k,k},{f,-k,k}, {g,-k,k},{h,-k,k},{i,-k,k}],8],Det[Partition[#,3]]==1&]; Next, we generate a list (=distlist) of all values of for :
Hmu = Function[mu,G.Partition[mu,3].Inverse[F]]; distr = Function[mu,Norm[SingularValueList[Hmu[mu]]^r-{1,1,1}]]; distlist = distr/@SL; Then, we generate a list(=poslist) of all the positions of μ's in that give rise to the minimal deformation distance:
poslist = Flatten[Position[distlist,RankedMin[distlist,1]],1]; Further, we calculate the minimal deformation distance m0, the second to minimal deformation distance m1 and return their numerical difference Δ=m1−m0 (=delta):
m0 = distlist[[poslist[[1]]]]; m1 = Sort[distlist][[Length[poslist]+1]]; delta = N[m1-m0] Finally, we return a list of all μ's that give rise to an optimal deformation Hμ and a list of all optimal Hμ's:
SL[[poslist]] Hmu/@SL[[poslist]]
Appendix B. Matlab
A GUI called ‘OptLat’ can either be found on Matlab File exchange4 (requires Matlab) or downloaded directly as a standalone Windows application.5
Footnotes
‘Über den Mechanismus dieser “Martensitumwandlung” ist bisher nichts Sicheres bekannt. Bain stellt sich vor, daß eine tetragonalkörperzentrierte Elementarzelle des Austenits durch Schrumpfung in der einen Richtung und Ausdehnung in den beiden anderen in die kubischraumzentrierte des α-Eisens übergeht. Eine Bestätigung für diese Anschauung konnte bisher nicht erbracht werden.’
In particular, no assumptions are made on the type of lattice points (e.g. atoms, molecules) or on the relation between the point groups of the two lattices.
The original .nb file can be found online at http://solids.maths.ox.ac.uk/programs/OptLat.nb or in the electronic supplementary material.
See http://uk.mathworks.com/matlabcentral/fileexchange/55554-optlat or the electronic supplementary material.
Data accessibility
Source codes for the Mathematica and Matlab applications are available online.
Authors' contributions
The results of the paper were obtained jointly by K.K. and A.M.
Competing interests
We have no competing interests.
Funding
The research of A.M. leading to these results has received funding from the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013)/ERC grant no. 291053.
References
- 1.Bain EC. 1924. The nature of martensite. Trans. ISS AIME 70, 25–47. [Google Scholar]
- 2.Kurdjumov GV, Sachs G. 1930. Über den Mechanismus der Stahlhärtung. Z. Phys. 64, 325–343. ( 10.1007/BF01397346) [DOI] [Google Scholar]
- 3.Koumatos K, Muehlemann A. 2016. A theoretical investigation of orientation relationships and transformation strains in steels. (http://arxiv.org/pdf/1604.05270v1.pdf)
- 4.Bowles JS, Wayman CM. 1972. The Bain strain, lattice correspondences, and deformations related to martensitic transformations. Metall. Trans. 3, 1113–1121. ( 10.1007/BF02642442) [DOI] [Google Scholar]
- 5.Lomer WM. 1955. The transformation in uranium-1.4 at.% chromium alloy. Inst. Metals (London) Monograph, no. 18, pp. 243–253. London, UK: Institute of Metals. [Google Scholar]
- 6.Chen X, Song Y, Tamura N, James RD. 2015. Determination of the stretch tensor for structural transformations. (http://arxiv.org/abs/1501.05064)
- 7.Gentle JE. 2007. Matrix algebra: theory, computations, and applications in statistics. Springer Texts in Statistics. New York, NY: Springer. [Google Scholar]
- 8.Bhattacharya K. 2003. Microstructure of martensite. Oxford, UK: Oxford University Press. [Google Scholar]
- 9.Pitteri M, Zanzotto G. 2002. Continuum models for phase transitions and twinning in crystals. New York, NY: CRC Press. [Google Scholar]
- 10.Doyle TC, Ericksen JL. 1956. Non-linear elasticity. Adv. Appl. Mech., 4. 53–115. ( 10.1016/S0065-2156(08)70371-5) [DOI]
- 11.Bhadeshia HKDH. 2001. Geometry of crystals. London, UK: Institute of Materials. [Google Scholar]
- 12.Ball JM, James RD. 1992. Proposed experimental tests of a theory of fine microstructure and the two-well problem. Phil. Trans. R. Soc. Lond. A 338, 389–450. ( 10.1098/rsta.1992.0013) [DOI] [Google Scholar]
- 13.Ball JM, James RD. 2015. Incompatible sets of gradients and metastability. Arch. Ration. Mech. Anal. 218, 1363–1416. ( 10.1007/s00205-015-0883-9) [DOI] [Google Scholar]
- 14.Bailey M, Brown CJ. 1967. The crystal structure of terephthalic acid. Acta Crystallogr. 22, 387–391. ( 10.1107/S0365110X67000751) [DOI] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
Data Availability Statement
Source codes for the Mathematica and Matlab applications are available online.



