AFTD Auto-Formalizing Theoretical Domains

Matrix.PosDef.reindex

theoremverifiedformalizationimported Lean

Matrix.PosDef.reindex

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix in
open BigOperators in
variable {n ๐•œ : Type*} in
variable [RCLike ๐•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open ComplexOrder in
open Kronecker in
theorem Matrix.PosDef.reindex {dโ‚ dโ‚‚ ๐•œ : Type*} [Fintype dโ‚] [DecidableEq dโ‚] [Fintype dโ‚‚] [DecidableEq dโ‚‚] [RCLike ๐•œ]
    {M : Matrix dโ‚ dโ‚ ๐•œ} (hM : M.PosDef) (e : dโ‚ โ‰ƒ dโ‚‚) : (M.reindex e e).PosDef
Formalizes
QuantumInfo, `Matrix.PosDef.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

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix in
open BigOperators in
variable {n ๐•œ : Type*} in
variable [RCLike ๐•œ] [DecidableEq n] in
open scoped ComplexOrder MatrixOrder in
open ComplexOrder in
open Kronecker in
theorem Matrix.PosDef.reindex {dโ‚ dโ‚‚ ๐•œ : Type*} [Fintype dโ‚] [DecidableEq dโ‚] [Fintype dโ‚‚] [DecidableEq dโ‚‚] [RCLike ๐•œ]
    {M : Matrix dโ‚ dโ‚ ๐•œ} (hM : M.PosDef) (e : dโ‚ โ‰ƒ dโ‚‚) : (M.reindex e e).PosDef :=
  hM.submatrix e.symm.injective
See it in the graphDiscuss this resultChallenge it