← All problems

Erné’s chain-continuity and interpolation questions

Let PP be a dcpo. For x,y∈Px,y\in P, define x≪Cyx\ll_{\mathcal C}y to mean that for every chain C⊆PC\subseteq P, y≤sup⁡Cy\leq\sup C implies that there exists c∈Cc\in C with x≤cx\leq c. Call PP chain-continuous if every y∈Py\in P satisfies y=sup⁡{x∈P:x≪Cy}y=\sup\{x\in P:x\ll_{\mathcal C}y\}, and call PP continuous if every y∈Py\in P satisfies y=sup⁡{x∈P:x≪y}y=\sup\{x\in P:x\ll y\}, where ≪\ll is the way-below relation defined using directed subsets. The problem asks whether every chain-continuous dcpo is continuous; more precisely, whether every such PP satisfies ≪=(≪C)2\ll=(\ll_{\mathcal C})^2, i.e. for all x,y∈Px,y\in P, x≪yx\ll y if and only if there exists z∈Pz\in P such that x≪Cz≪Cyx\ll_{\mathcal C}z\ll_{\mathcal C}y.

References

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to settle several approximation questions in domain theory, but its conclusions have not been independently checked.

Erné’s questions concern whether chain-based approximation suffices for continuity and interpolation in domain theory. The preprint claims affirmative and negative answers to the respective questions.

October 2026 reported preprint

The paper claims every chain-continuous dcpo is continuous, with ≪=(≪C)2=(≪C)n\ll=(\ll_{\mathcal C})^2=(\ll_{\mathcal C})^n for every n≥2n\ge 2. It also claims counterexamples to associated Scott-closed interpolation questions, including a countably based, completely distributive, algebraic lattice where Scott-closed approximation does not interpolate. The source is an unrefereed preprint, with no independent verification or correction found.

Current status (as of October 2026): The preprint claims the chain-continuity question and associated interpolation questions are settled, but these results remain unverified.

Sources

Solutions 0

No solutions have been posted yet.