Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pointwise evaluation bound on the span of kernel sections (Cauchy-Schwarz)

Disproved
HighDimStat.Rkhs.reproducing_bound

by junyihjy · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysishighdimstatreproducing-kernelrkhssource-faithful-child

Decomposition of HighDimStat.Rkhs.thm12_11_moore_aronszajn (Wainwright, Theorem 12.11), step 2. Pointwise evaluation bound on the span of kernel sections: for f = ∑ᵢ cᵢK(·,xᵢ), |f z| ≤ √(K z z) · √(Gram sum), the Cauchy-Schwarz corollary of the pre-inner product. Hence point evaluation z ↦ f z is continuous for the pre-inner-product norm, so it extends to the completion — the reproducing property (12.3) of Theorem 12.11.

Preamble
import Mathlib

namespace HighDimStat.Rkhs

/-- A kernel `K` on `X` is positive semidefinite: every finite Gram matrix is PSD. -/
def IsPSDKernel {X : Type} (K : X → X → ℝ) : Prop :=
  ∀ (n : ℕ) (x : Fin n → X) (c : Fin n → ℝ),
    0 ≤ Finset.sum Finset.univ (fun i =>
      Finset.sum Finset.univ (fun j => c i * c j * K (x i) (x j)))

end HighDimStat.Rkhs
Formal statement
namespace HighDimStat.Rkhs

/-- Step 2 of the Moore-Aronszajn construction: the pointwise evaluation bound on
    the span of kernel sections. For `f` a finite linear combination of the
    kernel sections `K · (x i)` one has `|f z| ≤ sqrt (K z z) * sqrt (Gram sum)`,
    the Cauchy-Schwarz corollary that
    makes point evaluation continuous for the pre-inner-product norm. -/
theorem reproducing_bound {X : Type} (K : X → X → ℝ) (hK : IsPSDKernel K) :
    ∀ (n : ℕ) (x : Fin n → X) (c : Fin n → ℝ) (z : X),
      abs (Finset.sum Finset.univ (fun i => c i * K z (x i))) ≤
        Real.sqrt (K z z) *
          Real.sqrt (Finset.sum Finset.univ (fun i =>
            Finset.sum Finset.univ (fun j => c i * c j * K (x i) (x j)))) := by
  sorry

end HighDimStat.Rkhs
Source
Wainwright, High-Dimensional Statistics, CUP 2019, p. 389 (PDF p. 409), Theorem 12.11, Eq. (12.3)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me