The admissible Borel hierarchy embedding conjecture
Statement
For a function with , define the classes recursively from clopen subsets of by taking unions at successor stages where has value , intersections at successor stages where has value , and unions over earlier stages at limit stages. Call admissible when its domain contains and and . For admissible and , write when there is a strictly increasing map such that for every . The classes satisfy .
Admissible Borel hierarchy embedding conjecture. It is relatively consistent with ZF that, for every pair of admissible functions and ,
This asserts that, consistently with ZF, inclusion among the corresponding transfinite Borel classes is characterized exactly by the embeddability relation on their defining binary sequences. The source presents relative consistency rather than an unconditional theorem, and gives no resolution of the consistency claim.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.