recordTable meets K1
ProvedAPFPaper5.K1.ThreePairwise.recordTable_meets_K1apfapf-referencepullbacks-v39-2026-11
Result: recordTable meets K1. All parameters and hypotheses are retained in the declaration below.
theorem recordTable_meets_K1 :
IsBilinear (VP := Fin 3 → ℝ) (VE := Fin 3 → ℝ) (tableForm (uniformTable 3 1)) ∧
FaithfulNonnegDiagonal (tableForm (uniformTable 3 1)) (LinearEquiv.refl ℝ (Fin 3 → ℝ))
Module context and limits: For the supplied three-mark cost function, each pair satisfies the strict bound at c=3/5 while the full form is negative on the all-ones vector. A different supplied table with diagonal 3 and off-diagonal 1 is faithful. Admissibility of three related physical distinctions is not established.
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_three_pairwise_joint_Vocabulary import Definitions.Def_APFPaper5_K1_dominant_table_Vocabulary import Theorems.Thm_APFPaper5_K1_dominant_table_lower_bound import Theorems.Thm_APFPaper5_K1_dominant_table_meets_K1 import Theorems.Thm_APFPaper5_K1_sharedCost_self import Theorems.Thm_APFPaper5_K1_sharedCost_le_right import Theorems.Thm_APFPaper5_K1_sharedCost_le_left import Theorems.Thm_APFPaper5_K1_sharedCost_nonneg_iff import Theorems.Thm_APFPaper5_K1_sharedCost_channel_ledger import Theorems.Thm_APFPaper5_K1_sharedCost_channel_no_joint import Theorems.Thm_APFPaper5_K1_cost_is_count_times_floor import Mathlib.Algebra.BigOperators.Fin import Mathlib.Tactic.FinCases import Mathlib.Tactic.NormNum import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false namespace APFPaper5.K1.ThreePairwise end APFPaper5.K1.ThreePairwise open APFPaper5 open APFPaper5.K1 open APFPaper5.K1.ThreePairwise
Formal statement
theorem APFPaper5.K1.ThreePairwise.recordTable_meets_K1 :
IsBilinear (VP := Fin 3 → ℝ) (VE := Fin 3 → ℝ) (tableForm (uniformTable 3 1)) ∧
FaithfulNonnegDiagonal (tableForm (uniformTable 3 1)) (LinearEquiv.refl ℝ (Fin 3 → ℝ)) := by sorry
Source
['Theorems.Thm_APFPaper5_K1_three_pairwise_joint:95; pullbacks v39; source SHA-256 6cf934a1a14b67ecd7e5fa43a27ca54befe0d9ccc87d8c78d771bfc7e553856b']