Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem II.4: For fixed d,0<tau,lambda<1 there exist Kprime,delta>0 uniformly over n,Wi,Pi and measurable A of product mass≥tau: an (n,lambda) c

Open
QAlgorithms.Papers.Independent.Renew46.P43.maximalCodes

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

prove2quantum

Fix a nonzero finite output system of dimension ddd. The nonstationary channels WiW_iWi​ are nonempty measurable state sets; C(Wi)=sup⁡PI(P;Wi)C(W_i)=\sup_PI(P;W_i)C(Wi​)=supP​I(P;Wi​) optimizes over ALL probability laws on that set. A code has temporal product codewords, a collective block POVM with optional failure, positive length and a nonempty finite message set. N(n,λ)N(n,\lambda)N(n,λ) optimizes actual codes under maximum error, with 0<λ<10<\lambda<10<λ<1. In the maximal-code statements, 0<τ<10<\tau<10<τ<1, the laws PiP_iPi​ are arbitrary, and the measurable event AAA has product mass at least τ\tauτ; constants K′,δ>0K',\delta>0K′,δ>0 are chosen before the channel, laws, event and length. In the converse ϵ>0\epsilon>0ϵ>0 and the threshold is uniform over channel sequences. The hybrid version uses intrinsic output trace and algebra-valued decoding.

f(m)∈A,Tr⁡Dm≤Tr⁡ΠH,f(m),δn,log⁡2∣M∣≥∑iI(Pi;Wi)−K′n.f(m)\in A,\quad\operatorname{Tr}D_m\le\operatorname{Tr}\Pi_{H,f(m),\delta}^n,\quad\log_2|M|\ge\sum_i I(P_i;W_i)-K'\sqrt n.f(m)∈A,TrDm​≤TrΠH,f(m),δn​,log2​∣M∣≥i∑​I(Pi​;Wi​)−K′n​.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

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

open Filter MeasureTheory

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)

attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace

/-- Theorem II.4, PDF pp.24-25: uniform constants before the channel, laws, event
and length. Both the codebook restriction and decoder trace estimate are conclusions. -/
theorem maximalCodes (d : ℕ) (hd : 0 < d) (tau lambda : ℝ)
    (htau : 0 < tau) (htausmall : tau < 1) (hlambda : 0 < lambda) (hlambdasmall : lambda < 1) :
    ∃ K delta : ℝ, 0 < delta ∧ ∀ (n : ℕ), 0 < n →
      ∀ (W : ℕ → StateChannel (fullAlgebra d hd))
        (P : ∀ i : Fin n, ProbabilityMeasure (W i.val).carrier)
        (event : Set (∀ i : Fin n, (W i.val).carrier)), MeasurableSet event →
      ENNReal.ofReal tau ≤ (Measure.pi (fun i => (P i : Measure (W i.val).carrier))) event →
      MaximalCodeConclusion P event K delta lambda false := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 24, Theorem II.4
Read-back

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

For every positive integer ddd and real numbers 0<τ<10<\tau<10<τ<1 and 0<λ<10<\lambda<10<λ<1, there exist real numbers K,δK,\deltaK,δ, with δ>0\delta>0δ>0 and no stated sign requirement on KKK, having the following property uniformly over all positive integers nnn, all sequences W=(Wi)i≥0W=(W_i)_{i\ge0}W=(Wi​)i≥0​ of nonempty measurable sets of d×dd\times dd×d density matrices, all probability measures PiP_iPi​ on WiW_iWi​ for i<ni<ni<n, and all measurable sets E⊆∏i<nWiE\subseteq\prod_{i<n}W_iE⊆∏i<n​Wi​: if the product measure ⨂i<nPi\bigotimes_{i<n}P_i⨂i<n​Pi​ assigns EEE measure at least τ\tauτ, then there exists a code with M>0M>0M>0 messages, states ρm,i∈Wi\rho_{m,i}\in W_iρm,i​∈Wi​, and positive semidefinite decoding matrices D⊥,D0,…,DM−1D_\bot,D_0,\ldots,D_{M-1}D⊥​,D0​,…,DM−1​ summing to the identity, such that every encoded tuple lies in EEE and

max⁡m<M[1−Re⁡tr⁡ ⁣((⨂i<nρm,i)Dm)]≤λ,log⁡2M≥∑i<n(∫Wi−D2(ρ∥ρˉi) dPi(ρ))real−Kn,ρˉi=∫Wiρ dPi(ρ).\max_{m<M}\left[1-\operatorname{Re}\operatorname{tr}\!\left(\left(\bigotimes_{i<n}\rho_{m,i}\right)D_m\right)\right]\le\lambda, \qquad \log_2M\ge \sum_{i<n}\left(\int_{W_i}^{-}D_2(\rho\Vert\bar\rho_i)\,dP_i(\rho)\right)_{\mathrm{real}} -K\sqrt n, \quad \bar\rho_i=\int_{W_i}\rho\,dP_i(\rho).m<Mmax​[1−Retr((i<n⨂​ρm,i​)Dm​)]≤λ,log2​M≥i<n∑​(∫Wi​−​D2​(ρ∥ρˉ​i​)dPi​(ρ))real​−Kn​,ρˉ​i​=∫Wi​​ρdPi​(ρ).

A density matrix means a positive semidefinite matrix of trace 111. For density matrices, D2(ρ∥σ)D_2(\rho\Vert\sigma)D2​(ρ∥σ) is +∞+\infty+∞ if ker⁡σ⊈ker⁡ρ\ker\sigma\not\subseteq\ker\rhokerσ⊆kerρ, and otherwise is the nonnegative part of Re⁡tr⁡(ρlog⁡ρ−ρlog⁡σ)/log⁡2\operatorname{Re}\operatorname{tr}(\rho\log\rho-\rho\log\sigma)/\log2Retr(ρlogρ−ρlogσ)/log2, using functional calculus with log⁡0=0\log0=0log0=0; its value for other arguments is 000, and real conversion sends +∞+\infty+∞ to 000. In addition, there are spectral representations ρm,i=∑j<dsm,i,jum,i,jum,i,j∗\rho_{m,i}=\sum_{j<d}s_{m,i,j}u_{m,i,j}u_{m,i,j}^{*}ρm,i​=∑j<d​sm,i,j​um,i,j​um,i,j∗​, where the weights are nonnegative and sum to 111 and the vectors form an orthonormal basis for each m,im,im,i, such that Re⁡tr⁡Dm≤Re⁡tr⁡Πm,δ\operatorname{Re}\operatorname{tr}D_m\le\operatorname{Re}\operatorname{tr}\Pi_{m,\delta}RetrDm​≤RetrΠm,δ​ for every mmm, with

Πm,δ=∑j0,…,jn−1<dsm,i,ji>0 ∀i∣∑i<n−log⁡2sm,i,ji−∑i<nH(ρm,i)∣≤δn⨂i<num,i,jium,i,ji∗,H(ρ)=−Re⁡tr⁡(f(ρ)),f(t)=tlog⁡2t.\Pi_{m,\delta} =\sum_{\substack{j_0,\ldots,j_{n-1}<d\\ s_{m,i,j_i}>0\ \forall i\\ \left|\sum_{i<n}-\log_2s_{m,i,j_i}-\sum_{i<n}H(\rho_{m,i})\right|\le\delta\sqrt n}} \bigotimes_{i<n}u_{m,i,j_i}u_{m,i,j_i}^{*}, \qquad H(\rho)=-\operatorname{Re}\operatorname{tr}\bigl(f(\rho)\bigr),\quad f(t)=t\log_2t.Πm,δ​=j0​,…,jn−1​<dsm,i,ji​​>0 ∀i∣∑i<n​−log2​sm,i,ji​​−∑i<n​H(ρm,i​)∣≤δn​​∑​i<n⨂​um,i,ji​​um,i,ji​∗​,H(ρ)=−Retr(f(ρ)),f(t)=tlog2​t.

All block labels here are constant, so the code's block-vanishing condition imposes no restriction. No idempotence requirement is asserted for the decoding matrices.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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