OctoInformBeta

The geometric case of the Erdős similarity conjecture

Write mm for Lebesgue measure on ℝ\mathbb R. The dyadic sequence is D={2−n:n∈ℕ,n≥1}D=\{2^{-n}:n\in\mathbb N,\ n\ge1\}. For A⊆ℝA\subseteq\mathbb R, a nontrivial affine copy of AA is x+sA={x+sa:a∈A}x+sA=\{x+sa:a\in A\} with x∈ℝx\in\mathbb R and s∈ℝ\{0}s\in\mathbb R\setminus\{0\}. A set A⊆ℝA\subseteq\mathbb R is measure universal if every Lebesgue measurable subset of ℝ\mathbb R of positive measure contains a nontrivial affine copy of AA. The similarity conjecture posed by Erdős asserts that no infinite subset of ℝ\mathbb R is measure universal.

Bourgain proved that a sum of three infinite sets is not measure universal. Kolountzakis proved nonuniversality for sums of two copies of certain sequences, including D+DD+D. Mora Cuéllar, Iosevich, Kulkarni, Rojas Aravena and Yavicoli proved nonuniversality for the sum or difference of a nonconstant geometric sequence tending to zero and an arbitrary infinite set.

The preprint proves that for every η∈(0,1)\eta\in(0,1) there is a compact set Eη⊆[0,1]E_\eta\subseteq[0,1] with m(Eη)>1−ηm(E_\eta)>1-\eta such that x+sD⊈Eηx+sD\nsubseteq E_\eta for every x∈ℝx\in\mathbb R and every s∈ℝ\{0}s\in\mathbb R\setminus\{0\}.

The Lean library DyadicAvoidance formalizes the dyadic avoidance construction. Lean has checked every result of the Lean library, so the Lean library is the reference for the statements on these pages. Each result on these pages is stated as it is in the Lean library and linked to its statement there. Where the preprint states a result differently, the statement on the page is the Lean library’s, with the preprint’s statement beside it. The preprint serves only as a guide to the order and names of the results.

The Lean library: DyadicAvoidance

DyadicAvoidance is a Lean library: 17 items, in six groups. Each has a page written by OctoInform, listed below.

§1. Introduction 2 items
  1. §1 (setting): affine dyadic copies The reference points for affine copies.
  2. Theorem 1.1 [Compact avoidance of every signed affine dyadic copy] Large compact sets can avoid dyadic copies.
§2. The periodic hitting problem 2 items
  1. §2 (setting): periodicity and density Measuring sets within one period.
  2. Lemma 2.1 [Periodic hitting sets] Sparse periodic sets hit dyadic sequences.
§3. Separated index windows 3 items
  1. §3 (setting): the finite ordered tree, parameter budgets, and windows Separated index windows for ordered trees.
  2. §3 (setting): dyadic keys and stable centers Dyadic indices refine across nested grids.
  3. Lemma 3.1 [Spatial stability of earlier grid keys] Separated windows preserve earlier grid indices.
§4. Random routing and independent tests 5 items
  1. §4 (setting): selector tables, terminal tables, and the routed set Independent terminal labels fix the expected density.
  2. §4 (setting): full center exposure, first default, and local predicates A good exposure fixes the first default.
  3. Lemma 4.1 [A default choice on the center path] Default avoidance has an exact probability.
  4. Lemma 4.2 [Preservation of the route] Earlier test agreement preserves route prefixes.
  5. Lemma 4.3 [The fixed-scale estimate] Local misses have an exact fixed-scale mass.
§5. All normalized scales and all centers 4 items
  1. Lemma 5.1 [Finite representatives for all local scale tests] Finitely many scales represent every local test.
  2. Proposition 5.2 [Raw failure estimate; weaker concrete Lean event] Small failure probability at stable centers.
  3. §5 (setting): exceptional centers for an open enlargement Repairing exceptional centers along vanishing sequences.
  4. §5 (completion of Lemma 2.1): open enlargement, expectation, and repair Repairing random blockers into open hitting sets.
§6. The compact avoiding set 1 item
  1. §6 (proof of Theorem 1.1): summable signed dyadic dilations From normalized hitting to compact avoidance.

No item matches.