Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Model vocabulary — Supplied load worlds separate prefix and subword heredity

Definition
APFPaper1_Cont_load_worlds_Vocabulary

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

apfapf-referencesib-v58-2026-11

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

Two explicit one-context worlds satisfy the eight encoded predicates and revised B02, with monotone zero-preserving natural-number calibration and C1. The spike world violates C3; the warm-up world satisfies C3 but violates contiguous-subword heredity. A supplied one-context model of the declared predicates, not an instance certified as the original physical inputs. B01 facts are chosen quotient pullbacks; the B02 domain contains only identity; B06 uses a supplied extensional joint class with trivial sufficiency/use data; A2/BW use singleton admissibility and constant price. The marginal-floor implication is vacuous because support novelty fails. No physical independence or impossibility claim follows. This isolates formal load conditions only. Prefix monotonicity is sufficient for C3, not necessary; cross-context capacity, C2 and C4 are not settled.

Supplied data and hypotheses

  • A supplied one-context model of the declared predicates, not an instance certified as the original physical inputs. B01 facts are chosen quotient pullbacks; the B02 domain contains only identity; B06 uses a supplied extensional joint class with trivial sufficiency/use data; A2/BW use singleton admissibility and constant price. The marginal-floor implication is vacuous because support novelty fails. No physical independence or impossibility claim follows. This isolates formal load conditions only. Prefix monotonicity is sufficient for C3, not necessary; cross-context capacity, C2 and C4 are not settled.

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
/-
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.
-/
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

set_option autoImplicit false
open APFPaper1.Continuation

namespace APFPaper1.LoadWorld

abbrev Frag : Unit → Unit → Type := fun _ _ => Bool
abbrev Raw : Unit → Type := fun _ => Bool
abbrev Res : Unit → Type := fun _ => ℕ
abbrev Dist : Type := APFPaper5.Worlds.Dist

/-- Every fragment runs from the state `true` to the state `true`, and from nowhere else. -/
def step : (g h : Unit) → Frag g h → Raw g → Raw h → Prop := fun _ _ _ x y => x = true ∧ y = true

/-- The fragments of a word, in execution order. -/
def labels : {g h : Unit} → Word Frag g h → List Bool
  | _, _, Word.nil _ => []
  | _, _, Word.cons f w => f :: labels w

/-- The two loads. `false` is the spike load: a one-fragment word loads 3, a longer one 1. `true` is the
warm-up load: a word beginning with a fragment of the second kind loads 3, any other nonempty word 1. -/
def load : Bool → List Bool → ℕ
  | false, [] => 0
  | false, [_] => 3
  | false, _ :: _ :: _ => 1
  | true, [] => 0
  | true, false :: _ => 3
  | true, true :: _ => 1


theorem load_two (m : Bool) : load m [true, true] = 1 := by cases m <;> rfl

def resource (m : Bool) : (g : Unit) → WordFrom Frag g → Res g := fun _ w => load m (labels w.2)
def calibration : (g : Unit) → Res g → NNReal := fun _ n => ((n : ℕ) : NNReal)
def C : Unit → NNReal := fun _ => 2

abbrev K (m : Bool) : (g : Unit) → Raw g → WordFrom Frag g → Prop :=
  Cont step (resource m) calibration C

/-- The word of one fragment of the first kind. -/
def w1 (g : Unit) : WordFrom Frag g := ⟨g, Word.cons (g := g) (h := g) (k := g) true (Word.nil g)⟩

/-- The word of two fragments of the first kind. -/
def w2 (g : Unit) : WordFrom Frag g :=
  ⟨g, Word.cons (g := g) (h := g) (k := g) true
    (Word.cons (g := g) (h := g) (k := g) true (Word.nil g))⟩

theorem runs_from_true : {g h : Unit} → (w : Word Frag g h) → Executes step w true true
  | _, _, Word.nil _ => rfl
  | _, _, Word.cons _ w => ⟨true, ⟨rfl, rfl⟩, runs_from_true w⟩

theorem no_run_from_false {g h k : Unit} (f : Frag g h) (w : Word Frag h k) (y : Raw k) :
    ¬ Executes step (Word.cons f w) false y := by
  rintro ⟨_, ⟨hx, _⟩, _⟩
  exact Bool.noConfusion hx

theorem bill_w2 (m : Bool) : calibration () (resource m () (w2 ())) = 1 := by
  show ((load m [true, true] : ℕ) : NNReal) = 1
  rw [load_two]
  exact Nat.cast_one

theorem w2_in (m : Bool) : K m () true (w2 ()) :=
  ⟨⟨true, runs_from_true _⟩, by rw [bill_w2]; exact one_le_two⟩

theorem profile_ne (m : Bool) : K m () true ≠ K m () false := by
  intro h
  have h2 : K m () false (w2 ()) := Eq.mp (congrFun h (w2 ())) (w2_in m)
  obtain ⟨⟨y, hy⟩, _⟩ := h2
  exact no_run_from_false _ _ y hy

theorem profile_inj (m : Bool) (a b : Bool) (h : K m () a = K m () b) : a = b := by
  cases a <;> cases b
  · rfl
  · exact absurd h.symm (profile_ne m)
  · exact absurd h (profile_ne m)
  · rfl

/-- The mark as a distinction on the B01 quotient. -/
def markD (m : Bool) : APFB01.PhysicalState (K m ()) → Bool :=
  Quot.lift (fun x : Bool => x) (profile_inj m)

def D (m : Bool) : (g : Unit) → Set (APFB01.PhysicalState (K m g) → Bool) := fun _ => Set.univ

def markTask (m : Bool) : APFB06.Task (K m ()) (D m ()) := ⟨markD m, Set.mem_univ _⟩

def align (m : Bool) : APFB06.OriginalAlignment (K m ()) (D m ()) where
  carrier := APFB01.physicalClass (K m ()) true
  carried := {markTask m}
  active := by
    intro d hd
    rw [Finset.mem_singleton] at hd
    subst hd
    rfl

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

def proto0 : {p // p ∈ protocols ()} := ⟨w2 (), rfl⟩

def maint (g : Unit) (_ : {p // p ∈ protocols g}) : Set Unit := Set.univ

def suffT (m : Bool) (g : Unit) (_ : {p // p ∈ protocols g}) (_ : Set Unit)
    (_ : APFB06.Task (K m g) (D m g)) : Prop := True
def usesT (m : Bool) (g : Unit) (_ : {p // p ∈ protocols g}) (_ : APFB06.Task (K m g) (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 (K m g) (D m g)) → Set {p // p ∈ protocols g} :=
  fun g => APFB06.extensionalJoint (maint g) (suffT m g) (usesT m g)



def actualJoint (m : Bool) : Set (Sigma fun g => APFB06.OriginalAlignment (K m g) (D m g)) :=
  {⟨(), align m⟩}

def wholeRes (m : Bool) (g : Unit) (p : {p // p ∈ protocols g}) : Res g := resource m g p.val
def suff (g : Unit) (_ : {p // p ∈ protocols g}) (_ : Set Unit) (_ : Dist) : Prop := True
def uses (g : Unit) (_ : {p // p ∈ protocols g}) (_ : Dist) (_ : Set Unit) : Prop := True

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







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





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







/-- A word is admissible when it is a continuation from some state. -/
def Adm (m : Bool) : (g h : Unit) → Word Frag g h → Prop :=
  fun g h M => ∃ x : Raw g, K m g x ⟨h, M⟩

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















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











end APFPaper1.LoadWorld

Source
Theorems/Thm_APFPaper1_Cont_load_worlds.lean; Sib v58 / pullbacks v9, SHA-256 f86ce45cc90917ffe3a1e386727215b9ee841958012f163435e6314f8247f04c. C:\Users\brook\My Drive\__APF Library\Papers\Paper 01 - The Enforceability of Distinction\Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex:1224-1241 (C1/C3 and whole concatenation load); C:\Users\brook\My Drive\__APF Library\Papers\Paper 01 - The Enforceability of Distinction\Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex:2197-2216 (resource order and calibration); C:\Users\brook\My Drive\__APF Library\Papers\Paper 01 - The Enforceability of Distinction\Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex:2889-2891 (empty-family/empty-protocol convention); C:\Users\brook\My Drive\__APF Library\Papers\Paper 01 - The Enforceability of Distinction\Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex:3284-3303 (W-her is separately hypothesized); C:\Users\brook\My Drive\__APF Library\Artifacts_2026-11-14_session\astra\sib_v58_publication\frozen\pullbacks\Notes\RULING_calls_2026-11-14.md; C:\Users\brook\My Drive\__APF Library\Artifacts_2026-11-14_session\astra\sib_v58_publication\frozen\pullbacks\Notes\CALLS_for_the_author_2026-11-14.md; C:\Users\brook\My Drive\__APF Library\Papers\Paper 00 - What Physics Permits\Old\Paper_0_What_Physics_Permits_v6.2.56.tex:3454-3515 (original A2 cost sum and original admissible domain)
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

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