Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Model vocabulary — Joint record cost survives an empty protocol

Definition
APFB06_residue_world_with_a_do_nothing_protocol_Vocabulary

by FiniteUniverse · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencepullbacks-v46-2026-11

Data, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.

The supplied four-process residue world has bills 0, 1, 1, 3 and satisfies encoded EightHold and occupant predicates. A joint record makes the pair more costly than the sum of the singletons. Admissible configurations and actual-joint data are supplied, not physically identified.

Supplied data and hypotheses

  • Every parameter and hypothesis in the exact source declaration remains exposed; no author input is adopted.

Limits

This is conditional reference mathematics. The supplied model and its hypotheses are not adopted Foundation inputs, and this node does not establish K1, K3 or K4 closure.

Definition code
import Definitions.Def_APFPaper1_holding_nothing_costs_nothing_Vocabulary
import Theorems.Thm_APFPaper1_Source_familyCost_empty_eq_zero
import Theorems.Thm_APFPaper1_Source_sourceNeeds_empty_eq
import Theorems.Thm_APFPaper1_Source_isOccupantOf_empty
import Theorems.Thm_APFPaper1_Source_part_cost_eq_count_all
import Theorems.Thm_APFPaper1_Source_individual_floor_of_holding_nothing_free
import Theorems.Thm_APFPaper1_Source_nothing_is_the_one_minimum
import Theorems.Thm_APFPaper1_Source_isOccupantOf_of_available
import Theorems.Thm_APFB06_ResidueWorldR2_cost_empty
import Theorems.Thm_APFB06_ResidueWorldR2_not_holdingNothingFree
import Theorems.Thm_APFB06_ReadingsWorld_holdingNothingFree
import Theorems.Thm_APFB06_ReadingsWorld_fcost_empty
import Theorems.Thm_APFB06_ReadingsWorld_occupant_holds_with_parts_at_unit
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Linarith

set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1

namespace APFB06.ResidueNullWorld

inductive St
  | a | b | c | e
  deriving DecidableEq

/-- The processes: do nothing, the protocol for dA, the protocol for dB, the protocol for both. -/
inductive Pr
  | p0 | pa | pb | pab
  deriving DecidableEq

/-- The records: one for dA, one for dB, one that only the pair's protocol keeps. -/
inductive Rc
  | ra | rb | rj
  deriving DecidableEq

/-- The continuation relation. Every state admits doing nothing. Beyond that: state a admits every
process, state b the pair's process, state c nothing more, state e the process for dA. -/
def cont : St → Pr → Prop
  | .a, _ => True
  | .b, q => q = Pr.pab ∨ q = Pr.p0
  | .c, q => q = Pr.p0
  | .e, q => q = Pr.pa ∨ q = Pr.p0

theorem cont_inj (x y : St) (h : cont x = cont y) : x = y := by
  have hab : cont St.a ≠ cont St.b := fun h => by
    have h' : Pr.pa = Pr.pab ∨ Pr.pa = Pr.p0 := Eq.mp (congrFun h Pr.pa) trivial
    rcases h' with h' | h' <;> cases h'
  have hac : cont St.a ≠ cont St.c := fun h => by
    have h' : Pr.pa = Pr.p0 := Eq.mp (congrFun h Pr.pa) trivial
    cases h'
  have hbc : cont St.b ≠ cont St.c := fun h => by
    have h' : Pr.pab = Pr.p0 :=
      Eq.mp (congrFun h Pr.pab) (show Pr.pab = Pr.pab ∨ Pr.pab = Pr.p0 from Or.inl rfl)
    cases h'
  have hae : cont St.a ≠ cont St.e := fun h => by
    have h' : Pr.pab = Pr.pa ∨ Pr.pab = Pr.p0 := Eq.mp (congrFun h Pr.pab) trivial
    rcases h' with h' | h' <;> cases h'
  have hbe : cont St.b ≠ cont St.e := fun h => by
    have h' : Pr.pab = Pr.pa ∨ Pr.pab = Pr.p0 :=
      Eq.mp (congrFun h Pr.pab) (show Pr.pab = Pr.pab ∨ Pr.pab = Pr.p0 from Or.inl rfl)
    rcases h' with h' | h' <;> cases h'
  have hce : cont St.c ≠ cont St.e := fun h => by
    have h' : Pr.pa = Pr.p0 :=
      Eq.mpr (congrFun h Pr.pa) (show Pr.pa = Pr.pa ∨ Pr.pa = Pr.p0 from Or.inl rfl)
    cases h'
  cases x <;> cases y
  · rfl
  · exact absurd h hab
  · exact absurd h hac
  · exact absurd h hae
  · exact absurd h.symm hab
  · rfl
  · exact absurd h hbc
  · exact absurd h hbe
  · exact absurd h.symm hac
  · exact absurd h.symm hbc
  · rfl
  · exact absurd h hce
  · exact absurd h.symm hae
  · exact absurd h.symm hbe
  · exact absurd h.symm hce
  · rfl

abbrev K : (g : Unit) → St → Pr → Prop := fun _ => cont

/-- True at a and e. -/
def dA : St → Bool
  | .a => true
  | .e => true
  | _ => false

/-- True at a and b. -/
def dB : St → Bool
  | .a => true
  | .b => true
  | _ => false

abbrev Delta : (g : Unit) → (St → Bool) → Prop := fun _ d => d = dA ∨ d = dB

noncomputable instance instDecEqDomain (g : Unit) : DecidableEq {d : St → Bool // Delta g d} :=
  Classical.decEq _

abbrev Dist : Type := {d : St → Bool // Delta () d}

theorem hresp (g : Unit) (d : {d : St → Bool // Delta g d}) (x y : St) (h : K g x = K g y) :
    d.val x = d.val y := by
  rw [cont_inj x y h]

def dAd : Dist := ⟨dA, Or.inl rfl⟩
def dBd : Dist := ⟨dB, Or.inr rfl⟩






/-- The protocols: all four processes. -/
def protocols : (g : Unit) → Set Pr := fun _ => Set.univ

def pZ : {p : Pr // p ∈ protocols ()} := ⟨Pr.p0, Set.mem_univ _⟩
def pA : {p : Pr // p ∈ protocols ()} := ⟨Pr.pa, Set.mem_univ _⟩
def pB : {p : Pr // p ∈ protocols ()} := ⟨Pr.pb, Set.mem_univ _⟩
def pAB : {p : Pr // p ∈ protocols ()} := ⟨Pr.pab, Set.mem_univ _⟩

/-- What each protocol keeps. Doing nothing keeps nothing. -/
def keeps : Pr → Rc → Prop
  | .p0, _ => False
  | .pa, r => r = Rc.ra
  | .pb, r => r = Rc.rb
  | .pab, _ => True

/-- A distinction's record, read off its value at b: ra for dA, rb for dB. -/
def recOfB : Bool → Rc
  | false => Rc.ra
  | true => Rc.rb

def maint (g : Unit) (p : {p : Pr // p ∈ protocols g}) : Set Rc := {r | keeps p.val r}
def suff (g : Unit) (_ : {p : Pr // p ∈ protocols g}) (s : Set Rc)
    (d : {d : St → Bool // Delta g d}) : Prop := recOfB (d.val St.b) ∈ s
def uses (g : Unit) (_ : {p : Pr // p ∈ protocols g}) (d : {d : St → Bool // Delta g d})
    (s : Set Rc) : Prop := recOfB (d.val St.b) ∈ s
def wholeRes (g : Unit) (p : {p : Pr // p ∈ protocols g}) : Pr := p.val
def calibration (_ : Unit) : Pr → NNReal
  | .p0 => 0
  | .pa => 1
  | .pb => 1
  | .pab => 3
def C : Unit → NNReal := fun _ => 3



abbrev ServesFam (p : {p : Pr // p ∈ protocols ()}) (S : Finset Dist) : Prop :=
  ∀ d ∈ S, ∃ sigma : Set Rc, sigma ⊆ maint () p ∧ suff () p sigma d ∧ uses () p d sigma



noncomputable abbrev cost (S : Finset Dist) : ℝ :=
  familyCost (wholeRes ()) (calibration ()) (maint ()) (suff ()) (uses ()) S

abbrev billSet (S : Finset Dist) : Set ℝ :=
  {c : ℝ | ∃ p : {p : Pr // p ∈ protocols ()},
    ServesFam p S ∧ ((calibration () (wholeRes () p) : NNReal) : ℝ) = c}



/-! ### Bills -/















/-! ### Family costs -/



























/-! ### Holding nothing costs nothing -/







/-! ### The eight declared forms -/



/-- The held family: both distinctions. -/
noncomputable def heldD : Finset Dist := {dAd, dBd}

/-- The occupant's alignment: it sits at a and carries dA and dB. -/
noncomputable def alignP : APFB06.OriginalAlignment (K ())
    (APFB06.physicalDomain (K ()) (Delta ()) (hresp ())) where
  carrier := APFB01.physicalClass (K ()) St.a
  carried := heldD.map (APFB06.taskEquiv (K ()) (Delta ()) (hresp ())).symm.toEmbedding
  active := by
    intro t ht
    obtain ⟨d, hd, rfl⟩ := Finset.mem_map.mp ht
    rcases Finset.mem_insert.mp hd with rfl | hd'
    · rfl
    · rw [Finset.mem_singleton.mp hd']
      rfl

def actualJointP : Set (Sigma fun g =>
    APFB06.OriginalAlignment (K g) (APFB06.physicalDomain (K g) (Delta g) (hresp g))) :=
  {⟨(), alignP⟩}



/-- The eight declared forms on the supplied data. -/
def EightHold : Prop :=
  APF_B01_DeclaredInput (K ())
      (fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
      (fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
      (fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
      (fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x)) ∧
    APFB02.B02SourceMeaning (Context := Unit) (X := fun _ => St) (Q := fun _ => Pr)
      (P := fun g => {p : Pr // p ∈ protocols g}) (Record := fun _ => Rc)
      K Delta maint suff uses ∧
    APFB03.B03TaskCost (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
      (P := fun g => {p : Pr // p ∈ protocols g}) (R := fun _ => Pr) (Record := fun _ => Rc)
      wholeRes calibration maint suff uses ∧
    APFB04.B04FiniteCapacity (Context := Unit) (fun g => ((C g : NNReal) : ℝ)) ∧
    APFB05.MarginalFloor (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
      (P := fun g => {p : Pr // p ∈ protocols g}) (R := fun _ => Pr) (Record := fun _ => Rc)
      wholeRes calibration maint suff uses (fun _ _ => True) (fun g => ((C g : NNReal) : ℝ))
      (fun _ => (1 : ℝ)) ∧
    APFB06.AmendedB06_20260914 K
      (fun g => APFB06.physicalDomain (K g) (Delta g) (hresp g)) protocols
      (fun g => APFB06.extensionalJoint (maint g)
        (fun p s t => suff g p s (APFB06.taskEquiv (K g) (Delta g) (hresp g) t))
        (fun p t s => uses g p (APFB06.taskEquiv (K g) (Delta g) (hresp g) t) s))
      wholeRes calibration C actualJointP ∧
    APFB07a.A2Selection (Interface := Unit)
      (Configuration := fun _ => APFB01.PhysicalState (K ()))
      (fun _ s => s = APFB01.physicalClass (K ()) St.a) (fun _ _ => (1 : ℝ))
      (fun _ => APFB01.physicalClass (K ()) St.a) ∧
    APFB07b.BWUniqueMinimum (Interface := Unit)
      (Configuration := fun _ => APFB01.PhysicalState (K ()))
      (fun _ s => s = APFB01.physicalClass (K ()) St.a) (fun _ _ => (1 : ℝ))



/-! ### B02 in the proposed r2 form -/

/-- The state holding a given side of dA and a given side of dB. -/
def stateOf : Bool → Bool → St
  | true, true => St.a
  | false, true => St.b
  | false, false => St.c
  | true, false => St.e








/-! ### What families need -/











/-! ### The occupant -/





/-! ### The whole still costs more than its parts -/









/-! ### The empty family has one cheapest protocol -/



end APFB06.ResidueNullWorld
Source
Theorems.Thm_APFB06_residue_world_with_a_do_nothing_protocol; Pullbacks v46, SHA-256 8c27264bec6dc15ed5c77ea91b60d4147e26c110919095cdc588d0da8881c5a6. Theorems.Thm_APFB06_residue_world_with_a_do_nothing_protocol; pullbacks v46; SHA-256 8c27264bec6dc15ed5c77ea91b60d4147e26c110919095cdc588d0da8881c5a6

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