Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-05-15T06:57:56.109Z Has data issue: false hasContentIssue false

ON ARTIN'S BRAID GROUP AND POLYCONVEXITY IN THE CALCULUS OF VARIATIONS

Published online by Cambridge University Press:  20 May 2003

ALI TAHERI
Affiliation:
Department of Mathematics, University of Warwick, Coventry CV4 7AL taheri@maths.warwick.ac.uk
Get access

Abstract

Let $\Omega \subset \R^2$ be a bounded Lipschitz domain and let \[ F: \Omega \times {\mathbb R}_{+}^{2 \times 2} \longrightarrow {\mathbb R} \] be a Carathèodory integrand such that $F\left(x, \cdot\right)$ is polyconvex for ${\mathcal L}^2$-a.e. $x \in \Omega$. Moreover assume that $F$ is bounded from below and satisfies the condition $F\left(x, \xi\right) \searrow \infty$ as $\det \xi \searrow 0$ for ${\mathcal L}^2$-a.e. $x \in \Omega$. The paper describes the effect of domain topology on the existence and multiplicity of strong local minimizers of the functional \[ {\mathbb F} \left[u\right] := \int_{\Omega } F\left(x, \nabla u\left(x\right)\right) \, dx,\] where the map $u$ lies in the Sobolev space $W_{\rm {id}}^{1,p} (\Omega, {\mathbb R}^2)$ with $p \geqslant 2$ and satisfies the pointwise condition $\det \nabla u\left(x\right) >0$ for ${\mathcal L}^2$-a.e. $x \in \Omega$. The question is settled by establishing that ${\mathbb F}\left[\cdot\right]$ admits a set of strong local minimizers on {W^{1,p}_{\rm{id}}(\Omega, {\mathbb R}^2)} that can be indexed by the group $\Pn \oplus \Z^n$, the direct sum of Artin's pure braid group on $n$ strings and $n$ copies of the infinite cyclic group. The dependence on the domain topology is through the number of holes $n$ in $\Omega$ and the different mechanisms that give rise to such local minimizers are fully exploited by this particular representation.

Keywords

Type
Research Article
Copyright
The London Mathematical Society 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)