Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Testing error below one bounds the finite Rényi threshold

Proved
ChannelContinuity.FiniteAnalyticInputs.threshold_le_of_eventual_sqrt_bound

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

channel-renyi-continuity-jwang226quantum-information

Let (d,f,c,E)(d,f,c,E)(d,f,c,E) be finite analytic input data: d≥0d\ge0d≥0, fff is monotone on (1,∞)(1,\infty)(1,∞) and bounded below by ddd, E(n,r)≥0E(n,r)\ge0E(n,r)≥0, and the package's weak-testing, Rényi-testing, and raw Schatten estimates hold. Here fff is the order-dependent scalar divergence, ccc its finite cap, and EEE the testing quantity. Set d+=inf⁡a>1f(a)d_+=\inf_{a>1}f(a)d+​=infa>1​f(a). If r≥0r\ge0r≥0, B<1B<1B<1, and E(n,r)≤B\sqrt{E(n,r)}\le BE(n,r)​≤B for all sufficiently large nnn, then

d+≤r.d_+\le r.d+​≤r.

This conditional scalar criterion converts a persistent testing error strictly below one into an upper bound on the right-hand threshold; its analytic input package is part of the hypothesis.

Preamble
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Analysis.Complex.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Analysis.SpecificLimits.Basic
import Mathlib.LinearAlgebra.Matrix.PosDef
import Mathlib.Order.ConditionallyCompleteLattice.Basic
import Mathlib.Order.LiminfLimsup
import Mathlib.Tactic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Instances.ENNReal.Lemmas
import Mathlib.Topology.Order.Monotone
import Definitions.Def_CRCD_ChannelContinuity_Main
import Definitions.Def_CRCD_ChannelContinuity_Parameters
import Definitions.Def_CRCD_ChannelContinuity_Testing
import Definitions.Def_CRCD_ChannelContinuity_ThreePiece

/-
Copyright (c) 2026 Jinzhao Wang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jinzhao Wang (AI-assisted formalization)
-/










/-!
# Scalar limit argument for Theorem 1

The successive limit passages, testing-threshold argument, and left/right
assembly are proved. `FiniteAnalyticInputs` records the scalar estimates needed
for the finite right-limit argument; its raw Schatten estimate is normalized
here. `QuantumChannelContinuity.QuantumMain` derives that estimate from the
proved operator bounds, and `QuantumChannelContinuity.ContinuityAssembly`
constructs the input record for concrete channels in the finite branch.
`QuantumChannelContinuity.Main` combines the finite and infinite cases with
the proved state-order facts to export the unconditional channel theorem.
-/

open Filter Set
open scoped Topology ENNReal

namespace ChannelContinuity
end ChannelContinuity
open ChannelContinuity
Formal statement
theorem ChannelContinuity.FiniteAnalyticInputs.threshold_le_of_eventual_sqrt_bound
    (h : FiniteAnalyticInputs) {r B : ℝ} (hr : 0 ≤ r) (hBlt : B < 1)
    (hBevent : ∀ᶠ n in atTop, Real.sqrt (h.testing n r) ≤ B) :
    sInf (h.renyi '' Ioi 1) ≤ r := by sorry
Source
https://github.com/JWang226/Continuity-of-regularized-channel-renyi-divergence/blob/e29274a69978bb499f00497481c6008befb0b84d/ChannelContinuity/Main.lean#L81-L105

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me