Model vocabulary — A protocol-bound minimum can retain an unneeded record
DefinitionAPFB06_A2_keeps_unneeded_world_VocabularyVocabulary for the supplied model. Its substantive theorems are published separately.
In the revised four-state residue model, the explicit cheapest-serving selector satisfies A2 at the protocol binding with capacity 3. For the pair it selects pAB, retaining rj although rj is outside the pair’s needed-record union. This checks protocol-bound A2 on supplied data rather than inferring it from EightHold’s singleton-physical-state A2. No uniqueness is proved or needed; cheaper singleton choices tie for the empty family. This is a supplied finite model of the named Lean predicates, not a physical APF context or independence from the author-intended physical inputs. EightHold still includes the old B02SourceMeaning; amended B02 is checked separately by meets_B02_r2 against the proposed conjunction form. Singleton-domain A2/BW in EightHold do not certify physical selection or a typed whole-word continuation law.
Assumptions
- Every explicit/implicit binder and section/typeclass variable in the declaration inventory and module context is retained.
Status: conditional reference mathematics. The supplied predicates and model assumptions are not additional Foundation inputs. These records do not establish K1, K3 or K4 closure.
/-
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.
-/
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
set_option autoImplicit false
open APFPaper1.Source
namespace APFB06.ResidueWorldR2
open Classical in
/-- The cheapest admitted protocol for each family. -/
noncomputable def realized (S : Finset Dist) : {p : Pr // p ∈ protocols ()} :=
if ∀ d ∈ S, d.val St.b = false then pA
else if ∀ d ∈ S, d.val St.b = true then pB
else pAB
end APFB06.ResidueWorldR2
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.