Model vocabulary — A supplied world whose bills are not record sums
DefinitionAPFPaper5_K1_bill_not_a_sum_world_Vocabularyapfapf-referencepullbacks-v39-2026-11
Data, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.
OverheadWorld has bills 1,1,3 on two records and satisfies the eight encoded forms, with B02's second clause separately proved. No record weights reproduce all bills. Its counted-party-score result uses the unruled leastBill candidate. This is not a physical consistency claim or a model of the later occupant statement.
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
/-
APF Foundation Ledger — theorem node DRAFT (Claude seat, session EthanBrooke-01WrrBvv, 2026-11-15; not
gated, not reviewed, not released, not built in the ledger repo)
name: APFPaper5_K1_bill_not_a_sum_world
title: A world where all eight declared forms hold and no costs of records make the bill a sum over the records kept; the pair is still a counted family and K1's typed conditions hold for its score
inputs_revision: 2026-11-14.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the author, 2026-11-15 06:55 HST: "1", in answer to this seat's "1. Derive the record ledger item by
item from the eight." And 07:00 HST: "Would like the goal here to be adding the work to our p2m
foundation… thinking it would be ideal to bolt on the Ks to that model? The goal is a P2m that takes us
from first principals to quantum and gauge form". Read as: state the K layer on the foundation's own
data. RULING_ledger_item_by_item_and_the_goal_2026-11-15.
Paper 1 Supplement v9.28:1964: the calibration map and its additivity are "physical model inputs, not
universal conclusions of the ledger formalism"; 2391-2399: the trigger conditions are not additional
physical laws; 2197-2221: resource loads form a preordered monoid and a calibration is monotone, with no
additivity asked. Codebank apf/core.py check_L_cost: ledger completeness (C1) is recorded there as a
postulate and is not executed.
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
about the physical inputs.
the world (APFB06.OverheadWorld): the residue world without its third record. Copied from
Thm_APFB06_subadditivity_worlds (APFB06.ResidueWorldR2, the block from its states to eight_hold) with one
change: the record type has ra and rb only. So the pair's protocol keeps exactly ra and rb and bills 3,
while the protocol keeping ra bills 1 and the protocol keeping rb bills 1.
theorems:
- (eight_hold, meets_B02_r2) all eight declared forms hold, B06 at the extensional joint class on the
physical domain, B02 with its second sentence.
- (keeps_iff_mem_kept, maint_eq_kept) what a protocol maintains is a finite set.
- (no_record_costs) no assignment of costs to the records, of either sign, makes every bill the sum of
the costs of the records kept.
- (pair_counted_first_typed, pair_is_counted_leastBill) the pair is a counted family, ra being dA's own
record and rb dB's, each with least bill at least 1.
- (world_meets_eight_without_a_book_and_counted_pair_meets_K1) the above together, with K1's typed
conditions for the pair's score.
reading: "a protocol's bill is the sum of the costs of the records it keeps" is independent of the eight
declared forms as encoded. Consistent: every earlier world of this seat. Not entailed: this world. This
closes guard 3 of pass 28 (MEMO_pullbacks_pass28: a world meeting all eight in which the bill is not a
sum was owed). K1's typed conditions for a counted family do not need the sentence.
not claimed: that this world is a physical context; independence for the physical inputs as the author
means them; that no reading of the eight gives additivity under further conditions (the Supplement's
factorized-support theorem does, under its own hypotheses). The least bill is NOT RULED. No lane. No claim
that the transfer is forced, that the carrier gap is closed or narrowed, or that Born is derived.
axioms: within propext, Classical.choice, Quot.sound. No sorry.
-/
import Theorems.Thm_APFPaper5_K1_sourceNeeds_mono
import Theorems.Thm_APFPaper5_K1_source_own_record_of_alone_not_rest
import Theorems.Thm_APFPaper5_K1_source_party_score_meets_K1
import Theorems.Thm_APFPaper5_K1_source_counted_family_meets_K1
import Theorems.Thm_APFPaper5_K1_leastBill_nonneg
import Theorems.Thm_APFPaper5_K1_leastBill_le_bill
import Theorems.Thm_APFPaper5_K1_le_leastBill
import Theorems.Thm_APFPaper5_K1_leastBill_pos_iff
import Theorems.Thm_APFPaper5_K1_source_counted_family_meets_K1_leastBill
import Theorems.Thm_APFPaper5_K1_familyNeeds_eq_sourceNeeds
import Theorems.Thm_APFPaper5_K1_cost_le_leastBill
import Theorems.Thm_APFPaper5_K1_leastBill_eq_cost_of_kept_alone
import Theorems.Thm_APFPaper5_K1_ledgerPartyScore_eq_source
import Theorems.Thm_APFPaper5_K1_counted_iff_sourceCounted
import Theorems.Thm_APFPaper5_K1_sourceCounted_leastBill_of_counted
import Theorems.Thm_APFPaper5_K1_PaidPair_source_counted_pair_meets_K1
import Definitions.Def_APFB06_subadditivity_worlds_Vocabulary_r2
import Theorems.Thm_APFB06_RelationWorldR2_cost_subadditive
import Theorems.Thm_APFB06_ResidueWorldR2_servesAll
import Theorems.Thm_APFB06_ResidueWorldR2_bill_pA
import Theorems.Thm_APFB06_ResidueWorldR2_bill_pB
import Theorems.Thm_APFB06_ResidueWorldR2_bill_pAB
import Theorems.Thm_APFB06_ResidueWorldR2_bill_ge_one
import Theorems.Thm_APFB06_ResidueWorldR2_bill_of_both
import Theorems.Thm_APFB06_ResidueWorldR2_servesA
import Theorems.Thm_APFB06_ResidueWorldR2_servesB
import Theorems.Thm_APFB06_ResidueWorldR2_keeps_ra_of_serves
import Theorems.Thm_APFB06_ResidueWorldR2_keeps_rb_of_serves
import Theorems.Thm_APFB06_ResidueWorldR2_exists_false_of_not_all_true
import Theorems.Thm_APFB06_ResidueWorldR2_exists_true_of_not_all_false
import Theorems.Thm_APFB06_ResidueWorldR2_floor_holds
import Theorems.Thm_APFB06_ResidueWorldR2_eight_hold
import Theorems.Thm_APFB06_ResidueWorldR2_dAd_b
import Theorems.Thm_APFB06_ResidueWorldR2_dBd_b
import Theorems.Thm_APFB06_ResidueWorldR2_alignment_holds_relation
import Theorems.Thm_APFB06_ResidueWorldR2_keeps_iff_mem_kept
import Theorems.Thm_APFB06_ResidueWorldR2_bill_eq_number_kept
import Theorems.Thm_APFB06_ResidueWorldR2_cost_pair
import Theorems.Thm_APFB06_ResidueWorldR2_not_subadditive
import Theorems.Thm_APFB06_ResidueWorldR2_sharedCost_eq
import Theorems.Thm_APFB06_ResidueWorldR2_no_join
import Definitions.Def_APF_B02_DeclaredInput_r2_proposed
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Linarith
set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1
/-! ### The overhead world: the residue world without its third record -/
namespace APFB06.OverheadWorld
inductive St
| a | b | c | e
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. There is no third record. -/
inductive Rc
| ra | rb
deriving DecidableEq
/-- The continuation relation. State a admits every process, state b the pair's process only, state c
none, state e the process for dA only. -/
def cont : St → Pr → Prop
| .a, _ => True
| .b, q => q = Pr.pab
| .c, _ => False
| .e, q => q = Pr.pa
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
have hae : cont St.a ≠ cont St.e := fun h => by
have h' : Pr.pab = Pr.pa := Eq.mp (congrFun h Pr.pab) trivial
cases h'
have hbe : cont St.b ≠ cont St.e := fun h => by
have h' : Pr.pab = Pr.pa := Eq.mp (congrFun h Pr.pab) rfl
cases h'
have hce : cont St.c ≠ cont St.e := fun h =>
show False from Eq.mpr (congrFun h Pr.pa) rfl
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
/-- 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 bill is not a sum over the records kept -/
instance instFintypeRc : Fintype Rc :=
⟨{Rc.ra, Rc.rb}, fun r => by cases r <;> simp⟩
/-- What each protocol keeps, as a finite set. -/
def kept : Pr → Finset Rc
| .pa => {Rc.ra}
| .pb => {Rc.rb}
| .pab => {Rc.ra, Rc.rb}
/-! ### B02 with its second sentence -/
/-- 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
/-! ### The pair is a counted family, and K1's typed conditions hold for its score -/
/-- The pair as an indexed family: dA at `false`, dB at `true`. -/
def pairD : Bool → Dist
| false => dAd
| true => dBd
end APFB06.OverheadWorld
Source
Theorems.Thm_APFPaper5_K1_bill_not_a_sum_world; Pullbacks v39, SHA-256 ae51bbf3ba9b0bba1fa565efd8d5ad49873a207e346981aaa63d1ab8918a71cb. Theorems.Thm_APFPaper5_K1_bill_not_a_sum_world; pullbacks v39; SHA-256 ae51bbf3ba9b0bba1fa565efd8d5ad49873a207e346981aaa63d1ab8918a71cb