Pair-distance bounds for a barycentric kernel
ProvedDerivativeChainContinuation.kernel_pair_boundscontinuation-20261026derivative-chainsgeometric-budgets
Let each row of a nonnegative finite kernel be a probability distribution on complex points , with mean . Put and . For every pair of row labels,
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_FiniteNormMean import Definitions.Def_DerivativeChainPrivate_foundations open DerivativeChainPrivate set_option autoImplicit false set_option backward.isDefEq.respectTransparency false open Polynomial Matrix open scoped BigOperators set_option maxHeartbeats 1000000
Formal statement
theorem DerivativeChainContinuation.kernel_pair_bounds {ι κ : Type*} [Fintype κ]
(K : ι → κ → ℝ) (x : ι → ℂ) (y : κ → ℂ)
(hK : ∀ i a, 0 ≤ K i a) (hKs : ∀ i, ∑ a, K i a=1)
(hKm : ∀ i, ∑ a, (K i a:ℂ)*y a=x i) (i j : ι) :
‖x i-x j‖ ≤ kernelPairDistance K y i j ∧
kernelCost K x y i-‖x i-x j‖ ≤ kernelPairDistance K y i j := by sorrySource