Borel two-point sets — Problem 5.1
Borel two-point sets — Problem 5.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 Borel two-point sets — Problem 5.1. https://arxiv.org/html/2608.26628v2#S5.Thmproblem1 Not an author-supplied code.
Problem statement
Problem 5.1.
Is there a Borel two-point set?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- Jialiang He
These notes concern two related definability questions in infinite combinatorics and Borel model theory.
Definition 5.1.
A set is called a two-point set, if for every line ,
Theorem 5.2 (Larman [1]).
There is no two-point set.
Since every set is Borel, Larman’s theorem rules out the lowest nontrivial possibility in the Borel hierarchy, but it does not settle the following problem.
Miller showed that, assuming Gödel’s axiom of constructibility , there is a , i.e., coanalytic two-point set [2].
Definition 5.3.
A standard Borel space is a measurable space isomorphic to the Borel space of a Polish space. A Borel field is a field whose universe is a standard Borel space and whose field operations are Borel.
Definition 5.4.
Let be a Borel field. A Borel algebraically closed extension of is a Borel field , together with a Borel injective field homomorphism
such that is algebraically closed.
Progress & source assessment
Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
- [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).; Borel two-point sets — Problem 5.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 recordedAttempts 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 notesNotes 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.