Coarse-graining a level-set family again is the level-set family of the composite label. The level sets of g ∘ φ are the unions of the level sets of φ along the level sets…
ProvedMIPRE.Weyl.sum_synOfA statement of the module MIPRE.Foundations.Weyl of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). Generalized Pauli operators over a field of characteristic two. The paper's sec:generalized-pauli: for a ∈ F_q^n the X-type operator shifts the computational basis of (C^q)^{⊗ n} by a, the Z-type operator is diagonal with the phase ω^{tr(a · b)}, and the two families twisted-commute, τ^X(a) τ^Z(b) = ω^{-tr(a · b)} τ^Z(b) τ^X(a). This is the missing half of the Pauli basis test's infrastructure. MIPRE/LCS/Pauli.lean is the 2 × 2 Pauli matrices for the Magic Square; what the appendix's expansion stage and its swap isometry both run on is the F_q Weyl system, and that is…
Coarse-graining a level-set family again is the level-set family of the composite label.
The level sets of g ∘ φ are the unions of the level sets of φ along the level sets of g, so
relabelling a coarse-grained eigenbasis measurement never leaves the family.
Formal statement. In Lean, with the scope shown:
open MIPRE
open MIPRE.Weyl
open Finset Matrix
variable {F : Type*} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F]
variable {n : Type*} [Fintype n] [DecidableEq n]
variable {w : (n → F) → Matrix (n → F) (n → F) ℂ}
theorem MIPRE.Weyl.sum_synOf {C D : Type*} [Fintype C] [DecidableEq C] [DecidableEq D]
(w : (n → F) → Matrix (n → F) (n → F) ℂ) (φ : (n → F) → C) (g : C → D) (c : D) :
∑ o ∈ univ.filter fun o => g o = c, synOf w φ o = synOf w (fun e => g (φ e)) c
Formalization Note MIPRE.Weyl.sum_synOf is declared in MIPRE/Foundations/Weyl.lean, lines 634–655. 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.Matrix
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.SpecialFunctions.Complex.Circle
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finite.GaloisField
import Mathlib.RingTheory.Trace.Basic
import Mathlib.Tactic.IntervalCases
import Definitions.Def_MIPRE_Foundations_LowDegree_Encoding
import Definitions.Def_MIPRE_Foundations_Sign
import Definitions.Def_MIPRE_Foundations_LowDegree_SchwartzZippel
import Definitions.Def_MIPRE_Foundations_LowDegree_Anticomm
import Definitions.Def_MIPRE_Foundations_Weyl
open MIPRE
open MIPRE.Weyl
open Finset Matrix
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]
variable {w : (n → F) → Matrix (n → F) (n → F) ℂ}theorem MIPRE.Weyl.sum_synOf {C D : Type*} [Fintype C] [DecidableEq C] [DecidableEq D]
(w : (n → F) → Matrix (n → F) (n → F) ℂ) (φ : (n → F) → C) (g : C → D) (c : D) :
∑ o ∈ univ.filter fun o => g o = c, synOf w φ o = synOf w (fun e => g (φ e)) c := by sorry