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

Minimal subsets of Borel Kakeya sets — Problem 4.2

Minimal subsets of Borel Kakeya sets — Problem 4.2. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

Editorial MSC2020 mapping of Minimal subsets of Borel Kakeya sets — Problem 4.2. https://arxiv.org/html/2608.26628v2#S4.Thmproblem2 Not an author-supplied code.

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

Problem statement

Problem 4.2.

Does every Borel Kakeya set AA contain a minimal Kakeya set B⊆AB\subseteq A?

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. Liang Yu

A set A⊆R2A\subseteq\mathbb{R}^{2} is called a Kakeya set if, for every α∈R\alpha\in\mathbb{R}, there exists Cα∈RC_{\alpha}\in\mathbb{R} such that

y=αx+Cα⟹(x,y)∈Ay=\alpha x+C_{\alpha}\quad\Longrightarrow\quad(x,y)\in A

for every (x,y)∈R2(x,y)\in\mathbb{R}^{2}. Equivalently,

{(x,y)∈R2:y=αx+Cα}⊆A\bigl\{(x,y)\in\mathbb{R}^{2}:y=\alpha x+C_{\alpha}\bigr\}\subseteq A

for every α∈R\alpha\in\mathbb{R}.

A Kakeya set AA is called minimal if every proper subset B⊊AB\subsetneq A is not a Kakeya set.

Yinghe Peng has shown that there is a full fine Kakeya set which contains no minimal Kakeya set.

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).; Minimal subsets of Borel Kakeya sets — Problem 4.2 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.