Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Model vocabulary — Unit-count bills can exceed the count of needed records

Definition
APFB06_count_worlds_Vocabulary

by FiniteUniverse · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v52-2026-11

Vocabulary for the supplied model. Its substantive theorems are published separately.

In the revised four-state residue model, bills count kept records, maintained support equals kept support and serving requires each distinction’s own record. The pair requires two records but costs three, and no serving protocol keeps exactly its needed pair. The absence of an exact-serving witness is proved in this supplied model. It does not assert that every model without availability has unequal cost and count. 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.

Definition code
/-
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_count_worlds
title: In the residue world bills count the records kept and each distinction is served by its own record, yet family cost is not the number of records the family needs
inputs_revision: 2026-10-04.1
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: Thm_APFB06_subadditivity_worlds (the residue world, in which the eight declared forms and both
 readings of 2026-11-13 hold). Thm_APFPaper1_familyCost_count (the three clauses and the availability
 clause). Thm_APFPaper5_K1_shared_cost_counting (seat 01WrrBvu: cost is a count where every finite set of
 records is a protocol). RULING_records_clause_2026-11-12, RULING_bill_is_a_sum_2026-11-13.
consumes_inputs: none as hypotheses. The world is supplied data.
statement: in APFB06.ResidueWorldR2, with each distinction needing its own record: (bill_counts_kept) every
 bill is the number of records the protocol keeps. (maint_eq_kept) what a protocol maintains is what it
 keeps. (serving_needs_own_record) a set of records sufficient for a distinction contains its record.
 (needed_pair_card) the pair dA, dB needs two records. (cost_exceeds_count) the pair costs more than the
 number of records it needs: 3 against 2. (not_available) no admitted protocol keeps exactly the records
 the pair needs: the availability clause fails.
reading: "family cost is the number of records the family needs" does not follow from the eight declared
 forms as encoded, with B06 read under both rulings, even when bills are counts of kept records and
 service is by a distinction's own record. What is missing is the availability clause.
not_claimed: independence from the physical inputs as the author means them; that the world is a physical
 context. No world is built here in which the eight declared forms and both readings hold and cost is a
 count; the builder seat's record model shows only that B05's floor holds there
 (APFB05.weighted_record_model_satisfies_floor).
-/
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 Theorems.Thm_APFPaper1_Source_needed_subset_kept
import Theorems.Thm_APFPaper1_Source_card_needed_le_bill
import Theorems.Thm_APFPaper1_Source_card_needed_le_familyCost
import Theorems.Thm_APFPaper1_Source_familyCost_eq_card_of_available
import Theorems.Thm_APFPaper1_Source_join_of_available
import Mathlib.Data.Finset.Union
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Linarith

set_option autoImplicit false
open APFPaper1.Source

namespace APFB06.ResidueWorldR2

/-- The records a distinction needs: its own record. -/
def fam (d : Dist) : Finset Rc := {recOfB (d.val St.b)}

/-- What an admitted protocol keeps, as a finite set. -/
def keptP (p : {p : Pr // p ∈ protocols ()}) : Finset Rc := kept p.val













end APFB06.ResidueWorldR2
Source
Theorems/Thm_APFB06_count_worlds.lean; Sib v52 / pullbacks v6; SHA-256 59da16165a8f8f9f95aa99161f26bfe6d6fe65283e550624ddb9f719dbcd7ddb. Paper 1 Supplement v9.28:1741-1819,1833-1888,2746-2782,2845-2923,3046-3058,5919-5931,7101; Paper 0 v6.3.2:3226-3242 for A2 scope; Actual codebank continuation_calculus.py:76-157; delta_calculus.py:236-314; yang_mills_md_bridge.py:548-638; Current FOUNDATION_INPUTS revision 2026-11-14.1; W/notes/HANDOFF_auditor_and_publisher_2026-11-14.md; frozen/pullbacks_v6/Notes/MEMO_pullbacks_pass10_2026-11-14.md
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 16, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me