Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

6.18

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.classical_conditioning_bound

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣. The symbols Hmin⁡H_{\min}Hmin​ and Hmax⁡H_{\max}Hmax​ denote conditional min- and max-entropy, with values +∞+\infty+∞ and −∞-\infty−∞ at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies 0≤ε<Tr⁡ρ0\le\varepsilon<\sqrt{\operatorname{Tr}\rho}0≤ε<Trρ​.

For both smooth min and max, H^ε(A|YB)≥H^ε(A|B)−log dim Y when Y is classical.

Hε(A∣YB)ρ≥Hε(A∣B)ρ−log⁡2dY(H=Hmin⁡,Hmax⁡).H^\varepsilon(A|YB)_\rho\ge H^\varepsilon(A|B)_\rho-\log_2 d_Y\quad(H=H_{\min},H_{\max}).Hε(A∣YB)ρ​≥Hε(A∣B)ρ​−log2​dY​(H=Hmin​,Hmax​).

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#6.18
6.18, arXiv:1504.00233v5, PDF p.103. -/
theorem classical_conditioning_bound [Nonempty A] [Nonempty Y] [Nonempty B] (r : paperMat ((A × Y) × B))
    (hr : paperSubnormalized r) (hc : ∀ a y b a' y' b', y ≠ y' → r ((a,y),b) ((a',y'),b') = 0)
    (e : ℝ) (he : Radius r e) :
    paperSmoothMin (paperTraceMiddle r) e-(Real.logb 2 (Fintype.card Y):EReal) ≤ paperSmoothMin (paperRegroup r) e ∧
    paperSmoothMax (paperTraceMiddle r) e-(Real.logb 2 (Fintype.card Y):EReal) ≤ paperSmoothMax (paperRegroup r) e := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 103, 6.18
Read-back

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

Let A,Y,BA,Y,BA,Y,B be finite nonempty types with decidable equality. Let r⪰0r\succeq0r⪰0 be a complex matrix on (A×Y)×B(A\times Y)\times B(A×Y)×B, with τ(r)≤1\tau(r)\le1τ(r)≤1, where τ=Re⁡tr⁡\tau=\operatorname{Re}\operatorname{tr}τ=Retr, and suppose r(((a,y),b),((a′,y′),b′))=0r(((a,y),b),((a',y'),b'))=0r(((a,y),b),((a′,y′),b′))=0 for all a,a′,b,b′,y,y′a,a',b,b',y,y'a,a′,b,b′,y,y′ with y≠y′y\ne y'y=y′. Let 0≤e<τ(r)0\le e<\sqrt{\tau(r)}0≤e<τ(r)​, which requires positive trace. Define t((a,b),(a′,b′))=∑yr(((a,y),b),((a′,y),b′))t((a,b),(a',b'))=\sum_y r(((a,y),b),((a',y),b'))t((a,b),(a′,b′))=∑y​r(((a,y),b),((a′,y),b′)), and define v((a,(y,b)),(a′,(y′,b′)))=r(((a,y),b),((a′,y′),b′))v((a,(y,b)),(a',(y',b')))=r(((a,y),b),((a',y'),b'))v((a,(y,b)),(a′,(y′,b′)))=r(((a,y),b),((a′,y′),b′)). For positive semidefinite matrices set F(u,w)=τ(u wu)F(u,w)=\tau(\sqrt{\sqrt u\,w\sqrt u})F(u,w)=τ(u​wu​​), with square roots from spectral functional calculus, and Bη(w)={u⪰0:τ(u)≤1, 1−(F(u,w)+(1−τ(u))(1−τ(w)))2≤η}\mathcal B_\eta(w)=\{u\succeq0:\tau(u)\le1,\ \sqrt{1-(F(u,w)+\sqrt{(1-\tau(u))(1-\tau(w))})^2}\le\eta\}Bη​(w)={u⪰0:τ(u)≤1, 1−(F(u,w)+(1−τ(u))(1−τ(w))​)2​≤η}. For a matrix qqq on U×VU\times VU×V, define h−(q)=sup⁡{λ∈R:∃σ⪰0, τ(σ)≤1, 2−λIU⊗σ−q⪰0}h_-(q)=\sup\{\lambda\in\mathbb R:\exists\sigma\succeq0,\ \tau(\sigma)\le1,\ 2^{-\lambda}I_U\otimes\sigma-q\succeq0\}h−​(q)=sup{λ∈R:∃σ⪰0, τ(σ)≤1, 2−λIU​⊗σ−q⪰0} and h+(q)=sup⁡σ⪰0,τ(σ)≤1log⁡0(F(q,IU⊗σ)2)h_+(q)=\sup_{\sigma\succeq0,\tau(\sigma)\le1}\log_0(F(q,I_U\otimes\sigma)^2)h+​(q)=supσ⪰0,τ(σ)≤1​log0​(F(q,IU​⊗σ)2), where log⁡0(0)=−∞\log_0(0)=-\inftylog0​(0)=−∞ and otherwise log⁡0=log⁡2\log_0=\log_2log0​=log2​; define H−η(q)=sup⁡u∈Bη(q)h−(u)H_-^\eta(q)=\sup_{u\in\mathcal B_\eta(q)}h_-(u)H−η​(q)=supu∈Bη​(q)​h−​(u) and H+η(q)=inf⁡u∈Bη(q)h+(u)H_+^\eta(q)=\inf_{u\in\mathcal B_\eta(q)}h_+(u)H+η​(q)=infu∈Bη​(q)​h+​(u), with extended-real extrema. Regarding ttt as A:BA:BA:B and vvv as A:YBA:YBA:YB, both inequalities hold:

H−e(t)−log⁡2∣Y∣≤H−e(v),H+e(t)−log⁡2∣Y∣≤H+e(v).H_-^e(t)-\log_2|Y|\le H_-^e(v), \qquad H_+^e(t)-\log_2|Y|\le H_+^e(v).H−e​(t)−log2​∣Y∣≤H−e​(v),H+e​(t)−log2​∣Y∣≤H+e​(v).

The cases e=0e=0e=0 and ∣Y∣=1|Y|=1∣Y∣=1 are included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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