AFTD Auto-Formalizing Theoretical Domains

HermitianMat.conj_submatrix

theoremverifiedformalizationimported Lean

HermitianMat.conj_submatrix

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
variable {d d₂ d₃ d₄ 𝕜 : Type*} [RCLike 𝕜] in
variable (A B : HermitianMat d 𝕜) (e : d ≃ d₂) in
variable [Fintype d] in
set_option backward.isDefEq.respectTransparency false in
theorem HermitianMat.conj_submatrix (B : Matrix d₂ d₄ 𝕜) (e : d₃ ≃ d₂) (f : d → d₄) :
    A.conj (B.submatrix e f) = (A.conj (B.submatrix id f)).reindex e.symm
Formalizes
QuantumInfo, `HermitianMat.conj_submatrix`
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 95

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open HermitianMat in
variable {d d₂ d₃ d₄ 𝕜 : Type*} [RCLike 𝕜] in
variable (A B : HermitianMat d 𝕜) (e : d ≃ d₂) in
variable [Fintype d] in
set_option backward.isDefEq.respectTransparency false in
theorem HermitianMat.conj_submatrix (B : Matrix d₂ d₄ 𝕜) (e : d₃ ≃ d₂) (f : d → d₄) :
    A.conj (B.submatrix e f) = (A.conj (B.submatrix id f)).reindex e.symm := by
  ext1
  simp [conj_apply, ← Matrix.submatrix_mul_equiv (e₂ := .refl d)]
See it in the graphDiscuss this resultChallenge it