Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8.4.8 — Logarithm is operator concave

Proved
TroppMatrixConcentration.ch8_log_operator_concave

by tc · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexitymatrix-analysismatrix-concentration

The negative logarithm is operator convex on the positive real line. Equivalently, for positive-definite complex matrices A,HA,HA,H of any common positive finite dimension and 0≤t≤10\le t\le10≤t≤1,

tlog⁡A+(1−t)log⁡H⪯log⁡(tA+(1−t)H).t\log A+(1-t)\log H\preceq\log(tA+(1-t)H).tlogA+(1−t)logH⪯log(tA+(1−t)H).

This is concavity in semidefinite order, with no assumption that AAA and HHH commute.

Preamble
import Definitions.Def_TroppMatrixConcentration_ch8_entropy

open scoped Matrix.Norms.L2Operator ComplexOrder

Formal statement
namespace TroppMatrixConcentration

theorem ch8_log_operator_concave :
    ch8_operatorConvexOn (Set.Ioi 0) (fun x => -Real.log x) := by sorry

end TroppMatrixConcentration
Source
Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, arXiv:1501.01571v1 (7 January 2015); https://arxiv.org/abs/1501.01571v1; Proposition 8.4.8, printed pp. 130–131.
Read-back

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

The interval (0,∞)⊆R(0,\infty)\subseteq\mathbb R(0,∞)⊆R is convex, and for every natural number d≠0d\ne 0d=0, every pair of complex d×dd\times dd×d Hermitian matrices A,HA,HA,H whose spectra over R\mathbb RR are contained in (0,∞)(0,\infty)(0,∞), and every real number ttt with 0≤t≤10\le t\le 10≤t≤1, the matrix tF(A)+(1−t)F(H)−F(tA+(1−t)H)tF(A)+(1-t)F(H)-F(tA+(1-t)H)tF(A)+(1−t)F(H)−F(tA+(1−t)H) is positive semidefinite, where F(B)F(B)F(B) is the real continuous functional calculus of the function x↦−log⁡xx\mapsto-\log xx↦−logx evaluated at BBB. Here positive semidefinite means that the displayed matrix is Hermitian and its quadratic form is nonnegative on every vector in Cd\mathbb C^dCd; equivalently, F(tA+(1−t)H)⪯tF(A)+(1−t)F(H)F(tA+(1-t)H)\preceq tF(A)+(1-t)F(H)F(tA+(1−t)H)⪯tF(A)+(1−t)F(H) in the order defined by a positive semidefinite difference. The endpoint values t=0t=0t=0 and t=1t=1t=1 are included, while the zero-dimensional case is excluded by d≠0d\ne0d=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by tc · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by mikedeng1 · Oct 23, 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