The hod-pair capturing conjecture

Let obreakAD+ obreak\textsf{AD}^+ denote the strengthened axiom of determinacy, and let obreakNLE obreak\textsf{NLE} denote the no-long-extender assertion. Let obreakHPC obreak\textsf{HPC} denote hod-pair capturing: under obreakAD+ obreak\textsf{AD}^+, every Suslin and co-Suslin set of reals is first-order definable over (HC,Σ,)(HC,\Sigma,\in) for some hod pair (M,Σ)(\mathcal M,\Sigma). HPC conjecture. Assuming obreakAD++obreakNLE obreak\textsf{AD}^++ obreak\textsf{NLE}, obreakHPC obreak\textsf{HPC} holds. This is presented as a central open problem in descriptive inner model theory and, together with determinacy and V=L((R))V=L({\wp}(\mathbb R)), would imply the expected HOD analysis and GCH.

Sources & referencesView supporting material

Primary source

Grigor Sargsyan, “Generic Generators”, arXiv:2307.00109 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.