Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — on a star with nonnegative weights, every unit state has energy at most max_e w_e + Σ_e w_e

Proved
QMaxCutBeyond.TwoQubit.lemma_1

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

monogamyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-max-cutstar-graph

Let G=(V,E,w)G=(V,E,w)G=(V,E,w) be a star graph with nonnegative weights and HGH_GHG​ the quantum Max Cut Hamiltonian. Then

∥HG∥  ≤  max⁡e∈Ewe+∑e∈Ewe.\|H_G\|\;\le\;\max_{e\in E}w_e+\sum_{e\in E}w_e .∥HG​∥≤e∈Emax​we​+e∈E∑​we​.

The trivial bound is 2∑ewe2\sum_e w_e2∑e​we​; the lemma says the centre qubit cannot be maximally entangled with all leaves at once (monogamy of entanglement). Applied to the star of each vertex it gives the upper bound on OPT(G)\mathrm{OPT}(G)OPT(G) used in Theorems 3 and 5.

Formalization Note Stated as: every unit state ψ\psiψ has ⟨ψ∣HG∣ψ⟩≤max⁡ewe+∑ewe\langle\psi|H_G|\psi\rangle\le\max_e w_e+\sum_e w_e⟨ψ∣HG​∣ψ⟩≤maxe​we​+∑e​we​. Since HG⪰0H_G\succeq0HG​⪰0, this is equivalent to the norm bound. A star is a graph all of whose edges contain a centre ccc; other vertices may be isolated (their qubits are idle), which is the situation in which the lemma is applied.

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

/-- Lemma 1, p. 6: for a star graph with nonnegative weights, `‖H_G‖ ≤ max_{e∈E} w_e +
Σ_{e∈E} w_e`, stated as: every unit state has energy at most that bound. -/
theorem lemma_1 {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj]
    (w : Sym2 (Fin n) → ℝ) (hw : ∀ e, 0 ≤ w e) (c : Fin n) (hstar : IsStar G c)
    (ψ : Config n → ℂ) (hψ : IsUnitState ψ) :
    energy (hamiltonian G w) ψ ≤ maxEdgeWeight G w + totalWeight G w := by sorry

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