Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma I.8: Pr(TV,P,alpha)≥1−a/alpha² and |TV,P,alpha|≤2^(nH(P)+K a alpha sqrt(n)), K=2log2(e)/e.

Proved
QAlgorithms.Papers.Independent.Renew46.P43.classicalTypical

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

prove2quantum

Let XXX be a finite nonempty alphabet of size aaa, PPP a normalized law, n>0n>0n>0 and α>0\alpha>0α>0. A word is variance typical if each count differs from nP(x)nP(x)nP(x) by at most αnP(x)(1−P(x))\alpha\sqrt{nP(x)(1-P(x))}αnP(x)(1−P(x))​. Put KV=2log⁡2(e)/eK_V=2\log_2(e)/eKV​=2log2​(e)/e.

P⊗n(TV,P,αn)≥1−a/α2,∣TV,P,αn∣≤2nH(P)+KVaαn.P^{\otimes n}(T_{V,P,\alpha}^n)\ge1-a/\alpha^2,\qquad |T_{V,P,\alpha}^n|\le2^{nH(P)+K_Va\alpha\sqrt n}.P⊗n(TV,P,αn​)≥1−a/α2,∣TV,P,αn​∣≤2nH(P)+KV​aα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

/-- Lemma I.8, PDF pp.11-12. Printed d in the cardinality bound is corrected to
alphabet size a: the proof is the eigenvalue-list counting argument, and there is no
quantum dimension in this classical statement. See MODERATION_NOTES.md. -/
theorem classicalTypical {I : Type} [Fintype I] [DecidableEq I] [Nonempty I]
    (P : PMF I) (n : ℕ) (hn : 0 < n) (alpha : ℝ) (halpha : 0 < alpha) :
    (∑ w ∈ varianceSet P n alpha, ∏ k, (P (w k)).toReal) ≥
      1 - Fintype.card I / alpha^2 ∧
    ((varianceSet P n alpha).card : ℝ) ≤
      exp2 (n * pmfEntropy P + varianceConstant * Fintype.card I * alpha * Real.sqrt n) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 11, Lemma I.8
Read-back

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

Let III be a finite, nonempty set with decidable equality, let PPP be a probability mass function on III, and write pi=P(i)p_i=P(i)pi​=P(i) as a real number. For every positive integer nnn and every real α>0\alpha>0α>0, define Ni(w)=∣{k∈{0,…,n−1}:wk=i}∣N_i(w)=|\{k\in\{0,\ldots,n-1\}:w_k=i\}|Ni​(w)=∣{k∈{0,…,n−1}:wk​=i}∣ and

V={w∈In: ∀i∈I,∣Ni(w)−npi∣≤αpi(1−pi)n}.V=\left\{w\in I^n:\ \forall i\in I,\quad |N_i(w)-np_i|\le \alpha\sqrt{p_i(1-p_i)}\sqrt n\right\}.V={w∈In: ∀i∈I,∣Ni​(w)−npi​∣≤αpi​(1−pi​)​n​}.

Writing H(P)=−∑i∈Ipilog⁡2piH(P)=-\sum_{i\in I}p_i\log_2 p_iH(P)=−∑i∈I​pi​log2​pi​, with zero terms contributing zero, and c=2log⁡2(e)/ec=2\log_2(e)/ec=2log2​(e)/e, the declaration asserts both

∑w∈V∏k=0n−1pwk≥1−∣I∣α2,∣V∣≤2 nH(P)+c∣I∣αn.\sum_{w\in V}\prod_{k=0}^{n-1}p_{w_k}\ge 1-\frac{|I|}{\alpha^2}, \qquad |V|\le 2^{\,nH(P)+c|I|\alpha\sqrt n}.w∈V∑​k=0∏n−1​pwk​​≥1−α2∣I∣​,∣V∣≤2nH(P)+c∣I∣αn​.

Zero probabilities are allowed: the defining condition then requires the corresponding symbol to occur zero times; a symbol of probability one must occur nnn times. The first lower bound is permitted to be negative.

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