Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exponential load bound for the exact threshold parameters

Proved
NarrowDNF.HatamiParameters.loadExpression_le_exp

by chenghua.liu · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

For real e>0e>0e>0 and k≥1k\ge1k≥1 satisfying e−1≤ke^{-1}\le ke−1≤k, set δ=2−100k2\delta=2^{-100k^2}δ=2−100k2 and η=3−10k2e10k\eta=3^{-10k^2}e^{10k}η=3−10k2e10k. The threshold-family load expression obeys

k22kδη2≤exp⁡(10000k2).\frac{k2^{2k}}{\delta\eta^2}\le\exp(10000k^2).δη2k22k​≤exp(10000k2).

This numerical lemma preserves both of the source parameter definitions and converts the multiplicity load estimate into a single exponential in the squared degree cutoff. At k=1000C/ak=1000C/ak=1000C/a and e=a/1000e=a/1000e=a/1000, its exponent becomes 1010C2/a210^{10}C^2/a^21010C2/a2.

Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.GCongr
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_HatamiParameters

namespace NarrowDNF.HatamiParameters
end NarrowDNF.HatamiParameters
noncomputable section
open NarrowDNF
open NarrowDNF.HatamiParameters
Formal statement
theorem NarrowDNF.HatamiParameters.loadExpression_le_exp {e0 k : ℝ} (he0 : 0 < e0) (hk1 : 1 ≤ k)
    (hk : e0⁻¹ ≤ k) : loadExpression k e0 ≤ Real.exp (10000*k^2) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/HatamiParameters.lean#L27-L53

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