Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, piecewise exponent

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.piecewiseExponent

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For nonorthogonal finite laws p,qp,qp,q, with overlap masses ψ0,ψ1>0\psi_0,\psi_1>0ψ0​,ψ1​>0 and conditional exponent e~\widetilde ee, the original exponent is

e(r)={+∞,0≤r<−log⁡ψ1,−log⁡ψ0+e~(r+log⁡ψ1),r≥−log⁡ψ1.e(r)=\begin{cases}+\infty,&0\le r<-\log\psi_1,\\-\log\psi_0+\widetilde e(r+\log\psi_1),&r\ge-\log\psi_1.\end{cases}e(r)={+∞,−logψ0​+e(r+logψ1​),​0≤r<−logψ1​,r≥−logψ1​.​

The threshold belongs to the finite branch. This corrects the reversed inequality printed in Lemma 4 using its own proof.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

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

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

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- arXiv:0708.4282v1, PDF p.24: Lemma 4, piecewise exponent. Source correction: PDF p.24 finite branch prints r<=-log psi1; changed to r>=-log psi1, as the proof explicitly assumes and proves. Rendered PDF checked; independent moderation required. -/
theorem piecewiseExponent (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q)
    (h0 : 0 < overlapMass p q) (h1 : 0 < overlapMass q p) (r : ℝ) (hr : 0 ≤ r) :
    classicalExponent p q r =
      if r < -Real.log (overlapMass q p) then ⊤
      else (((-Real.log (overlapMass p q) : ℝ) : EReal)+
        conditionalExponent p q (r+Real.log (overlapMass q p))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 24, Lemma 4, piecewise exponent
Read-back

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

Let III be a finite type with decidable equality, and let p,q:I→Rp,q:I\to\mathbb Rp,q:I→R be nonnegative laws of total mass one. Define C={i:pi>0, qi>0}C=\{i:p_i>0,\ q_i>0\}C={i:pi​>0, qi​>0}, u=∑i∈Cpiu=\sum_{i\in C}p_iu=∑i∈C​pi​, and v=∑i∈Cqiv=\sum_{i\in C}q_iv=∑i∈C​qi​, and assume u,v>0u,v>0u,v>0. Define laws on CCC by p^i=pi/u\widehat p_i=p_i/up​i​=pi​/u and q^i=qi/v\widehat q_i=q_i/vq​i​=qi​/v, and, for finite laws P,QP,QP,Q, define

EP,Q(t)=sup⁡0≤s<1−ts−L ⁣(∑iPi 1−sQi s)1−s,L(z)={log⁡z,z>0,−∞,z≤0.E_{P,Q}(t)=\sup_{0\le s<1} \frac{-ts-L\!\left(\sum_iP_i^{\,1-s}Q_i^{\,s}\right)}{1-s}, \qquad L(z)= \begin{cases}\log z,&z>0,\\-\infty,&z\le0.\end{cases}EP,Q​(t)=0≤s<1sup​1−s−ts−L(∑i​Pi1−s​Qis​)​,L(z)={logz,−∞,​z>0,z≤0.​

Here the supremum and arithmetic are extended-real, and real powers use 00=10^0=100=1. For every real r≥0r\ge0r≥0, the assertion is

Ep,q(r)={+∞,r<−log⁡v,−log⁡u+Ep^,q^(r+log⁡v),r≥−log⁡v.E_{p,q}(r)= \begin{cases} +\infty,&r<-\log v,\\ -\log u+E_{\widehat p,\widehat q}(r+\log v),&r\ge-\log v. \end{cases}Ep,q​(r)={+∞,−logu+Ep​,q​​(r+logv),​r<−logv,r≥−logv.​

Thus the equality case at the threshold belongs to the second branch; zero values of the original laws outside their common positive support are allowed.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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