Model vocabulary — The eight Lean forms and held-relation reading do not settle cost subadditivity
DefinitionAPFB06_subadditivity_worlds_VocabularyData, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.
The eight Lean forms and held-relation reading do not settle cost subadditivity. RelationWorld is subadditive. ResidueWorld has three protocols, three records, costs 1,1,3 and sharedCost -1; bills count kept records, but no protocol joins both singleton services for bill <=2. Boundaries: Only the stated encoded forms and two typed readings are satisfied; hold sentence and original occupant binding are absent. No full physical independence or necessity equivalence for the sufficient join clause; residual overhead is allowed by the paper/codebank.
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.
/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-13; not
gated, not reviewed, not released, not built on the build box)
name: APFB06_subadditivity_worlds
title: The eight declared forms and both readings of 2026-11-13 hold in one supplied world where family cost is subadditive and in another where it is not
inputs_revision: 2026-10-04.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the eight declared-input definition nodes, unchanged. RULING_joint_class_2026-11-13 and
RULING_held_relation_reading_2026-11-13 (the two readings). Def_APFPaper5_K1_SharedCost (seat 01WrrBvu).
Thm_APFB06_held_relation_worlds (the relation world). Supplement v9.28:1779-1781 (the residue kappa_int),
1805 and 7313 (it may be positive: coupling overhead, C4), 2426-2470 (additivity only under factorized
support). Codebank apf/delta_calculus.py: Delta = epsilon * (J - R), sign not fixed (note F2); world W1,
two anchors and one irreducibly joint term.
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
about the physical inputs.
first world (APFB06.RelationWorld, unchanged): (cost_subadditive) cost of S ∪ T is at most cost of S plus
cost of T, for all families. (join_holds) the join clause holds there.
second world (APFB06.ResidueWorld): raw states a, b, c with three different continuation relations. Two
distinctions: dA, true at a only; dB, true at a and b. Three records ra, rb, rj and three protocols: one
keeps ra and bills 1, one keeps rb and bills 1, one keeps ra, rb and rj and bills 3. No admitted protocol
keeps ra and rb alone. Capacity 3, floor 1. The alignment sits at a and carries both distinctions.
(eight_hold) all eight declared forms hold, B06 at the extensional joint class on the physical domain.
(alignments_hold_relation) every actual joint alignment holds a relation. (bill_eq_number_kept) each bill
is the number of records the protocol keeps. (cost_single_A, cost_single_B, cost_pair) the costs are 1, 1
and 3. (not_subadditive) the cost of the pair exceeds the sum of the two costs. (sharedCost_eq) the
shared cost of the two singletons is -1. (no_join) no protocol serves both for at most the two bills
together: the join clause of Thm_APFPaper1_familyCost_subadditive_of_join fails.
reading: subadditivity of family cost is independent of the eight declared forms as encoded, with B06 read
under both rulings. Bills that are sums over kept records do not give it either: what is missing is that
the admitted protocols are closed under running two of them side by side.
not_claimed: independence from the physical inputs as the author means them; that either world is a
physical context; anything about the hold sentence or the occupant binding, which are not typed here.
-/
import Definitions.Def_APFB06_held_relation_worlds_Vocabulary
import Theorems.Thm_APFB06_BridgeWorld_no_held_relation
import Theorems.Thm_APFB06_RelationWorld_servesAll
import Theorems.Thm_APFB06_RelationWorld_bill_pF
import Theorems.Thm_APFB06_RelationWorld_bill_ge_one
import Theorems.Thm_APFB06_RelationWorld_one_le_cost
import Theorems.Thm_APFB06_RelationWorld_cost_le_two
import Theorems.Thm_APFB06_RelationWorld_world_B06
import Theorems.Thm_APFB06_RelationWorld_eight_hold
import Theorems.Thm_APFB06_RelationWorld_alignment_holds_relation
import Theorems.Thm_APFB06_RelationWorld_alignments_hold_relation
import Definitions.Def_APFPaper5_K1_SharedCost
import Mathlib.Tactic.NormNum
set_option autoImplicit false
open APFPaper1.Source
/-! ### First world: the relation world is subadditive -/
namespace APFB06.RelationWorld
end APFB06.RelationWorld
/-! ### Second world: holding the pair needs a record neither member needs -/
namespace APFB06.ResidueWorld
inductive St
| a | b | c
deriving DecidableEq
/-- The processes: the protocol for dA, the protocol for dB, the protocol for both. -/
inductive Pr
| 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. State a admits every process, state b the pair's process only, state c
none. -/
def cont : St → Pr → Prop
| .a, _ => True
| .b, q => q = Pr.pab
| .c, _ => False
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 := Eq.mp (congrFun h Pr.pa) trivial
cases h'
have hac : cont St.a ≠ cont St.c := fun h =>
show False from Eq.mp (congrFun h Pr.pa) trivial
have hbc : cont St.b ≠ cont St.c := fun h =>
show False from Eq.mp (congrFun h Pr.pab) rfl
cases x <;> cases y
· rfl
· exact absurd h hab
· exact absurd h hac
· exact absurd h.symm hab
· rfl
· exact absurd h hbc
· exact absurd h.symm hac
· exact absurd h.symm hbc
· rfl
abbrev K : (g : Unit) → St → Pr → Prop := fun _ => cont
/-- True at a only. -/
def dA : St → Bool
| .a => true
| _ => false
/-- True at a and b. -/
def dB : St → Bool
| .c => false
| _ => true
/-- The distinction domain: dA and dB. -/
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 three processes. -/
def protocols : (g : Unit) → Set Pr := fun _ => Set.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. -/
def keeps : Pr → Rc → Prop
| .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
| .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}
/-- 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 : ℝ))
/-- The records each protocol keeps, as a finite set. -/
def kept : Pr → Finset Rc
| .pa => {Rc.ra}
| .pb => {Rc.rb}
| .pab => {Rc.ra, Rc.rb, Rc.rj}
end APFB06.ResidueWorld
Confirmed by the mission captain (proposal self-audit).