Dense-set dependence in the Katětov order for uncountable coordinate ideals
Xing-Yu Hu, Zhang-Yi Luo
Abstract
For each countable ordinal α≥ 2, Filipów, Kowalczuk and Kwela introduced an ideal convα on the countable compact ordinal space ωα+1. Kowalczuk later proved that, for each countable limit ordinal λ, the ideal conv<λ is the greatest lower bound of \convβ:β<λ\ in the Katětov order. At the first uncountable level, let A⊂eq[2,ω1) be uncountable and let D be a countable dense subset of XA=Πα∈ A(ωα+1). The coordinate ideal Conv(A,D) on D consists of those B⊂eq D with πα[B]∈convα for every α∈ A. For a pair D⊂eq E of countable dense sets, call α non-small if πα[E D]convα. In ZFC, if at most countably many coordinates are non-small, then Conv(A,D)KConv(A,E). Under CH this countability bound is sharp: for every A⊂eq[3,ω1) with |A|=1, there are countable dense sets D⊂eq D*⊂eq XA such that Conv(A,D*)≤KConv(A,D) but Conv(A,D)≤KConv(A,D*), and in particular Conv(A,D) and Conv(A,D*) are not Katětov equivalent. The non-reduction is obtained, under CH, by diagonalizing along ω1 coordinates against the elements of ωω that code retractions D* D.
Create a lesson
Related papers
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski
Coding is non-robust
Sam Sanders
Scott topologies on products of countable complete Heyting algebras
Xiaoquan Xu
1-genericity and almost everywhere domination
Xuanheng Zhao
Almost-everywhere computation of weak generics relative to r.e. sets
Xuanheng Zhao
On definable Galois theory and definable Galois cohomology in the totally transcendental setting
David Meretzky