Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (28)–(30): every model has a causaloid on any elementary fiducial sets

Proved
HardyCausaloid.causaloid_exists

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

causaloidlinear-algebrap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probabilistic-theoriesquantum-gravity

Let MMM be an experiment model and, for every location xxx, let Ωx\Omega_xΩx​ be a fiducial set of the elementary region RxR_xRx​. Then there is a causaloid CCC of MMM whose elementary fiducial sets are the given Ωx\Omega_xΩx​: for every finite set OOO of locations its fiducial set ΩO\Omega_OΩO​ of the region ROR_ORO​ lies in ∏x∈OΩx\prod_{x\in O}\Omega_x∏x∈O​Ωx​ (eq. (28)), and the vectors computed from its Λ\LambdaΛ matrices by the causaloid product,

(rα(RO))k=∑l∈∏x∈OΩx(∏x∈OΛαxlx)Λlk,\big(\mathbf r_\alpha(R_O)\big)_k=\sum_{l\in\prod_{x\in O}\Omega_x}\Big(\prod_{x\in O}\Lambda^{l_x}_{\alpha_x}\Big)\Lambda^{k}_{l},(rα​(RO​))k​=l∈∏x∈O​Ωx​∑​(x∈O∏​Λαx​lx​​)Λlk​,

give every probability: pα=rα(RO)⋅p(RO)p_\alpha=\mathbf r_\alpha(R_O)\cdot\mathbf p(R_O)pα​=rα​(RO​)⋅p(RO​) for every label α\alphaα of ROR_ORO​ and every generalised preparation (eq. (20)).

This is the paper's claim that "Given these Λ matrices we can calculate the r vectors for any measurement outcome for any region using the causaloid product" (p.14), with the list (30) built by second level compression for any number of regions.

Differences from the source:

  • reading: the causaloid Λ ≡ (subset of Λ's | RULES), (31), and 'once we have the causaloid' (p.16) → a causaloid is the list (30) of Λ matrices (Causaloid) with IsCausaloidOf C M; reason: (31) leaves RULES unspecified; every compressed form is used through the list (30) it reproduces, so the theorem covers it
  • reading: 'for any region', (28)–(30) → every finite set O of locations, with Ω_O ⊆ ∏_{x∈O} Ω_x; reason: by (2) a region is a union of elementary regions; (21) iterated through (28) places Ω_O in the product
  • generalization: labels α₁ = 1, 2, … of (Y₁, F₁); sums over the outcomes β₂ → settings and outcomes of arbitrary types, unconditional sums (tsum/HasSum), summability proved in the conclusion; reason: the paper does not say the label sets are finite; finite label sets are the special case, where every tsum is a finite sum
  • reading: a just sufficient set of probabilities (p.11), the fiducial set (p.12) → Fiducial: sufficient, and no proper subset is sufficient; reason: inclusion-minimality is the literal sense of just sufficient
Preamble
import Mathlib
import Definitions.Def_HardyCausaloid_Model
import Definitions.Def_HardyCausaloid_Region
import Definitions.Def_HardyCausaloid_Fiducial
import Definitions.Def_HardyCausaloid_Causaloid

set_option autoImplicit false
Formal statement
namespace HardyCausaloid

/-- **Eqs. (28)–(30): every model has a causaloid on any elementary fiducial sets**, Hardy,
arXiv:gr-qc/0608043v1, §4.3, eqs. (28)–(29), p.14 ("We can implement second level physical
compression for more than two regions by applying the same reasoning.") and §4.4, eq. (30),
p.14 ("Given these Λ matrices we can calculate the r vectors for any measurement outcome for any
region using the causaloid product.").

For every model `M` and every family `Ω₁` of finite sets of labels with `Ω₁ x` a fiducial set of
the elementary region `R_x` for every location `x`, there is a causaloid `C` with elementary
fiducial sets `C.Ω₁ = Ω₁` that is a causaloid of `M`: its fiducial set for every region `R_O`
lies in `∏_{x∈O} Ω₁ x`, and the vectors `r_α(R_O)` computed from its Λ matrices by the causaloid
product give every probability `p_α = r_α(R_O) · p(R_O)`. -/
theorem causaloid_exists {X : Type*} {Setting : X → Type*}
    {Outcome : (x : X) → Setting x → Type*} [DecidableEq X] (M : Model Setting Outcome)
    (Ω₁ : ∀ x, Finset (Label Setting Outcome x))
    (hΩ₁ : ∀ x, Fiducial (elemTable M x) (Ω₁ x)) :
    ∃ C : Causaloid Setting Outcome, C.Ω₁ = Ω₁ ∧ IsCausaloidOf C M := by sorry

end HardyCausaloid
Source
Hardy, Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure, arXiv:gr-qc/0608043v1, §4.3, eqs. (28)–(29), p.14; §4.4, eq. (30), p.14
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me