QPBT definitions: Palomar / PauliGameBridge
DefinitionQPBT_QPBT_Palomar_PauliGameBridgeqpbt
This bundle identifies compact Pauli-basis game types with their registered counterparts and transports questions, answers, edges, and ambient coordinates between both presentations.
Principal definitions:
MIPStarRE.QPBT.Palomar.pauliKindEquiv: equivalence between compact and registered Pauli labels.MIPStarRE.QPBT.Palomar.pauliTypeEquiv: equivalence between compact and registered Pauli types.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv: product-coordinate equivalence between ambient spaces.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv: equivalence between typed Pauli questions.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact: maps compact answers to registered answers.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect: registered ordered-edge graph.MIPStarRE.QPBT.Palomar.pauliEdgeEquiv: equivalence between ordered-edge carriers.
Formalization Credit. This Lean declaration is part of the Quantum Pauli basis test formalization by Ruixuan Deng. The source code was generated by AI agents; Ruixuan Deng is the responsible maintainer.
Mathematical Source. The mathematical source is Ji, Natarajan, Vidick, Wright, and Yuen, MIP*=RE, arXiv:2001.04383v3.
Definition code
-- Generated from QPBT/Palomar/PauliGameBridge.lean by skeleton subtraction.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_PMFAverages
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState
import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore
import Definitions.Def_QPBT_QPBT_Algebra_Coefficients
import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_Lines
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Algebra_Pauli
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Palomar_Definitions
import Definitions.Def_QPBT_QPBT_Palomar_LowDegreeGameBridge
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Definitions.Def_QPBT_QPBT_Test_MagicSquare
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
import Theorems.Thm_LIDT_MIPStarRE_LDT_Distribution_IsProbability_map
import Theorems.Thm_LIDT_MIPStarRE_LDT_Distribution_toPMF_map
namespace MIPStarRE.QPBT.Palomar
end MIPStarRE.QPBT.Palomar
/-!
# Exact bridge for the compact Pauli basis game
This module identifies the compact product-space presentation with the
registered Pauli basis test. The bridge preserves the fixed field model, all
ordered edges, the full ambient seed, every answer constructor, the question
PMF, and every branch of the Boolean verifier.
## References
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1126-1491`.
-/
@[expose] public section
open scoped BigOperators
namespace MIPStarRE.QPBT.Palomar
noncomputable section
/-- Copy the registered Pauli parameters into the compact numerical domain. -/
@[reducible] def PauliParams.ofAdmissibleParams
(P : _root_.MIPStarRE.QPBT.AdmissibleParams) : _root_.MIPStarRE.QPBT.Palomar.PauliParams where
q := P.q
m := P.m
d := P.d
hm := P.one_le_m
hd := P.hd
hq := P.hq
hdvd := P.hdvd
/-- The compact and registered Pauli-basis labels are equivalent. -/
def pauliKindEquiv : _root_.MIPStarRE.QPBT.Palomar.PauliKind ≃ _root_.MIPStarRE.QPBT.PauliKind where
toFun
| .X => .X
| .Z => .Z
invFun
| .X => .X
| .Z => .Z
left_inv W := by cases W <;> rfl
right_inv W := by cases W <;> rfl
/-- The compact 26-element type carrier is the registered Pauli type carrier. -/
def pauliTypeEquiv : _root_.MIPStarRE.QPBT.Palomar.PauliType ≃ _root_.MIPStarRE.QPBT.PauliType where
toFun
| .point W => .point (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
| .aline W => .aline (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
| .dline W => .dline (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
| .pauli W => .pauli (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
| .pairW W => .pairW (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
| .pair => .pair
| .constraint i => .ms (.constraint i)
| .variable j => .ms (.var j)
invFun
| .point W => .point (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv.symm W)
| .aline W => .aline (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv.symm W)
| .dline W => .dline (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv.symm W)
| .pauli W => .pauli (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv.symm W)
| .pairW W => .pairW (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv.symm W)
| .pair => .pair
| .ms (.constraint i) => .constraint i
| .ms (.var j) => .variable j
left_inv
| .point W => by cases W <;> rfl
| .aline W => by cases W <;> rfl
| .dline W => by cases W <;> rfl
| .pauli W => by cases W <;> rfl
| .pairW W => by cases W <;> rfl
| .pair => rfl
| .constraint _ => rfl
| .variable _ => rfl
right_inv
| .point W => by cases W <;> rfl
| .aline W => by cases W <;> rfl
| .dline W => by cases W <;> rfl
| .pauli W => by cases W <;> rfl
| .pairW W => by cases W <;> rfl
| .pair => rfl
| .ms t => by cases t <;> rfl
/-- Product coordinates identify the full compact and registered ambient spaces. -/
def pauliSpaceEquiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
_root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P) ≃
_root_.MIPStarRE.QPBT.PauliSpace P where
toFun z
| .inl (.inl (.inl (.inl (.inl i)))) => z.1 i
| .inl (.inl (.inl (.inl (.inr i)))) => z.2.1 i
| .inl (.inl (.inl (.inr _))) => z.2.2.1
| .inl (.inl (.inr i)) => z.2.2.2.1 i
| .inl (.inr _) => z.2.2.2.2.1
| .inr _ => z.2.2.2.2.2
invFun z :=
(_root_.MIPStarRE.QPBT.pauliXBlock z, _root_.MIPStarRE.QPBT.pauliZBlock z,
_root_.MIPStarRE.QPBT.pauliScalarBlock z, _root_.MIPStarRE.QPBT.pauliDirectionBlock z,
_root_.MIPStarRE.QPBT.pauliRXBlock z, _root_.MIPStarRE.QPBT.pauliRZBlock z)
left_inv z := by
rcases z with ⟨uX, uZ, s, v, rX, rZ⟩
rfl
right_inv z := by
funext i
rcases i with ((((i | i) | u) | i) | u) | u <;> rfl
/-- Typed compact questions are equivalent to registered Pauli questions. -/
def pauliQuestionEquiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P) ≃
_root_.MIPStarRE.QPBT.PauliQuestion P :=
Equiv.prodCongr _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P)
/-- All seven compact answer constructors map to their registered counterparts. -/
def pauliAnswerEquivCompact (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
_root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P) ≃
_root_.MIPStarRE.QPBT.PauliAnswer P where
toFun
| .value a => .value a
| .alinePoly a => .alinePoly a
| .dlinePoly a => .dlinePoly a
| .pairBits a => .pairBits a
| .bit a => .bit a
| .msTriple a => .msTriple a
| .pauliOutcome a => .pauliOutcome a
invFun
| .value a => .value a
| .alinePoly a => .alinePoly a
| .dlinePoly a => .dlinePoly a
| .pairBits a => .pairBits a
| .bit a => .bit a
| .msTriple a => .msTriple a
| .pauliOutcome a => .pauliOutcome a
left_inv a := by cases a <;> rfl
right_inv a := by cases a <;> rfl
/-- The compact and registered Magic Square incidence maps coincide. -/
@[simp] theorem magicVariable_eq_msConstraintVars (i : Fin 6) (j : Fin 3) :
_root_.MIPStarRE.QPBT.Palomar.magicVariable i j = _root_.MIPStarRE.QPBT.msConstraintVars i j :=
rfl
/-- The registered filtered Magic Square carrier is its direct 18-edge image. -/
theorem registeredMagicEdges_eq :
((Finset.univ : Finset (_root_.MIPStarRE.QPBT.MsType × _root_.MIPStarRE.QPBT.MsType)).filter
(fun xy => Sym2.mk xy.1 xy.2 ∈ _root_.MIPStarRE.QPBT.msEdges) |>.image
(fun xy => Sym2.mk (_root_.MIPStarRE.QPBT.PauliType.ms xy.1)
(_root_.MIPStarRE.QPBT.PauliType.ms xy.2))) =
(Finset.univ : Finset (Fin 6 × Fin 3)).image (fun ij =>
Sym2.mk
(_root_.MIPStarRE.QPBT.PauliType.ms (_root_.MIPStarRE.QPBT.MsType.constraint ij.1))
(_root_.MIPStarRE.QPBT.PauliType.ms
(_root_.MIPStarRE.QPBT.MsType.var
(_root_.MIPStarRE.QPBT.msConstraintVars ij.1 ij.2)))) := by
ext e
simp only [_root_.MIPStarRE.QPBT.msEdges, Finset.mem_image, Finset.mem_filter,
Finset.mem_univ, true_and, Prod.exists, Sym2.eq_iff]
constructor
· rintro ⟨a, b, hab, he⟩
rcases hab with ⟨a', b', hab⟩
rcases hab with h | h
· rcases h with ⟨rfl, rfl⟩
exact ⟨a', b', he⟩
· rcases h with ⟨rfl, rfl⟩
exact ⟨a', b', Sym2.eq_swap.trans he⟩
· rintro ⟨a, b, he⟩
exact ⟨_root_.MIPStarRE.QPBT.MsType.constraint a,
_root_.MIPStarRE.QPBT.MsType.var (_root_.MIPStarRE.QPBT.msConstraintVars a b),
⟨a, b, Or.inl ⟨rfl, rfl⟩⟩, he⟩
/-- The registered graph written with the direct Magic Square edge image. -/
def registeredPauliEdgesDirect : Finset (Sym2 _root_.MIPStarRE.QPBT.PauliType) :=
let loops := Finset.univ.image fun t : _root_.MIPStarRE.QPBT.PauliType => Sym2.mk t t
let lines := (Finset.univ : Finset _root_.MIPStarRE.QPBT.PauliKind).image (fun W =>
Sym2.mk (.point W) (.aline W)) ∪
(Finset.univ : Finset _root_.MIPStarRE.QPBT.PauliKind).image (fun W =>
Sym2.mk (.point W) (.dline W)) ∪
(Finset.univ : Finset _root_.MIPStarRE.QPBT.PauliKind).image (fun W =>
Sym2.mk (.point W) (.pauli W))
let basis := (Finset.univ : Finset _root_.MIPStarRE.QPBT.PauliKind).image (fun W =>
Sym2.mk (.point W) (.pairW W)) ∪
({Sym2.mk (.point .X) (.ms (.var 0)),
Sym2.mk (.point .Z) (.ms (.var 4))} : Finset (Sym2 _root_.MIPStarRE.QPBT.PauliType))
let pairs := (Finset.univ : Finset _root_.MIPStarRE.QPBT.PauliKind).image fun W =>
Sym2.mk (.pairW W) .pair
let magic := (Finset.univ : Finset (Fin 6 × Fin 3)).image fun ij =>
Sym2.mk (.ms (.constraint ij.1))
(.ms (.var (_root_.MIPStarRE.QPBT.msConstraintVars ij.1 ij.2)))
loops ∪ lines ∪ basis ∪ pairs ∪ magic
/-- The direct-component presentation is exactly the registered graph. -/
theorem registeredPauliEdgesDirect_eq :
_root_.MIPStarRE.QPBT.pauliEdges = _root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect := by
unfold _root_.MIPStarRE.QPBT.pauliEdges _root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect
rw [_root_.MIPStarRE.QPBT.Palomar.registeredMagicEdges_eq]
simp
/-- Every compact edge maps to a registered edge. -/
theorem pauliEdges_map_mem {s : Sym2 _root_.MIPStarRE.QPBT.Palomar.PauliType} (h : s ∈ _root_.MIPStarRE.QPBT.Palomar.pauliEdges) :
Sym2.map _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv s ∈ _root_.MIPStarRE.QPBT.pauliEdges := by
rw [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect_eq]
simp only [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, Finset.mem_union, Finset.mem_image, Finset.mem_univ,
true_and, Finset.mem_insert, Finset.mem_singleton] at h
rcases h with ((((hloop | hlines) | hbasis) | hpairs) | hmagic)
· rcases hloop with ⟨t, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hlines with (h | h) | h
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hbasis with h | h | h
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with rfl
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with rfl
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hpairs with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hmagic with ⟨i, j, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
/-- Every registered edge maps back to a compact edge. -/
theorem registeredPauliEdges_map_mem {s : Sym2 _root_.MIPStarRE.QPBT.PauliType}
(h : s ∈ _root_.MIPStarRE.QPBT.pauliEdges) :
Sym2.map _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv.symm s ∈ _root_.MIPStarRE.QPBT.Palomar.pauliEdges := by
rw [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect_eq] at h
simp only [_root_.MIPStarRE.QPBT.Palomar.registeredPauliEdgesDirect, Finset.mem_union, Finset.mem_image,
Finset.mem_univ, true_and, Finset.mem_insert, Finset.mem_singleton] at h
rcases h with ((((hloop | hlines) | hbasis) | hpairs) | hmagic)
· rcases hloop with ⟨t, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hlines with (h | h) | h
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hbasis with h | h | h
· rcases h with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with rfl
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases h with rfl
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hpairs with ⟨W, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
· rcases hmagic with ⟨i, j, rfl⟩
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEdges, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv]
/-- The compact type map preserves the complete undirected edge set. -/
theorem pauliEdges_mem_equiv (e : _root_.MIPStarRE.QPBT.Palomar.PauliType × _root_.MIPStarRE.QPBT.Palomar.PauliType) :
Sym2.mk e.1 e.2 ∈ _root_.MIPStarRE.QPBT.Palomar.pauliEdges ↔
Sym2.mk (_root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv e.1) (_root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv e.2) ∈
_root_.MIPStarRE.QPBT.pauliEdges := by
constructor
· intro h
simpa using _root_.MIPStarRE.QPBT.Palomar.pauliEdges_map_mem h
· intro h
have h' := _root_.MIPStarRE.QPBT.Palomar.registeredPauliEdges_map_mem h
simpa using h'
/-- The compact and registered ordered-edge carriers are equivalent. -/
def pauliEdgeEquiv : _root_.MIPStarRE.QPBT.Palomar.PauliEdge ≃ _root_.MIPStarRE.QPBT.PauliEdge :=
(Equiv.prodCongr _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv).subtypeEquiv _root_.MIPStarRE.QPBT.Palomar.pauliEdges_mem_equiv
/-- The complete common-source spaces are equivalent coordinate by coordinate. -/
def pauliSourceEquiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
(_root_.MIPStarRE.QPBT.Palomar.PauliEdge ×
_root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) ≃
(_root_.MIPStarRE.QPBT.PauliEdge × _root_.MIPStarRE.QPBT.PauliSpace P) :=
Equiv.prodCongr _root_.MIPStarRE.QPBT.Palomar.pauliEdgeEquiv (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P)
/-- Equivalence of the two ordered question-pair carriers. -/
def pauliQuestionPairEquiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P) ×
_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) ≃
(_root_.MIPStarRE.QPBT.PauliQuestion P × _root_.MIPStarRE.QPBT.PauliQuestion P) :=
Equiv.prodCongr (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P) (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P)
/-- The compact Pauli parameters select exactly the registered low-degree tuple. -/
theorem pauliLowDegreeParams_eq (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
(_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toLowDegreeParams =
_root_.MIPStarRE.QPBT.Palomar.LowDegreeParams.ofLdParams P.toLdParams := by
rfl
/-- The published low-degree map bridge specialized to the Pauli parameters. -/
theorem pauliLowDegreeMap_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(t : _root_.MIPStarRE.QPBT.Palomar.LowDegreeType)
(z : _root_.MIPStarRE.QPBT.Palomar.LowDegreeSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toLowDegreeParams
(_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.lowDegreeSpaceEquiv P.toLdParams
(_root_.MIPStarRE.QPBT.Palomar.lowDegreeMap (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toLowDegreeParams
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) t z) =
_root_.MIPStarRE.QPBT.ldCL P.toLdParams (_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv t)
(_root_.MIPStarRE.QPBT.Palomar.lowDegreeSpaceEquiv P.toLdParams z) := by
cases _root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeParams_eq P
exact _root_.MIPStarRE.QPBT.Palomar.lowDegreeMap_equiv P.toLdParams t z
/-- Reading the selected compact point block commutes with the space equivalence. -/
@[simp] theorem pauliSpaceEquiv_pointBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(W : _root_.MIPStarRE.QPBT.Palomar.PauliKind)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliPointBlock (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W) (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) =
_root_.MIPStarRE.QPBT.Palomar.pauliPointBlock W z := by
cases W <;> rfl
/-- Restriction to one low-degree block commutes with the coordinate equivalence. -/
theorem pauliLowDegreeSpace_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(W : _root_.MIPStarRE.QPBT.Palomar.PauliKind)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.lowDegreeSpaceEquiv P.toLdParams (_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeSpace W z) =
_root_.MIPStarRE.QPBT.pauliToLd P (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W) (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) := by
funext i
rcases i with (i | u) | i <;> cases W <;> rfl
/-- Embedding one low-degree block commutes with the coordinate equivalence. -/
theorem pauliEmbedLowDegree_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(W : _root_.MIPStarRE.QPBT.Palomar.PauliKind)
(z : _root_.MIPStarRE.QPBT.Palomar.LowDegreeSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toLowDegreeParams
(_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P (_root_.MIPStarRE.QPBT.Palomar.pauliEmbedLowDegree W z) =
_root_.MIPStarRE.QPBT.embedLd P (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
(_root_.MIPStarRE.QPBT.Palomar.lowDegreeSpaceEquiv P.toLdParams z) := by
funext i
rcases i with ((((i | i) | u) | i) | u) | u <;> cases W <;> rfl
/-- A basis-selected compact low-degree map commutes with ambient embedding. -/
theorem pauliEmbeddedLowDegreeMap_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(W : _root_.MIPStarRE.QPBT.Palomar.PauliKind) (t : _root_.MIPStarRE.QPBT.Palomar.LowDegreeType)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P (_root_.MIPStarRE.QPBT.Palomar.pauliEmbedLowDegree W
(_root_.MIPStarRE.QPBT.Palomar.lowDegreeMap (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toLowDegreeParams
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) t (_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeSpace W z))) =
_root_.MIPStarRE.QPBT.embedLd P (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W)
(_root_.MIPStarRE.QPBT.ldCL P.toLdParams (_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv t)
(_root_.MIPStarRE.QPBT.pauliToLd P (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W) (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z))) := by
rw [_root_.MIPStarRE.QPBT.Palomar.pauliEmbedLowDegree_equiv]
apply congrArg (_root_.MIPStarRE.QPBT.embedLd P (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W))
calc
_root_.MIPStarRE.QPBT.Palomar.lowDegreeSpaceEquiv P.toLdParams
(_root_.MIPStarRE.QPBT.Palomar.lowDegreeMap (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toLowDegreeParams
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) t (_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeSpace W z)) =
_root_.MIPStarRE.QPBT.ldCL P.toLdParams (_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv t)
(_root_.MIPStarRE.QPBT.Palomar.lowDegreeSpaceEquiv P.toLdParams (_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeSpace W z)) :=
_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeMap_equiv P t (_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeSpace W z)
_ = _root_.MIPStarRE.QPBT.ldCL P.toLdParams (_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv t)
(_root_.MIPStarRE.QPBT.pauliToLd P (_root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv W) (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z)) := by
rw [_root_.MIPStarRE.QPBT.Palomar.pauliLowDegreeSpace_equiv]
/-- The shared four-register projection commutes with the space equivalence. -/
theorem pauliSharedProjection_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P (z.1, z.2.1, 0, 0, z.2.2.2.2.1, z.2.2.2.2.2) =
_root_.MIPStarRE.QPBT.pauliSharedProjection (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) := by
funext i
rcases i with ((((i | i) | u) | i) | u) | u <;> rfl
/-- Every compact Pauli question map is the registered map in product coordinates. -/
theorem pauliMap_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (t : _root_.MIPStarRE.QPBT.Palomar.PauliType)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P
(_root_.MIPStarRE.QPBT.Palomar.pauliMap (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) t z) =
_root_.MIPStarRE.QPBT.pauliCL P (_root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv t) (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) := by
cases t with
| point W =>
simpa [_root_.MIPStarRE.QPBT.Palomar.pauliMap, _root_.MIPStarRE.QPBT.pauliCL, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv,
_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv, _root_.MIPStarRE.QPBT.ldCL] using
_root_.MIPStarRE.QPBT.Palomar.pauliEmbeddedLowDegreeMap_equiv P W .point z
| aline W =>
simpa [_root_.MIPStarRE.QPBT.Palomar.pauliMap, _root_.MIPStarRE.QPBT.pauliCL, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv,
_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv, _root_.MIPStarRE.QPBT.ldCL] using
_root_.MIPStarRE.QPBT.Palomar.pauliEmbeddedLowDegreeMap_equiv P W .aline z
| dline W =>
simpa [_root_.MIPStarRE.QPBT.Palomar.pauliMap, _root_.MIPStarRE.QPBT.pauliCL, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv,
_root_.MIPStarRE.QPBT.Palomar.lowDegreeTypeEquiv, _root_.MIPStarRE.QPBT.ldCL] using
_root_.MIPStarRE.QPBT.Palomar.pauliEmbeddedLowDegreeMap_equiv P W .dline z
| pauli W =>
funext i
rcases i with ((((i | i) | u) | i) | u) | u <;> rfl
| pairW W | pair | constraint _ | _ =>
exact _root_.MIPStarRE.QPBT.Palomar.pauliSharedProjection_equiv P z
/-- The compact question PMF is exactly the registered question distribution. -/
theorem pauliQuestionPMF_map (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionPMF (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)).map (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionPairEquiv P) =
(_root_.MIPStarRE.QPBT.pauliBasisTest P).μ.toPMF
(_root_.MIPStarRE.QPBT.pauliBasisTest P).μ_prob := by
classical
letI : Nonempty _root_.MIPStarRE.QPBT.PauliEdge := _root_.MIPStarRE.QPBT.pauliEdge_nonempty
let compactMap := fun s : _root_.MIPStarRE.QPBT.Palomar.PauliEdge ×
_root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P) =>
((s.1.1.1, _root_.MIPStarRE.QPBT.Palomar.pauliMap (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) s.1.1.1 s.2),
(s.1.1.2, _root_.MIPStarRE.QPBT.Palomar.pauliMap (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) s.1.1.2 s.2))
let originalMap := fun s :
_root_.MIPStarRE.QPBT.PauliEdge × _root_.MIPStarRE.QPBT.PauliSpace P =>
((s.1.1.1, _root_.MIPStarRE.QPBT.pauliCL P s.1.1.1 s.2),
(s.1.1.2, _root_.MIPStarRE.QPBT.pauliCL P s.1.1.2 s.2))
have hcomm : _root_.MIPStarRE.QPBT.Palomar.pauliQuestionPairEquiv P ∘ compactMap =
originalMap ∘ _root_.MIPStarRE.QPBT.Palomar.pauliSourceEquiv P := by
funext s
apply Prod.ext
· apply Prod.ext
· rfl
· exact _root_.MIPStarRE.QPBT.Palomar.pauliMap_equiv P s.1.1.1 s.2
· apply Prod.ext
· rfl
· exact _root_.MIPStarRE.QPBT.Palomar.pauliMap_equiv P s.1.1.2 s.2
rw [show _root_.MIPStarRE.QPBT.Palomar.pauliQuestionPMF (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) =
(PMF.uniformOfFintype _).map compactMap by rfl]
rw [PMF.map_comp, hcomm, ← PMF.map_comp]
rw [_root_.LIDT.PMF.uniformOfFintype_map_equiv (_root_.MIPStarRE.QPBT.Palomar.pauliSourceEquiv P)]
have hmap :=
(_root_.LIDT.MIPStarRE.LDT.Distribution.toPMF_map
(_root_.LIDT.MIPStarRE.LDT.uniformDistribution
(_root_.MIPStarRE.QPBT.PauliEdge × _root_.MIPStarRE.QPBT.PauliSpace P))
(_root_.LIDT.MIPStarRE.LDT.uniformDistribution_isProbability
(_root_.MIPStarRE.QPBT.PauliEdge × _root_.MIPStarRE.QPBT.PauliSpace P)) originalMap).symm
rw [_root_.LIDT.MIPStarRE.LDT.uniformDistribution_toPMF] at hmap
simpa only [_root_.MIPStarRE.QPBT.pauliBasisTest,
_root_.MIPStarRE.QPBT.pauliQuestionDistribution] using hmap
/-- The six registered block projections recover the compact product coordinates. -/
@[simp] theorem pauliSpaceEquiv_xBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliXBlock (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) = z.1 :=
rfl
@[simp] theorem pauliSpaceEquiv_zBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliZBlock (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) = z.2.1 :=
rfl
@[simp] theorem pauliSpaceEquiv_scalarBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliScalarBlock (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) = z.2.2.1 :=
rfl
@[simp] theorem pauliSpaceEquiv_directionBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliDirectionBlock (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) = z.2.2.2.1 :=
rfl
@[simp] theorem pauliSpaceEquiv_rxBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliRXBlock (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) = z.2.2.2.2.1 :=
rfl
@[simp] theorem pauliSpaceEquiv_rzBlock (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.pauliRZBlock (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) = z.2.2.2.2.2 :=
rfl
/-- The compact balanced coordinate map is the registered `chiIndex`. -/
@[simp] theorem pauliChiIndex_eq (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(s : _root_.MIPStarRE.QPBT.PauliScalar P) :
_root_.MIPStarRE.QPBT.Palomar.pauliChiIndex (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model) s =
_root_.MIPStarRE.QPBT.chiIndex P.toLdParams s := by
rfl
/-- Compact indicator entries are the registered Boolean-cube indicators. -/
@[simp] theorem pauliIndicator_eq_indicatorVec (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(x : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (y : Fin P.m → Bool) :
_root_.MIPStarRE.QPBT.Palomar.pauliIndicator (P := _root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) x y =
_root_.MIPStarRE.QPBT.indicatorVec x y :=
(_root_.MIPStarRE.QPBT.indicatorVec_apply_eq_prod x y).symm
/-- The complete compact indicator vector is the registered indicator vector. -/
@[simp] theorem pauliIndicator_fun_eq_indicatorVec
(P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(x : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) :
_root_.MIPStarRE.QPBT.Palomar.pauliIndicator (P := _root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) x =
_root_.MIPStarRE.QPBT.indicatorVec x := by
funext y
exact _root_.MIPStarRE.QPBT.Palomar.pauliIndicator_eq_indicatorVec P x y
/-- The compact multilinear encoding is the registered low-degree encoding. -/
@[simp] theorem pauliEncoded_eq_lowDegreeEnc (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(h : (Fin P.m → Bool) → _root_.MIPStarRE.QPBT.PauliScalar P)
(x : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) :
_root_.MIPStarRE.QPBT.Palomar.pauliEncoded (P := _root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) h x =
_root_.MIPStarRE.QPBT.lowDegreeEnc h x := by
rw [_root_.MIPStarRE.QPBT.lowDegreeEnc_eq_dotProduct]
simp [_root_.MIPStarRE.QPBT.Palomar.pauliEncoded, _root_.MIPStarRE.QPBT.Palomar.pauliIndicator_fun_eq_indicatorVec]
/-- The compact phase gate is exactly the registered Pauli pair gamma bit. -/
@[simp] theorem pauliGamma_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.Palomar.PauliSpace (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.pauliGamma (_root_.MIPStarRE.QPBT.fixedBinTrace P.model) z =
_root_.MIPStarRE.QPBT.pauliPairGamma P (_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv P z) := by
simp only [_root_.MIPStarRE.QPBT.Palomar.pauliGamma, _root_.MIPStarRE.QPBT.pauliPairGamma, _root_.MIPStarRE.QPBT.gammaValue,
_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv_rxBlock, _root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv_rzBlock, _root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv_xBlock,
_root_.MIPStarRE.QPBT.Palomar.pauliSpaceEquiv_zBlock]
rw [_root_.MIPStarRE.QPBT.Palomar.pauliIndicator_fun_eq_indicatorVec P z.1,
_root_.MIPStarRE.QPBT.Palomar.pauliIndicator_fun_eq_indicatorVec P z.2.1]
/-- The compact and registered exceptional Magic Square parities coincide. -/
@[simp] theorem magicParity_eq_msParity (i : Fin 6) :
_root_.MIPStarRE.QPBT.Palomar.magicParity i = _root_.MIPStarRE.QPBT.msParity i :=
rfl
/-- Answer-shape rejection is unchanged by the constructor equivalence. -/
theorem validPauliAnswer_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(t : _root_.MIPStarRE.QPBT.Palomar.PauliType)
(a : _root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.validPauliAnswer t a =
_root_.MIPStarRE.QPBT.validPauliAnswer (_root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv t) (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P a) := by
cases t <;> cases a <;>
simp [_root_.MIPStarRE.QPBT.Palomar.validPauliAnswer, _root_.MIPStarRE.QPBT.validPauliAnswer, _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv,
_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact]
set_option maxRecDepth 10000 in
set_option maxHeartbeats 4000000 in
-- The proof checks all well-formed question/answer constructor pairs explicitly.
/-- The compact Boolean verifier is exactly the registered verifier after relabeling. -/
theorem pauliWin_equiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(x y : _root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.PauliScalar P))
(a b : _root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.PauliScalar P)) :
_root_.MIPStarRE.QPBT.Palomar.pauliWin (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)
(_root_.MIPStarRE.QPBT.fixedBinTrace P.model) x y a b =
_root_.MIPStarRE.QPBT.pauliWinPredicate P (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P x)
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P y) (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P a)
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P b) := by
rcases x with ⟨tA, xA⟩
rcases y with ⟨tB, xB⟩
unfold _root_.MIPStarRE.QPBT.Palomar.pauliWin _root_.MIPStarRE.QPBT.pauliWinPredicate
simp only [_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv, Equiv.prodCongr_apply, Prod.map_fst, Prod.map_snd]
rw [← _root_.MIPStarRE.QPBT.Palomar.validPauliAnswer_equiv P tA a, ← _root_.MIPStarRE.QPBT.Palomar.validPauliAnswer_equiv P tB b]
by_cases hv : (_root_.MIPStarRE.QPBT.Palomar.validPauliAnswer tA a && _root_.MIPStarRE.QPBT.Palomar.validPauliAnswer tB b) = true
· rw [if_pos hv, if_pos hv]
by_cases ht : tA = tB
· have ht' : _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv tA = _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv tB := congrArg _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv ht
rw [if_pos ht, if_pos ht']
apply decide_eq_decide.mpr
constructor
· exact fun h => congrArg (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P) h
· exact fun h => (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).injective h
· have ht' : _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv tA ≠ _root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv tB :=
fun h => ht (_root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv.injective h)
rw [if_neg ht, if_neg ht']
obtain ⟨hvA, hvB⟩ := Bool.and_eq_true_iff.mp hv
rcases tA with (_ | _) | (_ | _) | (_ | _) | (_ | _) | (_ | _) | _ | i | j <;>
rcases a with uA | fA | gA | bitsA | bitA | tripleA | outcomeA <;>
(try exact Bool.noConfusion hvA) <;>
rcases tB with (_ | _) | (_ | _) | (_ | _) | (_ | _) | (_ | _) | _ | i' | j' <;>
rcases b with uB | fB | gB | bitsB | bitB | tripleB | outcomeB <;>
(try exact Bool.noConfusion hvB) <;>
simp [_root_.MIPStarRE.QPBT.Palomar.pauliTypeEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliKindEquiv, _root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact,
_root_.MIPStarRE.QPBT.pauliAlinePointCondition,
_root_.MIPStarRE.QPBT.pauliDlinePointCondition,
_root_.MIPStarRE.QPBT.pauliPointPauliCondition,
_root_.MIPStarRE.QPBT.pauliPairCondition,
_root_.MIPStarRE.QPBT.pauliPointPairCondition,
_root_.MIPStarRE.QPBT.pauliPointVariableCondition,
_root_.MIPStarRE.QPBT.msWinPredicate, _root_.MIPStarRE.QPBT.coordinateDirection,
_root_.MIPStarRE.QPBT.Palomar.lowDegreeEval_eq_evalCoefficient, _root_.MIPStarRE.QPBT.Palomar.magicVariable_eq_msConstraintVars,
_root_.MIPStarRE.QPBT.Palomar.magicParity_eq_msParity] <;>
rfl
· rw [if_neg hv, if_neg hv]
end
end MIPStarRE.QPBT.Palomar
Source