Unnumbered: indicator measure satisfies E1–E3
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.indicator_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.
Define for separable states and otherwise. This functional vanishes exactly on separable states, is invariant under local unitaries, and for every complete product-Kraus family , with , obeys
It therefore satisfies all three source conditions E1–E3.
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 p.19: the indicator measure satisfies all three conditions, including expected E3. -/
theorem indicator_measure_conditions {I J : Type} [Fintype I] [Fintype J]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] :
MeasureConditions (entanglementIndicator (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 finite nonempty types with decidable equality, define if is separable and otherwise, as an extended-real-valued function on matrices on ; separability means admitting a finite expression with , , and positive semidefinite trace-one factors . Three properties hold: for every positive semidefinite trace-one , if and only if is separable; for every such and every pair of unitary matrices on and on , ; and for every finite type , every family of square matrices on and on satisfying , where , and every positive semidefinite trace-one , putting and gives
The completeness condition cannot hold for empty on these nonempty registers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.