more shared side cheaper
ProvedAPFB07.Ties.more_shared_side_cheaperapfapf-referencepullbacks-v46-2026-11
Result: more shared side cheaper. All parameters and hypotheses are retained in the declaration below.
theorem more_shared_side_cheaper (cost : Rec → ℝ) (eps : ℝ) (heps : 0 < eps)
(hunit : ∀ r, cost r = eps) (K T F : Finset Rec) (hcard : T.card = F.card)
(hshare : (F ∩ K).card < (T ∩ K).card) :
∑ r ∈ K ∪ T, cost r < ∑ r ∈ K ∪ F, cost r
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
Formal statement
theorem APFB07.Ties.more_shared_side_cheaper :
∀ {Rec : Type apfNative_u_1} [inst : DecidableEq.{apfNative_u_1 + 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) (K T F : Finset.{apfNative_u_1} Rec)
(hcard : @Eq.{1} Nat (@Finset.card.{apfNative_u_1} Rec T) (@Finset.card.{apfNative_u_1} Rec F))
(hshare :
@LT.lt.{0} Nat instLTNat
(@Finset.card.{apfNative_u_1} Rec
(@Inter.inter.{apfNative_u_1} (Finset.{apfNative_u_1} Rec) (@Finset.instInter.{apfNative_u_1} Rec inst) F K))
(@Finset.card.{apfNative_u_1} Rec
(@Inter.inter.{apfNative_u_1} (Finset.{apfNative_u_1} Rec) (@Finset.instInter.{apfNative_u_1} Rec inst) T K))),
@LT.lt.{0} Real Real.instLT
(@Finset.sum.{apfNative_u_1, 0} Rec Real Real.instAddCommMonoid
(@Union.union.{apfNative_u_1} (Finset.{apfNative_u_1} Rec) (@Finset.instUnion.{apfNative_u_1} Rec inst) K T)
fun (r : Rec) => cost r)
(@Finset.sum.{apfNative_u_1, 0} Rec Real Real.instAddCommMonoid
(@Union.union.{apfNative_u_1} (Finset.{apfNative_u_1} Rec) (@Finset.instUnion.{apfNative_u_1} Rec inst) K F)
fun (r : Rec) => cost r) := by sorry
Source
['Theorems.Thm_APFB07_ties_under_unit_cost:137; pullbacks v46; source SHA-256 bd8e2c924c31ef28f29621e62ff7bd2436441491a46c8923dedf1f48754dca6a']