A conditional partition-limit reduction from center tracking
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.erdos_partition_limit_exists_of_center_trackinganalytic-combinatoricsconditional-limitslean4partitions-remainder
Let , with the source partition count and . The source kernel, rank and killed hit-value constructions are those defined below. Assume that for all sufficiently large cutoffs there exist functions such that , , and
Then
This implication retains the entire tracking hypothesis; it does not construct its witnesses.
This conditional reduction carries the following complete literal source contract:
theorem erdos_partition_limit_exists_of_center_tracking
(hdata : ∀ᶠ J : ℕ in atTop,
∃ c V : ℕ → ℝ,
Tendsto V atTop (𝓝 0) ∧
Summable (fun R => |c (R + 1) - c R|) ∧
(∀ n, |hitVal Pker rnk J u n - c (rnk n)| ≤ V (rnk n))) :
∃ a : ℝ, 0 < a ∧ Tendsto u atTop (𝓝 a)
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_RenewalHitPot
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_SigmaRecurrence
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_UpperBound
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_ErdosKernel
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_KernelBarriers
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_PartitionRenewal
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# hhit via center-tracking: the gap-isolating interface
This is a *structural* brick, NOT a closure of `hhit`. It packages the §9 convergence engine
`tendsto_of_center_tracking` for the concrete killed-harmonic hit value `hitVal Pker rnk J u`, so that
the remaining analytic content is exactly the explicit hypothesis `hdata`:
for cofinitely many cutoffs `J`, there exist a center sequence `c` and a tracking bound `V` with
* `V → 0` (the *tracking* error — may be only polynomial, e.g. `R^{-1/2}`),
* `∑_R |c(R+1) − c R| < ∞` (the *center links* — must be summable), and
* `|hitVal_J(n) − c(rnk n)| ≤ V(rnk n)`.
The design audit (ChatGPT R1/R2, 2026-06-13) established that the coupling/FK route supplies the
*tracking* bound at a polynomial (non-summable) rate, while the *summable center links* require a
separate finite-boundary renewal / kernel-gradient estimate that is NOT derivable from the banked
first-moment drift `muTilde_two_term`. This interface isolates that single remaining input.
-/
open Filter Topology
open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Erdos
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.erdos_partition_limit_exists_of_center_tracking
(hdata : ∀ᶠ J : ℕ in atTop,
∃ c V : ℕ → ℝ,
Tendsto V atTop (𝓝 0) ∧
Summable (fun R => |c (R + 1) - c R|) ∧
(∀ n, |hitVal Pker rnk J u n - c (rnk n)| ≤ V (rnk n))) :
∃ a : ℝ, 0 < a ∧ Tendsto u atTop (𝓝 a) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).