Embedding FD(ω) into Ps densely
Abstract
Let Ps be the lattice of degrees of non-empty 10 subsets of 2ω under Medvedev reducibility. Binns and Simpson proved that FD(ω), the free distributive lattice on countably many generators, is lattice-embeddable below any non-zero element in Ps. Cenzer and Hinman proved that Ps is dense, by adapting the Sacks Preservation and Sacks Coding Strategies used in the proof of the density of the c.e.\ Turing degrees. With a construction that is a modification of the one by Cenzer and Hinman, we improve on the result of Binns and Simpson by showing that for any U <s V, we can lattice embed FD(ω) into Ps strictly between degs(U) and degs(V). We also note that, in contrast to the infinite injury in the proof of the Sacks Density Theorem, in our proof all injury is finite, and that this is also true for the proof of Cenzer and Hinman, if a straightforward simplification is made.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.