§13 (C), Corollary IV₃ — iff
ProvedAronszajnRK.Inclusion.eq_class_iff_kernel_two_sidedp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1reproducing-kernelsrkhs
Let and be positive matrices on a set and , the corresponding classes of complex functions. Then
Two kernels thus define the same function class exactly when each is dominated by a multiple of the other.
Formalization Note As for Corollary IV₂: stated for arbitrary complex RKHS instances , with scalar kernels , ; "" is equality of their sets of functions.
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), §13 (C),
Corollary IV₃, p. 383 (PDF p. 47). Under the hypotheses of Corollary IV₂ (`K`, `K₁` positive
matrices, `F`, `F₁` the corresponding classes), in order that `F₁ = F` it is necessary and
sufficient that there exist two positive constants `m` and `M` such that `mK ≪ K₁ ≪ MK`.
Stated, as Corollary IV₂, for arbitrary complex RKHSs `H`, `H₁` with kernels `K`, `K₁`. -/
theorem eq_class_iff_kernel_two_sided {X H H₁ : Type*}
[NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] [RKHS ℂ H X ℂ]
[NormedAddCommGroup H₁] [InnerProductSpace ℂ H₁] [CompleteSpace H₁] [RKHS ℂ H₁ X ℂ] :
Set.range (fun f₁ : H₁ => ⇑f₁) = Set.range (fun f : H => ⇑f) ↔
∃ m M : ℝ, 0 < m ∧ 0 < M ∧
AronszajnRK.Limits.KernelLE (fun x y => (m : ℂ) * AronszajnRK.Sum.kernelFn H x y) (AronszajnRK.Sum.kernelFn H₁) ∧
AronszajnRK.Limits.KernelLE (AronszajnRK.Sum.kernelFn H₁) (fun x y => (M : ℂ) * AronszajnRK.Sum.kernelFn H x y) := by sorry
end AronszajnRK.Inclusion
Source
Aronszajn, Theory of Reproducing Kernels, Trans. Amer. Math. Soc. 68 (1950), p. 383, §13 (C), Corollary IV₃
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.