O-minimal Hauptvermutung for polyhedra I
Milnor discovered two compact polyhedra which are homeomorphic but not PL homeomorphic (a counterexample to the Hauptvermutung). He constructed the homeomorphism by a finite procedure repeated infinitely often. Informally, we call a procedure constructive if it consists of an explicit procedure that is repeated only finitely many times. In this sense, Milnor did not give a constructive procedure to define the homeomorphism between the two polyhedra. In the case where the homeomorphism is semialgebraic, the author and Yokoi proved that the polyhedra in R n are PL homeomorphic. In that article, the required PL homeomorphism was not constructively defined from the given homeomorphism. In the present paper we obtain the PL homeomorphism by a constructive procedure starting from the homeomorphism. We prove in fact that for any ordered field R equipped with any o-minimal structure, two definably homeomorphic compact polyhedra in R n are PL homeomorphic (the o-minimal Hauptvermutung theorem 1.1). Together with the fact that any compact definable set is definably homeomorphic to a compact polyhedron we can say that o-minimal topology is “tame”.
Mathematics Subject Classification (2000)03C64 57Q05 57Q25
- 2.Bochnak, J., Coste, M., Roy, M.F.: Real algebraic geometry. Erg. Math. Grenzgeb. (3) 36 (1998) Google Scholar
- 7.Coste, M.: An introduction to o-minimal geometry. Dottorato di Ricerca in. Matematica, Dip. Mat. Univ. Pisa. Instituti Editoriali e Poligrafici Internazion (2000) Google Scholar
- 14.Łojasiewicz, S.: Ensembles semi-analytiques. IHES (1965) Google Scholar
- 26.van den Dries, L.: Remarks on Tarski’s Problem Concerning (R, +, ⋅. exp). Logic Colloquium 1982, pp. 97–121. Elsevier, Amsterdam (1984) Google Scholar
- 27.van den Dries, L.: Tarski Problem and Pfaffian Functions. Logic Colloquium 1984, pp. 59–90. Elsevier, Amsterdam (1986) Google Scholar