Pairsign rearrange any naming
ProvedAPFPaper5.K1.pairSign_rearrange_any_namingapfapf-referencesib-v44-2026-11
On a finite Boolean coordinate family, permuting one member of a pair under a fixed conjugating side naming preserves their pairSign. The simultaneous naming/permutation formula is exact; it does not equate coordinate permutation with arbitrary side flips.
Preamble
import Definitions.Def_APFPaper5_K1_PairParity 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.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.pairSign_rearrange_any_naming {D : Type*} [Fintype D] (f : D → Bool) (sigma : D ≃ D)
(v w : D → Bool) :
pairSign Finset.univ v (rename f (rearrange sigma (rename f w))) = pairSign Finset.univ v w := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_pair_parity.lean:73
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.