ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A Suslin ccc poset is a poset that is Suslin and satisfies the countable chain condition. It is correctness preserving if, whenever ⟨\mathdsP0,\mathdsP1,\mathdsQ0,\mathdsQ1⟩\langle\mathds{P}_0,\mathds{P}_1,\mathds{Q}_0,\mathds{Q}_1\rangle is a correct diagram, the diagram

⟨\mathdsP0∗\mathdsS˙V\mathdsP0,\mathdsP1∗\mathdsS˙V\mathdsP1,\mathdsQ0∗\mathdsS˙V\mathdsQ0,\mathdsQ1∗\mathdsS˙V\mathdsQ1⟩\langle\mathds{P}_0\ast\dot{\mathds{S}}^{V^{\mathds{P}_0}},\mathds{P}_1\ast\dot{\mathds{S}}^{V^{\mathds{P}_1}},\mathds{Q}_0\ast\dot{\mathds{S}}^{V^{\mathds{Q}_0}},\mathds{Q}_1\ast\dot{\mathds{S}}^{V^{\mathds{Q}_1}}\rangle

is also correct. Brendle's conjecture. Every Suslin ccc poset is correctness preserving. This property determines which definable Suslin ccc posets can be used in template iterations. The examples presented in the paper are proved to be correctness preserving, but no example of a Suslin ccc poset that is not correctness preserving is known.

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.