Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 21: Bell sandwich of a swap

Proved
QAlgorithms.Papers.Independent.Extend50.P33.fact21

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

prove2quantum

Let d≥2d\ge2d≥2 be the local dimension, N≥2N\ge2N≥2 the number of ports, and n=N+1n=N+1n=N+1. All physical diagrams have height at most ddd. Write mλm_\lambdamλ​ for its multiplicity in the natural tensor permutation action, dλd_\lambdadλ​ for its Specht dimension, and PλP_\lambdaPλ​ for the full isotypic projector. The relation μ∈α\mu\in\alphaμ∈α means adding one box. Let B=BN,nB=B_{N,n}B=BN,n​ be the unnormalized Bell operator on the final port and input. For every a∈{1,…,N}a\in\{1,\ldots,N\}a∈{1,…,N},

B V((a,N)) B={dB,a=N,B,a<N.B\,V((a,N))\,B=\begin{cases}dB,&a=N,\\B,&a<N.\end{cases}BV((a,N))B={dB,B,​a=N,a<N.​

The identity-coset case is B2=dBB^2=dBB2=dB and fixes the normalization.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P33
Formal statement
set_option backward.isDefEq.respectTransparency.types false

noncomputable section

open scoped Matrix ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Extend50.P33

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted type constructors; local notation only reorders Word's arguments.

local notation "Word" => (fun d r : ℕ =>
  QAlgorithms.Papers.Independent.Information100.P58.Word r d)

local notation "Op" => (fun d r : ℕ =>
  QAlgorithms.Papers.Independent.Information100.P21.Op
    (QAlgorithms.Papers.Independent.Information100.P58.Word r d))

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Gap20.P01 (spechtMatrix)

/-- PDF p.22 Fact21 Eq.(70), including the identity-coset factor d. -/
theorem fact21 (d k : ℕ) (hd : 2 ≤ d) (a : Fin (k+2)) :
    unnormalizedPortBell d (k+2) (Fin.last (k+1)) * portSwap d k a *
      unnormalizedPortBell d (k+2) (Fin.last (k+1)) =
      (if a = Fin.last (k+1) then (d:ℂ) else 1) •
        unnormalizedPortBell d (k+2) (Fin.last (k+1)) := by sorry

end QAlgorithms.Papers.Independent.Extend50.P33

end
Source
Port-based teleportation in arbitrary dimension, arXiv:1612.09260v3, PDF p. 22, Fact 21: Bell sandwich of a swap
Read-back

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

For every d,k∈Nd,k\in\mathbb Nd,k∈N with d≥2d\ge2d≥2 and every a∈{0,…,k+1}a\in\{0,\ldots,k+1\}a∈{0,…,k+1}, consider matrices indexed by ddd-letter words of length k+3k+3k+3. Define Bx,y=1B_{x,y}=1Bx,y​=1 precisely when xk+1=xk+2x_{k+1}=x_{k+2}xk+1​=xk+2​, yk+1=yk+2y_{k+1}=y_{k+2}yk+1​=yk+2​, and xi=yix_i=y_ixi​=yi​ for every i∉{k+1,k+2}i\notin\{k+1,k+2\}i∈/{k+1,k+2}, and define Bx,y=0B_{x,y}=0Bx,y​=0 otherwise. Let τa\tau_aτa​ exchange positions aaa and k+1k+1k+1, fixing all other positions, and let (Ta)x,y=1{x=y∘τa−1}(T_a)_{x,y}=\mathbf1_{\{x=y\circ\tau_a^{-1}\}}(Ta​)x,y​=1{x=y∘τa−1​}​. Then

BTaB={dB,a=k+1,B,a≠k+1.BT_aB= \begin{cases} dB,&a=k+1,\\ B,&a\ne k+1. \end{cases}BTa​B={dB,B,​a=k+1,a=k+1.​

In particular, the quantified values include k=0k=0k=0 and the choice a=k+1a=k+1a=k+1, where TaT_aTa​ is the identity.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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