Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted form of Eq. (15) — OPT(G) ≤ W + ½ Σ_v max_{e∼v} w_e

Proved
QMaxCutBeyond.TwoQubit.weighted_eq_15

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-max-cutupper-bound

Let G=(V,E,w)G=(V,E,w)G=(V,E,w) be a graph with nonnegative weights and W=∑e∈EweW=\sum_{e\in E}w_eW=∑e∈E​we​. Then

OPT(G)=∥HG∥  ≤  W+12∑v∈Vmax⁡e∼vwe,\mathrm{OPT}(G)=\|H_G\|\;\le\;W+\frac12\sum_{v\in V}\max_{e\sim v}w_e ,OPT(G)=∥HG​∥≤W+21​v∈V∑​e∼vmax​we​,

where max⁡e∼vwe\max_{e\sim v}w_emaxe∼v​we​ is the largest weight of an edge incident to vvv (000 if vvv is isolated).

This is the weighted replacement of eq. (15) in the proof of Theorem 3; it is the upper bound on the optimum against which all candidate states are compared.

Formalization Note Stated as: every unit state has energy at most the right-hand side. The paper derives it by "exactly the same arguments" as eqs. (14)–(15), written there for unit weights; this item is that weighted form.

Preamble
import Mathlib
import Definitions.Def_QMaxCutBeyond_TwoQubit_Setting
Formal statement
namespace QMaxCutBeyond.TwoQubit

/-- Weighted form of Eq. (15), proof of Theorem 3, p. 9:
`OPT(G) ≤ W + ½ Σ_{v∈V} max_{e∼v} w_e`, stated for every unit state. -/
theorem weighted_eq_15 {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (w : Sym2 (Fin n) → ℝ) (hw : ∀ e, 0 ≤ w e)
    (ψ : Config n → ℂ) (hψ : IsUnitState ψ) :
    energy (hamiltonian G w) ψ ≤ totalWeight G w + (1 / 2) * ∑ v, maxIncident G w v := by sorry

end QMaxCutBeyond.TwoQubit
Source
Anshu, Gosset & Morenz, Beyond product state approximations for a quantum analogue of Max Cut, arXiv:2003.14394v1, proof of Theorem 3, p. 9 (weighted Eq. (15)); W defined on p. 10
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me