A.2
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.inverse_perspective_curvatureAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. All matrix arguments A,B (and the corresponding second pair in convex combinations) are positive definite; X is an arbitrary rectangular linear map, and convexity is in Loewner order.
On positive definite matrix pairs, BA^{-1}B is jointly operator convex and (A^{-1}+B^{-1})^{-1} is jointly operator concave.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#A.2
A.2, arXiv:1504.00233v5, PDF p.125. -/
theorem inverse_perspective_curvature [Nonempty I] (M N R S : paperMat I) (hM : M.PosDef) (hN : N.PosDef)
(hR : R.PosDef) (hS : S.PosDef) (l : ℝ) (hl : l ∈ Set.Icc 0 1) :
paperBelow (paperMix l N S*(paperMix l M R)⁻¹*paperMix l N S) (paperMix l (N*M⁻¹*N) (S*R⁻¹*S)) ∧
paperBelow (paperMix l ((M⁻¹+N⁻¹)⁻¹) ((R⁻¹+S⁻¹)⁻¹)) (((paperMix l M R)⁻¹+(paperMix l N S)⁻¹)⁻¹) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For a finite nonempty index type , with decidable equality, let all be positive definite, and let , including both endpoints. Put and . Then both inequalities hold:
In each inequality, means that is positive semidefinite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.