The mapping-content factorization conjecture through trees
Statement
Let be a non-negative integer, let , and let be a -Lipschitz mapping. The -mapping content is defined by
where the infimum is over coverings of by dyadic cubes with disjoint interiors in , and is -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 , 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 connects small mapping content with qualitative and quantitative approximation by maps factoring through trees. The case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.