A bilipschitz version of Hardt's theorem (Q2484541)

The Hardt theorem, proved in [\textit{R. Hardt}, Am. J. Math. 102, 291--302 (1980; Zbl 0465.14012)] and generalized in arbitrary o-minimal structures, asserts that a definable family of sets is generically definably topologically trivial. In this note the author shows that in case that the o-minimal structure is polynomially bounded this trivialization can be chosen to be bilipschitz. To do this, he introduces a concept of Lipschitz triangulation and deduces the result from the triangulation of the generic fibers.