§5.1 parenthetical extension: arbitrary isolated-reference unitary
ProvedQAlgorithms.Papers.Independent.Support50.P41.unitaryReferenceEntropyLet be a normalized purification of a density matrix , let be CPTP on its nonzero finite-dimensional system, and let be any unitary on the isolated finite reference. Set . Then
This extends the entropy interpretation to a reference with internal unitary evolution.
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 p.22, parenthetical extension: arbitrary isolated-reference unitary preserves the entropy statement. -/
theorem unitaryReferenceEntropy {d a : ℕ} [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)
(U : Matrix.unitaryGroup (Fin a) ℂ) :
vnEntropy (conjSuperop (Matrix.kronecker (U : Matrix (Fin a) (Fin a) ℂ)
(1 : Matrix (Fin d) (Fin d) ℂ)) (idTensorSuperop Phi (pureDensity psi))) =
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 Kraus representation with , let be positive semidefinite with trace , and let satisfy and . For every unitary ,
where , with , and for . Functional calculus defines the matrix functions, and partial trace means summing diagonal entries over the discarded factor. The quantifier includes , but then no satisfies the norm hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.