AFTD Auto-Formalizing Theoretical Domains

HermitianMat.nonSingular_iff_reindex

theoremverifiedformalizationimported Lean

HermitianMat.nonSingular_iff_reindex

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
variable {n m R π•œ : Type*} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] in
variable [CommRing R] [StarRing R] [RCLike π•œ] in
variable (A : HermitianMat n R) (B : HermitianMat m R) in
variable {A : HermitianMat n π•œ} {B : HermitianMat m π•œ} {C : Matrix n n π•œ} in
open ComplexOrder in
@[simp]
theorem HermitianMat.nonSingular_iff_reindex (e : n ≃ m) : NonSingular (A.reindex e) ↔ NonSingular A
Formalizes
QuantumInfo, `HermitianMat.nonSingular_iff_reindex`
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 136
Used by 7

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
variable {n m R π•œ : Type*} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] in
variable [CommRing R] [StarRing R] [RCLike π•œ] in
variable (A : HermitianMat n R) (B : HermitianMat m R) in
variable {A : HermitianMat n π•œ} {B : HermitianMat m π•œ} {C : Matrix n n π•œ} in
open ComplexOrder in
@[simp]
theorem HermitianMat.nonSingular_iff_reindex (e : n ≃ m) : NonSingular (A.reindex e) ↔ NonSingular A := by
  rw [nonSingular_iff_det_ne_zero, nonSingular_iff_det_ne_zero]
  rw [reindex_eq_conj, ← Matrix.det_reindex_self e, conj_apply_mat]
  congr! 2
  ext : 2
  simp [Matrix.mul_apply, Matrix.one_apply]
See it in the graphDiscuss this resultChallenge it