Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Model vocabulary — Empty-protocol load countermodels

Definition
APFPaper1_Cont_load_worlds_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 spike and warm-up models gain an empty zero-cost protocol and exact occupancy with unit costs on designated holders. Encoded inputs hold, yet prefix restriction or subword heredity fails. Pricing holders does not give a sum law for every word; the models do not certify physical counterexamples.

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_APFPaper5_Worlds_TwoObjects
import Definitions.Def_APFB06_ExtensionalJoint
import Definitions.Def_APFPaper1_ContextualEquivalence
import Definitions.Def_APF_B02_DeclaredInput_r2_proposed
import Theorems.Thm_APFPaper1_Continuation_cont_prefix
import Theorems.Thm_APFPaper1_Continuation_contHereditary_iff_cont
import Theorems.Thm_APFPaper1_Continuation_prefix_closed_iff_hereditary
import Theorems.Thm_APFPaper1_Continuation_prefixMonotone_of_resource_mono
import Theorems.Thm_APFPaper1_Continuation_prefix_closed_of_subwordHeredity
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Definitions.Def_APFPaper1_Cont_sum_keep_worlds_Vocabulary
import Theorems.Thm_APFB06_BridgeWorld_sum_holds
import Theorems.Thm_APFB06_BridgeWorld_prefix_restriction_holds
import Theorems.Thm_APFB06_BridgeWorld_subword_heredity_holds
import Theorems.Thm_APFPaper1_LoadWorld_spike_no_sum_with_keep
import Theorems.Thm_APFPaper1_LoadWorld_warm_no_sum_with_keep_and_after
import Theorems.Thm_APFPaper1_Source_needed_subset_kept
import Theorems.Thm_APFPaper1_Source_card_needed_le_bill
import Theorems.Thm_APFPaper1_Source_card_needed_le_familyCost
import Theorems.Thm_APFPaper1_Source_familyCost_eq_card_of_available
import Theorems.Thm_APFPaper1_Source_join_of_available
import Definitions.Def_APFB06_worlds_against_the_occupant_statement_Vocabulary
import Theorems.Thm_APFPaper1_Source_not_holdingNothingFree_of_bill_pos
import Theorems.Thm_APFPaper1_Source_not_holdingNothingFree_of_keeps
import Theorems.Thm_APFPaper1_Source_not_inFull_of_not_free
import Theorems.Thm_APFB06_ReadingsWorld_meets_in_full
import Theorems.Thm_APFB06_MovingWorld_holdingNothingFree
import Theorems.Thm_APFB06_MovingWorld_fcost_empty
import Theorems.Thm_APFB06_MovingWorld_every_family_occupied
import Theorems.Thm_APFB06_MovingWorld_occupant_holds_with_parts_at_unit
import Theorems.Thm_APFB06_MovingWorld_meets_in_full
import Theorems.Thm_APFB06_SharedWorld_holdingNothingFree
import Theorems.Thm_APFB06_SharedWorld_fcost_empty
import Theorems.Thm_APFB06_SharedWorld_every_family_occupied
import Theorems.Thm_APFB06_SharedWorld_occupant_holds_with_parts_at_unit
import Theorems.Thm_APFB06_SharedWorld_meets_in_full
import Theorems.Thm_APFB06_ResidueNullWorld_meets_in_full
import Theorems.Thm_APFB06_BridgeWorld_not_holdingNothingFree
import Theorems.Thm_APFB06_BridgeWorld_fails_in_full
import Theorems.Thm_APFB06_RelationWorldR2_not_holdingNothingFree
import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_not_holdingNothingFree
import Theorems.Thm_APFB06_BusWorld_not_holdingNothingFree
import Theorems.Thm_APFB06_OverheadWorld_not_holdingNothingFree
import Theorems.Thm_APFB06_DiscountWorld_not_holdingNothingFree
import Theorems.Thm_APFPaper1_LoadWorld_not_holdingNothingFree
import Theorems.Thm_APFPaper5_Worlds_not_holdingNothingFree
import Theorems.Thm_APFB06_WorldsAudit_three_signs_among_worlds_meeting_the_statement
/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-14; not
 gated, not reviewed, not released, not built in the ledger repo)
name: APFPaper1_Cont_load_worlds
title: Two supplied worlds of the eight declared forms, with a monotone calibration and the identity continuation, in which prefix restriction fails, and in which it holds while contiguous-subword heredity fails
inputs_revision: 2026-11-14.1 (the eight declared forms as encoded, with B02 also in the builder seat's
 proposed form Def_APF_B02_DeclaredInput_r2_proposed, which is not a live node)
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: Paper 1 Supplement v9.28:1224-1234 (C1 identity, C3 prefix restriction, stated as closure laws of
 Cont), 1240 ("the combined load is the load of the concatenation, not the sum of the two loads"),
 2197-2214 (resource preorder; a calibration is a monotone valuation with value 0 at 0), 3301 (W-her:
 natural for fragment-monotone budgets, "falsifiable in principle by nonseparable load models, and
 therefore hypothesized, not derived"). Author ruling of 2026-11-12: whole-word budget.
 Def_APFPaper1_ContinuationWords, Thm_APFPaper1_Cont_prefix_restriction, Def_APFPaper1_ContextualEquivalence
 and Reference/Ref_APFPaper1_Cont_prefix_countermodel (seat 01WrrBvu; that model has one raw state and a
 calibration that is not monotone, so it is not a world of the eight). Thm_APFB06_bridge_independence_eight
 (the pattern of this world). Codebank: nothing on prefix restriction or load monotonicity of words.
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
 about the physical inputs.
the worlds (APFPaper1.LoadWorld, one for each of two load functions): one context; two raw states; two
 kinds of fragment, each running from the state `true` to itself and from nowhere else; the continuation
 class is the whole-word class Cont. Loads are natural numbers in their usual order, the calibration is the
 inclusion into the nonnegative reals, capacity 2, floor 1. The one protocol is the word of two fragments
 of the first kind, which bills 1. One distinction, the identity on the two states.
 Spike load (`false`): the empty word loads 0, a one-fragment word 3, every longer word 1.
 Warm-up load (`true`): the empty word loads 0, a word beginning with a fragment of the second kind 3,
 every other word 1.
statement: in both worlds (eight_hold) all eight declared forms hold; (meets_B02_r2) so does B02 with the
 sentence of revision 2026-11-14.1; (identity_holds) the empty word is a continuation from every state;
 (calibration_monotone, calibration_zero) the calibration is monotone and is 0 at 0.
 Spike world: (spike_prefix_restriction_fails) C3 fails; (spike_resource_not_monotone) an initial segment
 loads more than the whole word; (spike_not_prefixMonotone, spike_whole_ne_hereditary,
 spike_subword_heredity_fails) the consequences.
 Warm-up world: (warm_prefixMonotone, warm_prefix_restriction_holds) loads are prefix-monotone and C3
 holds; (warm_subword_heredity_fails) W-her fails: a final segment of a continuation is over budget alone.
reading: C3 does not follow from the eight declared forms with the whole-word budget, even with the
 Supplement's monotone calibration and with C1. What is missing is that an initial segment never loads more
 than the whole. W-her does not follow either, and it is strictly stronger than C3.
not_claimed: independence from the physical inputs as the author means them; that either load is physical;
 that C3 or W-her is false of the physical continuation class; anything about C2 or C4.
-/












set_option autoImplicit false
open APFPaper1.Continuation

namespace APFPaper1.LoadWorld












theorem load_nil (m : Bool) : load m [] = 0 := by cases m <;> rfl



























































/-! ### B02 with the sentence of revision 2026-11-14.1 -/





/-! ### What both worlds keep of the Supplement's vocabulary -/









/-! ### The spike world: prefix restriction fails -/















/-! ### The warm-up world: prefix restriction holds, subword heredity fails -/











end APFPaper1.LoadWorld











































set_option autoImplicit false
open APFPaper1.Continuation APFPaper1.Source

namespace APFPaper1.LoadNullWorld

/-! ### Protocols and records -/

/-- The protocols: the empty word and the two-fragment word. -/
def protocols : (g : Unit) → Set (WordFrom LoadWorld.Frag g) :=
  fun g => {nullWord g, LoadWorld.w2 g}

abbrev Pr (g : Unit) : Type := {p : WordFrom LoadWorld.Frag g // p ∈ protocols g}

/-- The do-nothing protocol. -/
def protoNull : Pr () := ⟨nullWord (), Or.inl rfl⟩

/-- The two-fragment protocol. -/
def protoTwo : Pr () := ⟨LoadWorld.w2 (), Or.inr rfl⟩

/-- The records a word keeps: none for the empty word, the one record for any other. -/
def keptW : {g h : Unit} → Word LoadWorld.Frag g h → Finset Unit
  | _, _, Word.nil _ => ∅
  | _, _, Word.cons _ _ => {()}

def kept (g : Unit) (w : WordFrom LoadWorld.Frag g) : Finset Unit := keptW w.2
def keptP (p : Pr ()) : Finset Unit := kept () p.val




/-- B02's distinction domain: the identity is the one distinction. -/
abbrev Delta : (g : Unit) → (LoadWorld.Raw g → Bool) → Prop := fun _ d => d = id

def idDist : {d : LoadWorld.Raw () → Bool // Delta () d} := ⟨id, rfl⟩

def maint (g : Unit) (p : {p : WordFrom LoadWorld.Frag g // p ∈ protocols g}) : Set Unit :=
  ↑(kept g p.val)

/-- The record law: a set of records suffices for the mark exactly when it contains the record. -/
def suff (g : Unit) (_ : {p : WordFrom LoadWorld.Frag g // p ∈ protocols g}) (s : Set Unit)
    (_ : LoadWorld.Dist) : Prop := () ∈ s
def uses (g : Unit) (_ : {p : WordFrom LoadWorld.Frag g // p ∈ protocols g}) (_ : LoadWorld.Dist)
    (_ : Set Unit) : Prop := True
def wholeRes (m : Bool) (g : Unit) (p : {p : WordFrom LoadWorld.Frag g // p ∈ protocols g}) :
    LoadWorld.Res g := LoadWorld.resource m g p.val

/-- The records a distinction needs: the one record. -/
def fam (_ : LoadWorld.Dist) : Finset Unit := {()}





/-- The same law for B06's tasks. -/
def suffT (m : Bool) (g : Unit) (_ : {p // p ∈ protocols g}) (s : Set Unit)
    (_ : APFB06.Task (LoadWorld.K m g) (LoadWorld.D m g)) : Prop := () ∈ s
def usesT (m : Bool) (g : Unit) (_ : {p // p ∈ protocols g})
    (_ : APFB06.Task (LoadWorld.K m g) (LoadWorld.D m g)) (_ : Set Unit) : Prop := True

/-- The joint class: the extensional one on that record data. -/
def J (m : Bool) : (g : Unit) → Finset (APFB06.Task (LoadWorld.K m g) (LoadWorld.D m g)) →
    Set {p // p ∈ protocols g} :=
  fun g => APFB06.extensionalJoint (maint g) (suffT m g) (usesT m g)





/-! ### Cost is the number of records needed -/













/-- The family cost of the ledger on this world. -/
noncomputable abbrev fcost (m : Bool) (S : Finset LoadWorld.Dist) : ℝ :=
  familyCost (wholeRes m ()) (LoadWorld.calibration ()) (maint ()) (suff ()) (uses ()) S









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

/-- The eight declared forms on the supplied data. -/
def EightHold (m : Bool) : Prop :=
  APF_B01_DeclaredInput (LoadWorld.K m ())
      (fun (f : APFB01.PhysicalState (LoadWorld.K m ()) → Prop) (x : Bool) =>
        f (APFB01.physicalClass (LoadWorld.K m ()) x))
      (fun (f : APFB01.PhysicalState (LoadWorld.K m ()) → Prop) (x : Bool) =>
        f (APFB01.physicalClass (LoadWorld.K m ()) x))
      (fun (f : APFB01.PhysicalState (LoadWorld.K m ()) → Prop) (x : Bool) =>
        f (APFB01.physicalClass (LoadWorld.K m ()) x))
      (fun (f : APFB01.PhysicalState (LoadWorld.K m ()) → Prop) (x : Bool) =>
        f (APFB01.physicalClass (LoadWorld.K m ()) x)) ∧
    APFB02.B02SourceMeaning (Context := Unit) (X := fun _ => Bool)
      (Q := fun g => WordFrom LoadWorld.Frag g)
      (P := fun g => {p : WordFrom LoadWorld.Frag g // p ∈ protocols g}) (Record := fun _ => Unit)
      (LoadWorld.K m) Delta maint suff uses ∧
    APFB03.B03TaskCost (Context := Unit) (D := fun _ => LoadWorld.Dist)
      (P := fun g => {p : WordFrom LoadWorld.Frag g // p ∈ protocols g})
      (R := fun _ => ℕ) (Record := fun _ => Unit) (wholeRes m) LoadWorld.calibration maint suff
      uses ∧
    APFB04.B04FiniteCapacity (Context := Unit) (fun _ => (2 : ℝ)) ∧
    APFB05.MarginalFloor (Context := Unit) (D := fun _ => LoadWorld.Dist)
      (P := fun g => {p : WordFrom LoadWorld.Frag g // p ∈ protocols g})
      (R := fun _ => ℕ) (Record := fun _ => Unit) (wholeRes m) LoadWorld.calibration maint suff uses
      (fun _ _ => True) (fun _ => 2) (fun _ => 1) ∧
    APFB06.AmendedB06_20260914 (LoadWorld.K m) (LoadWorld.D m) protocols (J m)
      (fun g p => LoadWorld.resource m g p.val) LoadWorld.calibration LoadWorld.C
      (LoadWorld.actualJoint m) ∧
    APFB07a.A2Selection (Interface := Unit)
      (Configuration := fun _ => APFB01.PhysicalState (LoadWorld.K m ()))
      (fun _ s => s = APFB01.physicalClass (LoadWorld.K m ()) true) (fun _ _ => (1 : ℝ))
      (fun _ => APFB01.physicalClass (LoadWorld.K m ()) true) ∧
    APFB07b.BWUniqueMinimum (Interface := Unit)
      (Configuration := fun _ => APFB01.PhysicalState (LoadWorld.K m ()))
      (fun _ s => s = APFB01.physicalClass (LoadWorld.K m ()) true) (fun _ _ => (1 : ℝ))







/-! ### The occupant statement in full -/









/-! ### What still fails -/

/-- The cost of the one record. -/
def costOne : Unit → NNReal := fun _ => 1











end APFPaper1.LoadNullWorld
Source
Theorems.Thm_APFPaper1_Cont_load_worlds_with_a_do_nothing_protocol; Pullbacks v46, SHA-256 df28cf76239361f5249db0173b503d4bae5a2d025808b7e17d62daaa8f68843f. Theorems.Thm_APFPaper1_Cont_load_worlds_with_a_do_nothing_protocol; pullbacks v46; SHA-256 df28cf76239361f5249db0173b503d4bae5a2d025808b7e17d62daaa8f68843f

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