Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hadamard bound for positive semidefinite complex matrices

Proved
complex_psd_det_le_prod_diag

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

linear-algebramatrix-analysis

For a finite Hermitian positive semidefinite complex matrix, the determinant is real and nonnegative, and it is at most the product of the real diagonal entries. This is the Hadamard determinant inequality in its positive semidefinite matrix form.

Preamble
import Mathlib.Analysis.Matrix.PosDef
open scoped ComplexOrder
Formal statement
theorem complex_psd_det_le_prod_diag {idx : Type*} [Fintype idx] [DecidableEq idx] (B : Matrix idx idx Complex) (hB : B.PosSemidef) : B.det.re <= Finset.prod Finset.univ (fun i : idx => (B i i).re) := by sorry
Source
Hadamard determinant inequality, Gram matrix formulation; https://en.wikipedia.org/wiki/Hadamard%27s_inequality. The target theorem cites this inequality applied to the columns of A.

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