§5.2, full unequal-support profile
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.classicalProfileFor nonorthogonal finite laws, let , , and . Then
On the exponent is finite, convex and non-increasing. If the conditional laws differ, it is strictly convex and strictly decreasing on . If they coincide, it equals throughout . Conditional laws in entropies against ambient laws are extended by zero outside the overlap.
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.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
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 nonnegative laws of total mass one. Let , , , , and on . Write , , , and , where if implies , and otherwise. Put
with real powers, including , and extended-real arithmetic. The assertion is that whenever ; ; and , where and on and both are zero outside ; is neither nor for every ; is nonincreasing on ; and its real-valued conversion is convex there. Furthermore, whenever ; if , its real-valued conversion is strictly convex and is strictly decreasing on the closed interval ; and if , then for every . Here is the real conversion of the extended-real , which sends either infinite endpoint to zero; all interval endpoints and equality cases are included as written.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.