ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q0=[0,1]3Q_0=[0,1]^3 and let f ⁣:Q0→Xf\colon Q_0\rightarrow X be a 11-Lipschitz mapping into a metric space. Assume without loss of generality that X⊆ℓ∞X\subseteq\ell_\infty. A Lipschitz mapping factors through a tree if there are a tree TT and Lipschitz maps g ⁣:Q0→Tg\colon Q_0\rightarrow T and h ⁣:T→Xh\colon T\rightarrow X such that f=h∘gf=h\circ g. Tree-factorization conjecture.

If H∞2,1(f,Q0)=0\mathcal{H}^{2,1}_\infty(f,Q_0)=0, then ff factors through a tree. Moreover, for every ϵ>0\epsilon>0, there is a δ=δ(ϵ)\delta=\delta(\epsilon) such that if H∞2,1(f,Q0)<δ\mathcal{H}^{2,1}_\infty(f,Q_0)<\delta, then there is a 11-Lipschitz map g ⁣:Q0→ℓ∞g\colon Q_0\rightarrow\ell_\infty that factors through a tree and satisfies

∥g−f∥∞<ϵ.\|g-f\|_\infty<\epsilon.

This conjecture addresses the first unanswered case of the question of what can be said about a mapping when its (2,1)(2,1)-mapping content is zero or small. Kaufman's construction and related examples show that no simple conclusion such as constancy is possible, while those examples factor through trees. The conjecture asks whether tree factorization characterizes the zero-content case and provides quantitative approximation in the small-content case.

Record

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.