Every relation between potential states
ProvedAPFPaper5.K1.every_relation_between_potential_statesapfapf-referencesib-v44-2026-11
For a finite distinction type and a readout satisfying AllSidesHeld, each finite subset T determines two potential states opposed on exactly card(T) coordinates, with overlap card(D)-2 card(T). Surjectivity of all Boolean patterns is assumed; no continuum of relation values follows.
Preamble
import Definitions.Def_APFPaper5_K1_RegionSymmetries import Definitions.Def_APF_B02_DeclaredInput import Theorems.Thm_APFB02_both_sides_held import Theorems.Thm_APFPaper5_K1_side_mul_side import Theorems.Thm_APFPaper5_K1_overlap_eq_agree_sub_oppose import Theorems.Thm_APFPaper5_K1_agree_add_oppose import Theorems.Thm_APFPaper5_K1_number_is_count_of_agreements import Theorems.Thm_APFPaper5_K1_overlap_of_same_alignment import Mathlib.Data.Fintype.BigOperators set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.every_relation_between_potential_states {X D : Type*} [Fintype D] [DecidableEq D]
(reads : D → X → Bool) (h : AllSidesHeld reads) (T : Finset D) :
∃ x y : X,
opposeOn Finset.univ (fun d => reads d x) (fun d => reads d y) = (T.card : ℝ) ∧
overlapOn Finset.univ (fun d => reads d x) (fun d => reads d y)
= ((Finset.univ : Finset D).card : ℝ) - 2 * (T.card : ℝ) := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_every_side_pattern.lean:66
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.