Conditional coalescence from uniform drop-set hitting
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.umass_tendsto_zero_of_uniform_drop_hitanalytic-combinatoricscoupling-hittinglean4partitions-support
Carries a uniform drop-set hitting lower bound for the free residual chain. It does not prove that bound for frozen-apart starts.
The full literal source contract is:
theorem umass_tendsto_zero_of_uniform_drop_hit (i j : α)
(δ p0 : ℝ) (hδ : 0 < δ) (hp0 : 0 < p0)
(M : ℕ) (hM : 0 < M)
(hhit :
∀ xy, p0 ≤ hitProb (KhatResPair P rnk W) (dropSet P rnk W δ) M xy) :
Tendsto (fun t => umass P rnk W i j t) atTop (𝓝 0)
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_FKHittingBridge
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_ITERCoupling
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_FKPartitionHitting
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_KhatRes
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Partition FK hitting bridge
This file packages the concrete drop-set interface for the partition residual
coupling: a uniform free-`KhatRes` hitting lower bound for
`{xy | δ ≤ cmass xy}` implies `umass → 0`.
-/
open Filter Topology
open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Erdos
variable {α : Type*} [Fintype α] [DecidableEq α]
variable (P : α → α → ℝ) (rnk : α → ℕ) (W : ℕ)
variable (hPnn : ∀ x y, 0 ≤ P x y) (hPmass : ∀ x, ∑ y, P x y = 1)
include hPnn hPmass
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.umass_tendsto_zero_of_uniform_drop_hit (i j : α)
(δ p0 : ℝ) (hδ : 0 < δ) (hp0 : 0 < p0)
(M : ℕ) (hM : 0 < M)
(hhit :
∀ xy, p0 ≤ hitProb (KhatResPair P rnk W) (dropSet P rnk W δ) M xy) :
Tendsto (fun t => umass P rnk W i j t) atTop (𝓝 0) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).