§7, p. 354 — is a partial order on positive matrices
ProvedAronszajnRK.Inclusion.dominated_partialOrderp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1positive-matricesreproducing-kernels
Let be positive matrices on a set . Then
- if and , then ;
- if and , then (as functions on ).
Together with reflexivity, which is immediate, this shows that is a partial ordering of the class of positive matrices; the inclusion theorems for reproducing kernel classes are statements about this order.
Preamble
import Mathlib import Definitions.Def_AronszajnRK_Limits_KernelLE open scoped ComplexOrder
Formal statement
namespace AronszajnRK.Inclusion
/-- Aronszajn, *Theory of Reproducing Kernels*, Trans. Amer. Math. Soc. 68 (1950), §7, p. 354
(PDF p. 18), unnumbered: on positive matrices, `≪` is a partial ordering. From
`K₁ ≪ K₂ ≪ K₃` it follows that `K₁ ≪ K₃`; if `K₁ ≪ K₂` and `K₂ ≪ K₁`, then `K₁ = K₂`. -/
theorem dominated_partialOrder {X : Type*} (K₁ K₂ K₃ : X → X → ℂ)
(h₁ : (Matrix.of K₁).PosSemidef) (h₂ : (Matrix.of K₂).PosSemidef)
(h₃ : (Matrix.of K₃).PosSemidef) :
(AronszajnRK.Limits.KernelLE K₁ K₂ → AronszajnRK.Limits.KernelLE K₂ K₃ → AronszajnRK.Limits.KernelLE K₁ K₃) ∧
(AronszajnRK.Limits.KernelLE K₁ K₂ → AronszajnRK.Limits.KernelLE K₂ K₁ → K₁ = K₂) := by sorry
end AronszajnRK.Inclusion
Source
Aronszajn, Theory of Reproducing Kernels, Trans. Amer. Math. Soc. 68 (1950), p. 354, §7 (unnumbered remark after (1))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.