Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A⪯αB ⇒ vTB−1v≤α vTA−1vA\preceq\alpha B\ \Rightarrow\ v^{T}B^{-1}v\le\alpha\,v^{T}A^{-1}vA⪯αB ⇒ vTB−1v≤αvTA−1v for positive definite A,BA,BA,B

Proved
BosonicLearn.loewner_inv_form_le

by Senrui Chen · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

Inversion reverses the Loewner order, in quadratic-form version.

Let A,BA,BA,B be real positive definite matrices of the same size and α>0\alpha>0α>0 with A⪯αBA\preceq\alpha BA⪯αB. Then for every real vector vvv,

v⊤B−1v  ≤  α  v⊤A−1v,i.e.∥B−1/2v∥2≤α ∥A−1/2v∥2.v^{\top}B^{-1}v\;\le\;\alpha\;v^{\top}A^{-1}v ,\qquad\text{i.e.}\qquad \|B^{-1/2}v\|_2\le\sqrt\alpha\,\|A^{-1/2}v\|_2 .v⊤B−1v≤αv⊤A−1v,i.e.∥B−1/2v∥2​≤α​∥A−1/2v∥2​.

Role. In the proof of Theorem 8, A=C=Σ+121A=C=\Sigma+\tfrac12\mathbf 1A=C=Σ+21​1 is the covariance of the heterodyne outcomes, B=ΣB=\SigmaB=Σ and α=αν\alpha=\alpha_\nuα=αν​: the concentration of μ^\hat\muμ^​ in the C−1C^{-1}C−1 norm (Eq. (210)) gives the bound in the Σ−1\Sigma^{-1}Σ−1 norm needed by Lemma 18.

Formalization Note The quadratic forms are v ⬝ᵥ (B⁻¹ *ᵥ v); Loewner order is Matrix.PosSemidef of the difference. Pure linear algebra.

Preamble
import Mathlib

open scoped Matrix
Formal statement
namespace BosonicLearn

/-- **Inversion reverses the Loewner order (quadratic-form version).**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §7.2, proof of Theorem 8, p. 62: "From C ⪯ α_ν Σ, inversion reverses the positive-semidefinite order, so
C^{−1} ⪰ α_ν^{−1} Σ^{−1}, or equivalently Σ^{−1} ⪯ α_ν C^{−1}. Consequently,
‖Σ^{−1/2}(µ̂ − µ)‖₂ ≤ √α_ν ‖C^{−1/2}(µ̂ − µ)‖₂."

Let `A, B` be real positive definite matrices with `A ⪯ α B`, `α > 0`. Then for every vector `v`,
`vᵀ B⁻¹ v ≤ α · vᵀ A⁻¹ v`.

**Formalization Note.** `‖M^{−1/2} v‖₂² = vᵀ M⁻¹ v` for positive definite `M`; Loewner order is positive
semidefiniteness of the difference. -/
theorem loewner_inv_form_le {ι : Type} [Fintype ι] [DecidableEq ι] (A B : Matrix ι ι ℝ) (hA : A.PosDef)
    (hB : B.PosDef) (α : ℝ) (hα : 0 < α) (hAB : (α • B - A).PosSemidef) (v : ι → ℝ) :
    v ⬝ᵥ (B⁻¹ *ᵥ v) ≤ α * (v ⬝ᵥ (A⁻¹ *ᵥ v)) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, p. 62, between Eqs. (216) and (217) ("inversion reverses the positive-semidefinite order", proof of Theorem 8)

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me