Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.4

Open
QAlgorithms.Papers.Independent.Support50.P12.proposition_6_4

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

prove2quantum

Let A1⊆B(H1)\mathcal A_1\subseteq B(H_1)A1​⊆B(H1​) and A2⊆B(H2)\mathcal A_2\subseteq B(H_2)A2​⊆B(H2​) be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let Φ:A1→A2\Phi:\mathcal A_1\to\mathcal A_2Φ:A1​→A2​ be complex linear. The adjoint is for ⟨X,Y⟩HS=Tr⁡X∗Y\langle X,Y\rangle_{\rm HS}=\operatorname{Tr}X^*Y⟨X,Y⟩HS​=TrX∗Y. A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let A,B∈A1,+A,B\in\mathcal A_{1,+}A,B∈A1,+​. Powers are zero on kernels and traces are not normalized. Write Sα(A∥B)S_\alpha(A\Vert B)Sα​(A∥B) for the unnormalized Petz Rényi entropy, ψA,B(α)=log⁡Tr⁡AαB1−α\psi_{A,B}(\alpha)=\log\operatorname{Tr}A^\alpha B^{1-\alpha}ψA,B​(α)=logTrAαB1−α, C(A∥B)=sup⁡0≤α<1−ψA,B(α)C(A\Vert B)=\sup_{0\le\alpha<1}-\psi_{A,B}(\alpha)C(A∥B)=sup0≤α<1​−ψA,B​(α), and Hr(A∥B)=sup⁡0≤α<1[−αr−ψA,B(α)]/(1−α)H_r(A\Vert B)=\sup_{0\le\alpha<1}[-\alpha r-\psi_{A,B}(\alpha)]/(1-\alpha)Hr​(A∥B)=sup0≤α<1​[−αr−ψA,B​(α)]/(1−α). Logarithms are natural and log⁡0=−∞\log0=-\inftylog0=−∞. The Petz map is ΦB∗(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2\Phi_B^*(Y)=B^{1/2}\Phi^*(\Phi(B)^{-1/2}Y\Phi(B)^{-1/2})B^{1/2}ΦB∗​(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2.

If A\mathcal AA admits two nonzero orthogonal projections, then no admissible generator represents Chernoff distance on its whole density-operator space, and, for each fixed r>0r>0r>0, none represents HrH_rHr​:

existsf: C(ρ∥σ)=Sf(ρ∥σ) ∀ρ,σ;existsf: Hr(ρ∥σ)=Sf(ρ∥σ) ∀ρ,σ.exists f:\ C(\rho\Vert\sigma)=S_f(\rho\Vert\sigma)\ \forall\rho,\sigma;\qquad exists f:\ H_r(\rho\Vert\sigma)=S_f(\rho\Vert\sigma)\ \forall\rho,\sigma.existsf: C(ρ∥σ)=Sf​(ρ∥σ) ∀ρ,σ;existsf: Hr​(ρ∥σ)=Sf​(ρ∥σ) ∀ρ,σ.

The positive-rate scope is the operational parameter used in the proof; r=0r=0r=0 is excluded. Representation multiplicities do not change the algebraic nontriviality condition.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P12

open Filter MeasureTheory Set

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

open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)

open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)

open QAlgorithms.Papers.Independent.Next46.P23 (Supports)

open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)

open QAlgorithms (spectralProjector)

open QAlgorithms.Learning (IsDistribution)

open QAlgorithms.Papers.Independent.Information100.P04 (absOp)

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

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

/-- Proposition 6.4, PDF p.30: nonrepresentability on a nontrivial algebra;
Hoeffding's operational rate is strictly positive, as used by the source proof. -/
theorem proposition_6_4 [Nonempty I] (A : Alg I) (ha : TwoProjections A) :
    (¬ ∃ f, RepresentsStateDivergence A chernoff f) ∧
    ∀ r > (0 : ℝ), ¬ ∃ f, RepresentsStateDivergence A (fun X Y => hoeffding X Y r) f := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 30, Proposition 6.4
Read-back

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

Let III be a finite, nonempty index type with decidable equality, and let AAA be a unital complex star subalgebra of MI(C)M_I(\mathbb C)MI​(C) containing two nonzero Hermitian idempotents P,QP,QP,Q with PQ=0PQ=0PQ=0. For positive semidefinite matrices X,YX,YX,Y, let X[a]X^{[a]}X[a] denote spectral powers with value 000 at zero for every exponent, and define

LX,Y(a)=ℓ ⁣(Re⁡Tr⁡(X[a]Y[1−a])),C(X,Y)=sup⁡0≤a<1[−LX,Y(a)],Hr(X,Y)=sup⁡0≤a<1−ar−LX,Y(a)1−a,L_{X,Y}(a)=\ell\!\left(\operatorname{Re}\operatorname{Tr}(X^{[a]}Y^{[1-a]})\right),\quad C(X,Y)=\sup_{0\le a<1}[-L_{X,Y}(a)],\quad H_r(X,Y)=\sup_{0\le a<1}\frac{-ar-L_{X,Y}(a)}{1-a},LX,Y​(a)=ℓ(ReTr(X[a]Y[1−a])),C(X,Y)=0≤a<1sup​[−LX,Y​(a)],Hr​(X,Y)=0≤a<1sup​1−a−ar−LX,Y​(a)​,

where ℓ(q)=ln⁡q\ell(q)=\ln qℓ(q)=lnq for q>0q>0q>0 and −∞-\infty−∞ otherwise. For a real function fff, define

Qf(X,Y)=∑x∈spec⁡X∑y∈spec⁡Yy f(x/y)Re⁡Tr⁡(PxXPyY),Q_f(X,Y)=\sum_{x\in\operatorname{spec}X}\sum_{y\in\operatorname{spec}Y} y\,f(x/y)\operatorname{Re}\operatorname{Tr}(P_x^XP_y^Y),Qf​(X,Y)=x∈specX∑​y∈specY∑​yf(x/y)ReTr(PxX​PyY​),

using distinct eigenvalues, their orthogonal spectral projections, and the total division convention x/0=0x/0=0x/0=0; define Df(X,Y)=Qf(X,Y)\mathcal D_f(X,Y)=Q_f(X,Y)Df​(X,Y)=Qf​(X,Y) as an extended real when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and otherwise define it by the totalized extended-real limit of Qf(X,Y+ε1)Q_f(X,Y+\varepsilon1)Qf​(X,Y+ε1) as ε→0+\varepsilon\to0^+ε→0+. Call fff a divergence generator when it is continuous on (0,∞)(0,\infty)(0,∞) and f(x)/xf(x)/xf(x)/x, viewed in the extended reals, converges as x→+∞x\to+\inftyx→+∞ to the value selected by the corresponding total limit operation. There is no such generator fff for which C(X,Y)=Df(X,Y)C(X,Y)=\mathcal D_f(X,Y)C(X,Y)=Df​(X,Y) for every positive semidefinite X,Y∈AX,Y\in AX,Y∈A with real trace one. Furthermore, for every real r>0r>0r>0, there is no such generator fff for which Hr(X,Y)=Df(X,Y)H_r(X,Y)=\mathcal D_f(X,Y)Hr​(X,Y)=Df​(X,Y) for every such pair of algebra density matrices.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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