Morrey's conjecture: rank-one convexity implies quasi-convexity for two-dimensional, two-component maps
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2019
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912371419643904 |
|---|---|
| author | Pedregal, Pablo |
| author_facet | Pedregal, Pablo |
| contents | We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that preserves decomposition directions within the $(H_n)$-condition formalism. The existence of a fixed point ensures that, in addition to keeping decomposition directions, joint volume fractions are respected as well, leading to the fundamental fact that every two-dimensional, two-component gradient can be reached by lamination. When maps have more than two components, fixed points exist for every combination of two components, but they do not match in general. Higher dimension would require further insight on how to organize and deal with triangulations for piece-wise affine maps. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1905_06571 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Morrey's conjecture: rank-one convexity implies quasi-convexity for two-dimensional, two-component maps Pedregal, Pablo Optimization and Control 65L05, 65L20, 47J30, 65D05 We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that preserves decomposition directions within the $(H_n)$-condition formalism. The existence of a fixed point ensures that, in addition to keeping decomposition directions, joint volume fractions are respected as well, leading to the fundamental fact that every two-dimensional, two-component gradient can be reached by lamination. When maps have more than two components, fixed points exist for every combination of two components, but they do not match in general. Higher dimension would require further insight on how to organize and deal with triangulations for piece-wise affine maps. |
| title | Morrey's conjecture: rank-one convexity implies quasi-convexity for two-dimensional, two-component maps |
| topic | Optimization and Control 65L05, 65L20, 47J30, 65D05 |
| url | https://arxiv.org/abs/1905.06571 |