Unnumbered: relative entropy yields E1–E3
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntropy_measure_conditionsAll local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, , and Umegaki relative entropy is on failure of support inclusion. The relative entropy of entanglement is , where separability is across the specified Alice:Bob cut.
The functional vanishes exactly on separable states, is invariant under local unitary conjugation, and satisfies expected monotonicity for every complete product-Kraus family . With ,
These are E1–E3 in the source’s explicit Eq.(1) operational idealization.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.11–12: relative entropy's concrete measure satisfies E1,E2,E3.
This does not assert the defective printed all-projector F1–F5 package. -/
theorem relativeEntropy_measure_conditions {I J : Type} [Fintype I] [Fintype J]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] :
MeasureConditions (relativeEntanglementNats (I := I) (J := J)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of nonempty finite types with decidable equality, define the extended real valued function
Here the kernels are those of matrix multiplication, means applying by continuous functional calculus, uses the same calculus with the total natural logarithm, and “separable” means admitting a finite decomposition with , , and all positive semidefinite with complex trace . The assertion is that: for every density matrix , if and only if is separable; for every such and unitaries on and on ,
and for every finite type , every pair of local matrix families on , on satisfying
and every density matrix , writing and , one has
The sums, products, infimum, and inequalities involving use extended real arithmetic; zero probability branches contribute .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.