Model vocabulary — A counted pair in the supplied residue world
DefinitionAPFPaper5_K1_residue_world_counted_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.
The fixed supplied world satisfies the eight encoded forms and B02's second clause, and has a SourceCounted pair with a joint record. The displayed K1 algebra uses unruled least bills 1,1,3 and identity exchange. This is not physical consistency, full Paper 5 K1, 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
import Definitions.Def_APFB06_held_relation_worlds_Vocabulary_r2
import Theorems.Thm_APFB06_BridgeWorld_no_held_relation_r2
import Theorems.Thm_APFB06_RelationWorldR2_servesAll
import Theorems.Thm_APFB06_RelationWorldR2_bill_pF
import Theorems.Thm_APFB06_RelationWorldR2_bill_ge_one
import Theorems.Thm_APFB06_RelationWorldR2_one_le_cost
import Theorems.Thm_APFB06_RelationWorldR2_cost_le_two
import Theorems.Thm_APFB06_RelationWorldR2_world_B06
import Theorems.Thm_APFB06_RelationWorldR2_eight_hold
import Theorems.Thm_APFB06_RelationWorldR2_alignment_holds_relation
import Theorems.Thm_APFB06_RelationWorldR2_alignments_hold_relation
import Definitions.Def_APFPaper5_K1_SharedCost
import Mathlib.Tactic.NormNum
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_APFB06_worlds_meet_B02_r2_Vocabulary
import Theorems.Thm_APFB06_BridgeWorld_every_combination_held
import Theorems.Thm_APFB06_BridgeWorld_meets_B02_r2
import Theorems.Thm_APFB06_RelationWorldR2_every_combination_held
import Theorems.Thm_APFB06_RelationWorldR2_meets_B02_r2
import Theorems.Thm_APFB06_ResidueWorldR2_every_combination_held
import Theorems.Thm_APFB06_ResidueWorldR2_meets_B02_r2
import Theorems.Thm_APFB06_BusWorld_every_combination_held
import Theorems.Thm_APFB06_BusWorld_meets_B02_r2
import Theorems.Thm_APFB06_BusWorld_relation_free_over_the_pair
/-
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 for the eight declared forms as encoded. Revised 2026-11-14 (v2) so that the
second world also meets the sentence added to B02 at revision 2026-11-14.1: see Thm_APFB06_worlds_meet_B02_r2.
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.RelationWorldR2, 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.ResidueWorldR2): raw states a, b, c, e with four different continuation relations. Two
distinctions: dA, true at a and e; dB, true at a and b. (v1 had no state e, so no state held dA without
dB; v2 adds it and changes nothing else.) 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.
-/
set_option autoImplicit false
open APFPaper1.Source
/-! ### First world: the relation world is subadditive -/
namespace APFB06.RelationWorldR2
end APFB06.RelationWorldR2
/-! ### Second world: holding the pair needs a record neither member needs -/
namespace APFB06.ResidueWorldR2
theorem cost_eq (S : Finset Dist) : cost S = sInf (billSet S) := rfl
theorem billSet_bdd (S : Finset Dist) : BddBelow (billSet S) :=
⟨0, by rintro c ⟨p, _, rfl⟩; exact NNReal.coe_nonneg _⟩
theorem cost_le_three (S : Finset Dist) : cost S ≤ 3 := by
rw [cost_eq]
exact csInf_le (billSet_bdd S) ⟨pAB, servesAll S, bill_pAB⟩
theorem cost_le_one_of_allA (S : Finset Dist) (h : ∀ d ∈ S, d.val St.b = false) : cost S ≤ 1 := by
rw [cost_eq]
exact csInf_le (billSet_bdd S) ⟨pA, servesA S h, bill_pA⟩
theorem cost_le_one_of_allB (S : Finset Dist) (h : ∀ d ∈ S, d.val St.b = true) : cost S ≤ 1 := by
rw [cost_eq]
exact csInf_le (billSet_bdd S) ⟨pB, servesB S h, bill_pB⟩
end APFB06.ResidueWorldR2
/-
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_residue_world_counted
title: In the residue world, where all eight declared forms hold, the pair is a counted family with a joint record 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.
The world: Thm_APFB06_subadditivity_worlds (APFB06.ResidueWorldR2, this seat, 2026-11-13) and
Thm_APFB06_worlds_meet_B02_r2 (B02 with its second sentence). Nothing in the world is changed.
consumes_inputs: none as hypotheses. Declared forms are PROVED of supplied data, which certifies nothing
about the physical inputs.
the world, in short: two distinctions dA and dB; three records ra, rb, rj; one protocol keeps ra and bills
1, one keeps rb and bills 1, one keeps all three and bills 3. Capacity 3, floor 1.
theorems:
- (ra_needed, rb_needed, ra_not_needed, rb_not_needed, rj_needed, rj_not_needed_allA, rj_not_needed_allB)
what families need.
- (novel_A_over_allB, novel_B_over_allA, pair_counted_first_typed) the pair is within capacity and each
member is support-novel over the other.
- (pair_has_own_paid_record, pair_is_counted) the pair is a counted family, as ruled, for any cost of
records under which ra and rb cost something.
- (leastBill_ra, leastBill_rb, leastBill_rj) the least bills are 1, 1 and 3. The least bill of rj is the
whole bill of the only protocol that keeps it; counting records, as the bills of this world do
(bill_eq_number_kept), rj would cost 1.
- (pair_is_counted_leastBill) counted with each record costing its least bill.
- (rj_is_joint, both_party_to_rj) rj is a joint record and both members are party to it.
- (world_meets_eight_and_counted_pair_meets_K1) all eight declared forms hold, B02 with its second
sentence; the pair is counted; K1's typed conditions hold for its score with least bills.
what this closes: the item owed since pass 42, a world meeting the eight with a counted family and a joint
record. Before this pass K1's statement needed a record ledger, and this world is not typed as one.
not claimed: that this world is a physical context; independence or consistency for the physical inputs as
the author means them; K1 as Paper 5 states it (the role exchange is the identity). 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.
-/
set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1
namespace APFB06.ResidueWorldR2
instance instFintypeRc : Fintype Rc :=
⟨{Rc.ra, Rc.rb, Rc.rj}, fun r => by cases r <;> simp⟩
/-- The pair as an indexed family: dA at `false`, dB at `true`. -/
def pairD : Bool → Dist
| false => dAd
| true => dBd
/-! ### What families need -/
/-! ### Support novelty -/
/-! ### The pair -/
end APFB06.ResidueWorldR2
Source
Theorems.Thm_APFPaper5_K1_residue_world_counted; Pullbacks v39, SHA-256 c4d724a3d255a3a30759f73f0d8a5504572e20d4658670b8376c5092d335ebee. Theorems.Thm_APFPaper5_K1_residue_world_counted; pullbacks v39; SHA-256 c4d724a3d255a3a30759f73f0d8a5504572e20d4658670b8376c5092d335ebee