Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (12) — D(ρ∥σ)=D(ρ∥PXρ)+D(PXρ∥σ)D(\rho\|\sigma)=D(\rho\|\mathcal P_X\rho)+D(\mathcal P_X\rho\|\sigma)D(ρ∥σ)=D(ρ∥PX​ρ)+D(PX​ρ∥σ)

Proved
ProjectiveMeasurementEquilibration.relEntropy_chain_rule

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

pinchingquantum-mechanicsrelative-entropy

Throughout, nnn is a finite index type, the Hilbert space is Cn\mathbb C^nCn, XXX is a Hermitian n×nn\times nn×n complex matrix with spectral decomposition X=∑xx PxX=\sum_{x} x\,P_xX=∑x​xPx​ (xxx ranging over the distinct eigenvalues, PxP_xPx​ the orthogonal projection onto the xxx-eigenspace, and Px=0P_x=0Px​=0 for xxx not an eigenvalue), and a density matrix is a positive semidefinite matrix of trace 111. For density matrices ρ,σ\rho,\sigmaρ,σ with [σ,X]=0[\sigma,X]=0[σ,X]=0,

D(ρ∥σ)=D(ρ∥PX(ρ))+D(PX(ρ)∥σ)D(\rho\|\sigma)=D(\rho\|\mathcal P_X(\rho))+D(\mathcal P_X(\rho)\|\sigma)D(ρ∥σ)=D(ρ∥PX​(ρ))+D(PX​(ρ)∥σ)

as an identity in (−∞,+∞](-\infty,+\infty](−∞,+∞], where D(ρ∥σ)=tr⁡(ρlog⁡ρ)−tr⁡(ρlog⁡σ)D(\rho\|\sigma)=\operatorname{tr}(\rho\log\rho)-\operatorname{tr}(\rho\log\sigma)D(ρ∥σ)=tr(ρlogρ)−tr(ρlogσ) if supp⁡ρ⊆supp⁡σ\operatorname{supp}\rho\subseteq\operatorname{supp}\sigmasuppρ⊆suppσ and +∞+\infty+∞ otherwise (for non-faithful σ\sigmaσ the identity is understood on its support).

Preamble
import Mathlib
import Definitions.Def_pme_quantum_basics
import Definitions.Def_pme_measurement_conditions

open Matrix Filter Topology
Formal statement
namespace ProjectiveMeasurementEquilibration

theorem relEntropy_chain_rule {n : Type} [Fintype n] [DecidableEq n] {X : Matrix n n ℂ} (hX : X.IsHermitian)
    (ρ σ : Matrix n n ℂ) (hρ : IsDensityMatrix ρ) (hσ : IsDensityMatrix σ)
    (hcomm : X * σ = σ * X) :
    relEntropy ρ σ = relEntropy ρ (pinching hX ρ) + relEntropy (pinching hX ρ) σ := by sorry

end ProjectiveMeasurementEquilibration
Source
G. Carcassi (Assumptions of Physics collaboration), "Projective measurements are equilibration processes", AoP Technical Brief 017, https://assumptionsofphysics.org/resources/briefs, proof of Theorem 1, eq. (12), p. 4
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent as the drafter; non-blind

Non-blind read-back. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, at the explicit request of the account owner. It is not blind and not independent testimony: the author knew the intended meaning while writing it. Reviewers should not treat it as an independent audit.

For every finite index type nnn, Hermitian X∈Mn(C)X\in M_n(\mathbb C)X∈Mn​(C), and density matrices ρ,σ\rho,\sigmaρ,σ with Xσ=σXX\sigma=\sigma XXσ=σX, the following equality holds in the extended reals [−∞,+∞][-\infty,+\infty][−∞,+∞]:

D(ρ∥σ)=D(ρ∥P(ρ))+D(P(ρ)∥σ),D(\rho\|\sigma)=D\big(\rho\|\mathcal P(\rho)\big)+D\big(\mathcal P(\rho)\|\sigma\big),D(ρ∥σ)=D(ρ∥P(ρ))+D(P(ρ)∥σ),

with P(ρ)=∑x∈ΛPxρPx\mathcal P(\rho)=\sum_{x\in\Lambda}P_x\rho P_xP(ρ)=∑x∈Λ​Px​ρPx​ and D(A∥B)=Re⁡tr⁡(A(log⁡A−log⁡B))D(A\|B)=\operatorname{Re}\operatorname{tr}\big(A(\log A-\log B)\big)D(A∥B)=Retr(A(logA−logB)) if ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA, D(A∥B)=+∞D(A\|B)=+\inftyD(A∥B)=+∞ otherwise (log⁡\loglog via functional calculus with log⁡0=0\log0=0log0=0). Extended-real addition is used on the right (in which a finite number plus +∞+\infty+∞ is +∞+\infty+∞).

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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