Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.3), p. 13 — the N2N^2N2 states ∣ψm,n⟩|\psi_{m,n}\rangle∣ψm,n​⟩ are orthonormal and ∑m,n∣ψm,n⟩⟨ψm,n∣=1⊗1\sum_{m,n}|\psi_{m,n}\rangle\langle\psi_{m,n}| = \mathbb 1 \otimes \mathbb 1∑m,n​∣ψm,n​⟩⟨ψm,n​∣=1⊗1

Proved
CerfCloning.Isotropic.eq_3_3

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

bell-basismaximally-entangled-statesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let N≥1N \ge 1N≥1 and let ∣ψm,n⟩=N−1/2∑je2πi jn/N∣j⟩∣j+m⟩|\psi_{m,n}\rangle = N^{-1/2}\sum_{j} e^{2\pi i\, jn/N} |j\rangle|j+m\rangle∣ψm,n​⟩=N−1/2∑j​e2πijn/N∣j⟩∣j+m⟩, m,n∈ZNm, n \in \mathbb Z_Nm,n∈ZN​, be the maximally entangled states of two NNN-level systems (Eq. (3.1)). Then they form an orthonormal basis:

  1. ⟨ψm,n∣ψm′,n′⟩=δm,m′ δn,n′\langle \psi_{m,n} | \psi_{m',n'} \rangle = \delta_{m,m'}\,\delta_{n,n'}⟨ψm,n​∣ψm′,n′​⟩=δm,m′​δn,n′​ for all m,n,m′,n′m, n, m', n'm,n,m′,n′;
  2. the resolution of identity holds:
∑m,n=0N−1∣ψm,n⟩⟨ψm,n∣=1A⊗1B.\sum_{m,n=0}^{N-1} |\psi_{m,n}\rangle\langle\psi_{m,n}| = \mathbb 1_A \otimes \mathbb 1_B .m,n=0∑N−1​∣ψm,n​⟩⟨ψm,n​∣=1A​⊗1B​.

The states ∣ψm,n⟩|\psi_{m,n}\rangle∣ψm,n​⟩ generalize the four Bell states to NNN dimensions; this basis is the one in which Heisenberg channels and Heisenberg cloning machines are described.

Formalization Note The inner product is conjugate-linear in its first argument; 1A⊗1B\mathbb 1_A \otimes \mathbb 1_B1A​⊗1B​ is the identity matrix on Fin N × Fin N.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_CerfCloning_Isotropic_Model

open scoped Matrix ComplexOrder BigOperators
open QAlgorithms
Formal statement
namespace CerfCloning.Isotropic

theorem eq_3_3 (N : ℕ) [NeZero N] :
    (∀ m n m' n' : Fin N, inner ℂ (meState N m n) (meState N m' n') =
        if m = m' ∧ n = n' then 1 else 0) ∧
    ∑ m, ∑ n, pureDensity (meState N m n) = 1 := by sorry
end CerfCloning.Isotropic
Source
Cerf, Asymmetric quantum cloning machines in any dimension, arXiv:quant-ph/9805024v2, p. 13, Eq. (3.3)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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