AFTD Auto-Formalizing Theoretical Domains

MatrixMap.submatrix

defimported Lean

The MatrixMap corresponding to applying a submatrix operation on each side.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {A B C D E F R : Type*} [Fintype A] [DecidableEq A] in
variable {A B : Type*} (R : Type*) [Semiring R] in
@[simps]
def MatrixMap.submatrix (f : B → A) : MatrixMap A B R
Defined in
QuantumInfo, `MatrixMap.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
16 Oct 2026
Axioms
none listed
Built on 3
  • MatrixMap.choi_map_invProves that MatrixMap.choi_matrix and MatrixMap.of_choi_matrix inverses.
  • MatrixMap.map_choi_invProves that MatrixMap.of_choi_matrix and MatrixMap.choi_matrix inverses.
  • MatrixMapA MatrixMap is a linear map between squares matrices of size A to size B, over R.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {A B C D E F R : Type*} [Fintype A] [DecidableEq A] in
variable {A B : Type*} (R : Type*) [Semiring R] in
/-- The `MatrixMap` corresponding to applying a `submatrix` operation on each side. -/
@[simps]
def MatrixMap.submatrix (f : B → A) : MatrixMap A B R where
  toFun x := x.submatrix f f
  map_add' := by simp [Matrix.submatrix_add]
  map_smul' := by simp [Matrix.submatrix_smul]
See it in the graphDiscuss this resultChallenge it