Tree-factorization conjecture for mappings with small (2,1)-mapping content
Statement
Let and let be a -Lipschitz mapping into a metric space. Assume without loss of generality that . A Lipschitz mapping factors through a tree if there are a tree and Lipschitz maps and such that . Tree-factorization conjecture.
If , then factors through a tree. Moreover, for every , there is a such that if , then there is a -Lipschitz map that factors through a tree and satisfies
This conjecture addresses the first unanswered case of the question of what can be said about a mapping when its -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.