ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a function f\requirementsymbolcolonδ→2f\requirementsymbolcolon\delta\to 2 with δ<ω1\delta<\omega_1, define the classes Γf\Gamma_f recursively from clopen subsets of 2ω2^\omega by taking unions at successor stages where ff has value 00, intersections at successor stages where ff has value 11, and unions over earlier stages at limit stages. Call ff admissible when its domain contains 00 and 11 and f(0)≠f(1)f(0)\neq f(1). For admissible ff and gg, write f⊴gf\unlhd g when there is a strictly increasing map π ⁣:dom⁡(f)→dom⁡(g)\pi\colon\operatorname{dom}(f)\to\operatorname{dom}(g) such that f(α)=g(π(α))f(\alpha)=g(\pi(\alpha)) for every α∈dom⁡(f)\alpha\in\operatorname{dom}(f). The classes satisfy f⊴g⇒Γf⊆Γgf\unlhd g\Rightarrow\Gamma_f\subseteq\Gamma_g.

Admissible Borel hierarchy embedding conjecture. It is relatively consistent with ZF that, for every pair of admissible functions ff and gg,

f⊴gif and only ifΓf⊆Γg.f\unlhd g\quad\text{if and only if}\quad\Gamma_f\subseteq\Gamma_g.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.