Metric Diagonal Selection
ProvedFunctionalInequalities.Analysis.exists_metric_diagonal_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This is a generic diagonal-selection theorem in a pseudometric space.
Let be a pseudometric space, let , let , and let . Assume that for every , as , and that as . Then there exists such that
This provides a reusable diagonalization tool for joint limiting constructions.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem exists_metric_diagonal {X : Type*} [PseudoMetricSpace X]
(G : ℕ → ℕ → X) (F : ℕ → X) (x : X)
(hrow : ∀ n : ℕ, Tendsto (G n) atTop (𝓝 (F n))) (houter : Tendsto F atTop (𝓝 x)) :
∃ k : ℕ → ℕ, (∀ n, n ≤ k n) ∧ Tendsto k atTop atTop ∧
Tendsto (fun n => G n (k n)) atTop (𝓝 x)
Module navigation
Module: Analysis/DiagonalSelector.
Source excerpt, lines 18–22 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_DiagonalSelector open Filter Topology
Formal statement
theorem FunctionalInequalities.Analysis.exists_metric_diagonal_readable {X : Type*} [PseudoMetricSpace X]
(G : ℕ → ℕ → X) (F : ℕ → X) (x : X)
(hrow : ∀ n : ℕ, Tendsto (G n) atTop (𝓝 (F n))) (houter : Tendsto F atTop (𝓝 x)) :
∃ k : ℕ → ℕ, (∀ n, n ≤ k n) ∧ Tendsto k atTop atTop ∧
Tendsto (fun n => G n (k n)) atTop (𝓝 x) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/DiagonalSelector.lean#L16-L43 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.DiagonalSelector`, declaration `FunctionalInequalities.Analysis.exists_metric_diagonal`; the repository is private at upload time).