Eq. (24), p.13 (corrected: upper indices ), and the general chain
ProvedHardyFLocal.eq24_general_chaincausaloidp2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-gravityquantum-informationsuperoperators
Let \_k\Lambda$ its pair table.
- For four sequential vertices, the coordinate at of \{l'''}\circ${l''}\circ$_{l'}\circ$_l$ is
- For every list of labels in time order, the composite \{l_r}\circ\cdots\circ${l_1}\sum_k c_k$_kc$ is the chain vector computed by the recursion from the pair table, and these real coefficients are unique.
The second part is the paper's "and so on": a clump of any length is handled by the two tables of (28).
Differences from the source:
- correction: the left side of (24) has lower indices l‴l″l′l and upper indices k″k′k, while the right side has the free index k‴ → the upper indices are k‴k″k′k, and k‴ is 1; reason: the printed equation has k‴ unbound and so is not well formed; this is the four-vertex analogue of (23)
- reading: a "fiducial spanning set of superoperators", with Λ in "a real vector space" (p.9) → a basis over ℝ of the Hermiticity-preserving one-qubit maps; reason: real coefficients are what p.9 requires, and they exist for Hermiticity-preserving maps
- 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_HardyFLocal_Superoperator import Definitions.Def_HardyFLocal_FiducialFamily set_option autoImplicit false
Formal statement
namespace HardyFLocal
/-- **Eq. (24) (corrected: the upper indices are `k''' k'' k' k`), and its generalizations**, Hardy,
arXiv:0804.0054v1, §5, eq. (24), p.13 ("For four sequential vertices, … and so on").
1. For four sequential vertices, the `k` coordinate of `$_{l'''} ∘ $_{l''} ∘ $_{l'} ∘ $_l` is
`Σ_{n''} Σ_{n'} Λ^{1 n''}_{l''' l''} Λ^{1 n'}_{n'' l'} Λ^{1 k}_{n' l}`, with `Λ = pairTable S`.
2. For every list of labels in time order, the composite is `Σ_k c_k $_k`, where `c` is the vector
`chainConst (pairTable S) ls` computed by the recursion, and these coefficients are unique.
**Formalization Note** The printed left side of (24) has lower indices `l''' l'' l' l` and upper
indices `k'' k' k`, leaving the right side's `k'''` unbound; the upper indices are read as
`k''' k'' k' k`. -/
theorem eq24_general_chain (S : FiducialFamily) :
(∀ l''' l'' l' l k : Ω,
coordsOf S.map (S.map l''' ∘ₗ S.map l'' ∘ₗ S.map l' ∘ₗ S.map l) k =
∑ a, ∑ b, pairTable S l''' l'' a * pairTable S a l' b * pairTable S b l k) ∧
∀ ls : List Ω,
compose S ls = ∑ k, chainConst (pairTable S) ls k • S.map k ∧
∀ c : Ω → ℝ, compose S ls = ∑ k, c k • S.map k → c = chainConst (pairTable S) ls := by sorry
end HardyFLocal
Source
L. Hardy, Formalism Locality in Quantum Theory and Quantum Gravity, arXiv:0804.0054v1, §5, eq. (24), p.13
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.