AFTD Auto-Formalizing Theoretical Domains

Matrix.PosDef.toLin_ker_eq_bot

theoremverifiedformalizationimported Lean

Matrix.PosDef.toLin_ker_eq_bot

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix Matrix.PosDef in
open BigOperators in
variable {n ๐•œ : Type*} in
variable [RCLike ๐•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open scoped ComplexOrder in
variable {n m ๐•œ : Type*} in
variable [Fintype n] [RCLike ๐•œ] [DecidableEq n] in
variable {A : Matrix n n ๐•œ} in
theorem Matrix.PosDef.toLin_ker_eq_bot (hA : A.PosDef) : LinearMap.ker A.toLin' = โŠฅ
Formalizes
QuantumInfo, `Matrix.PosDef.toLin_ker_eq_bot`
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.PosDef in
open BigOperators in
variable {n ๐•œ : Type*} in
variable [RCLike ๐•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open scoped ComplexOrder in
variable {n m ๐•œ : Type*} in
variable [Fintype n] [RCLike ๐•œ] [DecidableEq n] in
variable {A : Matrix n n ๐•œ} in
theorem Matrix.PosDef.toLin_ker_eq_bot (hA : A.PosDef) : LinearMap.ker A.toLin' = โŠฅ := by
  ext v
  rw [Matrix.posDef_iff_dotProduct_mulVec] at hA
  have := @hA.right v
  grind [mulVec_zero, dotProduct_zero, LinearMap.mem_ker, toLin'_apply, Submodule.mem_bot]
See it in the graphDiscuss this resultChallenge it