tie cases count
ProvedAPFB07.Ties.tie_cases_countapfapf-referencepullbacks-v46-2026-11
Result: tie cases count. All parameters and hypotheses are retained in the declaration below.
theorem tie_cases_count (m : ℕ) :
((Finset.range (m + 1) ×ˢ Finset.range (m + 1)).filter (fun p => p.1 = p.2)).card = m + 1 ∧
(Finset.range (m + 1) ×ˢ Finset.range (m + 1)).card = (m + 1) * (m + 1)
Module context and limits: For finite record sets with a strictly positive common unit price, equal cost is equivalent to equal cardinality. With existing holdings, compare newly added records; among equally sized options, greater overlap is cheaper. The case count is unweighted and implies no probability law.
Source scope parameters:
variable {Rec : Type*}
variable [DecidableEq Rec]
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Theorems.Thm_APFPaper1_Source_each_eq_floor_of_sum_le import Theorems.Thm_APFPaper1_Source_sum_eq_card_mul_of_each_eq import Theorems.Thm_APFPaper1_Source_each_eq_floor_iff import Theorems.Thm_APFPaper1_Source_needed_records_at_floor_iff import Definitions.Def_APF_B07b_DeclaredInput import Mathlib.Algebra.Order.BigOperators.Group.Finset import Mathlib.Tactic.Linarith set_option autoImplicit false
Formal statement
theorem APFB07.Ties.tie_cases_count :
∀ (m : Nat),
And
(@Eq.{1} Nat
(@Finset.card.{0} (Prod.{0, 0} Nat Nat)
(@Finset.filter.{0} (Prod.{0, 0} Nat Nat)
(fun (p : Prod.{0, 0} Nat Nat) => @Eq.{1} Nat (@Prod.fst.{0, 0} Nat Nat p) (@Prod.snd.{0, 0} Nat Nat p))
(fun (a : Prod.{0, 0} Nat Nat) =>
instDecidableEqNat (@Prod.fst.{0, 0} Nat Nat a) (@Prod.snd.{0, 0} Nat Nat a))
(@SProd.sprod.{0, 0, 0} (Finset.{0} Nat) (Finset.{0} Nat) (Finset.{0} (Prod.{0, 0} Nat Nat))
(@Finset.instSProd.{0, 0} Nat Nat)
(Finset.range
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
(Finset.range
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))))))
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
(@Eq.{1} Nat
(@Finset.card.{0} (Prod.{0, 0} Nat Nat)
(@SProd.sprod.{0, 0, 0} (Finset.{0} Nat) (Finset.{0} Nat) (Finset.{0} (Prod.{0, 0} Nat Nat))
(@Finset.instSProd.{0, 0} Nat Nat)
(Finset.range
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
(Finset.range
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))))
(@HMul.hMul.{0, 0, 0} Nat Nat Nat (@instHMul.{0} Nat instMulNat)
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
(@HAdd.hAdd.{0, 0, 0} Nat Nat Nat (@instHAdd.{0} Nat instAddNat) m
(@OfNat.ofNat.{0} Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))) := by sorry
Source
['Theorems.Thm_APFB07_ties_under_unit_cost:149; pullbacks v46; source SHA-256 bd8e2c924c31ef28f29621e62ff7bd2436441491a46c8923dedf1f48754dca6a']