Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.3

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.lieb_ando_tensor

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

prove2quantum

All 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.

(A,B)↦A^α⊗B^(1−α) on positive definite operators is jointly operator concave for 0<α<1 and jointly operator convex for −1<α<0 or 1<α<2.

(A,B)↦Aα⊗B1−α is jointly concave for 0<α<1 and jointly convex for α∈(−1,0)∪(1,2).(A,B)\mapsto A^\alpha\otimes B^{1-\alpha}\text{ is jointly concave for }0<\alpha<1\text{ and jointly convex for }\alpha\in(-1,0)\cup(1,2).(A,B)↦Aα⊗B1−α is jointly concave for 0<α<1 and jointly convex for α∈(−1,0)∪(1,2).

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
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.3
A.3, arXiv:1504.00233v5, PDF p.126. -/
theorem lieb_ando_tensor [Nonempty I] [Nonempty J] (M R : paperMat I) (N S : paperMat J)
    (hM : M.PosDef) (hN : N.PosDef) (hR : R.PosDef) (hS : S.PosDef)
    (l : ℝ) (hl : l ∈ Set.Icc 0 1) (a : ℝ) :
    (0 < a → a < 1 → paperBelow (paperMix l (Matrix.kronecker (paperPower M a) (paperPower N (1-a)))
      (Matrix.kronecker (paperPower R a) (paperPower S (1-a)))) (Matrix.kronecker (paperPower (paperMix l M R) a) (paperPower (paperMix l N S) (1-a)))) ∧
    ((-1 < a ∧ a < 0) ∨ (1 < a ∧ a < 2) → paperBelow (Matrix.kronecker (paperPower (paperMix l M R) a) (paperPower (paperMix l N S) (1-a)))
      (paperMix l (Matrix.kronecker (paperPower M a) (paperPower N (1-a))) (Matrix.kronecker (paperPower R a) (paperPower S (1-a))))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 126, A.3
Read-back

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

For finite nonempty index types I,JI,JI,J, with decidable equality, let M,R∈CI×IM,R\in\mathbb C^{I\times I}M,R∈CI×I and N,S∈CJ×JN,S\in\mathbb C^{J\times J}N,S∈CJ×J all be positive definite, let l∈[0,1]l\in[0,1]l∈[0,1], and let a∈Ra\in\mathbb Ra∈R be arbitrary. Write Ml=lM+(1−l)RM_l=lM+(1-l)RMl​=lM+(1−l)R, Nl=lN+(1−l)SN_l=lN+(1-l)SNl​=lN+(1−l)S, and A⪯BA\preceq BA⪯B when B−AB-AB−A is positive semidefinite. Matrix powers here are defined by spectral functional calculus using the scalar function that is 000 at 000 and xbx^bxb at nonzero xxx, for exponent bbb. The assertion is the conjunction of the following implications:

0<a<1⟹l(Ma⊗N1−a)+(1−l)(Ra⊗S1−a)⪯Mla⊗Nl1−a,(−1<a<0) or (1<a<2)⟹Mla⊗Nl1−a⪯l(Ma⊗N1−a)+(1−l)(Ra⊗S1−a).\begin{aligned} 0<a<1\quad&\Longrightarrow\quad l(M^a\otimes N^{1-a})+(1-l)(R^a\otimes S^{1-a}) \preceq M_l^a\otimes N_l^{1-a},\\ (-1<a<0)\ \text{or}\ (1<a<2)\quad&\Longrightarrow\quad M_l^a\otimes N_l^{1-a} \preceq l(M^a\otimes N^{1-a})+(1-l)(R^a\otimes S^{1-a}). \end{aligned}0<a<1(−1<a<0) or (1<a<2)​⟹l(Ma⊗N1−a)+(1−l)(Ra⊗S1−a)⪯Mla​⊗Nl1−a​,⟹Mla​⊗Nl1−a​⪯l(Ma⊗N1−a)+(1−l)(Ra⊗S1−a).​

Here ⊗\otimes⊗ is the Kronecker product. Both implications are vacuous when aaa lies outside their stated ranges, including a=−1,0,1,2a=-1,0,1,2a=−1,0,1,2.

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