The covering-with-Chang-models conjecture

From papers

Assume obreakNLE obreak\textsf{NLE} and suppose there are unboundedly many Woodin cardinals and strong cardinals. Let obreakNLE obreak\textsf{NLE} denote the assertion that there is no active obreak\omega1+1 obreak\textsf{\omega}_1+1-iterable countable mouse or lbr mouse whose last extender is a long extender. Let obreakZFC-Powerset obreak\textsf{ZFC-Powerset} denote ZFC without the powerset axiom. Let obreakAD+ obreak\textsf{AD}^+ denote the strengthened axiom of determinacy, and let obreakColl(ω,<κ) obreak\textsf{Coll}(\omega,<\kappa) be the Levy collapse. If obreakκ obreak\kappa is a limit of Woodin cardinals and strong cardinals such that either obreakκ obreak\kappa is measurable or obreakcf(κ)=ω obreak\operatorname{cf}(\kappa)=\omega, then there is a transitive model MM of obreakZFC-Powerset obreak\textsf{ZFC-Powerset} satisfying: (1) obreakOrdM=κ+ obreak\operatorname{Ord}\cap M=\kappa^+; (2) MM has a largest cardinal obreakν obreak\nu; (3) for every generic obreakgColl(ω,<κ) obreak g\subseteq\operatorname{Coll}(\omega,<\kappa), defining obreakR=α<κRV[gColl(ω,α)] obreak\mathbb{R}^*=\bigcup_{\alpha<\kappa}\mathbb{R}^{V[g\cap\operatorname{Coll}(\omega,\alpha)]} and obreakΓ={AgR:α<κ(AΓgColl(ω,α))} obreak\Gamma^*=\{A^g\cap\mathbb{R}^*: \exists\alpha<\kappa\,(A\in\Gamma^\infty_{g\cap\operatorname{Coll}(\omega,\alpha)})\}, one has

L(M,α<ναω,Γ,R)AD+;L\left(M,\bigcup_{\alpha<\nu}\alpha^\omega,\Gamma^*,\mathbb{R}^*\right)\vDash\textsf{AD}^+;

and (4), if there is no inner model with a subcompact cardinal, then

L(M)ZFC+(ν)=(ν)M+ν.L(M)\vDash\textsf{ZFC}+{\wp}(\nu)={\wp}(\nu)^M+\square_\nu.

Covering with Chang Models conjecture. The asserted transitive model MM exists with all the listed properties. This conjecture is intended to overcome limitations of the core model induction and would yield consequences for the Proper Forcing Axiom, including an inner model with a subcompact cardinal. Its resolution status is not given in the supplied text.

Progress summary

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

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.