Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The `ε`-compression barrier.

Proved
ScanSchemeDecoding.ScanScheme.mean_decodeCost_ge_inv_two_mul

by raver1975 · Sep 12, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogalgebra

The ε-compression barrier. If the index is compressed to m ≤ ε · N buckets then the mean decoding cost is at least 1 / (2ε): buying a factor ε of space costs a factor 1/ε of time, with the exact constant 1/2.

theorem ScanSchemeDecoding.ScanScheme.mean_decodeCost_ge_inv_two_mul(eps : ℝ) (heps : 0 < eps)
    (hα : 0 < Fintype.card α) (hβ : 0 < Fintype.card β)
    (hcomp : (Fintype.card β : ℝ) ≤ eps * (Fintype.card α : ℝ)) :
    1 / (2 * eps) ≤ (∑ x, S.decodeCost x : ℝ) / (Fintype.card α : ℝ) := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/ScanSchemeDecoding/Epsilon.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Algebra/ScanSchemeDecoding/Epsilon.lean
import Mathlib
import Definitions.Def_Algebra_ScanSchemeDecoding_Core

/-!
# The `ε`-compression barrier for scan indices

The exact pigeonhole optimum of `Algebra.ScanSchemeDecoding.Triangle` is stated with the
*floor* `⌊N/m⌋`.  Here we sharpen it to a statement with genuine (real) division, which
is the form in which a space/time trade-off is usually quoted:

  `N * (N + m) ≤ 2 * m * triangleOpt N m`  (`triangleOpt_mul_ge`, an exact `ℕ` statement),

and deduce the analytic corollaries

* `mean_decodeCost_ge` — the mean decoding cost of any scan scheme is at least
  `(N/m + 1)/2`;
* `mean_decodeCost_ge_inv_two_mul` — the **`ε`-compression barrier**: a scheme whose
  index uses only `m ≤ ε · N` buckets has mean decoding cost at least `1/(2ε)`.

Both are sharp: for `m ∣ N` the residue scheme of `Algebra.ScanSchemeDecoding.Optimum`
meets the first bound with equality (`mean_decodeCost_modScheme_eq` for `m ∣ N`).
-/

open ScanSchemeDecoding

open Finset


open ScanScheme

variable {α β : Type*} [Fintype α] [LinearOrder α] [Fintype β] [DecidableEq β]
variable (S : ScanScheme α β)
Formal statement
theorem ScanSchemeDecoding.ScanScheme.mean_decodeCost_ge_inv_two_mul(eps : ℝ) (heps : 0 < eps)
    (hα : 0 < Fintype.card α) (hβ : 0 < Fintype.card β)
    (hcomp : (Fintype.card β : ℝ) ≤ eps * (Fintype.card α : ℝ)) :
    1 / (2 * eps) ≤ (∑ x, S.decodeCost x : ℝ) / (Fintype.card α : ℝ) := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Algebra/ScanSchemeDecoding/Epsilon.lean#L73

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