Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rounded block length and separation bounds

Definition
Nonadditivity_Asymptotics

by JWang226 · Oct 7, 2026 · Mathlib c5ea003 (Lean v4.30.0)

holevo-additivity-gap-v100quantum-channelsquantum-informationreal-analysis

For a natural number KKK, define the integer block length nK=⌈K/log⁡K⌉n_K=\lceil K/\sqrt{\log K}\rceilnK​=⌈K/logK​⌉. The single-use upper comparison is uK=9nK/(Klog⁡2)+1/Ku_K=9n_K/(K\log2)+1/KuK​=9nK​/(Klog2)+1/K, and the half-two-use lower comparison is ℓK=nKlog⁡K/(2Klog⁡2)\ell_K=n_K\log K/(2K\log2)ℓK​=nK​logK/(2Klog2). The logarithm and the block length are positive for K≥2K\ge2K≥2. These explicit comparison functions supply the scalar quantities used in the channel separation limits.

Definition code
import Mathlib.Algebra.Order.Floor.Semiring
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Data.Real.Sqrt
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring

/-
Copyright (c) 2026 the Nonadditivity project contributors.
All rights reserved. See COPYRIGHT.md for licensing and attribution.
-/










/-!
# Asymptotic consequences of the numerical channel bounds

The sequence `blockLength K = ⌈K / √(ln K)⌉₊` is the actual sequence in
Corollary 4 (vanishing Holevo information and diverging capacity).
The scalar limits below are unconditional theorems of real analysis.
The channel-specific conclusion takes the proved numerical bounds as explicit
hypotheses; it does not assert or axiomatize the random-channel construction.
-/

namespace Nonadditivity.Asymptotics

open Filter Topology

noncomputable section

/-- The exact integer block length in the separation corollary. -/
def blockLength (K : ℕ) : ℕ := ⌈(K : ℝ) / Real.sqrt (Real.log K)⌉₊

/-- Upper bound for the single-use Holevo information, in bits. -/
def separationUpper (K : ℕ) : ℝ :=
  9 * (blockLength K : ℝ) / ((K : ℝ) * Real.log 2) + 1 / (K : ℝ)

/-- Lower bound for half of the two-use Holevo information, in bits. -/
def separationLower (K : ℕ) : ℝ :=
  (blockLength K : ℝ) * Real.log K / (2 * (K : ℝ) * Real.log 2)



lemma log_nat_pos {K : ℕ} (hK : 2 ≤ K) : 0 < Real.log (K : ℝ) := by
  apply Real.log_pos
  exact_mod_cast (show 1 < K by omega)

lemma blockLength_pos {K : ℕ} (hK : 2 ≤ K) : 0 < blockLength K := by
  unfold blockLength
  apply Nat.ceil_pos.2
  apply div_pos
  · exact_mod_cast (show 0 < K by omega)
  · exact Real.sqrt_pos.2 (log_nat_pos hK)





















































end

end Nonadditivity.Asymptotics
Source
https://github.com/JWang226/Holevo-Additivity-Gap/blob/635aa93eb3a2310b79fd5371e2ce311914ec5887/Nonadditivity/Asymptotics.lean#L31-L53
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by JWang226 · Oct 9, 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