§III, equations (12)–(16): entropy and mutual-information specializations
ProvedQAlgorithms.Papers.Independent.Support50.P21.entropy_specializationsAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be a density operator, a bipartite density operator, and a density operator. The unconditional entropies satisfy
Relative to ,
Writing for the marginals, define . These are the paper's entropy and mutual-information substitutions, with extended logarithms at support failure. The max entropy here is the rank-based order-zero entropy.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- PDF p.3, (12)–(16): old rank-based Hmax; conditional reference is sigma_B.
The rho_B in the printed first line of (14) is corrected as explained above. -/
theorem entropy_specializations (rho : Mat I) (hrho : IsDensityMatrix rho)
(rhoAB : Mat (I × J)) (hAB : IsDensityMatrix rhoAB)
(sigmaB : Mat J) (hB : IsDensityMatrix sigmaB) :
hMin rho = -maxRelative rho 1 ∧ hMin rho = -elog (largestEigenvalue rho) ∧
hMax rho = -dMin rho 1 ∧ hMax rho = elog (rho.rank : ℝ) ∧
conditionalMin rhoAB sigmaB = -maxRelative rhoAB (Matrix.kronecker (1 : Mat I) sigmaB) ∧
conditionalMax rhoAB sigmaB = -dMin rhoAB (Matrix.kronecker (1 : Mat I) sigmaB) ∧
conditionalMax rhoAB sigmaB =
elog (tr (support rhoAB * Matrix.kronecker (1 : Mat I) sigmaB)) ∧
mutualMin rhoAB = dMin rhoAB (Matrix.kronecker (traceRight rhoAB) (traceLeft rhoAB)) ∧
mutualMax rhoAB = maxRelative rhoAB (Matrix.kronecker (traceRight rhoAB) (traceLeft rhoAB)) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite index types with decidable equality, let on , on , and on each be positive semidefinite complex matrices with complex trace one. Write , let denote the orthogonal projection onto the range of , define for and otherwise, and set
where the latter infimum is extended-real-valued and equals for an empty feasible set. The quantities defined by , , , , and satisfy
Here and . No support inclusion between and is required, so the displayed quantities may be infinite; the density hypotheses exclude empty or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.