ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm be a non-negative integer, let Q0=[0,1]2+mQ_0=[0,1]^{2+m}, and let f ⁣:Q0→ℓ∞f\colon Q_0\to\ell^\infty be a 11-Lipschitz mapping. The (2,m)(2,m)-mapping content is defined by

H∞2,m(f,Q0):=inf⁡∑QiH∞2(f(Qi))side⁡(Qi)m,\mathcal{H}^{2,m}_\infty(f,Q_0):=\inf\sum_{Q_i}\mathcal{H}^{2}_\infty(f(Q_i))\operatorname{side}(Q_i)^m,

where the infimum is over coverings of Q0Q_0 by dyadic cubes with disjoint interiors in Q0Q_0, and H∞2\mathcal{H}^{2}_\infty is 22-dimensional Hausdorff content. A map factors through a tree if it can be written as a composition through a metric tree.

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

sup⁡Q0∥g−f∥∞<ϵ.\sup_{Q_0}\|g-f\|_\infty<\epsilon.

This conjecture connects small mapping content with qualitative and quantitative approximation by maps factoring through trees. The case n=2n=2 is described as the first remaining open problem in a longer list, and the conjecture is motivated by the relation between mapping content and factorization through trees.

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.