Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — monogamy in Lasserre2\mathrm{Lasserre}_2Lasserre2​: ∑j∈Sxij≤1\sum_{j\in S}x_{ij}\le1∑j∈S​xij​≤1 over any set of neighbours of iii

Proved
QMCTriFree.Circuit.lemma_7

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

lasserremonogamyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-max-cut

Let MMM be feasible for Lasserre2(H)\mathrm{Lasserre}_2(H)Lasserre2​(H) and let xijx_{ij}xij​ be its edge values. For every vertex iii and every set SSS of neighbours of iii,

∑j∈Sxij≤1.\sum_{j\in S}x_{ij}\le 1 .j∈S∑​xij​≤1.

The relaxation "knows about" monogamy of entanglement: the edges of a star cannot all be close to the singlet. This bound, through Corollary 8, controls how much the rotations of neighbouring edges cost.

Formalization Note Only the xxx-part is stated (the yyy-part concerns the EPR Hamiltonian). Neighbours of iii are vertices k≠ik\ne ik=i with wik≠0w_{ik}\ne0wik​=0; no other property of www is assumed.

Preamble
import Mathlib
import Definitions.Def_QMCTriFree_Circuit_Lasserre

set_option autoImplicit false

open QMCProduct.HalfApprox Matrix MeasureTheory ProbabilityTheory
Formal statement
namespace QMCTriFree.Circuit

/-- King, arXiv:2209.02589v3, p. 7, Lemma 7 (the `x` part): for every feasible `M` of
`Lasserre_2(H)`, every vertex `i` and every set `S` of neighbours of `i`, `∑_{j∈S} x_ij ≤ 1`. -/
theorem lemma_7 {n : ℕ} (w : Fin n → Fin n → ℝ) (M : Matrix (P2 n) (P2 n) ℝ)
    (hM : IsFeasible M) (i : Fin n) (S : Finset (Fin n)) (hS : S ⊆ nbrs w i) :
    ∑ j ∈ S, xval M i j ≤ 1 := by sorry

end QMCTriFree.Circuit
Source
King, An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs, arXiv:2209.02589v3, p. 7, Lemma 7
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me