AFTD Auto-Formalizing Theoretical Domains

HermitianMat.conj_pos

theoremverifiedformalizationimported Lean

HermitianMat.conj_pos

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
open ComplexOrder in
variable {π•œ : Type*} [RCLike π•œ] in
variable {n m ΞΉ : Type*} [Fintype n] [Fintype m] [Fintype ΞΉ] in
variable {A B C : HermitianMat n π•œ} in
variable {M : Matrix m n π•œ} {N : Matrix n n π•œ} in
theorem HermitianMat.conj_pos [DecidableEq n] {A : HermitianMat n π•œ} {M : Matrix m n π•œ} (hA : 0 < A)
    (h : LinearMap.ker M.toEuclideanLin ≀ A.ker) : 0 < A.conj M
Formalizes
QuantumInfo, `HermitianMat.conj_pos`
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
Built on 126

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
open ComplexOrder in
variable {π•œ : Type*} [RCLike π•œ] in
variable {n m ΞΉ : Type*} [Fintype n] [Fintype m] [Fintype ΞΉ] in
variable {A B C : HermitianMat n π•œ} in
variable {M : Matrix m n π•œ} {N : Matrix n n π•œ} in
theorem HermitianMat.conj_pos [DecidableEq n] {A : HermitianMat n π•œ} {M : Matrix m n π•œ} (hA : 0 < A)
    (h : LinearMap.ker M.toEuclideanLin ≀ A.ker) : 0 < A.conj M := by
  classical exact (A.conj_nonneg M hA.le).lt_of_ne' (A.conj_ne_zero hA.ne' h)
See it in the graphDiscuss this resultChallenge it