pair is counted
ProvedAPFPaper5.K1.FreePair.pair_is_countedapfapf-referencepullbacks-v39-2026-11
Result: pair is counted. All parameters and hypotheses are retained in the declaration below.
theorem pair_is_counted : LedgerCounted ledger (fun _ => True) 1 (fun i : Fin 2 => i)
Module context and limits: The example satisfies B05 and the earlier LedgerCounted predicate; it does not satisfy the stronger Counted definition. The own records cost zero and the joint record costs one. No all-eight or physical-model claim follows.
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Definitions.Def_APFPaper5_K1_free_pair_paid_relation_Vocabulary import Theorems.Thm_APFPaper5_K1_partyScore_meets_K1_of_own_record import Theorems.Thm_APFPaper5_K1_memberNeeds_subset_familyNeeds_explicit import Theorems.Thm_APFPaper5_K1_familyNeeds_eq_of_exactly_served_explicit import Theorems.Thm_APFPaper5_K1_ledger_party_score_meets_K1_explicit import Theorems.Thm_APFPaper5_K1_ledger_counted_family_party_score_satisfies_K1_explicit import Definitions.Def_APFPaper5_K1_table_kernel_and_support_Vocabulary import Theorems.Thm_APFPaper5_K1_atomTable_form_eq_zero_iff import Theorems.Thm_APFPaper5_K1_atomTable_faithful_iff import Theorems.Thm_APFPaper5_K1_atomTable_row_eq_of_same_marks import Theorems.Thm_APFPaper5_K1_atomTable_merge_of_same_marks import Theorems.Thm_APFPaper5_K1_atomTable_eq_zero_of_disjoint import Theorems.Thm_APFPaper5_K1_card_mul_le_sum_of_private import Theorems.Thm_APFPaper1_Source_familyCost_nonneg import Theorems.Thm_APFPaper1_Source_familyCost_mono import Definitions.Def_APF_B05_DeclaredInput_r2 import Mathlib.Tactic.FinCases import Mathlib.Tactic.NormNum import Mathlib.Tactic.Linarith set_option autoImplicit false
Formal statement
theorem APFPaper5.K1.FreePair.pair_is_counted :
@APFPaper5.K1.LedgerCounted.{0, 0, 0, 0} (Fin (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
(Finset.{0} (Fin (@OfNat.ofNat.{0} Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))))
(Fin (@OfNat.ofNat.{0} Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
(Fin (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
(Fin.fintype (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
(instDecidableEqFin (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
(instDecidableEqFin (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))) APFPaper5.K1.FreePair.ledger
(fun (x : Fin (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))) => True)
(@OfNat.ofNat.{0} Real (nat_lit 1) (@One.toOfNat1.{0} Real Real.instOne))
fun (i : Fin (@OfNat.ofNat.{0} Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))) => i := by sorry
Source
['Theorems.Thm_APFPaper5_K1_free_pair_paid_relation:198; pullbacks v39; source SHA-256 29f8413cb357e5c0baaae617a7eea68f063cef67e92267bf8269f6afe85f8162']