Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (26) — for a forest F ⊆ E some basis state has energy ≥ Σ_{e∈F} w_e

Proved
QMaxCutBeyond.TwoQubit.eq_26

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

forestmax-cutp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-max-cut

Let G=(V,E,w)G=(V,E,w)G=(V,E,w) have nonnegative weights and let F⊆EF\subseteq EF⊆E be a forest. There is a computational basis state ∣s⟩|s\rangle∣s⟩, s∈{0,1}ns\in\{0,1\}^ns∈{0,1}n, with

⟨s∣HG∣s⟩  ≥  f,f=∑e∈Fwe.\langle s|H_G|s\rangle\;\ge\;f,\qquad f=\sum_{e\in F}w_e .⟨s∣HG​∣s⟩≥f,f=e∈F∑​we​.

This is the first (classical) candidate state of eq. (27).

Formalization Note Only existence is stated; "we may efficiently compute" is not formalized.

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

/-- Eq. (26), p. 11 (existence part): if `F ⊆ E` is a forest, some computational basis state
`|s⟩` has `⟨s|H_G|s⟩ ≥ f = Σ_{e∈F} w_e`. -/
theorem eq_26 {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (w : Sym2 (Fin n) → ℝ) (hw : ∀ e, 0 ≤ w e)
    (F : Finset (Sym2 (Fin n))) (hFG : F ⊆ G.edgeFinset)
    (hF : (SimpleGraph.fromEdgeSet (F : Set (Sym2 (Fin n)))).IsAcyclic) :
    ∃ s : Config n, ∑ e ∈ F, w e ≤ energy (hamiltonian G w) (basisState s) := by sorry

end QMaxCutBeyond.TwoQubit
Source
Anshu, Gosset & Morenz, Beyond product state approximations for a quantum analogue of Max Cut, arXiv:2003.14394v1, p. 11, eq. (26), proof of Theorem 3
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