PERM_mat
defimported Lean
PERM_mat
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ m n : Type*} in variable [Fintype d] [Fintype d₁] [Fintype d₂] [Fintype d₃] [Fintype m] [Fintype n] in variable [DecidableEq d] [DecidableEq d₁] [DecidableEq d₂] [DecidableEq d₃] [DecidableEq m] [DecidableEq n] in variable {dA dB dC dA₁ dA₂ : Type*} in variable [Fintype dA] [Fintype dB] [Fintype dC] [Fintype dA₁] [Fintype dA₂] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] [DecidableEq dA₁] [DecidableEq dA₂] in variable {𝕜 : Type*} [RCLike 𝕜] in variable {α : ℝ} in open scoped InnerProductSpace RealInnerProductSpace Kronecker Matrix in open scoped MatrixOrder ComplexOrder in open scoped MatrixOrder in variable {dA dB dC : Type*} [Fintype dA] [Fintype dB] [Fintype dC] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] in variable {dA dB dC : Type*} [Fintype dA] [Fintype dB] [Fintype dC] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] in noncomputable def PERM_mat (dA dB dC : Type*) [Fintype dA] [Fintype dB] [Fintype dC] [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] : Matrix (MidIdx dA dB dC) (BigIdx dA dB dC) ℂ
- Defined in
- QuantumInfo, `PERM_mat`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 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.PERM_mat← PERM_mat (QuantumInfo/Entropy/SSA.lean:522): verbatim
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Built on 3
- assoc_equivThe associator equivalence (no swap needed). Maps (((dA×dB)×dB)×(dB×dC)) to ((dA×dB)×(dB×(dB×dC))).
- BigIdxBigIdx
- MidIdxMidIdx
- Used by 1
- PERM_isometryPERM_isometry
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ m n : Type*} in variable [Fintype d] [Fintype d₁] [Fintype d₂] [Fintype d₃] [Fintype m] [Fintype n] in variable [DecidableEq d] [DecidableEq d₁] [DecidableEq d₂] [DecidableEq d₃] [DecidableEq m] [DecidableEq n] in variable {dA dB dC dA₁ dA₂ : Type*} in variable [Fintype dA] [Fintype dB] [Fintype dC] [Fintype dA₁] [Fintype dA₂] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] [DecidableEq dA₁] [DecidableEq dA₂] in variable {𝕜 : Type*} [RCLike 𝕜] in variable {α : ℝ} in open scoped InnerProductSpace RealInnerProductSpace Kronecker Matrix in open scoped MatrixOrder ComplexOrder in open scoped MatrixOrder in variable {dA dB dC : Type*} [Fintype dA] [Fintype dB] [Fintype dC] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] in variable {dA dB dC : Type*} [Fintype dA] [Fintype dB] [Fintype dC] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] in noncomputable def PERM_mat (dA dB dC : Type*) [Fintype dA] [Fintype dB] [Fintype dC] [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] : Matrix (MidIdx dA dB dC) (BigIdx dA dB dC) ℂ := (1 : Matrix (BigIdx dA dB dC) (BigIdx dA dB dC) ℂ).reindex (assoc_equiv dA dB dC) (Equiv.refl _)