Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§7, Theorem II — a contractively included Hilbert subclass has a kernel K1≪KK_1 \ll KK1​≪K

Proved
AronszajnRK.Inclusion.kernel_of_contractive_subclass

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 functions on XXX with norm ∥⋅∥\|\cdot\|∥⋅∥. Suppose the linear class F1⊂FF_1\subset FF1​⊂F forms a complex Hilbert space with a norm ∥⋅∥1\|\cdot\|_1∥⋅∥1​ such that

∥f1∥1 ≥ ∥f1∥for every f1∈F1.\|f_1\|_1 \ \ge\ \|f_1\| \qquad\text{for every } f_1\in F_1 .∥f1​∥1​ ≥ ∥f1​∥for every f1​∈F1​.

Then F1F_1F1​ possesses a reproducing kernel K1K_1K1​, that is, functions K1(⋅,y)∈F1K_1(\cdot,y)\in F_1K1​(⋅,y)∈F1​ with f1(y)=(f1,K1(⋅,y))1f_1(y) = (f_1, K_1(\cdot,y))_1f1​(y)=(f1​,K1​(⋅,y))1​ for all f1∈F1f_1\in F_1f1​∈F1​ and y∈Xy\in Xy∈X, and this kernel satisfies K1≪KK_1\ll KK1​≪K.

This is the necessity half of the inclusion criterion for contractive inclusions; with Theorem I of §7 it characterizes the contractively included subclasses by the order ≪\ll≪.

Formalization Note F1F_1F1​ is not assumed to have a reproducing kernel (that is the conclusion): it is an abstract complex Hilbert space H1H_1H1​ with an injective linear map ι\iotaι into functions on XXX, every ιf1\iota f_1ιf1​ being a function of FFF. With Mathlib's convention (inner product conjugate-linear in the first slot) the reproducing property is ⟨k1(y),f1⟩=(ιf1)(y)\langle k_1(y), f_1\rangle = (\iota f_1)(y)⟨k1​(y),f1​⟩=(ιf1​)(y), and K1(x,y)=(ι k1(y))(x)K_1(x,y) = (\iota\, k_1(y))(x)K1​(x,y)=(ιk1​(y))(x).

Preamble
import Mathlib
import Definitions.Def_AronszajnRK_Sum_kernelFn
import Definitions.Def_AronszajnRK_Limits_KernelLE
Formal statement
namespace AronszajnRK.Inclusion

/-- Aronszajn, *Theory of Reproducing Kernels*, Trans. Amer. Math. Soc. 68 (1950), §7, Theorem II,
p. 355 (PDF p. 19). If `K` is the reproducing kernel of the class `F` with the norm `‖ ‖`, and if
the linear class `F₁ ⊂ F` forms a Hilbert space with the norm `‖ ‖₁` such that `‖f₁‖₁ ≥ ‖f₁‖` for
every `f₁ ∈ F₁`, then `F₁` possesses a reproducing kernel `K₁` satisfying `K₁ ≪ K`.

`F₁` is not assumed to be an RKHS: it is a complex Hilbert space `H₁` realized as a class of
functions by an injective linear map `ι : H₁ → (X → ℂ)` with values in `F`. The conclusion gives
the kernel functions `k₁ y = K₁(·, y) ∈ F₁` with the reproducing property
`f₁(y) = (f₁, K₁(·, y))₁` (Mathlib's inner product is conjugate-linear in the first slot, so this is
`⟪k₁ y, f₁⟫_ℂ = ι f₁ y`) and `K₁(x, y) = ι (k₁ y) x` with `K₁ ≪ K`. -/
theorem kernel_of_contractive_subclass {X H H₁ : Type*}
    [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] [RKHS ℂ H X ℂ]
    [NormedAddCommGroup H₁] [InnerProductSpace ℂ H₁] [CompleteSpace H₁]
    (ι : H₁ →ₗ[ℂ] (X → ℂ)) (hι : Function.Injective ι)
    (hsub : ∀ f₁ : H₁, ∃ f : H, ⇑f = ι f₁)
    (hnorm : ∀ (f₁ : H₁) (f : H), ⇑f = ι f₁ → ‖f‖ ≤ ‖f₁‖) :
    ∃ k₁ : X → H₁, (∀ (y : X) (f₁ : H₁), inner ℂ (k₁ y) f₁ = ι f₁ y) ∧
      AronszajnRK.Limits.KernelLE (fun x y => ι (k₁ y) x) (AronszajnRK.Sum.kernelFn H) := by sorry

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

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me