pair meets K1 iff
ProvedAPFPaper5.K1.pair_meets_K1_iffapfapf-referencepullbacks-v39-2026-11
Result: pair meets K1 iff. All parameters and hypotheses are retained in the declaration below.
theorem pair_meets_K1_iff {D : Type*} [DecidableEq D] (f : Finset D → ℝ) (i j : D) :
(∀ x y : ℝ,
0 ≤ f {i} * x * x + 2 * sharedCost f {i} {j} * x * y + f {j} * y * y ∧
(f {i} * x * x + 2 * sharedCost f {i} {j} * x * y + f {j} * y * y = 0 → x = 0 ∧ y = 0)) ↔
0 < f {i} ∧ sharedCost f {i} {j} * sharedCost f {i} {j} < f {i} * f {j}
Module context and limits: The displayed quadratic form is positive definite exactly under its stated diagonal and determinant inequalities. The shared-cost specialization and supplied ResidueWorld boundary value do not derive a physical pair bound.
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_SharedCost import Definitions.Def_APFB06_subadditivity_worlds_Vocabulary_r2 import Theorems.Thm_APFB06_RelationWorldR2_cost_subadditive import Theorems.Thm_APFB06_ResidueWorldR2_servesAll import Theorems.Thm_APFB06_ResidueWorldR2_bill_pA import Theorems.Thm_APFB06_ResidueWorldR2_bill_pB import Theorems.Thm_APFB06_ResidueWorldR2_bill_pAB import Theorems.Thm_APFB06_ResidueWorldR2_bill_ge_one import Theorems.Thm_APFB06_ResidueWorldR2_bill_of_both import Theorems.Thm_APFB06_ResidueWorldR2_servesA import Theorems.Thm_APFB06_ResidueWorldR2_servesB import Theorems.Thm_APFB06_ResidueWorldR2_keeps_ra_of_serves import Theorems.Thm_APFB06_ResidueWorldR2_keeps_rb_of_serves import Theorems.Thm_APFB06_ResidueWorldR2_exists_false_of_not_all_true import Theorems.Thm_APFB06_ResidueWorldR2_exists_true_of_not_all_false import Theorems.Thm_APFB06_ResidueWorldR2_floor_holds import Theorems.Thm_APFB06_ResidueWorldR2_eight_hold import Theorems.Thm_APFB06_ResidueWorldR2_dAd_b import Theorems.Thm_APFB06_ResidueWorldR2_dBd_b import Theorems.Thm_APFB06_ResidueWorldR2_alignment_holds_relation import Theorems.Thm_APFB06_ResidueWorldR2_keeps_iff_mem_kept import Theorems.Thm_APFB06_ResidueWorldR2_bill_eq_number_kept import Theorems.Thm_APFB06_ResidueWorldR2_cost_pair import Theorems.Thm_APFB06_ResidueWorldR2_not_subadditive import Theorems.Thm_APFB06_ResidueWorldR2_sharedCost_eq import Theorems.Thm_APFB06_ResidueWorldR2_no_join import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.Tactic.NormNum set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.pair_meets_K1_iff {D : Type*} [DecidableEq D] (f : Finset D → ℝ) (i j : D) :
(∀ x y : ℝ,
0 ≤ f {i} * x * x + 2 * sharedCost f {i} {j} * x * y + f {j} * y * y ∧
(f {i} * x * x + 2 * sharedCost f {i} {j} * x * y + f {j} * y * y = 0 → x = 0 ∧ y = 0)) ↔
0 < f {i} ∧ sharedCost f {i} {j} * sharedCost f {i} {j} < f {i} * f {j} := by sorry
Source
['Theorems.Thm_APFPaper5_K1_pair_bound:105; pullbacks v39; source SHA-256 374e6041cea7d2be7cb3fcb5e86b14b42296ddd0ee3928c8e02bf19799b2cb65']