Skip to main content

Microstructure

  • Chapter
  • First Online:
Calculus of Variations

Part of the book series: Universitext ((UTX))

  • 6596 Accesses

Abstract

Motivated by the example on crystal microstructure in Section 1.8 and the remarks in Section 8.3 about the connection of the quasiconvex hull to the relaxation of integral functionals, in this chapter we continue our analysis of the differential inclusion

$$\begin{aligned} \left\{ \begin{aligned}&u \in \mathrm {W}^{1,\infty }(\varOmega ;\mathbb {R}^m), \quad u|_{\partial \varOmega } = Fx,\\&\nabla u \in K \quad \text {in}\, \varOmega . \end{aligned}\right. \end{aligned}$$

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Filip Rindler .

Appendices

Notes and Historical Remarks

The task to compute quasiconvex hulls first arose in the theory of mathematical material science, in particular in the work of Ball and James [30, 31]. However, the explicit definitions and study of the rank-one convex hull and polyconvex hull as lower and upper bounds, respectively, only seem to have appeared later (even though the methods to compute them are older). Dacorogna contributed many results investigating the properties of the various hulls, see [76] for an overview and pointers to the literature. One can also define notions of quasiconvex, polyconvex, and rank-one convex sets, not just envelopes as we have done, and develop a corresponding theory, see Chapter 7 in [76].

For most of the material on the application to the two-well problems we follow [203, 205]. The proof of Proposition 9.4 is based on ideas from [251]. Theorem 9.5 is from [254].

The basic idea of convex integration dates back to the famous Nash–Kuiper Theorem in differential geometry [173, 212]. These arguments were developed further until they culminated in Gromov’s “h-principle”, which is detailed in his treatise [145] (also see [144]). There, the Lipschitz case, which is the one relevant to us, is also briefly mentioned; in particular, the term “in-approximation” is due to Gromov. This work was transferred by Müller and Šverák [205, 207] to the multi-well inclusions that are of interest in material sciences. Simultaneously, Dacorogna and Marcellini [79, 80] adapted Cellina’s Baire method [20, 58, 59] for ordinary differential inclusions to partial differential inclusions. Sychev [257, 260, 262] developed the method further to prove an existence theorem that only assumed the existence of what we call a “piecewise affine reduction”. He also showed that the situation with an in-approximation (or RC-in-approximation) can be reduced to this abstract result. We remark that Sychev’s original result, Theorem 1.1 in [260], is in fact a bit more general than our version. Finally, Kirchheim’s approach based on Baire-one functionals unified the different strands of development, see [160], and further relates convex integration to the Banach–Mazur game. Our presentation mostly follows [160], but we also took some inspiration from [263]. We also remark that the term “convex integration” sometimes only designates the approach via an (RI-)in-approximation. Kirchheim speaks of “affine synthesis” in [160].

The technical Lemma 9.10 is from [207], which itself is a variant of Theorem 2.4 in [120], but the result is already mentioned in Gromov’s book [145]. While Theorem 9.12 as stated is due to Müller and Šverák [205], at the same time the Baire approach by Dacorogna and Marcellini [79] also resulted in similar results.

For convex integration in the inhomogeneous case, that is, where \(K = K(x)\), we refer to [208]. We also mention [206], where additionally a uniform determinant constraint is respected in the convex integration procedure. Convex integration has also been applied to the Euler equation to show the existence of very irregular solutions [91, 152, 239, 243]. One important and recurring theme in convex integration theory is that the regularity we require of solutions determines whether we can find solutions at all. The task is then to precisely identify the threshold between rigidity and non-rigidity.

Ornstein’s non-inequality is in fact a much more general result that shows that many singular integral operators are not \((\mathrm {L}^1 \mapsto \mathrm {L}^1)\)-bounded. An abstract approach to these questions is in [162].

Another aspect of microstructure which was not touched upon in this chapter is that of uniqueness and stability . Here, a microstructure \(\nu \in \mathscr {M}^\mathrm {qc}(K)\) is called unique (in K) if \(\hat{\nu } \in \mathscr {M}^\mathrm {qc}(K)\) with \([\hat{\nu }] = [\nu ]\) implies \(\hat{\nu } = \nu \). Many ideas in this area go back to Luskin; a nice modern exposition, which also incorporates some new ideas with a view toward numerics is in Chapter 4 of [100].

Problems

9.1.

Let \(K \subset \mathbb {R}^{m \times d}\) be a non-empty compact set. Show that \(K^\mathrm {lc}\) is the smallest set \(M \subset \mathbb {R}^{m \times d}\) that is closed under laminations, i.e., if \(A, B \in M\) and \({{\mathrm{rank}}}(A-B) = 1\), then \(\theta A + (1-\theta )B \in M\) for all \(\theta \in (0,1)\).

9.2.

Let \((t_k, A_k)_{k=1,\ldots , n} \subset [0,1] \times \mathbb {R}^{m \times d}\) with \(\sum _k t_k = 1\). We define:

  1. (i)

    If \(n = 2\) we say that \((t_k, A_k)_k\) satisfies the \((H_2)\) -condition if \({{\mathrm{rank}}}(A_1-A_2) \le 1\).

  2. (ii)

    If \(n > 2\) we say that \((t_k, A_k)_k\) satisfies the \((H_n)\)-condition if possibly after a permutation of indices,

    $$ {{\mathrm{rank}}}(A_1-A_2) \le 1 $$

    and with

    $$\begin{aligned} s_1&= t_1 + t_2,&B_1&= \frac{t_1}{s_1} A_1 + \frac{t_2}{s_1} A_2, \\ s_k&= t_{k+1},&B_k&= A_{k+1} \qquad \text {for}\quad k = 2,3,\ldots , n, \end{aligned}$$

    the collection \((s_k, B_k)_{k=1,\ldots , n-1}\) satisfies the \((H_{n-1})\)-condition.

Prove that

$$\begin{aligned} \mathscr {M}^\mathrm {lc}(K) =&\biggl \{\, \mu \in \mathscr {M}^1(K) \ \ {\varvec{:}}\ \ \mu = \sum _{k=1}^n t_k \delta _{A_k}, \; (t_k, A_k)_k \, \text {satisfies the}\, (H_n)\text {-condition}\\&\qquad \qquad \qquad \quad \;\text {for some} \, n \in \mathbb {N} \,\biggr \} . \end{aligned}$$

9.3.

Show that for all non-empty compact sets \(K \subset \mathbb {R}^{m \times d}\) it holds that

$$ K^\square = \bigl \{\, A \in \mathbb {R}^{m \times d} \ \ {\varvec{:}}\ \ h(A) \le {{\mathrm{inf}}}_K h \, \text {for all}\, h :\mathbb {R}^{m \times d} \rightarrow \mathbb {R}\, \text {such that}\, h = h^\square \,\bigr \} , $$

where \(\square \in \{\mathrm {rc},\mathrm {qc},\mathrm {pc},**\}\), and \(h^\square \) is the respective envelope of h (i.e., \(h = h^\square \) means that h has the respective convexity property).

9.4.

Show that for a compact set \(K \subset \mathbb {R}^{3 \times 3}\) it holds that

$$ K^\mathrm {pc}= \bigl \{\, A \in \mathbb {R}^{3 \times 3} \ \ {\varvec{:}}\ \ (A,{{\mathrm{cof}}}~A,\det A) \in (\mathbf M K)^{**} \,\bigr \}, $$

where

$$ \mathbf M K := \bigl \{\, (A,{{\mathrm{cof}}}~A,\det A) \ \ {\varvec{:}}\ \ A \in K \,\bigr \}. $$

What is the corresponding formula for general dimensions?

9.5.

Let

$$ K := \mathrm {SO}(2) \cup \mathrm {SO}(2) U, \quad U := \begin{pmatrix} \alpha &{} \\ &{} \beta \end{pmatrix}, \quad 0 < \alpha \le 1 \le \beta , \quad \alpha \beta \ge 1. $$

Show that for every \(A \in K^{**}\) we can find unique \(y, z \in \mathbb {R}^2\) with

$$ |y|^2 = y_1^2 + y_2^2 \le 1 \qquad \text {and}\qquad |z|^2 = z_1^2 + z_2^2 \le 1 $$

such that

$$ A = \begin{pmatrix} y_1 &{} -y_2 \\ y_2 &{} y_1 \end{pmatrix} + \begin{pmatrix} z_1 &{} -z_2 \\ z_2 &{} z_1 \end{pmatrix} U. $$

Show furthermore that the mapping \((y, z) \mapsto A\) is a diffeomorphism.

9.6.

Show that for all sufficiently small open sets \(U \supset K_{\mathrm {T4}}\) there are no rank-one connections in U.

9.7.

Show that for the set

$$ K := \left\{ \, \begin{pmatrix} x &{} 0 \\ 0 &{} y \\ z &{} z \end{pmatrix} \ \ \mathbf{: }\ \ x,y, z \in \{-1, 1\} \,\right\} $$

from Example 9.22 it holds that

$$ K^\mathrm {lc}= K^\mathrm {rc}= K^\mathrm {qc}= K^\mathrm {pc}= K^{**} = \left\{ \, \begin{pmatrix} x &{} 0 \\ 0 &{} y \\ z &{} z \end{pmatrix} \ \ \mathbf{: }\ \ x,y, z \in [-1, 1] \,\right\} . $$

9.8.

For an open set \(G \subset \mathbb {R}^{m \times d}\) we define

$$ G^\mathrm {qc}:= \bigcup \bigl \{\, K^\mathrm {qc} \ \ {\varvec{:}}\ \ K \subset G \, \text {compact} \,\bigr \}. $$

Assume that \(K \subset G^\mathrm {qc}\) is compact. Show that there exists a subset \(G_0 \Subset G\) with \(K \subset G_0^\mathrm {qc}\).

9.9.

Use a convex integration procedure to show that there are continuous, bounded functions on the interval [0, 1] that are nowhere differentiable.

9.10.

Show that if a compact set \(K \subset \mathbb {R}^{m \times d}\) has an in-approximation consisting of open, uniformly bounded sets \(G_k \subset \mathbb {R}^{m \times d}\) then K is piecewise affinely stable with respect to \(G_\infty := \bigcup _{l=1}^\infty G_l\).

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Rindler, F. (2018). Microstructure. In: Calculus of Variations. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-319-77637-8_9

Download citation

Publish with us

Policies and ethics