Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Improved bound with entropy-minimum attainment

Open
QAlgorithms.Papers.Independent.Support50.P38.remark16

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

prove2quantum

Let X,YX,YX,Y be finite nonempty alphabets, PPP a probability law on XXX, and W:X→P(Y)W:X\to\mathcal P(Y)W:X→P(Y) a stochastic channel. All logarithms and entropies are in bits. Write Pn,WnP^n,W^nPn,Wn for the memoryless product laws, I=H(PW)−H(W∣P)I=H(PW)-H(W|P)I=H(PW)−H(W∣P), and dTV(p,q)=12∑∣p−q∣d_{\rm TV}(p,q)=\frac12\sum|p-q|dTV​(p,q)=21​∑∣p−q∣. Assume c=∣X∣≥2c=|X|\ge2c=∣X∣≥2 and d=∣Y∣≥2d=|Y|\ge2d=∣Y∣≥2. If S(1)S(1)S(1) is the infimum of the message entropy of exact ordinary visible codes, there exists one attaining that infimum and satisfying

D∘E=W,H(E(P))=S(1),∣C∣≤cd−c+1.D\circ E=W,\qquad H(E(P))=S(1),\qquad |C|\le cd-c+1.D∘E=W,H(E(P))=S(1),∣C∣≤cd−c+1.

The bound refines the finite intermediate alphabet required for an entropy-optimal exact code.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P38
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P38

open scoped BigOperators Matrix ComplexConjugate

open Filter

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Frontier30.P12 (IsStochastic)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)

attribute [local instance] Classical.propDecidable

/-- Remark 16, PDF p.8: the improved finite alphabet bound still attains the entropy
minimum; C and D here are cardinalities, each at least two. -/
theorem remark16 {A B : Type} [Fintype A] [Fintype B] [Nonempty A] [Nonempty B]
    (ha : 2 ≤ Fintype.card A) (hb : 2 ≤ Fintype.card B)
    (p : A → ℝ) (w : A → B → ℝ) (hp : IsLaw p) (hw : IsStochastic w) :
    ∃ c : DistributionCompressionCode A B 1, c.Exact w ∧
      shannon (c.messageLaw p) = exactEntropy p w 1 ∧
      c.size ≤ Fintype.card A * Fintype.card B - Fintype.card A + 1 := by sorry

end QAlgorithms.Papers.Independent.Support50.P38

end
Source
Compression of sources of probability distributions and density operators, arXiv:quant-ph/0208131v1, PDF p. 8, Remark 16
Read-back

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

Let A,BA,BA,B be finite nonempty types with ∣A∣≥2|A|\ge2∣A∣≥2 and ∣B∣≥2|B|\ge2∣B∣≥2, let p:A→Rp:A\to\mathbb Rp:A→R be nonnegative with total mass 111, and let w:A→B→Rw:A\to B\to\mathbb Rw:A→B→R have nonnegative rows each summing to 111. There exists a length-one compression code with positive message count MMM, encoder probability distributions e(x,⋅)e(x,\cdot)e(x,⋅), and decoder probability distributions d(m,⋅)d(m,\cdot)d(m,⋅), for x∈A1,y∈B1x\in A^1,y\in B^1x∈A1,y∈B1, satisfying ∑me(x,m)d(m,y)=w(x0,y0)\sum_me(x,m)d(m,y)=w(x_0,y_0)∑m​e(x,m)d(m,y)=w(x0​,y0​) for every x,yx,yx,y. Its induced message distribution rc(m)=∑x∈A1p(x0)e(x,m)r_c(m)=\sum_{x\in A^1}p(x_0)e(x,m)rc​(m)=∑x∈A1​p(x0​)e(x,m) has Shannon entropy −∑mrc(m)log⁡2rc(m)-\sum_mr_c(m)\log_2r_c(m)−∑m​rc​(m)log2​rc​(m) equal to the real infimum of that entropy over all exact length-one codes, and its size satisfies

M≤∣A∣∣B∣−∣A∣+1.M\le |A||B|-|A|+1.M≤∣A∣∣B∣−∣A∣+1.

The subtraction is natural-number subtraction, truncated at zero, though the cardinality hypotheses ensure ∣A∣∣B∣≥∣A∣|A||B|\ge|A|∣A∣∣B∣≥∣A∣. Individual source or channel probabilities may be zero, and the exactness condition still quantifies over all input and output words.

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