unique fewest of generic
ProvedAPFB07b.unique_fewest_of_genericapfapf-referencepullbacks-v46-2026-11
Result: unique fewest of generic. All parameters and hypotheses are retained in the declaration below.
theorem unique_fewest_of_generic {Rec : Type*} (generic : Interface → Prop)
(originalAdmissible : (i : Interface) → Configuration i → Prop)
(kept : (i : Interface) → Configuration i → Finset Rec)
(cost : Rec → ℝ) (eps : ℝ) (heps : 0 < eps) (hunit : ∀ r, cost r = eps)
(h : BWUniqueMinimumWhere generic originalAdmissible
(fun i H => ∑ r ∈ kept i H, cost r)) (i : Interface) (hg : generic i) :
∃ G, (originalAdmissible i G ∧
∀ H, originalAdmissible i H → (kept i G).card ≤ (kept i H).card) ∧
∀ G', (originalAdmissible i G' ∧
∀ H, originalAdmissible i H → (kept i G').card ≤ (kept i H).card) → G' = G
Module context and limits: BWUniqueMinimumWhere requires unique minimization only on interfaces satisfying a supplied guard. An always-true guard recovers the current declared form; two distinct minima exclude a guarded interface. The guard and physical applicability are not derived or installed.
Source scope parameters:
variable {Interface : Type*} {Configuration : Interface → Type*}
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_APFB07b_unique_minimum_where_no_tie_Vocabulary import Theorems.Thm_APFB07_Ties_unit_cost_eq_iff import Theorems.Thm_APFB07_Ties_unit_cost_lt_iff import Theorems.Thm_APFB07_Ties_isMinimum_iff_fewest import Theorems.Thm_APFB07_Ties_coupled_tie_iff import Theorems.Thm_APFB07_Ties_coupled_lt_iff import Theorems.Thm_APFB07_Ties_uncoupled_tie_iff import Theorems.Thm_APFB07_Ties_equally_shared_tie import Theorems.Thm_APFB07_Ties_more_shared_side_cheaper import Theorems.Thm_APFB07_Ties_tie_cases_count import Definitions.Def_APF_B07b_DeclaredInput set_option autoImplicit false universe apfNative_u_1 apfNative_u_2 apfNative_u_3
Formal statement
theorem APFB07b.unique_fewest_of_generic :
∀ {Interface : Type apfNative_u_1} {Configuration : Interface → Type apfNative_u_2} {Rec : Type apfNative_u_3}
(generic : Interface → Prop) (originalAdmissible : (i : Interface) → Configuration i → Prop)
(kept : (i : Interface) → Configuration i → Finset.{apfNative_u_3} 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)
(h :
@APFB07b.BWUniqueMinimumWhere.{apfNative_u_1, apfNative_u_2} Interface Configuration generic originalAdmissible
fun (i : Interface) (H : Configuration i) =>
@Finset.sum.{apfNative_u_3, 0} Rec Real Real.instAddCommMonoid (kept i H) fun (r : Rec) => cost r)
(i : Interface) (hg : generic i),
@Exists.{apfNative_u_2 + 1} (Configuration i) fun (G : Configuration i) =>
And
(And (originalAdmissible i G)
(∀ (H : Configuration i),
originalAdmissible i H →
@LE.le.{0} Nat instLENat (@Finset.card.{apfNative_u_3} Rec (kept i G))
(@Finset.card.{apfNative_u_3} Rec (kept i H))))
(∀ (G' : Configuration i),
And (originalAdmissible i G')
(∀ (H : Configuration i),
originalAdmissible i H →
@LE.le.{0} Nat instLENat (@Finset.card.{apfNative_u_3} Rec (kept i G'))
(@Finset.card.{apfNative_u_3} Rec (kept i H))) →
@Eq.{apfNative_u_2 + 1} (Configuration i) G' G) := by sorry
Source
['Theorems.Thm_APFB07b_unique_minimum_where_no_tie:75; pullbacks v46; source SHA-256 0eb3d77262afee88ceeede4dec233573d599977f1d88b7011a010e41f2c96c17']