§5.3, quantum profile (44)–(45)
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.quantumProfileFor density operators and their chosen spectral-pair laws , the quantum exponent satisfies
If the pair is nonorthogonal, it has the complete conditional profile: below , and for . At it equals ; it is finite, convex and non-increasing thereafter, and is constant for . Strictness is asserted only for distinct conditional laws. Supports are defined by actual positive probabilities.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
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.25,26,27: §5.3, quantum profile (44)–(45). Source corrections: PDF p.25 (45) repeats the reversed finite-branch inequality; use >= from Lemma 4 proof. Its support shorthand also omits zero overlap weights; use positive p and q. Independent moderation required. -/
theorem quantumProfile (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(D : SpectralPair rho sigma) :
(∀ r : ℝ, 0 ≤ r → quantumExponent rho sigma r=
classicalExponent (spectralP D) (spectralQ D) r) ∧
(0 < overlapMass (spectralP D) (spectralQ D) →
0 < overlapMass (spectralQ D) (spectralP D) →
Profile (spectralP D) (spectralQ D) (quantumExponent rho sigma) ∧
∀ r : ℝ, 0 ≤ r → quantumExponent rho sigma r=
if r < -Real.log (overlapMass (spectralQ D) (spectralP D)) then ⊤
else (((-Real.log (overlapMass (spectralP D) (spectralQ D)) : ℝ) : EReal)+
conditionalExponent (spectralP D) (spectralQ D)
(r+Real.log (overlapMass (spectralQ D) (spectralP D))))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite type with decidable equality, and let be complex matrices indexed by , each positive semidefinite with trace one. Let a spectral pair consist of unitary matrices , nonnegative real families , and equalities and . On , define and . Let for and otherwise, and define
Matrix powers here mean continuous functional calculus for the real-power function; scalar real powers include . The first assertion is for every real . For the second assertion, let , , and ; if , put and on , , , , and , where when the positive support of is contained in that of , and otherwise. Then satisfies all of the following: for ; ; , where the conditional laws are extended by zero outside ; is finite for every , is nonincreasing there, and has a convex real-valued conversion there; for ; if , the real-valued conversion is strictly convex and is strictly decreasing on ; and if , then for all . The real conversion sends either infinite endpoint to zero. Under the same positive-overlap assumptions, every also satisfies
The first assertion requires no positive-overlap assumption; all the subsequent assertions are conditional on both overlaps being positive. An empty cannot satisfy the density-matrix hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.