Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operator pushing preserves the operator norm

Proved
QAlgorithms.Papers.Independent.Intakenext100.P95.operator_pushing

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 an isometry between finite-dimensional complex Hilbert spaces, and let OOO be any linear operator on HA\mathcal H_AHA​. Define Oout=TOT†O_{\mathrm{out}}=TOT^\daggerOout​=TOT†. Then

TO=OoutT,∥Oout∥2→2=∥O∥2→2.TO=O_{\mathrm{out}}T,\qquad \|O_{\mathrm{out}}\|_{2\to2}=\|O\|_{2\to2}.TO=Oout​T,∥Oout​∥2→2​=∥O∥2→2​.

Thus every incoming operator has an explicit outgoing representative with the same Hilbert-space operator norm. Orthonormal computational bases identify the maps with their matrices.

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, (2.3): the explicit pushed operator intertwines and has the same L2
operator norm. The norm is that of the continuous map on Euclidean Hilbert space. -/
theorem operator_pushing {A B : Type*} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] (T : Matrix B A ℂ) (hT : Tᴴ * T = 1)
    (O : Matrix A A ℂ) :
    T * O = (T * O * Tᴴ) * T ∧
    ‖Matrix.toEuclideanCLM (n := B) (𝕜 := ℂ) (T * O * Tᴴ)‖ =
      ‖Matrix.toEuclideanCLM (n := A) (𝕜 := ℂ) O‖ := 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, operator pushing (2.3)
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, every complex matrix TTT with rows indexed by BBB and columns by AAA satisfying T†T=IAT^\dagger T=I_AT†T=IA​, and every complex matrix OOO on AAA, both identities hold:

TO=(TOT†)T,∥TOT†∥CB→CB=∥O∥CA→CA,TO=(TOT^\dagger)T, \qquad \|TOT^\dagger\|_{\mathbb C^B\to\mathbb C^B} = \|O\|_{\mathbb C^A\to\mathbb C^A},TO=(TOT†)T,∥TOT†∥CB→CB​=∥O∥CA→CA​,

where the norms are operator norms for the Euclidean norms. No Hermiticity or unitarity assumption on OOO is made. Empty index types are included: if AAA is empty, both operator norms are zero; if BBB is empty and AAA is nonempty, the hypothesis T†T=IAT^\dagger T=I_AT†T=IA​ cannot hold.

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