Pure tripartite entropy balance
OpenQAlgorithms.Papers.Independent.Intakethird100.P64.pureStateEntropyBalanceLet be a unit pure state on finite nonzero registers . For each subsystem , let be the von Neumann entropy in bits of its reduced density matrix, and put . Then
This identity determines how Alice's residual entropy divides between the two mutual-information rates in the feedback father calculation. Complementary entropy equalities are consequences of purity, not additional hypotheses.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P64
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P64
open QAlgorithms
open QAlgorithms.Papers.Independent.Gap48.P20
(Copies redistributionMarginal subsystemEntropy forwardApply)
open QAlgorithms.Papers.Independent.Dependency50.P48 (densityPower)
open scoped Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.2, (8): the entropy balance of every normalized finite tripartite pure
state. Purity and normalization are provided by the vector and IsState, rather
than by assuming complementary entropy equalities. -/
theorem pureStateEntropyBalance {R A B : Type}
[Fintype R] [Fintype A] [Fintype B] [Nonempty R] [Nonempty A] [Nonempty B]
(psi : EuclideanSpace ℂ (R × (A × B))) (hpsi : IsState psi) :
feedbackEntropyA psi = (1 / 2 : ℝ) * mutualRA psi + (1 / 2 : ℝ) * mutualAB psi := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P64
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For types equipped with finite enumerations and each nonempty, and every vector satisfying , form the matrix . For any selection of these registers, let be its reduced matrix, with entries obtained by summing over the complementary register coordinates , and write
where is defined by continuous functional calculus and the real logarithm is total, with . The theorem asserts
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.