Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

H3H_3H3​ is the graph Hamiltonian of the all-ones adjacency matrix

Proved
PfisterCEP.H3_eq_graphHamiltonian

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-statesheisenberg-picturep2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-opticssqueezing

Let ak,ak†a_k,a_k^\daggerak​,ak†​ satisfy the canonical commutation relations and let JJJ be the N×NN\times NN×N matrix with every entry equal to 111. Then, for all real ℏ,κ\hbar,\kappaℏ,κ,

iℏκ(∑n<pan†ap†+∑nan†22)+H.c.=iℏκ2∑n,pJnp an†ap†+H.c.i\hbar\kappa\Big(\sum_{n<p}a_n^\dagger a_p^\dagger+\sum_n\frac{a_n^{\dagger2}}{2}\Big)+\mathrm{H.c.}=\frac{i\hbar\kappa}{2}\sum_{n,p}J_{np}\,a_n^\dagger a_p^\dagger+\mathrm{H.c.}iℏκ(n<p∑​an†​ap†​+n∑​2an†2​​)+H.c.=2iℏκ​n,p∑​Jnp​an†​ap†​+H.c.

That is, H3=HJH_3=H_JH3​=HJ​: the weight 12\tfrac1221​ on the self-loops of eq. (4) is exactly what puts 111 on the diagonal of the adjacency matrix, so the graph of H3H_3H3​ is the complete graph with a loop at every vertex (Fig. 3).

Differences from the source:

  • generalization: aj†a_j^\daggeraj†​ is the adjoint of aja_jaj​ → a†a^\daggera† is any family ad with [ak,al†]=δkl[a_k,a_l^\dagger]=\delta_{kl}[ak​,al†​]=δkl​, [ak,al]=[ak†,al†]=0[a_k,a_l]=[a_k^\dagger,a_l^\dagger]=0[ak​,al​]=[ak†​,al†​]=0; reason: the statement uses only the commutation relations; the adjoint pair of a Fock representation is one instance, so the statement specializes to the source's
  • reading: the adjacency matrix of H3H_3H3​ has all its elements equal to 1 → H3=HJH_3=H_JH3​=HJ​ as elements of the algebra, with HGH_GHG​ the graph Hamiltonian; reason: 'the adjacency matrix of H3H_3H3​' means the matrix GGG with H3=HGH_3=H_GH3​=HG​
  • encoding: H.c. → the explicit conjugate terms −iℏκ(∑n<papan+∑nan2/2)-i\hbar\kappa(\sum_{n<p}a_pa_n+\sum_na_n^2/2)−iℏκ(∑n<p​ap​an​+∑n​an2​/2); reason: the conjugate of iℏκ an†ap†i\hbar\kappa\,a_n^\dagger a_p^\daggeriℏκan†​ap†​ with real ℏκ\hbar\kappaℏκ; same operator
Preamble
import Mathlib
import Definitions.Def_PfisterCEP_IsCCR
import Definitions.Def_PfisterCEP_graphHamiltonian
import Definitions.Def_PfisterCEP_H3
Formal statement
namespace PfisterCEP

/-- **`H₃` is the graph Hamiltonian of the all-ones adjacency matrix.**
O. Pfister, *Graph states and carrier-envelope phase squeezing*, arXiv:quant-ph/0701104v2, Sec. b, p.2, right column, eq. (4) and "The adjacency matrix has all its elements equal
to 1".

For modes satisfying the CCR, `H₃ = H_J` with `J` the `N × N` matrix of ones: the weight `1/2` on
the self-loops `a†ₙ²/2` of (4) is what puts `1` on the diagonal.

**Formalization Note** Only the clauses `[aₖ, aₗ] = 0`, `[a†ₖ, a†ₗ] = 0` of the CCR are needed to
symmetrize `∑_{n<p}`; the full `IsCCR` is assumed as in the paper. -/
theorem H3_eq_graphHamiltonian {A : Type*} [Ring A] [Algebra ℂ A] {N : ℕ} (a ad : Fin N → A) (hccr : IsCCR a ad) (ħ κ : ℝ) : H3 ħ κ a ad = graphHamiltonian ħ κ (Matrix.of fun _ _ => (1 : ℝ)) a ad := by sorry

end PfisterCEP
Source
Pfister, Graph states and carrier-envelope phase squeezing, arXiv:quant-ph/0701104v2, Sec. b, p.2, right column, eq. (4)
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 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