§7, Theorem I — implies and
ProvedAronszajnRK.Inclusion.subclass_of_dominatedp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1reproducing-kernelsrkhs
Let and be classes of complex functions on a set forming complex Hilbert spaces with reproducing kernels and , with norms and . If
then , and for every .
This is the sufficiency half of the inclusion criterion: domination of kernels gives a contractive inclusion of the classes.
Formalization Note and are Mathlib RKHS instances H, H₁ over ; "" is inclusion of their sets of functions, and the norm comparison is between the element of and the element of 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.