A finite-row approximate-harmonic contraction
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.pair_contractanalytic-combinatoricscontraction-recordslean4partitions-support
Finite-row deterministic contraction assuming overlap and approximate harmonicity; overlap/escape inputs for the actual partition kernel remain separate.
The full literal source contract is:
lemma pair_contract {u : ℕ → ℝ} {Q : ℕ → ℕ → ℝ} {i j : ℕ} {T : Finset ℕ} {δ η lo W : ℝ}
(hQi_m : ∑ k ∈ T, Q i k = 1) (hQj_m : ∑ k ∈ T, Q j k = 1)
(hov : δ ≤ ∑ k ∈ T, min (Q i k) (Q j k))
(hband : ∀ k ∈ T, lo ≤ u k ∧ u k ≤ lo + W) (hW : 0 ≤ W)
(hηi : |u i - ∑ k ∈ T, Q i k * u k| ≤ η)
(hηj : |u j - ∑ k ∈ T, Q j k * u k| ≤ η) :
|u i - u j| ≤ (1 - δ) * W + 2 * η
Preamble
import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # R7 Fact B via Doeblin: the pairwise oscillation contraction The core contraction step: two points `i, j` whose (iterated) transition laws `Q i ·`, `Q j ·` overlap by `≥ δ` over a common support `T`, and which are each `η`-approximately `Q`-harmonic, satisfy `|u i − u j| ≤ (1−δ)·W + 2η`, where `W` bounds the oscillation of `u` on `T` (via a band `[lo, lo+W]`). This is the deterministic heart of the renewal oscillation contraction; the `δ` comes from the finite-time Doeblin overlap (the remaining hard analytic input). Opus-authored. -/
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.pair_contract {u : ℕ → ℝ} {Q : ℕ → ℕ → ℝ} {i j : ℕ} {T : Finset ℕ} {δ η lo W : ℝ}
(hQi_m : ∑ k ∈ T, Q i k = 1) (hQj_m : ∑ k ∈ T, Q j k = 1)
(hov : δ ≤ ∑ k ∈ T, min (Q i k) (Q j k))
(hband : ∀ k ∈ T, lo ≤ u k ∧ u k ≤ lo + W) (hW : 0 ≤ W)
(hηi : |u i - ∑ k ∈ T, Q i k * u k| ≤ η)
(hηj : |u j - ∑ k ∈ T, Q j k * u k| ≤ η) :
|u i - u j| ≤ (1 - δ) * W + 2 * η := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).