A finite overlap lower bound from a common dominated function
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.overlap_ge_of_common_submeasureanalytic-combinatoricscoupling-overlaplean4partitions-remainder
Let be finite, , and . If and for all , and , then
There is no nonnegativity premise on or either row.
This support estimate carries the following complete literal source contract:
lemma overlap_ge_of_common_submeasure
{κ : ℕ → ℕ → ℝ} {S : Finset ℕ} {lam : ℕ → ℝ} {n n' : ℕ} {δ : ℝ}
(hn : ∀ z ∈ S, lam z ≤ κ n z) (hn' : ∀ z ∈ S, lam z ≤ κ n' z)
(hmass : δ ≤ ∑ z ∈ S, lam z) :
δ ≤ ∑ z ∈ S, min (κ n z) (κ n' z)
Preamble
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# TASK T2-value, brick 2.0: the common-submeasure overlap bridge
The variable rank-band engine (`hitVal_cauchy_of_ceilBand_overlap_escape_variable`,
`RankBandEntrance.lean`) consumes a **value-level** overlap
`δ ≤ ∑_{z ∈ slice} min (κ n z) (κ n' z)`. The banked `overlap_ge_of_minorization`
(`RenewalOverlap.lean`) derives this from a *single-state* minorization `κ n z ≥ η` on a fixed
finite set `S`, which is FALSE for a growing band (the first-entrance landing law spreads over the
whole band, so the per-state mass `max_z κ n z → 0`).
This brick generalizes that bridge: instead of a per-state floor, it consumes a *common submeasure*
`lam : ℕ → ℝ`, a nonnegative function dominated pointwise by *both* kernels on the slice, and
returns `∑ lam ≤ ∑ min`. The common mass may be spread arbitrarily over the growing band; only its
total `∑ lam ≥ δ` needs to stay uniform. Trivial: `min (κ n z) (κ n' z) ≥ lam z` pointwise on the
slice, then sum.
NEW file; imports nothing from the banked partition bricks (pure Finset algebra). Opus-authored.
-/
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.overlap_ge_of_common_submeasure
{κ : ℕ → ℕ → ℝ} {S : Finset ℕ} {lam : ℕ → ℝ} {n n' : ℕ} {δ : ℝ}
(hn : ∀ z ∈ S, lam z ≤ κ n z) (hn' : ∀ z ∈ S, lam z ≤ κ n' z)
(hmass : δ ≤ ∑ z ∈ S, lam z) :
δ ≤ ∑ z ∈ S, min (κ n z) (κ n' z) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).