Theorem A.24: For finite-alphabet Xobs, compatible Yalg and Yalg-valued guessing Yobs on SAME alphabet, Pe=1−sum_j Tr(rho XjYj) gives H(Xobs|Yal
OpenQAlgorithms.Papers.Independent.Renew46.P43.fanoBoundLet be a normalized state, a POVM on a finite nonempty alphabet , and an intrinsic subalgebra commuting with every . Let a guessing POVM take values in on the SAME alphabet. Write for binary entropy in bits; a singleton alphabet has and the continuous zero-product convention.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Theorem A.24, PDF p.75: same finite nonempty alphabet for the observable and
its guess; conditioning is on the whole compatible subsystem, not just its measurement. -/
theorem fanoBound {B : Type*} [Fintype B] [DecidableEq B] [Nonempty B] {Y A : IntrinsicSystem}
(E : Embedding Y A) (X : B → Matrix (Fin A.dim) (Fin A.dim) ℂ)
(hX : IsPOVM X) (hblocks : ∀ b, InBlocks A.block (X b))
(hcompat : ∀ b T, InBlocks Y.block T → X b * E.map T = E.map T * X b)
(guess : B → Matrix (Fin Y.dim) (Fin Y.dim) ℂ) (hguess : IsPOVM guess)
(hguessblocks : ∀ b, InBlocks Y.block (guess b))
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
let Pe := 1 - ∑ b, effectProb rho (X b * E.map (guess b))
vnEntropy (observableJoint E X rho) - viewedEntropy Y E.map rho ≤
binEntropy2 Pe + Pe * Real.logb 2 (Fintype.card B - 1 : ℕ) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty finite type with decidable equality, and let be systems with positive finite dimensions and natural-number block labels. Let be a complex-linear map from matrices on to matrices on preserving the identity and block-diagonal matrices, multiplication and adjoints on block-diagonal matrices, and injective on those matrices; at every finite amplification, including dimension zero, it preserves positivity on matrices whose entries vanish between different -block labels. Let be positive semidefinite matrices on summing to the identity, each zero between different -block labels, and assume that for every and every block-diagonal matrix on . Let be positive semidefinite matrices on summing to the identity, each zero between different -block labels. Let be positive semidefinite of trace on , also zero between different -block labels. Define
and define by
With , applied by continuous functional calculus, and binary entropy , the conclusion is
The logarithm uses the total real-logarithm convention ; thus the singleton case is included and its logarithmic term is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.