Pairs alike of equal oppositions
ProvedAPFPaper5.K1.pairs_alike_of_equal_oppositionsapfapf-referencesib-v44-2026-11
For a finite Boolean coordinate family, two ordered pairs with the same number of opposed coordinates can be related by a common coordinate permutation followed by a common side-flip mask. This classifies model orbits, not physical admissibility.
Preamble
import Theorems.Thm_APFPaper5_K1_rearrange_injective import Theorems.Thm_APFPaper5_K1_overlap_rearrange import Theorems.Thm_APFPaper5_K1_rearrangement_returns import Theorems.Thm_APFPaper5_K1_side_not import Theorems.Thm_APFPaper5_K1_turning_one_over_is_not_a_rearrangement import Mathlib.Logic.Equiv.Fintype set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.pairs_alike_of_equal_oppositions {D : Type*} [Fintype D] [DecidableEq D]
(v w v' w' : D → Bool)
(h : Fintype.card {d : D // v' d ≠ w' d} = Fintype.card {d : D // v d ≠ w d}) :
∃ (sigma : D ≃ D) (f : D → Bool),
rename f (rearrange sigma v) = v' ∧ rename f (rearrange sigma w) = w' := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_two_marks_minimum.lean:85
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.