Stabilization conjecture for iterated balanced refinements

About 5 years old · traced to

Let (M,ρ)({\mathcal M},\rho) be a pseudometric space, let XX be a Banach space, and let mm be a fixed positive integer. Set ℓ=ℓ(m,X)=min⁡{m+1,dim⁡X}\ell=\ell(m,X)=\min\{m+1,\dim X\}. For a set-valued mapping F:M→Km(X)F:{\mathcal M}\to{\mathcal K}_m(X), define

F[0]=F,F[k+1](x)=⋂z∈M[F[k](z)+λk+1ρ(x,z)BX].F^{[0]}=F,\qquad F^{[k+1]}(x)=\bigcap_{z\in{\mathcal M}}\left[F^{[k]}(z)+\lambda_{k+1}\rho(x,z)B_X\right].

Stabilization conjecture. There exist ℓ+1\ell+1 numbers λ1,…,λℓ+1≥1\lambda_1,\ldots,\lambda_{\ell+1}\ge1 such that, for every FF satisfying the finiteness-principle hypothesis that each restriction to a subset of cardinality at most N(m,X)N(m,X) has a Lipschitz selection with seminorm at most 11, one has

F[ℓ](x)≠∅andF[ℓ+1](x)=F[ℓ](x)F^{[\ell]}(x)\ne\emptyset\qquad\text{and}\qquad F^{[\ell+1]}(x)=F^{[\ell]}(x)

for all x∈Mx\in{\mathcal M}. This asserts that the balanced-refinement process becomes nonempty and stabilizes after finitely many steps under the local selection hypothesis. The formulation is equivalent to requiring the terminal refinement to be a Lipschitz core, but expresses the claim without using the notion of a core.

Equivalent formulations 1Other wordings

Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.

  1. The stabilization conjecture for iterated balanced refinements

    Let (M,ρ)({\mathcal M},\rho) be a pseudometric space, let XX be a Banach space, and let mm be a fixed positive integer. Set

    ℓ=ℓ(m,X)=min⁡{m+1,dim⁡X}.\ell=\ell(m,X)=\min\{m+1,\dim X\}.

    For a sequence λ⃗={λk:1≤k≤ℓ+1}\vec{\lambda}=\{\lambda_k:1\le k\le\ell+1\}, construct the iterated balanced refinements F[k]F^{[k]} by

    F[k+1](x)=⋂y∈M[F[k](y)+λk+1ρ(x,y)BX].F^{[k+1]}(x)=\bigcap_{y\in{\mathcal M}}\left[F^{[k]}(y)+\lambda_{k+1}\rho(x,y)B_X\right].

    The stabilization conjecture. There exists a sequence λ⃗={λk:1≤k≤ℓ+1}\vec{\lambda}=\{\lambda_k:1\le k\le\ell+1\} with every λk≥1\lambda_k\ge1 such that, for every set-valued mapping F:M→Km(X)F:{\mathcal M}\to{\mathcal K}_m(X) satisfying the hypothesis of the Finiteness Principle, one has

    F[ℓ](x)≠∅andF[ℓ+1](x)=F[ℓ](x)F^{[\ell]}(x)\ne\emptyset\quad\text{and}\quad F^{[\ell+1]}(x)=F^{[\ell]}(x)

    for all x∈Mx\in{\mathcal M}. The claim predicts that the balanced-refinement process both remains nonempty through order ℓ\ell and stabilizes at that order for every mapping satisfying the local finiteness hypothesis. The source gives no evidence of resolution.

    source: Pavel Shvartsman, “The Core of a 2-Dimensional Set-Valued Mapping. Existence Criteria and Efficient Algorithms for Lipschitz Selections of Low Dimensional Set-Valued Mappings”, arXiv:2010.04540 (2021).

References

Primary source

Pavel Shvartsman, “On the Core of a Low Dimensional Set-Valued Mapping”, arXiv:2102.07609 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.