§5, p.14 — the clumping method respects F-locality
ProvedHardyFLocal.clumping_respects_f_localitycausaloidp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-gravityquantum-informationsuperoperators
Let be labels at the vertices of the lattice, a finite set of vertices, and , pairs of tables with on every sequential pair of vertices and for every . Then the two clumped causaloids have the same
So predictions for a region use only objects pertaining to that region, which is the property the paper is named for.
Differences from the source:
- reading: "we only use Λ matrices pertaining to regions R̃₁ ⊆ R₁" → for tables T, E as arguments: tables agreeing on the sequential pairs inside O and the vertices of O give the same ΩC O, Λ O and r_α; reason: the informal remark, as a statement about which entries of the tables are read
- reading: "a large number" of qubits → every m, n in ℕ, including small ones; reason: the statement is uniform in the lattice size and states nothing different on small lattices
- encoding: the labelling sentence of p.12 has v running from right to left → on a right mover (u, v) is followed by (u, v+1), on a left mover (u, v) by (u+1, v); reason: the explicit statement of p.13; it differs only by reversing both labellings
- reading: (21)–(22) take k′, k″ in {1} and k in Ω² → the earliest vertex of a clump carries the free label, later vertices the label 1, on each of the two qubits of a vertex; reason: this is the index placement of (21)–(22) applied to every clump
- encoding: labels run from 1, and the first element of Ω² is 1 → labels are 0-based, and the first element of Ω² = Fin 16 is 0; reason: Lean convention; same instances
Preamble
import Mathlib import Definitions.Def_HardyCausaloid_Model import Definitions.Def_HardyCausaloid_Region import Definitions.Def_HardyCausaloid_Fiducial import Definitions.Def_HardyCausaloid_Causaloid import Definitions.Def_HardyCausaloid_Conditional import Definitions.Def_HardyFLocal_Superoperator import Definitions.Def_HardyFLocal_Instrument import Definitions.Def_HardyFLocal_Lattice import Definitions.Def_HardyFLocal_FiducialFamily import Definitions.Def_HardyFLocal_ClumpCausaloid set_option autoImplicit false
Formal statement
namespace HardyFLocal
open HardyCausaloid
/-- **The clumping method respects F-locality**, Hardy, arXiv:0804.0054v1, §5, p.14 ("We note that the
clumping method respects F-locality since, in calculating the Λ matrix for R₁, we only use Λ matrices
pertaining to regions R̃₁ ⊆ R₁").
Let `(T, E)` and `(T', E')` be tables that agree on the sequential pairs of vertices inside `O` and
on the vertices of `O`. Then the two clumped causaloids have the same fiducial set `ΩC O`, the same
matrix `Λ O`, and the same vector `r_α(R_O)` for every label `α` of `R_O`. -/
theorem clumping_respects_f_locality {m n : ℕ}
(L : ∀ x : X m n, Ω × Ω → Label (Setting m n) (Outcome m n) x)
(T T' : X m n → X m n → PairTable)
(E E' : ∀ x : X m n, Label (Setting m n) (Outcome m n) x → Ω × Ω → ℝ)
(O : Finset (X m n))
(hT : ∀ x ∈ O, ∀ x' ∈ O, IsSequentialPair x x' → T x x' = T' x x')
(hE : ∀ x ∈ O, E x = E' x) :
(clumpCausaloid L T E).ΩC O = (clumpCausaloid L T' E').ΩC O ∧
(∀ (l : ∀ x : O, omegaOne L x.1) (k : omegaC L O),
(clumpCausaloid L T E).Λ O l k = (clumpCausaloid L T' E').Λ O l k) ∧
∀ α : Lab (Setting m n) (Outcome m n) O,
(clumpCausaloid L T E).r O α = (clumpCausaloid L T' E').r O α := by sorry
end HardyFLocal
Source
L. Hardy, Formalism Locality in Quantum Theory and Quantum Gravity, arXiv:0804.0054v1, §5, p.14
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.