Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Realized product tomography implies both spanning and fiducial minimality on the clump label set

Proved
HardyFLocal.clump_fiducial_from_test_table

by kmehltretter82 · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-algebramathematical-physics

For a qubit region with reconstruction, a realized table of independent product tests across clump starts implies both spanning of the physical preparation vectors and minimality of the proposed clump fiducial labels. The statement uses the actual decoded indices on each wire.

Preamble
import Mathlib
import Definitions.Def_HardyFLocal_ClumpCausaloid
import Theorems.Thm_HardyFLocal_product_tests_span
import Theorems.Thm_HardyFLocal_clump_coordinate_equivalence
open HardyCausaloid
open Classical
Formal statement
namespace HardyFLocal

open Classical in
theorem clump_fiducial_from_test_table {m n : ℕ} (M : Model (Setting m n) (Outcome m n))
    (S : FiducialFamily) (L : ∀ x : X m n, Ω × Ω → Label (Setting m n) (Outcome m n) x)
    (hL : IsFiducialLabels S L) (O : Finset (X m n))
    (recovers : ∀ α s, regionTable M O α s = (actualCausaloid S L).r O α ⬝ᵥ (actualCausaloid S L).state M O s)
    {T : Type} [Fintype T] (w : Ω → T → ℝ) (hw : LinearIndependent ℝ w)
    (tests : ∀ t : {i : O × Bool // IsClumpStart O (if i.2 then Sum.inl i.1.val.1 else Sum.inr i.1.val.2) i.1.val} → T,
      ∃ s, ∀ k : omegaC L O, (actualCausaloid S L).state M O s k =
        ∏ i, w (if i.val.2 then (famPairs L O k.val i.val.1.val).1 else (famPairs L O k.val i.val.1.val).2) (t i)) :
    Submodule.span ℝ (Set.range ((actualCausaloid S L).state M O)) = ⊤ ∧
      Fiducial (regionTable M O) ((actualCausaloid S L).fidSet O) := by sorry

end HardyFLocal
Source
Hardy, arXiv:0804.0054, section 5, interior tomography and fiducial minimality.

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