empty word scores as K1
ProvedAPFPaper5.K2.empty_word_scores_as_K1apfapf-referencepullbacks-v39-2026-11
Result: empty word scores as K1. All parameters and hypotheses are retained in the declaration below.
theorem empty_word_scores_as_K1 [Fintype ι]
(step : (g h : Context) → Frag g h → Raw g → Raw h → Prop) (a : Context)
{D : Type uD} (reads : D → Raw a → Bool) (dist : ι → D) (G : ι → ι → ℝ) :
ExecutesAs step (Word.nil a) id ∧ RearrangesFamily reads dist id id (fun _ => false) ∧
∀ x y : ι → ℝ, holdScore G id x y = tableForm G x y
Module context and limits: ExecutesAs assumes total deterministic execution as the supplied map. Rearrangement uniqueness additionally requires EveryCombinationHeld and an injective listing. The score result does not establish bills, admission, inverse-word availability or that every word is a hold.
Source scope parameters:
universe uI uX uD uC uF uW
variable {ι : Type uI}
variable {Context : Type uC} {Frag : Context → Context → Type uF} {Raw : Context → Type uW}
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_K2_HoldScore import Theorems.Thm_APFPaper5_K2_rearrangesFamily_id import Theorems.Thm_APFPaper5_K2_rearrangesFamily_comp import Theorems.Thm_APFPaper5_K2_nothingDrawn_of_rearranges import Theorems.Thm_APFPaper5_K2_exists_rearranges_of_nothingDrawn import Theorems.Thm_APFPaper5_K2_heldAfter_id import Theorems.Thm_APFPaper5_K2_heldAfter_comp import Theorems.Thm_APFPaper5_K2_heldAfter_add import Theorems.Thm_APFPaper5_K2_heldAfter_smul import Theorems.Thm_APFPaper5_K2_heldAfter_markClass import Theorems.Thm_APFPaper5_K2_holdScore_id import Theorems.Thm_APFPaper5_K2_holdScore_marks import Theorems.Thm_APFPaper5_K2_holdScore_isBilinear import Theorems.Thm_APFPaper5_K2_holdScore_eq_sum import Theorems.Thm_APFPaper5_K2_reverse_is_inverse_of_keeps import Theorems.Thm_APFPaper5_K2_keeps_of_reverse_is_inverse import Theorems.Thm_APFPaper5_K2_reverse_is_inverse_iff_keeps import Theorems.Thm_APFPaper5_K2_tableForm_heldAfter_of_keeps import Theorems.Thm_APFPaper5_K2_ends_reversed_of_keeps import Theorems.Thm_APFPaper5_K2_keepsTable_diag import Theorems.Thm_APFPaper5_K2_not_keepsTable_of_diag_ne import Theorems.Thm_APFPaper5_K2_holdScoreNull_iff_tables import Theorems.Thm_APFPaper5_K2_source_hold_score_marks import Theorems.Thm_APFPaper5_K2_source_hold_ends_reversed import Mathlib.Data.Finset.Insert set_option autoImplicit false universe apfNative_uI apfNative_uD apfNative_uC apfNative_uF apfNative_uW
Formal statement
theorem APFPaper5.K2.empty_word_scores_as_K1 :
∀ {ι : Type apfNative_uI} {Context : Type apfNative_uC} {Frag : Context → Context → Type apfNative_uF}
{Raw : Context → Type apfNative_uW} [inst : Fintype.{apfNative_uI} ι]
(step : (g h : Context) → Frag g h → Raw g → Raw h → Prop) (a : Context) {D : Type apfNative_uD}
(reads : D → Raw a → Bool) (dist : ι → D) (G : ι → ι → Real),
And
(@APFPaper5.K2.ExecutesAs.{apfNative_uC, apfNative_uF, apfNative_uW} Context Frag Raw step a
(@APFPaper1.Continuation.Word.nil.{apfNative_uC, apfNative_uF} Context Frag a) (@id.{apfNative_uW + 1} (Raw a)))
(And
(@APFPaper5.K2.RearrangesFamily.{apfNative_uI, apfNative_uW, apfNative_uD} ι (Raw a) D reads dist
(@id.{apfNative_uW + 1} (Raw a)) (@id.{apfNative_uI + 1} ι) fun (x : ι) => Bool.false)
(∀ (x y : ι → Real),
@Eq.{1} Real (@APFPaper5.K2.holdScore.{apfNative_uI} ι inst G (@id.{apfNative_uI + 1} ι) x y)
(@APFPaper5.K1.tableForm.{apfNative_uI} ι inst G x y))) := by sorry
Source
['Theorems.Thm_APFPaper5_K2_hold_words:131; pullbacks v39; source SHA-256 d254dc07751037f56a12a4a0422a606d6d4c387d9d62de81d3c3c2aba2633784']