Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reconstruction on the observation image is equivalent to fibre constancy

Proved
image_reconstructible_iff_fiber_constant

by alexcour · Nov 10, 2026 · Mathlib c5ea003 (Lean v4.30.0)

causal-fiber-01couret-programmecouret-unification-20261108toy-model

For arbitrary types H,O,VH,O,VH,O,V and maps p:H→Op:H\to Op:H→O, v:H→Vv:H\to Vv:H→V, the following are equivalent: vvv is constant on every fibre of ppp; and there exists a reconstructor that takes o∈Oo\in Oo∈O together with a witness that ooo lies in the image of ppp, and returns v(h)v(h)v(h) when applied to p(h)p(h)p(h) and its image witness. Reconstruction is required only on the image, with no inhabitance assumption on VVV.

Preamble
import Definitions.Def_Couret_CausalFiber01_c81331552304
/-! CAUSAL-FIBER-01: toy model; not a production FCI proof. -/
universe u v w









Formal statement
theorem image_reconstructible_iff_fiber_constant
    {H : Type u} {O : Type v} {V : Type w}
    (p : H → O) (v : H → V) :
    ImageReconstructible p v ↔ FiberConstant p v := by sorry



























/- Conservative authorization is weaker than exact verdict reconstruction.
   The observation map and the permitted-history predicate must be justified
   independently when connecting this theorem to a verifier. -/






/- CAUSAL-PAIR-01 bridge: one quiescent operation, initial effects 0 or 1,
   restored empty receipt ledger, non-idempotent receiver. This finite model
   is linked to measured SQLite traces by bridge.py, not by a refinement proof. -/
namespace Recovery



















end Recovery
Source
Alexandre Couret, https://github.com/alexcour/CAUSAL-PAIR-01/blob/02bcbbf17dfaade51171885578a228b16736d425/causal_fiber_01/CausalFiber01.lean#L29-L49; source SHA-256 bcff7eeabd153cd20f42ccd810dd20c074c9a899271ba5d29a4d6ed056b197ad; theorem image_reconstructible_iff_fiber_constant

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