Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2, p.12: a fiducial set has ∣Ω1∣|\Omega_1|∣Ω1​∣ linearly independent states

Proved
HardyCausaloid.fiducial_spanning_states

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

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

Let q(α,s)q(\alpha,s)q(α,s) be a table of real numbers and Ω\OmegaΩ a fiducial set for it, with state vectors p(s)=(q(l,s))l∈Ω∈RΩ\mathbf p(s)=(q(l,s))_{l\in\Omega}\in\mathbb R^\Omegap(s)=(q(l,s))l∈Ω​∈RΩ. Then

  1. the state vectors p(s)\mathbf p(s)p(s), over all preparations sss, span RΩ\mathbb R^{\Omega}RΩ;
  2. there are preparations sls_lsl​, l∈Ωl\in\Omegal∈Ω, whose states p(sl)\mathbf p(s_l)p(sl​) are linearly independent — ∣Ω∣|\Omega|∣Ω∣ linearly independent states;
  3. for every label α\alphaα the vector rα\mathbf r_\alpharα​ with q(α,s)=rα⋅p(s)q(\alpha,s)=\mathbf r_\alpha\cdot\mathbf p(s)q(α,s)=rα​⋅p(s) for all sss exists and is unique.

This is the fact the paper invokes at (24) ("Since we can find a spanning set of linearly independent states") and at (36) ("since there exists a linearly independent spanning set of such states").

Differences from the source:

  • generalization: the probabilities p_α of the labels α of a region R₁ under the generalised preparations in R − R₁ → any real table q α s; reason: the statement is linear algebra on the table; it specializes to q = regionTable M O and q = elemTable M x
  • generalization: there must exist a set of |Ω₁| linearly independent states → the states span ℝ^Ω, |Ω| of them are linearly independent, and the vectors r_α are unique; reason: adds the spanning and uniqueness consequences the paper uses at (24) and (36); clause 2 is the page's claim
  • 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_Fiducial

set_option autoImplicit false
Formal statement
namespace HardyCausaloid

/-- **A just sufficient list has `|Ω|` linearly independent states**, Hardy,
arXiv:gr-qc/0608043v1, §4.2, p.12 ("Since the probabilities in p(R1) are just sufficient for this
purpose, there must exist a set of |Ω1| linearly independent states chosen from the allowed set
of states.").

If `Ω` is a fiducial set of the probability table `q`, then

1. the state vectors `p_Ω(s)`, over all generalised preparations `s`, span `ℝ^Ω`;
2. some `|Ω|` of them, `p_Ω(s_l)` for `l ∈ Ω`, are linearly independent;
3. for every label `α` the vector `r_α` of eq. (15) is unique.

**Formalization Note** The table is arbitrary; the paper's case is `q = regionTable M O` (or
`elemTable M x`). -/
theorem fiducial_spanning_states {A S : Type*} (q : A → S → ℝ) (Ω : Finset A)
    (hΩ : Fiducial q Ω) :
    Submodule.span ℝ (Set.range (stateVec q Ω)) = ⊤ ∧
    (∃ s : Ω → S, LinearIndependent ℝ (fun l => stateVec q Ω (s l))) ∧
    (∀ α : A, ∃! r : Ω → ℝ, ∀ s : S, q α s = r ⬝ᵥ stateVec q Ω s) := by sorry

end HardyCausaloid
Source
Hardy, Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure, arXiv:gr-qc/0608043v1, §4.2, p.12
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