Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Orthogonality of the Fourier components

Open
QAlgorithms.Papers.Independent.Intakenext100.P77.fourier_orthogonal

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

prove2quantum

Let n≥1n\ge1n≥1. Fix an unrestricted joint unitary attack on the 2n2n2n ideal two-level signals and a probe initially in a fixed pure basis state. Fix the preparation/measurement bases, a balanced test/information partition, and announced test strings iT,jTi_T,j_TiT​,jT​ whose probability is positive. Symmetrize the attack coherently by Eq. (2), then condition on this test outcome using its actual probability. Write Ei,jE_{i,j}Ei,j​ for the resulting normalized information-register probe coefficients, with Alice's nnn information bits uniform. These coefficients are constructed from the unitary, rather than postulated to have any Fourier or information property. The public classical channel is unjammable and Eve has access only to the quantum channel and the public transcript.

For an information input iii, put ϕi=∑jEi,j⊗∣i⊕j⟩\phi_i=\sum_j E_{i,j}\otimes|i\oplus j\rangleϕi​=∑j​Ei,j​⊗∣i⊕j⟩, ηl=2−n∑i(−1)l⋅iϕi\eta_l=2^{-n}\sum_i(-1)^{l\cdot i}\phi_iηl​=2−n∑i​(−1)l⋅iϕi​, and dl2=∥ηl∥2d_l^2=\|\eta_l\|^2dl2​=∥ηl​∥2. Dot products are modulo two and inner products conjugate the first argument.

For distinct k,l∈{0,1}nk,l\in\{0,1\}^nk,l∈{0,1}n,

⟨ηk∣ηl⟩=0.\langle\eta_k\mid\eta_l\rangle=0.⟨ηk​∣ηl​⟩=0.

Some components may vanish. The conclusion is pairwise orthogonality, which is the source's explicit meaning of “orthogonal basis.”

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P77

open scoped BigOperators ComplexConjugate ComplexOrder

open QAlgorithms

-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.

open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)

open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon)

open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)

open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma 3.1, PDF p.6; Appendix D, pp.15--16: pairwise orthogonality, the
source's explicit 'i.e.' conclusion. Zero Fourier vectors remain permitted. -/
theorem fourier_orthogonal {n d : ℕ} (hn : 1 ≤ n)
    (U : Matrix.unitaryGroup (Fin d × Qubits (n + n)) ℂ) (e0 : Fin d)
    (iT jT : Qubits n)
    (hpos : 0 < testProbability (coherentBitSymmetrize (attackProbes U e0)) iT jT (fun _ => false))
    (k l : Qubits n) (hkl : k ≠ l) :
    inner ℂ (probeFourierComponent (conditionedSymmetric U e0 iT jT) k)
      (probeFourierComponent (conditionedSymmetric U e0 iT jT) l) = 0 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P77

end
Source
A Proof of the Security of Quantum Key Distribution, arXiv:quant-ph/9912053v1, PDF p. 6, Lemma 3.1: orthogonality of Fourier components
Read-back

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

For natural numbers n,dn,dn,d with n≥1n\ge1n≥1, a unitary matrix UUU indexed by {0,…,d−1}×{0,1}2n\{0,\ldots,d-1\}\times\{0,1\}^{2n}{0,…,d−1}×{0,1}2n, an index e0<de_0<de0​<d, length-nnn strings iT,jTi_T,j_TiT​,jT​, and distinct length-nnn strings k,lk,lk,l, use XOR addition, concatenation ∥\Vert∥, and χ(x,y)=(−1)∑rxryr\chi(x,y)=(-1)^{\sum_rx_ry_r}χ(x,y)=(−1)∑r​xr​yr​ with exponent modulo 222. Define

Su,v(r,q)=2−nχ(u+v,r)U(q,v+r),(e0,u+r),P=∑j∑r,q∣SiT∥0n, jT∥j(r,q)∣2,S_{u,v}(r,q)=2^{-n}\chi(u+v,r)U_{(q,v+r),(e_0,u+r)}, \qquad P=\sum_j\sum_{r,q}|S_{i_T\Vert0^n,\ j_T\Vert j}(r,q)|^2,Su,v​(r,q)=2−nχ(u+v,r)U(q,v+r),(e0​,u+r)​,P=j∑​r,q∑​∣SiT​∥0n, jT​∥j​(r,q)∣2,

and assume P>0P>0P>0, where u,v,ru,v,ru,v,r have length 2n2n2n, jjj has length nnn, and q<dq<dq<d. Set

Fi,j(r,q)=P−1/2SiT∥i, jT∥j(r,q),Gi((r,q),c)=Fi,i+c(r,q),G^a=2−n∑i∈{0,1}nχ(a,i)Gi.F_{i,j}(r,q)=P^{-1/2}S_{i_T\Vert i,\ j_T\Vert j}(r,q), \qquad G_i((r,q),c)=F_{i,i+c}(r,q), \qquad \widehat G_a=2^{-n}\sum_{i\in\{0,1\}^n}\chi(a,i)G_i.Fi,j​(r,q)=P−1/2SiT​∥i, jT​∥j​(r,q),Gi​((r,q),c)=Fi,i+c​(r,q),Ga​=2−ni∈{0,1}n∑​χ(a,i)Gi​.

Then the two vectors indexed by ({0,1}2n×{0,…,d−1})×{0,1}n\bigl(\{0,1\}^{2n}\times\{0,\ldots,d-1\}\bigr)\times\{0,1\}^n({0,1}2n×{0,…,d−1})×{0,1}n satisfy

⟨G^k,G^l⟩C=0.\langle\widehat G_k,\widehat G_l\rangle_{\mathbb C}=0.⟨Gk​,Gl​⟩C​=0.

No nonzero or unit-norm condition is imposed on either Fourier component.

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