Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 2.1: equivariance and one matrix unit imply positivity

Proved
EquivPosMaps.TwoPositive.lemma_2_1

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

k-positivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-mapsquantum-information

Let Ψ:Md1(C)→Md2(C)\Psi:M_{d_1}(\mathbb C)\to M_{d_2}(\mathbb C)Ψ:Md1​​(C)→Md2​​(C) be complex-linear, with d1≥1d_1\geq1d1​≥1. Suppose that for every unitary U∈Md1(C)U\in M_{d_1}(\mathbb C)U∈Md1​​(C) there is a matrix V∈Md2(C)V\in M_{d_2}(\mathbb C)V∈Md2​​(C) such that Ψ(UXU∗)=VΨ(X)V∗\Psi(UXU^*)=V\Psi(X)V^*Ψ(UXU∗)=VΨ(X)V∗ for every XXX. If Ψ(e11)≥0\Psi(e_{11})\geq0Ψ(e11​)≥0, then

Ψ(X)≥0for every X≥0.\Psi(X)\geq0\quad\text{for every }X\geq0.Ψ(X)≥0for every X≥0.

The lemma is the paper's positivity criterion for equivariant maps. The output matrix VVV need not be unitary.

Formalization Note The condition d1≥1d_1\geq1d1​≥1 makes the paper's e11e_{11}e11​ a valid matrix unit; Lean uses index zero for that unit.

Preamble
import Mathlib
import Definitions.Def_EquivPosMaps_TwoPositive_Basic
open scoped Matrix Kronecker ComplexOrder
noncomputable section
Formal statement
namespace EquivPosMaps.TwoPositive
/-- Lemma 2.1, p. 4: equivariance and positivity on e₁₁ imply positivity. -/
theorem lemma_2_1 (d₁ d₂ : ℕ) [NeZero d₁]
    (Φ : Matrix (Fin d₁) (Fin d₁) ℂ →ₗ[ℂ] Matrix (Fin d₂) (Fin d₂) ℂ)
    (hequiv : ∀ U : Matrix.unitaryGroup (Fin d₁) ℂ,
      ∃ V : Matrix (Fin d₂) (Fin d₂) ℂ, ∀ X : Matrix (Fin d₁) (Fin d₁) ℂ,
        Φ ((U : Matrix (Fin d₁) (Fin d₁) ℂ) * X * star (U : Matrix (Fin d₁) (Fin d₁) ℂ)) =
          V * Φ X * Vᴴ)
    (hunit : (Φ (Matrix.single 0 0 1)).PosSemidef) :
    IsPositiveMap Φ := by sorry

end EquivPosMaps.TwoPositive
Source
Collins, Osaka & Sapra, On a family of a linear maps from Mn(C) to Mn2(C), arXiv:1802.07553v1, p. 4, Lemma 2.1
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me