Fully quantum asymptotic equipartition property
OpenQAlgorithms.Papers.Independent.Support50.P23.fullyQuantumAepLet be a normalized state on arbitrary finite-dimensional nonzero complex Hilbert spaces and . Use binary entropies and smooth over subnormalized states at sine distance at most , where sine distance is and is root fidelity. For every , both positive-integer copy-count limits below exist as finite real numbers, and
Here and . The existential real functions in the statement witness the inner limits; outer convergence is through . This is the paper's first-order i.i.d. entropy limit.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
noncomputable section
open Filter
open scoped ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P23
attribute [local instance] Classical.propDecidable
-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.
open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)
open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)
variable {A B C D I : Type*}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]
/-- Theorem 1, PDF p.2, (6)-(7), proved on p.6. Both iterated limits include
existence of the inner limits; n+1 ranges over positive copy counts. -/
theorem fullyQuantumAep [Nonempty A] [Nonempty B]
(rho : Matrix (A × B) (A × B) ℂ) (hrho : IsDensityMatrix rho) :
∃ lower upper : ℝ → ℝ,
(∀ epsilon ∈ Set.Ioo (0 : ℝ) 1,
Tendsto (fun n : ℕ => (((n + 1 : ℕ) : ℝ)⁻¹ : EReal) *
sineSmoothMin (jointPower rho (n + 1)) epsilon) atTop (nhds (lower epsilon : EReal)) ∧
Tendsto (fun n : ℕ => (((n + 1 : ℕ) : ℝ)⁻¹ : EReal) *
sineSmoothMax (jointPower rho (n + 1)) epsilon) atTop (nhds (upper epsilon : EReal))) ∧
Tendsto lower (nhdsWithin 0 (Set.Ioo 0 1)) (nhds (conditionalEntropyBitsAB rho)) ∧
Tendsto upper (nhdsWithin 0 (Set.Ioo 0 1)) (nhds (conditionalEntropyBitsAB rho)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be finite, nonempty index types with decidable equality, and let be a positive semidefinite complex matrix on with trace one. Write , where is applied by continuous functional calculus, and let . For any matrix on a bipartite space, define , with the real candidates embedded in the extended reals, define , and define , where and , otherwise. Define as the supremum of , and as the infimum of , over all with and ; zero is allowed, and this distance has no additional term involving missing trace. For , let . There exist real-valued functions such that, for every fixed , the extended-real sequences and converge respectively to the finite values and as , and both and converge to as through . Their values outside are unrestricted, and the statement does not identify either fixed- limit with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.