isMinimum iff fewest
ProvedAPFB07.Ties.isMinimum_iff_fewestapfapf-referencepullbacks-v46-2026-11
Result: isMinimum iff fewest. All parameters and hypotheses are retained in the declaration below.
theorem isMinimum_iff_fewest {Config : Type*} (adm : Config → Prop) (kept : Config → Finset Rec)
(cost : Rec → ℝ) (eps : ℝ) (heps : 0 < eps) (hunit : ∀ r, cost r = eps) (G : Config) :
APFB07b.IsMinimum adm (fun H => ∑ r ∈ kept H, cost r) G ↔
adm G ∧ ∀ H, adm H → (kept G).card ≤ (kept H).card
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 universe apfNative_u_1 apfNative_u_2
Formal statement
theorem APFB07.Ties.isMinimum_iff_fewest :
∀ {Rec : Type apfNative_u_1} {Config : Type apfNative_u_2} (adm : Config → Prop)
(kept : Config → Finset.{apfNative_u_1} Rec) (cost : Rec → Real) (eps : Real)
(heps : @LT.lt.{0} Real Real.instLT (@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)) eps)
(hunit : ∀ (r : Rec), @Eq.{1} Real (cost r) eps) (G : Config),
Iff
(@APFB07b.IsMinimum.{apfNative_u_2} Config adm
(fun (H : Config) =>
@Finset.sum.{apfNative_u_1, 0} Rec Real Real.instAddCommMonoid (kept H) fun (r : Rec) => cost r)
G)
(And (adm G)
(∀ (H : Config),
adm H →
@LE.le.{0} Nat instLENat (@Finset.card.{apfNative_u_1} Rec (kept G))
(@Finset.card.{apfNative_u_1} Rec (kept H)))) := by sorry
Source
['Theorems.Thm_APFB07_ties_under_unit_cost:81; pullbacks v46; source SHA-256 bd8e2c924c31ef28f29621e62ff7bd2436441491a46c8923dedf1f48754dca6a']