Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, Theorem — restriction of a reproducing kernel to a subset

Proved
AronszajnRK.Product.restriction_theorem

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1reproducing-kernelsrkhs

Let KKK be the reproducing kernel of a class FFF of complex-valued functions on a set EEE with norm ∥⋅∥\|\cdot\|∥⋅∥, and let E1⊆EE_1 \subseteq EE1​⊆E. Then the restriction of KKK to E1×E1E_1 \times E_1E1​×E1​ is the reproducing kernel of the class F1F_1F1​ of all restrictions f∣E1f|_{E_1}f∣E1​​, f∈Ff \in Ff∈F, and for every f1∈F1f_1 \in F_1f1​∈F1​

∥f1∥1=min⁡{ ∥f∥:f∈F, f∣E1=f1 },\|f_1\|_1 = \min \{\, \|f\| : f \in F,\ f|_{E_1} = f_1 \,\},∥f1​∥1​=min{∥f∥:f∈F, f∣E1​​=f1​},

the minimum being attained.

Applied with E×EE \times EE×E and its diagonal, this yields the class and norm belonging to the product kernel in §8, Theorem II.

Formalization Note The statement asserts that a reproducing-kernel Hilbert space on E1E_1E1​ with kernel K∣E1×E1K|_{E_1 \times E_1}K∣E1​×E1​​ exists, and that every such space has exactly the restrictions as its functions and the attained minimum as its norm (by the uniqueness of the space with a given kernel this is the paper's statement). The norm is not squared.

Preamble
import Mathlib
import Definitions.Def_AronszajnRK_Product_kernelFn
Formal statement
namespace AronszajnRK.Product

universe u v w

/-- N. Aronszajn, *Theory of Reproducing Kernels*, Trans. Amer. Math. Soc. 68 (1950), §5,
Theorem, p. 351 (PDF p. 15). If `K` is the reproducing kernel of the class `F` (the RKHS `H`)
of functions on `X`, then `K` restricted to a subset `E₁ ⊆ X` is the reproducing kernel of the
class `F₁` of all restrictions to `E₁` of functions of `F`, and for each such restriction `f₁`,
`‖f₁‖₁` is the minimum of `‖f‖` over all `f ∈ F` whose restriction to `E₁` is `f₁`.
Stated as: an RKHS on `E₁` with the restricted kernel exists, and every RKHS on `E₁` with the
restricted kernel has exactly the restrictions as its functions and the attained minimum as
its norm. -/
theorem restriction_theorem {X : Type u} (H : Type v) [NormedAddCommGroup H]
    [InnerProductSpace ℂ H] [CompleteSpace H] [RKHS ℂ H X ℂ] (E₁ : Set X) :
    (∃ (H₁ : Type u) (_ : NormedAddCommGroup H₁) (_ : InnerProductSpace ℂ H₁)
        (_ : CompleteSpace H₁) (_ : RKHS ℂ H₁ E₁ ℂ),
        ∀ x y : E₁, kernelFn H₁ x y = kernelFn H (x : X) (y : X)) ∧
    ∀ (H₁ : Type w) [NormedAddCommGroup H₁] [InnerProductSpace ℂ H₁] [CompleteSpace H₁]
        [RKHS ℂ H₁ E₁ ℂ], (∀ x y : E₁, kernelFn H₁ x y = kernelFn H (x : X) (y : X)) →
      Set.range (fun f₁ : H₁ => (⇑f₁ : E₁ → ℂ)) =
          {φ : E₁ → ℂ | ∃ f : H, φ = fun x : E₁ => f (x : X)} ∧
      ∀ f₁ : H₁, IsLeast
        {r : ℝ | ∃ f : H, (fun x : E₁ => f (x : X)) = (⇑f₁ : E₁ → ℂ) ∧ r = ‖f‖} ‖f₁‖ := by sorry

end AronszajnRK.Product
Source
Aronszajn, Theory of Reproducing Kernels, Trans. Amer. Math. Soc. 68 (1950), p. 351, §5, Theorem
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 2026

    Confirmed by the mission captain (proposal self-audit).

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