Turn mixes the pair
ProvedAPFPaper5.K1.turn_mixes_the_pairapfapf-referencesib-v44-2026-11
Let sigma permute a finite Boolean coordinate family and assume its double action sends a chosen record v0 to its opposite. Then overlaps of the next x against v0 and the next v0 transform as (a,b) to (-b,a). The double-action property is assumed, not derived for arbitrary holds.
Preamble
import Theorems.Thm_APFPaper5_K1_overlap_rename import Theorems.Thm_APFPaper5_K1_one_record_carried_to_any_other import Theorems.Thm_APFPaper5_K1_one_record_has_no_meaning import Theorems.Thm_APFPaper5_K1_overlap_comm import Theorems.Thm_APFPaper5_K1_overlap_opposite_right import Theorems.Thm_APFPaper5_K1_overlap_opposite_left import Theorems.Thm_APFPaper5_K1_pairs_alike_of_equal_oppositions import Mathlib.Algebra.Group.Nat.Even import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.turn_mixes_the_pair {D : Type*} [Fintype D] (sigma : D ≃ D) (v0 : D → Bool)
(hhalf : ∀ d : D, v0 (sigma (sigma d)) = !(v0 d)) (x : D → Bool) :
overlapOn Finset.univ (rearrange sigma x) v0
= - overlapOn Finset.univ x (rearrange sigma v0) ∧
overlapOn Finset.univ (rearrange sigma x) (rearrange sigma v0)
= overlapOn Finset.univ x v0 := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_turn_on_a_pair.lean:40
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.