Gabrielov's regular triangulation conjecture for definable functions

Let KeK e\varnothing be a compact definable set in Rm{\mathbb R}^m, and let f:KRf:K\to{\mathbb R} be a definable function. Write the graph over an open simplex Δ\Delta as

Γ={(x,t)xΔ, t=f(x)}.\Gamma=\{(\mathbf{x},t)\mid \mathbf{x}\in\Delta,\ t=f(\mathbf{x})\}.

A regular nn-cell is understood as in the source's Definition 1.1. A definable triangulation of KK is a triangulation whose simplices are definable.

Gabrielov's regular triangulation conjecture. There exists a definable triangulation of KK such that, for each ndimKn\leq\dim K and every open nn-simplex Δ\Delta of the triangulation, Γ\Gamma is a regular nn-cell, and either ff is constant on Δ\Delta or every nonempty level set

Γ{t=c}\Gamma\cap\{t=c\}

is a regular (n1)(n-1)-cell.

This conjecture is presented as a key step in Gabrielov's triangulation program: a compatible triangulation of increasing definable families of compact sets would imply the homotopy equivalence conjecture above. The source does not provide a resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Saugata Basu, Andrei Gabrielov and Nicolai Vorobjov, “Semi-monotone sets”, arXiv:1004.5047 (2011).

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.