Model vocabulary — Unequal record costs with exact occupancy
DefinitionAPFB06_unequal_record_costs_world_Vocabularyapfapf-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 residue variant has record costs 1, 2, 1, protocol bills 1, 2, 4, encoded EightHold, and A2/BW at the explicitly stated protocol binding. Exact occupancy with parts does not force unit record costs. This model lacks a free empty protocol and does not satisfy the full 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_APFPaper1_FamilyCost
import Definitions.Def_APF_B05_DeclaredInput_r2
import Theorems.Thm_APFB05_support_novel_chain_capacity_bound
import Mathlib.Data.NNReal.Basic
import Mathlib.Tactic.Linarith
import Definitions.Def_APFB06_count_worlds_Vocabulary
import Theorems.Thm_APFB06_ResidueWorldR2_bill_counts_kept
import Theorems.Thm_APFB06_ResidueWorldR2_maint_eq_kept
import Theorems.Thm_APFB06_ResidueWorldR2_serving_needs_own_record
import Theorems.Thm_APFB06_ResidueWorldR2_needed_pair_card
import Theorems.Thm_APFB06_ResidueWorldR2_cost_exceeds_count
import Theorems.Thm_APFB06_ResidueWorldR2_not_available
import Theorems.Thm_APFB07a_realized_keeps_needed
import Theorems.Thm_APFB07a_realized_keeps_exactly_needed
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.SplitIfs
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
import Definitions.Def_APFPaper1_occupant_and_its_parts_Vocabulary
import Theorems.Thm_APFPaper1_Source_part_cost_eq_sum
import Theorems.Thm_APFPaper1_Source_occupantHoldsWithParts_of_everyFamilyOccupied
import Theorems.Thm_APFB06_ResidueWorldR2_occupant_holds_pair_with_parts
import Theorems.Thm_APFB06_OverheadWorld_no_occupant_holds_pair_with_parts
import Theorems.Thm_APFB06_DiscountWorld_no_occupant_holds_pair_with_parts
import Definitions.Def_APFB06_A2_keeps_unneeded_world_Vocabulary
import Theorems.Thm_APFB06_ResidueWorldR2_A2_at_protocol_binding
import Theorems.Thm_APFB06_ResidueWorldR2_realized_pair
import Theorems.Thm_APFB06_ResidueWorldR2_realized_pair_keeps_unneeded
/-
APF Foundation Ledger — theorem node. DRAFT for author and cold review. Not gated, not released, not uploaded.
name: APFB05.overfull_chain_not_admissible
title: A family built by more genuinely new tested distinctions than the capacity can pay for is not admissible, and a context with less than one floor of spare capacity cannot take one more
inputs_revision: 2026-10-04.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: Paper 1 Supplement v9.28:1781 (ledger admissibility), 1820-1824 (marginal floor and support novelty),
2625 (support novelty, formal). The consumed nodes cite the same passages by their v9.27 line numbers
(1763-1782, 1807-1818, 2615-2617). For the reading as a statement about classical record models: v9.28:3724,
3737 (the defender's admissible record space and charging clause), 6952.
consumes: B05 (encoding MarginalFloor, r2, with its tested guard). B04 enters only as the capacity C in
familyAdmissible. Uses the uploaded node APFB05.support_novel_chain_capacity_bound.
statement:
(1) familyAdmissible is inherited by subfamilies.
(2) If S n is built from S 0 by n tested support-novel insertions and C < n * epsilon, then S n is not admissible.
(3) Then no admissible family contains S n.
(4) If S is admissible, d is tested and support-novel over S, and C - familyCost S < epsilon, then insert d S is
not admissible.
no new definition: every statement is in the existing FamilyCost and B05 vocabulary.
what it does not say: nothing about defenders, Sep, IJC or nonclassicality. Reading (3) or (4) as "no classical
record model exists" needs a definition tying a defender's record family to familyAdmissible. That definition is
not on the ledger and is not supplied here.
-/
set_option autoImplicit false
open Classical
open APFPaper1.Source
namespace APFB05
/-- (1) Admissibility passes to subfamilies: the same protocol serves the subfamily, and the infimal bill of a
subfamily is at most that of the family. Ordinary mathematics on source data. -/
theorem familyAdmissible_of_subset {D P R Record : Type*}
(wholeResource : P → R) (calibration : R → NNReal)
(maintained : P → Set Record) (sufficient : P → Set Record → D → Prop)
(usesToRealize : P → D → Set Record → Prop) {C : ℝ} {S T : Finset D} (hST : S ⊆ T)
(hT : familyAdmissible wholeResource calibration maintained sufficient usesToRealize C T) :
familyAdmissible wholeResource calibration maintained sufficient usesToRealize C S := by
obtain ⟨⟨p, hp⟩, hcost⟩ := hT
refine ⟨⟨p, fun d hd => hp d (hST hd)⟩, le_trans ?_ hcost⟩
unfold familyCost
apply csInf_le_csInf
· refine ⟨0, fun c hc => ?_⟩
obtain ⟨q, _, rfl⟩ := hc
exact NNReal.coe_nonneg _
· exact ⟨_, p, hp, rfl⟩
· rintro c ⟨q, hq, rfl⟩
exact ⟨q, fun d hd => hq d (hST hd), rfl⟩
end APFB05
/-
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: APFB06_A2_keeps_unneeded_world
title: In the residue world A2 holds at the protocol binding and the protocol it selects for the pair keeps a record the pair does not need
inputs_revision: 2026-10-04.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: Thm_APFB06_subadditivity_worlds and Thm_APFB06_count_worlds (the residue world).
Def_APFB07a_ProtocolBinding (seat 01WrrBvu) and RULING_A2_protocol_binding_2026-11-13.
Thm_APFB07a_realized_keeps_needed (what the selected protocol keeps under the availability clause).
consumes_inputs: none as hypotheses. A2's declared form is PROVED of supplied data at the protocol
binding, which certifies nothing about the physical input.
statement: in APFB06.ResidueWorldR2, with realized S the cheapest admitted protocol serving S:
(A2_at_protocol_binding) A2's declared form holds at the protocol binding with capacity 3.
(realized_pair) the protocol selected for the pair dA, dB is the one that keeps all three records.
(realized_pair_keeps_unneeded) it keeps the record rj, which the pair does not need.
reading: at the affirmed binding A2 picks a cheapest admitted protocol. Whether that protocol keeps only
what its family needs is the availability clause again, not a consequence of A2.
not_claimed: that the world is a physical context; that the selected protocol is the occupant's; that A2
as the author means it allows this world.
-/
set_option autoImplicit false
open APFPaper1.Source
namespace APFB06.ResidueWorldR2
theorem realized_serves (S : Finset Dist) : ServesFam (realized S) S := by
unfold realized
split_ifs with h1 h2
· exact servesA S h1
· exact servesB S h2
· exact servesAll S
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
/-- A protocol that keeps ra and rb keeps rj: it is the pair's protocol. -/
theorem keeps_rj_of_both (p : Pr) (h1 : keeps p Rc.ra) (h2 : keeps p Rc.rb) : keeps p Rc.rj := by
cases p
· have h2' : Rc.rb = Rc.ra := h2
cases h2'
· have h1' : Rc.ra = Rc.rb := h1
cases h1'
· trivial
/-! ### What families need -/
/-! ### Support novelty -/
/-! ### The pair -/
end APFB06.ResidueWorldR2
set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1
namespace APFB06.ResidueWorldR2.Unequal
/-! ### The second pricing -/
/-- The bills: 1 for the protocol of dA, 2 for the protocol of dB, 4 for the protocol of the pair. -/
def calibrationU (_ : Unit) : Pr → NNReal
| .pa => 1
| .pb => 2
| .pab => 4
def CU : Unit → NNReal := fun _ => 4
/-- The cost of each record: 1 for dA's, 2 for dB's, 1 for the joint one. -/
def recCost : Rc → ℝ
| .ra => 1
| .rb => 2
| .rj => 1
noncomputable abbrev costU (S : Finset Dist) : ℝ :=
familyCost (wholeRes ()) (calibrationU ()) (maint ()) (suff ()) (uses ()) S
abbrev billSetU (S : Finset Dist) : Set ℝ :=
{c : ℝ | ∃ p : {p : Pr // p ∈ protocols ()},
ServesFam p S ∧ ((calibrationU () (wholeRes () p) : NNReal) : ℝ) = c}
/-! ### A protocol is known by what it keeps and what it bills -/
/-! ### Family costs -/
/-! ### The eight declared forms -/
/-- The eight declared forms on the supplied data with the second pricing. -/
def EightHoldU : 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 calibrationU maint suff uses ∧
APFB04.B04FiniteCapacity (Context := Unit) (fun g => ((CU 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 calibrationU maint suff uses (fun _ _ => True) (fun g => ((CU 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 calibrationU CU 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 : ℝ))
/-! ### A2 and BW at the protocol binding -/
/-! ### The occupant -/
/-! ### The record costs are forced, and they are not equal -/
end APFB06.ResidueWorldR2.Unequal
Source
Theorems.Thm_APFB06_unequal_record_costs_world; Pullbacks v46, SHA-256 1ac6164ac5990e4c7d74d9d8da4ba9f897c42ec1dbef0aabb4ecee0650a38b13. Theorems.Thm_APFB06_unequal_record_costs_world; pullbacks v46; SHA-256 1ac6164ac5990e4c7d74d9d8da4ba9f897c42ec1dbef0aabb4ecee0650a38b13