Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, full unequal-support profile

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.classicalProfile

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

prove2quantum

For nonorthogonal finite laws, let a=−log⁡ψ1a=-\log\psi_1a=−logψ1​, b=−log⁡ψ0b=-\log\psi_0b=−logψ0​, h=H(p~∥q~)h=H(\widetilde p\|\widetilde q)h=H(p​∥q​) and h′=H(q~∥p~)h'=H(\widetilde q\|\widetilde p)h′=H(q​∥p​). Then

e(r)=+∞ (0≤r<a),e(a)=b+h′=H(q~∥p),e(r)=+\infty\ (0\le r<a),\qquad e(a)=b+h'=H(\widetilde q\|p),e(r)=+∞ (0≤r<a),e(a)=b+h′=H(q​∥p), a+h=H(p~∥q),e(r)=b (r≥a+h).a+h=H(\widetilde p\|q),\qquad e(r)=b\ (r\ge a+h).a+h=H(p​∥q),e(r)=b (r≥a+h).

On [a,∞)[a,\infty)[a,∞) the exponent is finite, convex and non-increasing. If the conditional laws differ, it is strictly convex and strictly decreasing on [a,a+h][a,a+h][a,a+h]. If they coincide, it equals bbb throughout [a,∞)[a,\infty)[a,∞). Conditional laws in entropies against ambient laws are extended by zero outside the overlap.

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 pp.24,25: §5.2, full unequal-support profile. -/
theorem classicalProfile (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q)
    (h0 : 0 < overlapMass p q) (h1 : 0 < overlapMass q p) :
    Profile p q (classicalExponent p q) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 24, §5.2, full unequal-support profile
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. Let C={i:pi>0, qi>0}C=\{i:p_i>0,\ q_i>0\}C={i:pi​>0, qi​>0}, u=∑i∈Cpi>0u=\sum_{i\in C}p_i>0u=∑i∈C​pi​>0, v=∑i∈Cqi>0v=\sum_{i\in C}q_i>0v=∑i∈C​qi​>0, 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 on CCC. Write A=−log⁡vA=-\log vA=−logv, B=−log⁡uB=-\log uB=−logu, h=K(p^∥q^)h=K(\widehat p\Vert\widehat q)h=K(p​∥q​), and hrev=K(q^∥p^)h_{\mathrm{rev}}=K(\widehat q\Vert\widehat p)hrev​=K(q​∥p​), where K(P∥Q)=∑i:Pi>0Pilog⁡(Pi/Qi)K(P\Vert Q)=\sum_{i:P_i>0}P_i\log(P_i/Q_i)K(P∥Q)=∑i:Pi​>0​Pi​log(Pi​/Qi​) if Pi>0P_i>0Pi​>0 implies Qi>0Q_i>0Qi​>0, and K(P∥Q)=+∞K(P\Vert Q)=+\inftyK(P∥Q)=+∞ otherwise. Put

e(r)=sup⁡0≤s<1−rs−L ⁣(∑ipi 1−sqi s)1−s,L(z)={log⁡z,z>0,−∞,z≤0,e(r)=\sup_{0\le s<1} \frac{-rs-L\!\left(\sum_i p_i^{\,1-s}q_i^{\,s}\right)}{1-s}, \qquad L(z)= \begin{cases}\log z,&z>0,\\-\infty,&z\le0,\end{cases}e(r)=0≤s<1sup​1−s−rs−L(∑i​pi1−s​qis​)​,L(z)={logz,−∞,​z>0,z≤0,​

with real powers, including 00=10^0=100=1, and extended-real arithmetic. The assertion is that e(r)=+∞e(r)=+\inftye(r)=+∞ whenever 0≤r<A0\le r<A0≤r<A; e(A)=B+hreve(A)=B+h_{\mathrm{rev}}e(A)=B+hrev​; B+hrev=K(qC∥p)B+h_{\mathrm{rev}}=K(q^{C}\Vert p)B+hrev​=K(qC∥p) and A+h=K(pC∥q)A+h=K(p^{C}\Vert q)A+h=K(pC∥q), where piC=pi/up^{C}_i=p_i/upiC​=pi​/u and qiC=qi/vq^{C}_i=q_i/vqiC​=qi​/v on CCC and both are zero outside CCC; e(r)e(r)e(r) is neither +∞+\infty+∞ nor −∞-\infty−∞ for every r≥Ar\ge Ar≥A; eee is nonincreasing on [A,∞)[A,\infty)[A,∞); and its real-valued conversion is convex there. Furthermore, e(r)=Be(r)=Be(r)=B whenever r≥A+h.toRealr\ge A+h.toRealr≥A+h.toReal; if p^≠q^\widehat p\ne\widehat qp​=q​, its real-valued conversion is strictly convex and eee is strictly decreasing on the closed interval [A,A+h.toReal][A,A+h.toReal][A,A+h.toReal]; and if p^=q^\widehat p=\widehat qp​=q​, then e(r)=Be(r)=Be(r)=B for every r≥Ar\ge Ar≥A. Here h.toRealh.toRealh.toReal is the real conversion of the extended-real hhh, which sends either infinite endpoint to zero; all interval endpoints and equality cases are included as written.

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