pair of distinctions meets K1
ProvedAPFPaper5.K1.pair_of_distinctions_meets_K1apfapf-referencepullbacks-v39-2026-11
Result: pair of distinctions meets K1. All parameters and hypotheses are retained in the declaration below.
theorem pair_of_distinctions_meets_K1 {D : Type*} [DecidableEq D] (f : Finset D → ℝ) (i j : D)
(hi : 0 < f {i})
(hb : sharedCost f {i} {j} * sharedCost f {i} {j} < f {i} * f {j}) :
IsBilinear (VP := Fin 2 → ℝ) (VE := Fin 2 → ℝ)
(tableForm (pairTable2 (f {i}) (f {j}) (sharedCost f {i} {j}))) ∧
FaithfulNonnegDiagonal (tableForm (pairTable2 (f {i}) (f {j}) (sharedCost f {i} {j})))
(LinearEquiv.refl ℝ (Fin 2 → ℝ))
Module context and limits: A supplied symmetric two-by-two table has the typed K1 algebraic properties under positive first diagonal and strict determinant inequality. Those inequalities remain hypotheses.
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_pair_bound_table_Vocabulary import Theorems.Thm_APFPaper5_K1_pair_form_pos import Theorems.Thm_APFPaper5_K1_pair_form_needs import Theorems.Thm_APFPaper5_K1_pair_meets_K1_iff import Theorems.Thm_APFB06_ResidueWorldR2_residue_pair_on_the_boundary import Theorems.Thm_APFPaper5_K1_atomTable_symm import Theorems.Thm_APFPaper5_K1_atomTable_form import Theorems.Thm_APFPaper5_K1_atomTable_nonneg import Theorems.Thm_APFPaper5_K1_record_book_table_satisfies_K1 import Mathlib.Algebra.BigOperators.Fin import Mathlib.Tactic.FinCases set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.pair_of_distinctions_meets_K1 {D : Type*} [DecidableEq D] (f : Finset D → ℝ) (i j : D)
(hi : 0 < f {i})
(hb : sharedCost f {i} {j} * sharedCost f {i} {j} < f {i} * f {j}) :
IsBilinear (VP := Fin 2 → ℝ) (VE := Fin 2 → ℝ)
(tableForm (pairTable2 (f {i}) (f {j}) (sharedCost f {i} {j}))) ∧
FaithfulNonnegDiagonal (tableForm (pairTable2 (f {i}) (f {j}) (sharedCost f {i} {j})))
(LinearEquiv.refl ℝ (Fin 2 → ℝ)) := by sorry
Source
['Theorems.Thm_APFPaper5_K1_pair_bound_table:61; pullbacks v39; source SHA-256 7a78d1dd1b256c9d1e314a6fc97e1d5bb48094650fef6f488cec97666d5e1706']