Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantitative approach to order one

Proved
QAlgorithms.Papers.Independent.Support50.P23.alphaNearOne

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. Define η=Υ(A∣B)ρ∣σ=2−H3/2(A∣B)ρ∣σ/2+2H1/2(A∣B)ρ∣σ/2+1\eta=\Upsilon(A|B)_{\rho|\sigma}=2^{-H_{3/2}(A|B)_{\rho|\sigma}/2}+2^{H_{1/2}(A|B)_{\rho|\sigma}/2}+1η=Υ(A∣B)ρ∣σ​=2−H3/2​(A∣B)ρ∣σ​/2+2H1/2​(A∣B)ρ∣σ​/2+1. On its finite branch, η≥3\eta\ge3η≥3. If 1<α<1+log⁡23/(4log⁡2η)1<\alpha<1+\log_2 3/(4\log_2\eta)1<α<1+log2​3/(4log2​η), then

Hα(A∣B)ρ∣σ≥H(A∣B)ρ∣σ−4(α−1)(log⁡2η)2.H_\alpha(A|B)_{\rho|\sigma}\ge H(A|B)_{\rho|\sigma}-4(\alpha-1)(\log_2\eta)^2.Hα​(A∣B)ρ∣σ​≥H(A∣B)ρ∣σ​−4(α−1)(log2​η)2.

For η=+∞\eta=+\inftyη=+∞ the displayed order interval is empty. The finite parameter bounds the error when approaching the von Neumann order.

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]

/-- Lemma 8, PDF p.5, (25). Finite eta is the admissible branch of the printed
interval; eta=infinity leaves no admissible alpha. -/
theorem alphaNearOne [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (heta : entropyConvergenceParameter rho sigma ≠ ⊤) (alpha : ℝ) (halpha : 1 < alpha)
    (halphaUpper : alpha < 1 + Real.logb 2 3 / (4 * Real.logb 2 (entropyConvergenceParameter rho sigma).toReal)) :
    fixedVonNeumann rho sigma -
      ((4 * (alpha - 1) * (Real.logb 2 (entropyConvergenceParameter rho sigma).toReal) ^ 2 : ℝ) : EReal) ≤
        finiteAlpha rho sigma alpha := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 5, Lemma 8: quantitative approach to order one, (25)
Read-back

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

Let A,BA,BA,B be finite, nonempty index types with decidable equality, and let ρ\rhoρ on A×BA\times BA×B and σ\sigmaσ on BBB be positive semidefinite complex matrices of trace one. Put Q=IA⊗σQ=I_A\otimes\sigmaQ=IA​⊗σ, let S(ρ)=−Re⁡tr⁡[x↦xlog⁡2x](ρ)S(\rho)=-\operatorname{Re}\operatorname{tr}[x\mapsto x\log_2x](\rho)S(ρ)=−Retr[x↦xlog2​x](ρ), and define H1=Re⁡tr⁡[ρlog⁡2Q]+S(ρ)H_1=\operatorname{Re}\operatorname{tr}[\rho\log_2Q]+S(\rho)H1​=Retr[ρlog2​Q]+S(ρ) when ker⁡Q⊆ker⁡ρ\ker Q\subseteq\ker\rhokerQ⊆kerρ, and H1=−∞H_1=-\inftyH1​=−∞ otherwise. For t∈{12,32}t\in\{\tfrac12,\tfrac32\}t∈{21​,23​}, and also for any real t>1t>1t>1, define Ht=−∞H_t=-\inftyHt​=−∞ if t>1t>1t>1 and this support condition fails, and otherwise define Ht=(1−t)−1L(Re⁡tr⁡[ρtgt(Q)])H_t=(1-t)^{-1}L(\operatorname{Re}\operatorname{tr}[\rho^t g_t(Q)])Ht​=(1−t)−1L(Retr[ρtgt​(Q)]), where gt(0)=0g_t(0)=0gt​(0)=0, gt(x)=x1−tg_t(x)=x^{1-t}gt​(x)=x1−t otherwise, L(0)=−∞L(0)=-\inftyL(0)=−∞, and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise; matrix functions use continuous functional calculus. Define E(+∞)=+∞E(+\infty)=+\inftyE(+∞)=+∞, E(−∞)=0E(-\infty)=0E(−∞)=0, E(x)=2xE(x)=2^xE(x)=2x for finite extended-real xxx, and η=E(−H3/2/2)+E(H1/2/2)+1\eta=E(-H_{3/2}/2)+E(H_{1/2}/2)+1η=E(−H3/2​/2)+E(H1/2​/2)+1. Assume η≠+∞\eta\ne+\inftyη=+∞, write ηR\eta_{\mathbb R}ηR​ for its real value, and let α∈R\alpha\in\mathbb Rα∈R satisfy

1<α<1+log⁡234log⁡2ηR.1<\alpha<1+\frac{\log_2 3}{4\log_2\eta_{\mathbb R}}.1<α<1+4log2​ηR​log2​3​.

Then H1−4(α−1)(log⁡2ηR)2≤HαH_1-4(\alpha-1)(\log_2\eta_{\mathbb R})^2\le H_\alphaH1​−4(α−1)(log2​ηR​)2≤Hα​ in the extended reals. Division is total: if log⁡2ηR=0\log_2\eta_{\mathbb R}=0log2​ηR​=0, the upper bound becomes α<1\alpha<1α<1, so the two hypotheses on α\alphaα cannot both hold.

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