Universal one-opposition motion forces one signed swap under explicit hold hypotheses
ProvedAPFB02.hold_is_quarter_turn_of_one_pairFor a finite distinction domain, assume every whole-domain assignment is realized, NothingDrawn, StillHeldAfter, one-opposition motion at every raw state, and nonreturn of every record after two steps. Then exactly one pair of distinct coordinates is swapped with one complemented and all other readings stay fixed. These hypotheses are supplied; this does not derive motion or the hold readings from B02.
This is reference mathematics on Boolean records and the exact supplied predicates; it establishes no physical quantum reconstruction, admitted hold or additional foundation input. NothingDrawn and StillHeldAfter remain explicit hypotheses outside installed FOUNDATION_INPUTS revision 2026-11-14.1; ToldApart and the motion clauses also remain unadopted where used.
import Theorems.Thm_APFB02_rearranged_of_nothing_drawn import Theorems.Thm_APFB02_hold_keeps_every_relation import Theorems.Thm_APFB02_hold_erases_nothing import Theorems.Thm_APFB02_still_held_after_of_rearranged import Theorems.Thm_APFB02_still_held_after_of_onto import Theorems.Thm_APFB02_nothing_drawn_of_keeps_relations import Theorems.Thm_APFB02_keeps_every_relation_iff import Theorems.Thm_APFPaper5_K1_quarterOn_apply import Theorems.Thm_APFPaper5_K1_quarterOn_moves_one_away import Theorems.Thm_APFPaper5_K1_quarterOn_two_steps_turn_both_over import Theorems.Thm_APFPaper5_K1_quarterOn_two_steps_not_back import Theorems.Thm_APFPaper5_K1_quarter_turn_of_moves import Theorems.Thm_APFPaper5_K1_moves_iff_quarter_turn set_option autoImplicit false namespace APFB02 end APFB02 open APFB02 open APFPaper5.K1
theorem APFB02.hold_is_quarter_turn_of_one_pair {X D : Type*} [Fintype D] [DecidableEq D]
(reads : D → X → Bool) (h : X → X) (hall : AllSidesHeld reads)
(hdrawn : NothingDrawn reads h) (hafter : StillHeldAfter reads h)
(hmove : ∀ x : X,
overlapOn Finset.univ (fun d => reads d x) (fun d => reads d (h x))
= ((Finset.univ : Finset D).card : ℝ) - 2)
(hnot : ∀ x : X, (fun d => reads d (h (h x))) ≠ fun d => reads d x) :
∃ d1 d2 : D, d1 ≠ d2 ∧ ∀ x : X,
reads d1 (h x) = !(reads d2 x) ∧ reads d2 (h x) = reads d1 x ∧
∀ d : D, d ≠ d1 → d ≠ d2 → reads d (h x) = reads d x := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.