Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered Bell-observable invariance, proof of Theorem 4

Proved
QAlgorithms.Papers.Independent.Advance50.P50.bell_orthogonal_invariance

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

prove2quantum

Fix n≥0n\ge0n≥0 and d=2nd=2^nd=2n. In the computational basis define the literal vector printed in Eq.(22),

v=1d∑x∈{0,1}n∣x⟩∣x⟩.v=\frac1d\sum_{x\in\{0,1\}^n}|x\rangle|x\rangle.v=d1​x∈{0,1}n∑​∣x⟩∣x⟩.

For the real orthogonal subgroup O(d)⊆U(d)O(d)\subseteq U(d)O(d)⊆U(d),

∣v⟩⟨v∣∈C(2)(O(d)),∥v∥2=1d.|v\rangle\langle v|\in C^{(2)}(O(d)),\qquad \|v\|^2=\frac1d.∣v⟩⟨v∣∈C(2)(O(d)),∥v∥2=d1​.

Thus its outer product is a quadratic symmetry. For n>0n>0n>0 this vector is not a normalized quantum state; no classification claim is attached to it.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Advance50.P50

open MeasureTheory ProbabilityTheory

open scoped ComplexConjugate ENNReal

-- Exact accepted primitives; no paper-local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)

open QAlgorithms.Papers.Independent.Information100.P32 (purity)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

-- Matrices carry the associative commutator bracket X*Y-Y*X.

attribute [local instance 100] LieRing.ofAssociativeRing

/-- PDF pp.10–11, Eq.(23): the outer product of the literal printed Bell
vector is a quadratic orthogonal symmetry. Its norm squared is 1/d, not 1. -/
theorem bell_orthogonal_invariance (n : ℕ) :
    pureDensity (printedBell n) ∈ tensorCommutant 2 (orthogonalMatrices n) ∧
    ‖printedBell n‖ ^ 2 = 1 / (2 : ℝ) ^ n := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 10, Unnumbered Bell-observable invariance, proof of Theorem 4
Read-back

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

For every integer n≥0n\ge0n≥0, define a vector vvv on two nnn-qubit copies by v(x0,x1)=2−nv(x_0,x_1)=2^{-n}v(x0​,x1​)=2−n when x0=x1x_0=x_1x0​=x1​ and v(x0,x1)=0v(x_0,x_1)=0v(x0​,x1​)=0 otherwise, and define its matrix PPP by Px,y=v(x)v(y)‾P_{x,y}=v(x)\overline{v(y)}Px,y​=v(x)v(y)​. Then PPP commutes with V⊗VV\otimes VV⊗V for every real-entry unitary matrix VVV on the nnn-qubit space, and

∥v∥2=2−n.\|v\|^2=2^{-n}.∥v∥2=2−n.

Thus the asserted squared norm is 2−n2^{-n}2−n, including the value 111 when n=0n=0n=0; no unit-norm hypothesis is imposed on vvv.

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