Number is count of agreements
ProvedAPFPaper5.K1.number_is_count_of_agreementsapfapf-referencesib-v44-2026-11
For any finite family S and two Boolean assignments v,w, half the sum of S’s cardinality and their signed overlap is the number of coordinates where they agree. This is an unnormalized discrete count identity, not a physical probability or cost identification.
Preamble
import Definitions.Def_APFPaper5_K1_AlignmentCount import Definitions.Def_APF_B02_DeclaredInput import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.Tactic.NormNum set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.number_is_count_of_agreements {D : Type*} (S : Finset D) (v w : D → Bool) :
((S.card : ℝ) + overlapOn S v w) / 2 = agreeOn S v w := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_alignment_count.lean:84
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.