Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Heisenberg-picture Lindblad generator

Definition
HighEntropyLimit_lindblad

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

mathematical-physicsquantum-mechanics

Let A\mathcal AA be a C\mathbb CC-algebra of observables. For a Hamiltonian HHH and jump channels (γi,Li,Li†)(\gamma_i, L_i, L_i^\dagger)(γi​,Li​,Li†​), the Heisenberg-picture Lindblad generator (Eq. 26) is

L(X)=iℏ[H,X]+∑iγi(Li†XLi−12{Li†Li,X}),\mathcal L(X) = \frac{i}{\hbar}[H,X] + \sum_i \gamma_i\Big(L_i^\dagger X L_i - \frac12\{L_i^\dagger L_i, X\}\Big),L(X)=ℏi​[H,X]+i∑​γi​(Li†​XLi​−21​{Li†​Li​,X}),

where [A,B]=AB−BA[A,B] = AB-BA[A,B]=AB−BA and {A,B}=AB+BA\{A,B\} = AB+BA{A,B}=AB+BA.

Formalization Note The ladder operators of the paper are unbounded, so we work in an abstract ℂ-algebra and supply each adjoint Li†L_i^\daggerLi†​ explicitly as part of its channel.

Definition code
import Mathlib

namespace HighEntropyLimit

/-- Right-hand side of the Lindblad master equation in the Heisenberg picture, Eq. (26):
`dX/dt = (i/ħ)[H, X] + ∑ᵢ γᵢ (Lᵢ† X Lᵢ - ½ {Lᵢ† Lᵢ, X})`.
Each jump channel is a triple `(γᵢ, Lᵢ, Lᵢ†)`; the adjoint `Lᵢ†` is supplied explicitly
because the ladder operators are unbounded and are modelled as elements of an abstract
`ℂ`-algebra. -/
noncomputable def lindbladHeisenberg {A : Type*} [Ring A] [Algebra ℂ A]
    (hbar : ℝ) (H : A) (jumps : List (ℝ × A × A)) (X : A) : A :=
  (Complex.I / (hbar : ℂ)) • (H * X - X * H) +
    (jumps.map fun j =>
      ((j.1 : ℂ)) • (j.2.2 * X * j.2.1 - (1 / 2 : ℂ) • (j.2.2 * j.2.1 * X + X * (j.2.2 * j.2.1)))).sum

end HighEntropyLimit
Source
Carcassi, Landini, Aidala, Classical mechanics as the high-entropy limit of quantum mechanics, arXiv:2411.00972v3 (1 Feb 2026), https://arxiv.org/abs/2411.00972, p. 9 Eq. (26)
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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