§7, Theorem II — a contractively included Hilbert subclass has a kernel
ProvedAronszajnRK.Inclusion.kernel_of_contractive_subclassLet be the reproducing kernel of a class of complex functions on with norm . Suppose the linear class forms a complex Hilbert space with a norm such that
Then possesses a reproducing kernel , that is, functions with for all and , and this kernel satisfies .
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 .
Formalization Note is not assumed to have a reproducing kernel (that is the conclusion): it is an abstract complex Hilbert space with an injective linear map into functions on , every being a function of . With Mathlib's convention (inner product conjugate-linear in the first slot) the reproducing property is , and .
import Mathlib import Definitions.Def_AronszajnRK_Sum_kernelFn import Definitions.Def_AronszajnRK_Limits_KernelLE
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.