Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 9, p. 28 — the level-k Lasserre value is a relaxation: νk(H) ≥ λmax(H)

Proved
QMCProduct.HalfApprox.lemma_9

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

lasserre-hierarchyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationsemidefinite-programming

Let HHH be a Hermitian operator on nnn qubits and k≥0k\ge0k≥0. Let ρ~\widetilde\rhoρ​ be an optimal solution of level kkk of the quantum Lasserre hierarchy, i.e. a kkk-positive pseudo-density maximizing Tr⁡(Hρ~)\operatorname{Tr}(H\widetilde\rho)Tr(Hρ​), so that νk(H)=Tr⁡(Hρ~)\nu_k(H)=\operatorname{Tr}(H\widetilde\rho)νk​(H)=Tr(Hρ​). Then for every density matrix σ\sigmaσ (positive semidefinite, trace one)

Tr⁡(Hσ)≤νk(H)=Tr⁡(Hρ~).\operatorname{Tr}(H\sigma)\le\nu_k(H)=\operatorname{Tr}(H\widetilde\rho).Tr(Hσ)≤νk​(H)=Tr(Hρ​).

Since λmax⁡(H)=max⁡σTr⁡(Hσ)\lambda_{\max}(H)=\max_\sigma\operatorname{Tr}(H\sigma)λmax​(H)=maxσ​Tr(Hσ), this is νk(H)≥λmax⁡(H)\nu_k(H)\ge\lambda_{\max}(H)νk​(H)≥λmax​(H): the hierarchy is a relaxation of the largest eigenvalue.

This is the inequality in equation (1) and the second inequality in the proof of Proposition 1.

Formalization Note λmax⁡(H)\lambda_{\max}(H)λmax​(H) is expressed through comparison with every density matrix, and νk(H)\nu_k(H)νk​(H) through an optimal pseudo-density (equation (1) writes νk\nu_kνk​ as a maximum). The paper proves the lemma in the equivalent vector-program form (Definition 17); the pseudo-density form is equation (1). Real parts of traces are taken; they are the full traces for Hermitian arguments.

Preamble
import Definitions.Def_QMCProduct_HalfApprox_Basic

set_option autoImplicit false
Formal statement
namespace QMCProduct.HalfApprox

/-- Lemma 9, p. 28: the level-k value `νk(H) = Tr[H ρt]` of an optimal k-positive
pseudo-density is at least `Tr[H σ]` for every density matrix `σ`, i.e. `νk(H) ≥ λmax(H)`. -/
theorem lemma_9 {n : ℕ} (k : ℕ) (H : Op n) (hH : H.IsHermitian)
    (ρt : Op n) (hopt : IsOptimalLk k H ρt) :
    ∀ σ : Op n, QAlgorithms.IsDensityMatrix σ →
      (H * σ).trace.re ≤ (H * ρt).trace.re := by sorry

end QMCProduct.HalfApprox
Source
Parekh & Thompson, An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms, arXiv:2206.08342v2, p. 28, Lemma 9 (Appendix A.1); equation (1), p. 8
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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