Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§7, p. 354 — ≪\ll≪ is a partial order on positive matrices

Proved
AronszajnRK.Inclusion.dominated_partialOrder

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

p2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1positive-matricesreproducing-kernels

Let K1,K2,K3:X×X→CK_1, K_2, K_3 : X\times X\to\mathbb CK1​,K2​,K3​:X×X→C be positive matrices on a set XXX. Then

  1. if K1≪K2K_1\ll K_2K1​≪K2​ and K2≪K3K_2\ll K_3K2​≪K3​, then K1≪K3K_1\ll K_3K1​≪K3​;
  2. if K1≪K2K_1\ll K_2K1​≪K2​ and K2≪K1K_2\ll K_1K2​≪K1​, then K1=K2K_1 = K_2K1​=K2​ (as functions on X×XX\times XX×X).
K1≪K2≪K3  ⟹  K1≪K3,K1≪K2, K2≪K1  ⟹  K1=K2.K_1\ll K_2\ll K_3 \implies K_1\ll K_3, \qquad K_1\ll K_2,\ K_2\ll K_1 \implies K_1=K_2 .K1​≪K2​≪K3​⟹K1​≪K3​,K1​≪K2​, K2​≪K1​⟹K1​=K2​.

Together with reflexivity, which is immediate, this shows that ≪\ll≪ 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
  • 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me