shared only family meets K1
ProvedAPFPaper5.K1.SharedOnlyWitness.shared_only_family_meets_K1apfapf-referencepullbacks-v39-2026-11
Result: shared only family meets K1. All parameters and hypotheses are retained in the declaration below.
theorem shared_only_family_meets_K1 :
IsBilinear (VP := Fin 2 → ℝ) (VE := Fin 2 → ℝ)
(tableForm (fun i j : Fin 2 => sharedCost pairCost {i} {j})) ∧
FaithfulNonnegDiagonal (tableForm (fun i j : Fin 2 => sharedCost pairCost {i} {j}))
(LinearEquiv.refl ℝ (Fin 2 → ℝ))
Module context and limits: The supplied weighted model gives family costs 0,2,2,3 and common-record coefficient 1. The visible theorem concludes bilinearity and a faithful diagonal; its use of the earlier bridge does not establish a physical interface or all eight forms.
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_shared_only_witness_Vocabulary import Definitions.Def_APFPaper5_K1_interface_cost_book_Vocabulary import Theorems.Thm_APFPaper5_K1_counted_family_satisfies_K1_of_nonneg_shared import Definitions.Def_APFPaper5_K1_interface_bridge_witness_Vocabulary import Theorems.Thm_APFPaper5_K1_BridgeWitness_exactly_served import Theorems.Thm_APFPaper5_K1_weighted_marginal_ge import Theorems.Thm_APFB05_weighted_record_model_satisfies_floor import Theorems.Thm_APFPaper5_K1_needs_own_record_of_separates import Theorems.Thm_APFPaper5_K1_recordModel_supportNovel_of_needs_own_record import Theorems.Thm_APFPaper5_K1_recordModel_economy_of_separation set_option autoImplicit false open APFPaper1.Source namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5 open APFPaper5.K1 namespace SharedOnlyWitness end SharedOnlyWitness open SharedOnlyWitness open BridgeWitness
Formal statement
theorem APFPaper5.K1.SharedOnlyWitness.shared_only_family_meets_K1 :
IsBilinear (VP := Fin 2 → ℝ) (VE := Fin 2 → ℝ)
(tableForm (fun i j : Fin 2 => sharedCost pairCost {i} {j})) ∧
FaithfulNonnegDiagonal (tableForm (fun i j : Fin 2 => sharedCost pairCost {i} {j}))
(LinearEquiv.refl ℝ (Fin 2 → ℝ)) := by sorry
Source
['Theorems.Thm_APFPaper5_K1_shared_only_witness:106; pullbacks v39; source SHA-256 53633ba4964f8366d3f1d21114620815acb9905e819c0a8653beb4e660d50445']