AFTD Auto-Formalizing Theoretical Domains

HermitianMat.conj_ne_zero

theoremverifiedformalizationimported Lean

HermitianMat.conj_ne_zero

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
variable {Ξ± R π•œ : Type*} {m n : Type*} in
variable [Star R] [TrivialStar R] in
variable [RCLike π•œ] in
variable {d dβ‚‚ : Type*} [Fintype d] [DecidableEq d] [Fintype dβ‚‚] [DecidableEq dβ‚‚] in
theorem HermitianMat.conj_ne_zero {A : HermitianMat d π•œ} {M : Matrix dβ‚‚ d π•œ} (hA : A β‰  0)
    (h : LinearMap.ker M.toEuclideanLin ≀ A.ker) : A.conj M β‰  0
Formalizes
QuantumInfo, `HermitianMat.conj_ne_zero`
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 83
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
variable {Ξ± R π•œ : Type*} {m n : Type*} in
variable [Star R] [TrivialStar R] in
variable [RCLike π•œ] in
variable {d dβ‚‚ : Type*} [Fintype d] [DecidableEq d] [Fintype dβ‚‚] [DecidableEq dβ‚‚] in
theorem HermitianMat.conj_ne_zero {A : HermitianMat d π•œ} {M : Matrix dβ‚‚ d π•œ} (hA : A β‰  0)
    (h : LinearMap.ker M.toEuclideanLin ≀ A.ker) : A.conj M β‰  0 := by
  by_contra h_contra
  have h_range : LinearMap.range A.mat.toEuclideanLin ≀ LinearMap.ker A.mat.toEuclideanLin := by
    have h_range : LinearMap.range (A.mat * M.conjTranspose).toEuclideanLin ≀ LinearMap.ker M.toEuclideanLin := by
      rintro x ⟨y, rfl⟩
      replace h_contra := congr($(h_contra).mat)
      simp_all [Matrix.toLpLin_apply, Matrix.mul_assoc]
    rw [← Matrix.range_mul_conjTranspose_of_ker_le_ker h]
    exact h_range.trans h
  exact hA (range_le_ker_imp_zero h_range)
See it in the graphDiscuss this resultChallenge it