Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.1.4 (6.25)–(6.27): conditioning on a classical register

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.classical_block_entropy

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ρ​.

Let p_y>=0 with sum_y p_y<=1 and let each conditional rhohat_AB(y) be normalized. Assemble the actual classical block state sum_y p_y rhohat_AB(y) tensor |y><y|. The displayed min- and max-entropy identities hold, including zero total mass. For any normalized classical joint law, the optimal guessing probability is sum_y max_x p(x,y)=2^(-Hmin(X|Y)).

Hmin⁡(A∣BY)=−log⁡2∑ypy2−Hmin⁡(A∣B)ρ^y,Hmax⁡(A∣BY)=log⁡2∑ypy2Hmax⁡(A∣B)ρ^y.H_{\min}(A|BY)=-\log_2\sum_y p_y2^{-H_{\min}(A|B)_{\widehat\rho_y}},\qquad H_{\max}(A|BY)=\log_2\sum_y p_y2^{H_{\max}(A|B)_{\widehat\rho_y}}.Hmin​(A∣BY)=−log2​y∑​py​2−Hmin​(A∣B)ρ​y​​,Hmax​(A∣BY)=log2​y∑​py​2Hmax​(A∣B)ρ​y​​.

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.classicalconditioning
§6.1.4 (6.25)–(6.27): conditioning on a classical register, arXiv:1504.00233v5, PDF p.96. -/
theorem classical_block_entropy [Nonempty A] [Nonempty B] [Nonempty X] [Nonempty Y]
    (p : Y → ℝ) (hp : ∀ y, 0 ≤ p y) (ht : ∑ y, p y ≤ 1)
    (r : Y → paperMat (A × B)) (hr : ∀ y, IsDensityMatrix (r y)) :
    paperHmin (conditionalBlocks (fun y => (p y:ℂ) • r y)) = 
      -paperLogE (∑ y, p y*(2:ℝ)^(-(paperHmin (r y)).toReal)) ∧
    hmax (conditionalBlocks (fun y => (p y:ℂ) • r y)) = 
      paperLogE (∑ y, p y*(2:ℝ)^(hmax (r y)).toReal) ∧
    (∀ q : X × Y → ℝ, paperProbability q →
      expE (-paperHmin (Matrix.diagonal (fun xy => (q xy:ℂ)))) = 
        ENNReal.ofReal (∑ y, sSup {v : ℝ | ∃ x, v = q (x,y)})) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 96, §6.1.4 (6.25)–(6.27): conditioning on a classical register
Read-back

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

Let A,B,X,YA,B,X,YA,B,X,Y be nonempty finite types with decidable equality, let p:Y→Rp:Y\to\mathbb Rp:Y→R satisfy py≥0p_y\ge0py​≥0 and ∑ypy≤1\sum_yp_y\le1∑y​py​≤1, and let each ryr_yry​ be a positive semidefinite matrix of complex trace 111 on A×BA\times BA×B. For a matrix QQQ on U×VU\times VU×V, define

Hmin⁡(Q)=sup⁡{ℓ∈R:∃s⪰0, Re⁡tr⁡s≤1, Q⪯2−ℓ(1U⊗s)},H_{\min}(Q)= \sup\{\ell\in\mathbb R:\exists s\succeq0,\ \operatorname{Re}\operatorname{tr}s\le1,\ Q\preceq2^{-\ell}(1_U\otimes s)\},Hmin​(Q)=sup{ℓ∈R:∃s⪰0, Retrs≤1, Q⪯2−ℓ(1U​⊗s)}, Hmax⁡(Q)=sup⁡s⪰0Re⁡tr⁡s≤1L ⁣((Re⁡tr⁡Q(1U⊗s)Q)2),H_{\max}(Q)= \sup_{\substack{s\succeq0\\\operatorname{Re}\operatorname{tr}s\le1}} \mathcal L\!\left( \left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt Q(1_U\otimes s)\sqrt Q}\right)^2 \right),Hmax​(Q)=s⪰0Retrs≤1​sup​L((RetrQ​(1U​⊗s)Q​​)2),

where Q⪯TQ\preceq TQ⪯T means T−Q⪰0T-Q\succeq0T−Q⪰0, functional calculus supplies matrix square roots, L(0)=−∞\mathcal L(0)=-\inftyL(0)=−∞, and L(t)\mathcal L(t)L(t) is the extended-real embedding of log⁡2t\log_2tlog2​t for t≠0t\ne0t=0. Form RRR on A×(B×Y)A\times(B\times Y)A×(B×Y) by

R(a,(b,y)),(a′,(b′,y′))={py(ry)(a,b),(a′,b′)y=y′,0y≠y′.R_{(a,(b,y)),(a',(b',y'))}= \begin{cases} p_y(r_y)_{(a,b),(a',b')}&y=y',\\ 0&y\ne y'. \end{cases}R(a,(b,y)),(a′,(b′,y′))​={py​(ry​)(a,b),(a′,b′)​0​y=y′,y=y′.​

Then

Hmin⁡(R)=−L ⁣(∑ypy 2−(Hmin⁡(ry))R),Hmax⁡(R)=L ⁣(∑ypy 2(Hmax⁡(ry))R),H_{\min}(R)= -\mathcal L\!\left(\sum_y p_y\,2^{-(H_{\min}(r_y))_{\mathbb R}}\right), \qquad H_{\max}(R)= \mathcal L\!\left(\sum_y p_y\,2^{(H_{\max}(r_y))_{\mathbb R}}\right),Hmin​(R)=−L(y∑​py​2−(Hmin​(ry​))R​),Hmax​(R)=L(y∑​py​2(Hmax​(ry​))R​),

where hRh_{\mathbb R}hR​ denotes conversion of an extended real to a real, taking both infinities to 000. Moreover, for every q:X×Y→Rq:X\times Y\to\mathbb Rq:X×Y→R with qxy≥0q_{xy}\ge0qxy​≥0 and ∑x,yqxy=1\sum_{x,y}q_{xy}=1∑x,y​qxy​=1,

Exp⁡2 ⁣(−Hmin⁡(diag⁡q))=ofReal⁡ ⁣(∑ymax⁡x∈Xqxy).\operatorname{Exp}_2\!\left(-H_{\min}(\operatorname{diag}q)\right) = \operatorname{ofReal}\!\left(\sum_y\max_{x\in X}q_{xy}\right).Exp2​(−Hmin​(diagq))=ofReal(y∑​x∈Xmax​qxy​).

Here the diagonal matrix is viewed as bipartite on X×YX\times YX×Y, ofReal⁡\operatorname{ofReal}ofReal truncates a real number below at 000 and embeds it in [0,∞][0,\infty][0,∞], and Exp⁡2\operatorname{Exp}_2Exp2​ takes values +∞,0,ofReal⁡(2h)+\infty,0,\operatorname{ofReal}(2^h)+∞,0,ofReal(2h) at h=+∞,−∞,h=+\infty,-\infty,h=+∞,−∞, and finite hhh, respectively. Zero weights and the all-zero function ppp are included; no normalization ∑ypy=1\sum_yp_y=1∑y​py​=1 is imposed.

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