AFTD Auto-Formalizing Theoretical Domains

MatrixMap.choi_map_inv

theoremverifiedformalizationimported Lean

Proves that MatrixMap.choi_matrix and MatrixMap.of_choi_matrix inverses.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MatrixMap in
variable {A B C D E F R : Type*} [Fintype A] [DecidableEq A] in
variable [Semiring R] in
set_option backward.isDefEq.respectTransparency false in
@[simp]
theorem MatrixMap.choi_map_inv (M : MatrixMap A B R) : of_choi_matrix (choi_matrix M) = M
Formalizes
QuantumInfo, `MatrixMap.choi_map_inv`
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
Classical.choiceQuot.soundpropext
Built on 4
  • MatrixMap.choi_matrixChoi matrix of a given linear matrix map. Note that this is defined even for things that aren't CPTP, it's just rarely talked about in…
  • MatrixMap.map_choi_invProves that MatrixMap.of_choi_matrix and MatrixMap.choi_matrix inverses.
  • MatrixMap.of_choi_matrixGiven the Choi matrix, generate the corresponding R-linear map between matrices as a MatrixMap. This is the inverse of…
  • MatrixMapA MatrixMap is a linear map between squares matrices of size A to size B, over R.
Used by 7
  • MatrixMap.choi_matrix_injThe correspondence induced by MatrixMap.of_choi_matrix is injective.
  • MatrixMap.toMatrix_compMultiplication of transfer matrices, MatrixMap.toMatrix, is equivalent to composition of maps.
  • MatrixMap.toMatrixThe linear equivalence between MatrixMap's and transfer matrices on a larger space. Compare with MatrixMap.choi_matrix, which gives the…
  • MatrixMap.choi_equivThe linear equivalence between linear maps of matrices,and Choi matrices.
  • MatrixMap.of_krausConstruct a matrix map out of families of matrices M N : Σ → Matrix B A R indexed by κ via X ↦ ∑ k : κ, (M k) * X * (N k)ᴴ
  • MatrixMap.exists_krausMatrixMap.exists_kraus
  • MatrixMap.submatrixThe MatrixMap corresponding to applying a submatrix operation on each side.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MatrixMap in
variable {A B C D E F R : Type*} [Fintype A] [DecidableEq A] in
variable [Semiring R] in
set_option backward.isDefEq.respectTransparency false in
/-- Proves that `MatrixMap.choi_matrix` and `MatrixMap.of_choi_matrix` inverses. -/
@[simp]
theorem MatrixMap.choi_map_inv (M : MatrixMap A B R) : of_choi_matrix (choi_matrix M) = M := by
  -- By definition of `MatrixMap.of_choi_matrix`, we know that applying it to the Choi matrix of `M`
  -- reconstructs `M`.
  ext X b₁ b₂; simp [MatrixMap.of_choi_matrix, MatrixMap.choi_matrix];
  -- By linearity of $M$, we can distribute $M$ over the sum.
  have h_linear : M X = ∑ x : A, ∑ x_1 : A, X x x_1 • M (Matrix.single x x_1 1) := by
    have h_linear : M X = M (∑ x : A, ∑ x_1 : A, X x x_1 • Matrix.single x x_1 1) := by
      congr with i j ; simp ( config := { decide := Bool.true } ) [ Matrix.sum_apply ];
      simp ( config := { decide := Bool.true } ) [ Matrix.single ];
      rw [ Finset.sum_eq_single i ] <;> aesop;
    simp +decide only [h_linear, map_sum, LinearMap.map_smulₛₗ];
    simp +zetaDelta at *;
  -- By linearity of $M$, we can distribute $M$ over the sum and then apply it to each term.
  simp [h_linear, Matrix.sum_apply]
See it in the graphDiscuss this resultChallenge it