§5.1, equation (12): purification independence of entropy production
ProvedQAlgorithms.Papers.Independent.Support50.P41.intrinsicEntropyFix a density matrix and CPTP map on a nonzero finite-dimensional system. Any normalized purifications and of , with arbitrary finite reference dimensions, satisfy
Entropy is in bits. This makes the definition of entropy production independent of the chosen purification.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF pp.19--20, (12): entropy production is independent of reference and purification. -/
theorem intrinsicEntropy {d a b : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
(psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
(phi : EuclideanSpace ℂ (Fin b × Fin d)) (hphi : IsPurification rho phi) :
vnEntropy (idTensorSuperop Phi (pureDensity psi)) = entropyExchange Phi rho ∧
vnEntropy (idTensorSuperop Phi (pureDensity phi)) = entropyExchange Phi rho := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be integers. Let admit a finite representation for every matrix , with . Let be positive semidefinite with trace one, and let and be unit vectors whose partial traces over their respective reference factors equal . Define , where spectral functional calculus uses with , and let be the canonical purification with coefficients in the fixed enumeration of the input basis. Then both equalities hold:
Each amplification applies to blocks with fixed reference indices; each reference partial trace sums over equal reference indices. Neither purification hypothesis can hold when its reference dimension is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.