pith. machine review for the scientific record. sign in

IndisputableMonolith.Foundation.OptionAEmpiricalReadiness

IndisputableMonolith/Foundation/OptionAEmpiricalReadiness.lean · 87 lines · 12 declarations

show as:
view math explainer →

open module explainer GitHub source

Explainer status: ready · generated 2026-05-16 08:17:31.953846+00:00

   1import Mathlib
   2import IndisputableMonolith.Foundation.OptionAEmpiricalPipeline
   3
   4/-!
   5# Option A Empirical Readiness
   6
   7Readiness gate for Option A empirical work. A combination is ready when it has
   8all four operational layers:
   9
  10* falsifier protocol,
  11* analysis action,
  12* deliverable artifact,
  13* unified pipeline record.
  14
  15Lean status: 0 sorry, 0 axiom.
  16-/
  17
  18namespace IndisputableMonolith
  19namespace Foundation
  20namespace OptionAEmpiricalReadiness
  21
  22open OptionAFalsifierRegistry
  23open OptionAEmpiricalProtocol
  24open OptionAEmpiricalSchedule
  25open OptionAEmpiricalActionPlan
  26open OptionAEmpiricalDeliverables
  27open OptionAEmpiricalPipeline
  28
  29/-- A combination is empirically ready when all operational records exist. -/
  30def EmpiricallyReady (c : CombinationID) : Prop :=
  31  ProtocolFalsifiable c ∧
  32    HasAnalysisAction c ∧
  33    HasDeliverable c ∧
  34    HasPipeline c
  35
  36theorem empiricallyReady_all (c : CombinationID) :
  37    EmpiricallyReady c := by
  38  exact ⟨protocolFalsifiable_all c, hasAnalysisAction_all c,
  39    hasDeliverable_all c, hasPipeline_all c⟩
  40
  41theorem scheduled_empiricallyReady
  42    {c : CombinationID} (_h : c ∈ firstPassSchedule) :
  43    EmpiricallyReady c :=
  44  empiricallyReady_all c
  45
  46theorem c3_ready : EmpiricallyReady .c3OncologyTensor :=
  47  empiricallyReady_all .c3OncologyTensor
  48
  49theorem c8_ready : EmpiricallyReady .c8MillerSpan :=
  50  empiricallyReady_all .c8MillerSpan
  51
  52theorem c5_ready : EmpiricallyReady .c5AttentionTensor :=
  53  empiricallyReady_all .c5AttentionTensor
  54
  55/-- The first-pass schedule is ready iff every scheduled combination is ready. -/
  56def FirstPassReady : Prop :=
  57  ∀ {c : CombinationID}, c ∈ firstPassSchedule → EmpiricallyReady c
  58
  59theorem firstPassReady : FirstPassReady := by
  60  intro c h
  61  exact scheduled_empiricallyReady h
  62
  63/-- All C1-C9 implemented combinations are ready at the metadata/protocol layer. -/
  64def AllImplementedReady : Prop :=
  65  ∀ c : CombinationID, EmpiricallyReady c
  66
  67theorem allImplementedReady : AllImplementedReady :=
  68  empiricallyReady_all
  69
  70structure EmpiricalReadinessCert where
  71  all_ready : AllImplementedReady
  72  first_pass_ready : FirstPassReady
  73  c3_ready : EmpiricallyReady .c3OncologyTensor
  74  c8_ready : EmpiricallyReady .c8MillerSpan
  75  c5_ready : EmpiricallyReady .c5AttentionTensor
  76
  77def empiricalReadinessCert : EmpiricalReadinessCert where
  78  all_ready := allImplementedReady
  79  first_pass_ready := firstPassReady
  80  c3_ready := c3_ready
  81  c8_ready := c8_ready
  82  c5_ready := c5_ready
  83
  84end OptionAEmpiricalReadiness
  85end Foundation
  86end IndisputableMonolith
  87

source mirrored from github.com/jonwashburn/shape-of-logic