Open AccessKatetov’s problem
Author(s) -
Paul B. Larson,
Stevo Todorčević
Publication year - 2001
Publication title -
transactions of the american mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.798
H-Index - 100
eISSN - 1088-6850
pISSN - 0002-9947
DOI - 10.1090/s0002-9947-01-02936-1
Subject(s) - algorithm , annotation , computer science , artificial intelligence , type (biology) , mathematics , database , biology , ecology
In 1948 Miroslav Katětov showed that if the cube X 3 X^{3} of a compact space X X satisfies the separation axiom T 5 _{5} then X X must be metrizable. He asked whether X 3 X^{3} can be replaced by X 2 X^{2} in this metrization result. In this note we prove the consistency of this implication.