The state is a unit vector
ProvedMIPRE.Weyl.epr_unitA statement of the module MIPRE.Foundations.WeylEPR of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). The maximally entangled state of the Weyl system. |EPR_q⟩^{⊗ n} on two copies of (C^q)^{⊗ n}, normalized, and the one property the Pauli basis test uses it for: the two parties' Weyl operators act identically on it. That property is the reason the expansion stage of the appendix works at all. Its expanded state adjoins |EPR_q⟩^{⊗ M} to each player, and the sign (-1)^γ that the strategy's own observables carry is cancelled against one the ancilla observables carry; for that the ancilla halves must be tied together, and stateVec_epr_wX/stateVec_epr_wZ is the tie.
The state is a unit vector.
Formal statement. In Lean, with the scope shown:
open MIPRE
open MIPRE.Weyl
open Finset Matrix MIPRE
open scoped Kronecker
variable {F : Type*} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F]
variable {n : Type*} [Fintype n] [DecidableEq n]
theorem MIPRE.Weyl.epr_unit : star (epr (F := F) (n := n)) ⬝ᵥ epr = 1
Formalization Note MIPRE.Weyl.epr_unit is declared in MIPRE/Foundations/WeylEPR.lean, lines 72–92. The binders, hypotheses and conclusion are exactly those of the Lean statement above; the uploaded statement elaborates to the same type as the declaration in the repository. The definitions it mentions are those of the published definition bundles of the module's import closure.
import Mathlib.Algebra.MvPolynomial.CommRing
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Algebra.MvPolynomial.SchwartzZippel
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Analysis.CStarAlgebra.CStarMatrix
import Mathlib.Analysis.CStarAlgebra.Classes
import Mathlib.Analysis.CStarAlgebra.Matrix
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.Matrix.PosDef
import Mathlib.Analysis.SpecialFunctions.Complex.Circle
import Mathlib.Data.ENat.Lattice
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finite.GaloisField
import Mathlib.LinearAlgebra.Matrix.Kronecker
import Mathlib.RingTheory.Trace.Basic
import Mathlib.Tactic.IntervalCases
import Definitions.Def_MIPRE_Foundations_Games
import Definitions.Def_MIPRE_Foundations_Distances
import Definitions.Def_MIPRE_Foundations_LowDegree_Encoding
import Definitions.Def_MIPRE_Foundations_Closeness
import Definitions.Def_MIPRE_Foundations_OpBound
import Definitions.Def_MIPRE_Foundations_OpBound_B
import Definitions.Def_MIPRE_Foundations_StateDistance
import Definitions.Def_MIPRE_Foundations_StateDistance_B
import Definitions.Def_MIPRE_Foundations_Sign
import Definitions.Def_MIPRE_Foundations_PVM
import Definitions.Def_MIPRE_Foundations_PVM_B
import Definitions.Def_MIPRE_Foundations_LowDegree_SchwartzZippel
import Definitions.Def_MIPRE_Foundations_LowDegree_Anticomm
import Definitions.Def_MIPRE_Foundations_Weyl
import Definitions.Def_MIPRE_Foundations_WeylEPR
open MIPRE
open MIPRE.Weyl
open Finset Matrix MIPRE
open scoped Kronecker
set_option linter.unusedSectionVars false
variable {F : Type*} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F]
variable {n : Type*} [Fintype n] [DecidableEq n]theorem MIPRE.Weyl.epr_unit : star (epr (F := F) (n := n)) ⬝ᵥ epr = 1 := by sorry