AFTD Auto-Formalizing Theoretical Domains

Matrix.PosSemidef.nonneg_iff_eigenvalue_nonneg

theoremverifiedformalizationimported Lean

Matrix.PosSemidef.nonneg_iff_eigenvalue_nonneg

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix Matrix.PosSemidef in
open BigOperators in
variable {n ๐•œ : Type*} in
variable [RCLike ๐•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open scoped ComplexOrder in
open scoped MatrixOrder in
variable {n m ๐•œ : Type*} in
variable [Fintype n] [Fintype m] [RCLike ๐•œ] [DecidableEq m] in
variable {A : Matrix n n ๐•œ} {B : Matrix n n ๐•œ} in
variable (hA : A.IsHermitian) (hB : B.IsHermitian) in
theorem Matrix.PosSemidef.nonneg_iff_eigenvalue_nonneg [DecidableEq n] : 0 โ‰ค A โ†” โˆ€ x, 0 โ‰ค hA.eigenvalues x
Formalizes
QuantumInfo, `Matrix.PosSemidef.nonneg_iff_eigenvalue_nonneg`
Lean proof
By Alex Meiburg, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix Matrix.PosSemidef in
open BigOperators in
variable {n ๐•œ : Type*} in
variable [RCLike ๐•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open scoped ComplexOrder in
open scoped MatrixOrder in
variable {n m ๐•œ : Type*} in
variable [Fintype n] [Fintype m] [RCLike ๐•œ] [DecidableEq m] in
variable {A : Matrix n n ๐•œ} {B : Matrix n n ๐•œ} in
variable (hA : A.IsHermitian) (hB : B.IsHermitian) in
theorem Matrix.PosSemidef.nonneg_iff_eigenvalue_nonneg [DecidableEq n] : 0 โ‰ค A โ†” โˆ€ x, 0 โ‰ค hA.eigenvalues x :=
  Iff.trans Matrix.nonneg_iff_posSemidef hA.posSemidef_iff_eigenvalues_nonneg
See it in the graphDiscuss this resultChallenge it