ProbXiv
Explorersign in
Problem archiveProblem record

Statement

  1. (Victor Bangert) Let L: Tn × T × Rn → R, L = L(x, u, p ) be a smooth multi-dimensional Lagrangian satisfying the usual convexity assumptions in p ∈ Rn. For example,

L(x, u, p ) = 1

2|p|2 + F (x, u ),

where the potential F: Tn+1 → R is periodic in all variables. A function u: Rn → R is called minimal if it minimizes the action functional

∫

L(x, u (x), Du (x)) dx

for all variations with compact support. The set of minimizers u "without self-intersections" is very well understood. Here u: Rn → R is said to be "without self-intersections" if the projection to Tn+1 of graph( u) ⊂ Rn+1 is a hypersurface without 8

self-intersections. In particular, for every minimizer u without self-intersections there exists a "rotation vector" c ∈ (Rn)∗ such that

|u(x) − u(0) − c · x|

is bounded by a constant that only depends on L. Conversely, for every c ∈ (Rn)∗

there exists a minimizer u without self-intersections such that |u(x)−c·x| is bounded. Question: Is there an analytical condition implying that the minimizers satisfying this condition have no self-intersections. More concrete question: Suppose u: Rn → R is minimal and |Du (x)| is bounded. Is it true that the graph of u in Tn+1 has no self-intersections. For partial results see V. Bangert, Ann. Inst. Henri Poincar´ e - Analyse non lin´ eaire 6(1989), 95-138, in particular Sect. 8. 2

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.