Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 8 — ∏k∼i:xik≥01−β2xik2≥1−β2\prod_{k\sim i:x_{ik}\ge0}\sqrt{1-\beta^2x_{ik}^2}\ge\sqrt{1-\beta^2}∏k∼i:xik​≥0​1−β2xik2​​≥1−β2​ and ∏j≠k∼i:xik≥01−β2xik2≥1−β2(1−xij)2\prod_{j\ne k\sim i:x_{ik}\ge0}\sqrt{1-\beta^2x_{ik}^2}\ge\sqrt{1-\beta^2(1-x_{ij})^2}∏j=k∼i:xik​≥0​1−β2xik2​​≥1−β2(1−xij​)2​

Proved
QMCTriFree.Circuit.corollary_8

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) with edge values xijx_{ij}xij​, fix an edge (i,j)(i,j)(i,j) and β∈[0,1]\beta\in[0,1]β∈[0,1]. Then

  1. ∏k∼i: xik≥01−β2xik2 ≥ 1−β2\displaystyle\prod_{k\sim i:\ x_{ik}\ge0}\sqrt{1-\beta^2x_{ik}^2}\ \ge\ \sqrt{1-\beta^2}k∼i: xik​≥0∏​1−β2xik2​​ ≥ 1−β2​;
  2. ∏j≠k∼i: xik≥01−β2xik2 ≥ 1−β2(1−xij)2\displaystyle\prod_{j\ne k\sim i:\ x_{ik}\ge0}\sqrt{1-\beta^2x_{ik}^2}\ \ge\ \sqrt{1-\beta^2(1-x_{ij})^2}j=k∼i: xik​≥0∏​1−β2xik2​​ ≥ 1−β2(1−xij​)2​,

where k∼ik\sim ik∼i ranges over the neighbours of iii and j≠k∼ij\ne k\sim ij=k∼i over the neighbours other than jjj.

These are the neighbour-product bounds that turn Lemma 12 into Lemma 18 once cos⁡2θik=1−β2xik2\cos2\theta_{ik}=\sqrt{1-\beta^2x_{ik}^2}cos2θik​=1−β2xik2​​.

Formalization Note Only the xxx-part is stated. Part 2 holds as printed, without a sign condition on xijx_{ij}xij​. ⋅\sqrt{\cdot}⋅​ is Real.sqrt, which is 000 on negative arguments.

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. 8, Corollary 8 (the `x` part): for a feasible `M`, an edge
`(i, j)` and `β ∈ [0, 1]`,
(1) `∏_{k∼i : x_ik ≥ 0} √(1 − β² x_ik²) ≥ √(1 − β²)`, and
(2) `∏_{j≠k∼i : x_ik ≥ 0} √(1 − β² x_ik²) ≥ √(1 − β² (1 − x_ij)²)`. -/
theorem corollary_8 {n : ℕ} (w : Fin n → Fin n → ℝ) (hw : IsWeightedGraph w)
    (M : Matrix (P2 n) (P2 n) ℝ) (hM : IsFeasible M) (i j : Fin n) (hij : i ≠ j)
    (hwij : w i j ≠ 0) (β : ℝ) (hβ0 : 0 ≤ β) (hβ1 : β ≤ 1) :
    Real.sqrt (1 - β ^ 2) ≤
        ∏ k ∈ (nbrs w i).filter (fun k => 0 ≤ xval M i k),
          Real.sqrt (1 - β ^ 2 * xval M i k ^ 2) ∧
      Real.sqrt (1 - β ^ 2 * (1 - xval M i j) ^ 2) ≤
        ∏ k ∈ ((nbrs w i).erase j).filter (fun k => 0 ≤ xval M i k),
          Real.sqrt (1 - β ^ 2 * xval M i k ^ 2) := by sorry

end QMCTriFree.Circuit
Source
King, An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs, arXiv:2209.02589v3, p. 8, Corollary 8 (proof p. 27)
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