Appending one factor updates nonempty subproduct support
ProvedCouret.S5.selectedSupport_snoccouret-programmecouret-unification-20261108
Write , with residue map taking to , respectively. Let be a finite word over , let , and write for products of nonempty selections of positions. Then
The identity residue is included only when realized by a nonempty selection; the word may be empty.
Preamble
import Definitions.Def_Couret_SubproductSemantics_e0771d3a736f import Std import Theorems.Thm_Couret_Choice_eval_allSkip import Theorems.Thm_Couret_Choice_eval_of_not_picked import Definitions.Def_Couret_BCS5MaskSemantics_646df6f48a3c set_option maxRecDepth 100000 set_option maxHeartbeats 4000000 namespace Couret namespace S5
Formal statement
theorem selectedSupport_snoc (w : Word Code30) (g u : Code30) :
selectedSupport (.snoc w g) u ↔
selectedSupport w u ∨ (∃ v, selectedSupport w v ∧ mul30 g v = u) ∨ u = g := by sorry
end S5
end Couret
Source
Alexandre Couret, Certified minimal memory for a divisor-residue presence observable modulo 30, https://zenodo.org/records/23989640; archive Couret_BC_MOD30_Companion_20261105.zip, SHA-256 9bb2678164c63a9e47c192093f5ce9deb1b7b74a1f1c8fecc77f305a408266a2; file source/S5/SubproductSemantics.lean, lines 36–60; source file SHA-256 ba13bc319dc0b6baacbd98ea26d1e89628af10edec99409e87d0f01ff3d4e21c; theorem Couret.S5.selectedSupport_snoc