Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed-reference finite-block AEP

Proved
QAlgorithms.Papers.Independent.Support50.P23.fixedReferenceFiniteBlock

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ and σB\sigma_BσB​ be normalized finite-dimensional states and let n≥1n\ge1n≥1. Define η=Υ(A∣B)ρ∣σ\eta=\Upsilon(A|B)_{\rho|\sigma}η=Υ(A∣B)ρ∣σ​ and δ(ε,η)=4log⁡2ηlog⁡2(2/ε2)\delta(\varepsilon,\eta)=4\log_2\eta\sqrt{\log_2(2/\varepsilon^2)}δ(ε,η)=4log2​ηlog2​(2/ε2)​. On the branch η<∞\eta<\inftyη<∞, if 0<ε<10<\varepsilon<10<ε<1 and n≥85log⁡2(2/ε2)n\ge\frac85\log_2(2/\varepsilon^2)n≥58​log2​(2/ε2), then

1nHmin⁡ε(An∣Bn)ρ⊗n∣σ⊗n≥H(A∣B)ρ∣σ−δ(ε,η)n.\frac1n H_{\min}^{\varepsilon}(A^n|B^n)_{\rho^{\otimes n}|\sigma^{\otimes n}} \ge H(A|B)_{\rho|\sigma}-\frac{\delta(\varepsilon,\eta)}{\sqrt n}.n1​Hminε​(An∣Bn)ρ⊗n∣σ⊗n​≥H(A∣B)ρ∣σ​−n​δ(ε,η)​.

If the support of ρAB\rho_{AB}ρAB​ is not contained in that of IA⊗σBI_A\otimes\sigma_BIA​⊗σB​, the fixed-reference von Neumann entropy is −∞-\infty−∞, yielding the trivial lower bound. For ε≥1\varepsilon\ge1ε≥1, the smooth fixed min entropy is +∞+\infty+∞. This version retains the exact reference tensor power.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
Formal statement
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]

/-- Remark 10, PDF p.6: sigma^{tensor n} remains fixed. Use the finite-eta formula
only on its real domain; support failure is a -infinity lower bound. The epsilon
domain correction is the same as in Theorem 9. -/
theorem fixedReferenceFiniteBlock [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (epsilon : ℝ) (hepsilon : 0 < epsilon) (n : ℕ) (hn : 0 < n) :
    ((epsilon < 1 ∧ entropyConvergenceParameter rho sigma ≠ ⊤ ∧
        (8 / 5 : ℝ) * Real.logb 2 (2 / epsilon ^ 2) ≤ (n : ℝ)) →
      fixedVonNeumann rho sigma -
        ((aepBlockError epsilon (entropyConvergenceParameter rho sigma) / Real.sqrt (n : ℝ) : ℝ) : EReal) ≤
          (((n : ℝ)⁻¹ : ℝ) : EReal) *
            sineSmoothFixedMin (jointPower rho n) (matrixPower sigma n) epsilon) ∧
    (¬ supportedBy rho (identityTensorReference (A := A) sigma) →
      fixedVonNeumann rho sigma = ⊥ ∧ fixedVonNeumann rho sigma ≤
        (((n : ℝ)⁻¹ : ℝ) : EReal) *
          sineSmoothFixedMin (jointPower rho n) (matrixPower sigma n) epsilon) ∧
    (1 ≤ epsilon → sineSmoothFixedMin (jointPower rho n) (matrixPower sigma n) epsilon = ⊤) := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 6, Remark 10: fixed-reference finite-block AEP
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let A,BA,BA,B be nonempty finite types with decidable equality, and let ρ\rhoρ on CA×B\mathbb C^{A\times B}CA×B and σ\sigmaσ on CB\mathbb C^BCB be positive semidefinite matrices of trace 111. Write J=IA⊗σJ=I_A\otimes\sigmaJ=IA​⊗σ, and say that ρ\rhoρ is supported by JJJ when ker⁡J⊆ker⁡ρ\ker J\subseteq\ker\rhokerJ⊆kerρ. Put S(X)=−Re⁡tr⁡[Xlog⁡2X]S(X)=-\operatorname{Re}\operatorname{tr}[X\log_2X]S(X)=−Retr[Xlog2​X], using functional calculus with the scalar function x↦xlog⁡2xx\mapsto x\log_2xx↦xlog2​x, and define HJ(ρ)=Re⁡tr⁡[ρlog⁡2J]+S(ρ)H_J(\rho)=\operatorname{Re}\operatorname{tr}[\rho\log_2J]+S(\rho)HJ​(ρ)=Retr[ρlog2​J]+S(ρ) when this support inclusion holds, and HJ(ρ)=−∞H_J(\rho)=-\inftyHJ​(ρ)=−∞ otherwise. For t>0t>0t>0, define Ft(ρ,σ)F_t(\rho,\sigma)Ft​(ρ,σ) to be HJ(ρ)H_J(\rho)HJ​(ρ) at t=1t=1t=1, to be −∞-\infty−∞ when t>1t>1t>1 and the support inclusion fails, and otherwise to be (1−t)−1ℓ(Re⁡tr⁡[ρtJ[1−t]])(1-t)^{-1}\ell(\operatorname{Re}\operatorname{tr}[\rho^tJ^{[1-t]}])(1−t)−1ℓ(Retr[ρtJ[1−t]]); here J[u]J^{[u]}J[u] applies xux^uxu to positive eigenvalues and assigns 000 at zero, while ℓ(0)=−∞\ell(0)=-\inftyℓ(0)=−∞ and ℓ(x)=log⁡2x\ell(x)=\log_2xℓ(x)=log2​x for x≠0x\ne0x=0. Let e(+∞)=+∞e(+\infty)=+\inftye(+∞)=+∞, e(−∞)=0e(-\infty)=0e(−∞)=0, and e(x)=2xe(x)=2^xe(x)=2x for finite xxx, and put η=e(−F3/2/2)+e(F1/2/2)+1\eta=e(-F_{3/2}/2)+e(F_{1/2}/2)+1η=e(−F3/2​/2)+e(F1/2​/2)+1 and Eϵ(η)=4log⁡2(ηR)log⁡2(2/ϵ2)E_\epsilon(\eta)=4\log_2(\eta_{\mathbb R})\sqrt{\log_2(2/\epsilon^2)}Eϵ​(η)=4log2​(ηR​)log2​(2/ϵ2)​, where ηR\eta_{\mathbb R}ηR​ is the real conversion of the extended nonnegative number η\etaη, assigning 000 to +∞+\infty+∞. Define

hϵ(R,Σ)=sup⁡T⪰0, Re⁡tr⁡T≤11−F0(R,T)2≤ϵ sup⁡{r∈R:2−rI⊗Σ−T⪰0},F0(R,T)=Re⁡tr⁡R TR,h_\epsilon(R,\Sigma)= \sup_{\substack{T\succeq0,\ \operatorname{Re}\operatorname{tr}T\le1\\ \sqrt{1-F_0(R,T)^2}\le\epsilon}} \ \sup\{r\in\mathbb R:2^{-r}I\otimes\Sigma-T\succeq0\}, \qquad F_0(R,T)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt R\,T\sqrt R},hϵ​(R,Σ)=T⪰0, RetrT≤11−F0​(R,T)2​≤ϵ​sup​ sup{r∈R:2−rI⊗Σ−T⪰0},F0​(R,T)=RetrR​TR​​,

with the suprema taken in the extended reals. For every real ϵ>0\epsilon>0ϵ>0 and natural n>0n>0n>0, all three assertions hold: if ϵ<1\epsilon<1ϵ<1, η≠+∞\eta\ne+\inftyη=+∞, and 85log⁡2(2/ϵ2)≤n\frac85\log_2(2/\epsilon^2)\le n58​log2​(2/ϵ2)≤n, then HJ(ρ)−Eϵ(η)/n≤n−1hϵ(ρ⊗n,σ⊗n)H_J(\rho)-E_\epsilon(\eta)/\sqrt n\le n^{-1}h_\epsilon(\rho^{\otimes n},\sigma^{\otimes n})HJ​(ρ)−Eϵ​(η)/n​≤n−1hϵ​(ρ⊗n,σ⊗n); if ker⁡J⊈ker⁡ρ\ker J\not\subseteq\ker\rhokerJ⊆kerρ, then HJ(ρ)=−∞H_J(\rho)=-\inftyHJ​(ρ)=−∞ and HJ(ρ)≤n−1hϵ(ρ⊗n,σ⊗n)H_J(\rho)\le n^{-1}h_\epsilon(\rho^{\otimes n},\sigma^{\otimes n})HJ​(ρ)≤n−1hϵ​(ρ⊗n,σ⊗n); and if 1≤ϵ1\le\epsilon1≤ϵ, including ϵ=1\epsilon=1ϵ=1, then hϵ(ρ⊗n,σ⊗n)=+∞h_\epsilon(\rho^{\otimes n},\sigma^{\otimes n})=+\inftyhϵ​(ρ⊗n,σ⊗n)=+∞. The tensor powers have entries given by products over the nnn coordinates, and the smoothing permits T=0T=0T=0 and does not require trace 111.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me