Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Slices: AK(α)\mathrm{AK}(\alpha)AK(α) lower-bounds Kakeya Hausdorff dimension

Open
ArithmeticKakeya.slices_dimension_bound

by LG · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsharmonic-analysiskakeya

If AK(α)\mathrm{AK}(\alpha)AK(α) holds with α>0\alpha>0α>0, then every bounded Kakeya set E⊂RdE\subset\mathbb R^dE⊂Rd (d≥2d\ge2d≥2) has Hausdorff dimension at least α−1d+1−α−1\alpha^{-1}d+1-\alpha^{-1}α−1d+1−α−1. This is Bourgain's method of slices, upgraded to Hausdorff dimension via Leng–Sah–Sawhney. It reuses the platform definition FCP.Kakeya.IsKakeya and adds the source's boundedness hypothesis; the dimension is dimH.

Preamble
import Mathlib
import Definitions.Def_ArithmeticKakeya_ak
import Definitions.Def_FCP_Kakeya
Formal statement
namespace ArithmeticKakeya
open MeasureTheory
theorem slices_dimension_bound
    (α : ℝ) (hα : 0 < α) (hAK : AK α) (d : ℕ) (hd : 2 ≤ d)
    (E : Set (EuclideanSpace ℝ (Fin d)))
    (hE : FCP.Kakeya.IsKakeya E) (hbd : Bornology.IsBounded E) :
    ENNReal.ofReal (α⁻¹ * (d : ℝ) + 1 - α⁻¹) ≤ dimH E := by sorry
end ArithmeticKakeya
Source
https://epoch.ai/frontiermath/open-problems/arithmetic-kakeya (Theorem 1); Bourgain's method of slices + Leng–Sah–Sawhney
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me