Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, Theorem I — K1≪KK_1 \ll KK1​≪K implies F1⊂FF_1\subset FF1​⊂F and ∥f1∥1≥∥f1∥\|f_1\|_1 \ge \|f_1\|∥f1​∥1​≥∥f1​∥

Proved
AronszajnRK.Inclusion.subclass_of_dominated

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

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

Let FFF and F1F_1F1​ be classes of complex functions on a set XXX forming complex Hilbert spaces with reproducing kernels KKK and K1K_1K1​, with norms ∥⋅∥\|\cdot\|∥⋅∥ and ∥⋅∥1\|\cdot\|_1∥⋅∥1​. If

K1≪K,K_1 \ll K,K1​≪K,

then F1⊂FF_1\subset FF1​⊂F, and ∥f1∥1≥∥f1∥\|f_1\|_1\ge\|f_1\|∥f1​∥1​≥∥f1​∥ for every f1∈F1f_1\in F_1f1​∈F1​.

This is the sufficiency half of the inclusion criterion: domination of kernels gives a contractive inclusion of the classes.

Formalization Note FFF and F1F_1F1​ are Mathlib RKHS instances H, H₁ over C\mathbb CC; "F1⊂FF_1\subset FF1​⊂F" is inclusion of their sets of functions, and the norm comparison is between the element of H1H_1H1​ and the element of HHH that are the same function.

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 I,
p. 354 (PDF p. 18). If `K` and `K₁` are the reproducing kernels of the classes `F` and `F₁` with
the norms `‖ ‖`, `‖ ‖₁`, and if `K₁ ≪ K`, then `F₁ ⊂ F` and `‖f₁‖₁ ≥ ‖f₁‖` for every `f₁ ∈ F₁`.
The classes are complex RKHSs `H` (norm `‖ ‖`) and `H₁` (norm `‖ ‖₁`) of functions on `X`; the norm
comparison is between the elements of `H₁` and of `H` carrying the same function. -/
theorem subclass_of_dominated {X H H₁ : Type*}
    [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] [RKHS ℂ H X ℂ]
    [NormedAddCommGroup H₁] [InnerProductSpace ℂ H₁] [CompleteSpace H₁] [RKHS ℂ H₁ X ℂ]
    (hK : AronszajnRK.Limits.KernelLE (AronszajnRK.Sum.kernelFn H₁) (AronszajnRK.Sum.kernelFn H)) :
    Set.range (fun f₁ : H₁ => ⇑f₁) ⊆ Set.range (fun f : H => ⇑f) ∧
      ∀ (f₁ : H₁) (f : H), ⇑f = ⇑f₁ → ‖f‖ ≤ ‖f₁‖ := by sorry

end AronszajnRK.Inclusion
Source
Aronszajn, Theory of Reproducing Kernels, Trans. Amer. Math. Soc. 68 (1950), p. 354, §7, Theorem I
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me