Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 5, p. 17 — for k ≥ 2, µij ∈ [0, 1], vij ∈ [−1/3, 1] and sij ∈ [−1, 1]

Proved
QMCProduct.HalfApprox.lemma_5

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquantum-max-cut

Let ρ~\widetilde\rhoρ​ be a kkk-positive pseudo-density on nnn qubits, with k≥2k\ge2k≥2, and let i≠ji\ne ji=j. For the QMC edge values μij,vij,sij\mu_{ij},v_{ij},s_{ij}μij​,vij​,sij​ of Definition 12,

μij∈[0,1],vij∈[−1/3,1],sij∈[−1,1].\mu_{ij}\in[0,1],\qquad v_{ij}\in[-1/3,1],\qquad s_{ij}\in[-1,1].μij​∈[0,1],vij​∈[−1/3,1],sij​∈[−1,1].

These intervals delimit the feasible edge values used in the rounding and monogamy analysis.

Formalization Note Distinct sites are explicit because an edge has distinct endpoints.

Preamble
import Definitions.Def_QMCProduct_HalfApprox_Basic

set_option autoImplicit false
Formal statement
namespace QMCProduct.HalfApprox

/-- Lemma 5, p. 17. -/
theorem lemma_5 {n k : ℕ} (hk : 2 ≤ k) (ρt : Op n)
    (hρ : IsPseudoDensity k ρt) (i j : Fin n) (hij : i ≠ j) :
    (0 ≤ mu ρt i j ∧ mu ρt i j ≤ 1) ∧
    (-(1 / 3 : ℝ) ≤ v ρt i j ∧ v ρt i j ≤ 1) ∧
    (-1 ≤ s ρt i j ∧ s ρt i j ≤ 1) := 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. 17, Lemma 5
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