OpenFrontiers
← Back to the index
OP-11832Status unassessedLogic and foundations

Forcing models satisfying the genericity property — Problem 8.1

Forcing models satisfying the genericity property — Problem 8.1. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

Editorial MSC2020 mapping of Forcing models satisfying the genericity property — Problem 8.1. https://arxiv.org/html/2608.26628v2#S8.Thmproblem1 Not an author-supplied code.

Licensed source statementAs of 2608.26628v2; current status unassessedSource & evidence ↓

Problem statement

Problem 8.1.

Find more models MM and forcing notions P∈M\mathbb{P}\in M such that (∗)(*) is true.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  1. Hang Zhang

The following questions are motivated by the problem whether hyper-hyperfiniteness implies hyperfiniteness.

Let MM be a countable model for a sufficiently large fragment of ZFC. Suppose that a partial order PP is in MM. Define the space GenMPGen^{P}_{M} of MM-generics for PP by

GenMP={G⊆P:G is an P-generic filter over M}.Gen^{P}_{M}=\{G\subseteq P:G\text{ is an }P\text{-generic filter over }M\}.

If we identify GenMPGen^{P}_{M} as a subspace of 2P2^{P} with the product topology, then GenMPGen^{P}_{M} is GδG_{\delta} in 2P2^{P} and thus a Polish space. See [1] for details. Define G∼HG\sim H if and only if M[G]=M[H]M[G]=M[H]. Consider the equivalence relation ∼\sim on GenMPGen^{P}_{M}.

Example 8.1.

(Calderoni–Sinapova [2]) Let MM be a countable model for large fragment ZFC. Suppose M⊨κM\models\kappa is measurable (witnessed by U\mathcal{U}). If M⊨P={(s,A):s=⟨s0,…,sn⟩, n∈ω, A∈U}M\models\mathbb{P}=\{(s,A):s=\langle s_{0},\dots,s_{n}\rangle,\ n\in\omega,\ A\in\mathcal{U}\}, with order (s,A)≤(t,B)  ⟺  t⊆s∧s∖t⊆B∧A⊆B(s,A)\leq(t,B)\iff t\subseteq s\land s\setminus t\subseteq B\land A\subseteq B. Then for any generic sequences α⃗,β⃗\vec{\alpha},\vec{\beta} of P\mathbb{P} over MM,

M[α⃗]=M[β⃗]  ⟺  ∃N ∀n>N  α(n)=β(n).M[\vec{\alpha}]=M[\vec{\beta}]\iff\exists N\ \forall n>N\ \ \alpha(n)=\beta(n).

Remark 8.2 ([1, Theorem 3.1]).

If P=C\mathbb{P}=\mathbb{C} (Cohen forcing), then ”x∼y  ⟺  M[x]=M[y]x\thicksim y\iff M[x]=M[y]” is hyper-hyperfinite.

Remark 8.3.

If

⟨0,⋯ ,0,1,0,⋯ ,0,1,1,0⋯ ⟩\langle 0,\cdots,0,1,0,\cdots,0,1,1,0\cdots\rangle

is Cohen, then

⟨1,⋯ ,1,0,1,⋯ ,1,0,0,1⋯ ⟩\langle 1,\cdots,1,0,1,\cdots,1,0,0,1\cdots\rangle

is also Cohen. Notice that these two Cohen reals lead to the same forcing extension. So Cohen forcing does not satisfy (*) for any MM.

Progress & source assessment

Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

References
  1. [1]Barmpalias, George; Gao, Su; He, Jialiang; Kihara, Takayuki; Nies, Andre; Slaman, Theodore; Tran, Chieu-Minh; Turetsky, Daniel; Welch, Philip; Yu, Liang; Zhang, Hang. Tianyuan Workshop — Open Problems in Mathematical Logic (2026).; Forcing models satisfying the genericity property — Problem 8.1 linkhttp://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.