Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The converse of unitary operator pushing

Open
QAlgorithms.Papers.Independent.Intakenext100.P95.unitary_pushing_converse

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let T:HA→HBT:\mathcal H_A\to\mathcal H_BT:HA​→HB​ be a nonzero linear map between finite-dimensional complex Hilbert spaces. Suppose that for every unitary UUU on HA\mathcal H_AHA​ there exists a unitary WWW on HB\mathcal H_BHB​ such that TU=WTTU=WTTU=WT. Then

∃c>0:T†T=cIA.\exists c>0:\quad T^\dagger T=cI_A.∃c>0:T†T=cIA​.

Consequently T/cT/\sqrt cT/c​ is an isometric tensor. The outgoing unitary may depend on the incoming unitary; injectivity of TTT is not assumed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P95

open scoped Matrix ComplexConjugate

noncomputable section

local instance (p : Prop) : Decidable p := Classical.propDecidable p

/-- PDF p.6, converse of (2.3): a nonzero tensor intertwining every incoming
unitary with some outgoing unitary has a positive scalar Gram matrix.
The outgoing unitary is chosen after the incoming one; injectivity is a conclusion. -/
theorem unitary_pushing_converse {A B : Type*} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] (T : Matrix B A ℂ) (hT : T ≠ 0)
    (hpush : ∀ U : Matrix.unitaryGroup A ℂ, ∃ W : Matrix.unitaryGroup B ℂ,
      T * (U : Matrix A A ℂ) = (W : Matrix B B ℂ) * T) :
    ∃ c : ℝ, 0 < c ∧ Tᴴ * T = (c : ℂ) • 1 := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P95
Source
Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence, arXiv:1503.06237v2, PDF p. 6, §2, converse of operator pushing
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For finite types A,BA,BA,B, both with decidable equality, suppose TTT is a nonzero complex matrix with rows indexed by BBB and columns by AAA, and suppose that for every unitary matrix UUU on AAA, there exists a unitary matrix WWW on BBB such that TU=WTTU=WTTU=WT. Then there exists a real number c>0c>0c>0 such that

T†T=cIA.T^\dagger T=cI_A.T†T=cIA​.

The unitary WWW may depend on UUU; no single WWW is required to work for every UUU. The finite types may formally be empty, but if either is empty, every such matrix TTT is zero, so the nonzero hypothesis is impossible.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me