The subproduct-mask run exactly represents nonempty selections
ProvedCouret.S5.subRun_exactcouret-programmecouret-unification-20261108
Write , with residue map taking to , respectively. For every finite word over , let be its specified subproduct-mask run and the set of products of nonempty position selections. Then
For the empty word both supports are empty.
Preamble
import Definitions.Def_Couret_SubproductSemantics_e0771d3a736f import Std import Theorems.Thm_Couret_S5_selectedSupport_snoc import Theorems.Thm_Couret_maskSupport_or import Theorems.Thm_Couret_maskSupport_singleton import Theorems.Thm_Couret_maskSupport_zero import Theorems.Thm_Couret_shiftMask_support import Definitions.Def_Couret_BCS5MaskSemantics_646df6f48a3c set_option maxRecDepth 100000 set_option maxHeartbeats 4000000 namespace Couret namespace S5
Formal statement
theorem subRun_exact (w : Word Code30) (u : Code30) :
maskSupport (subRun w) u ↔ selectedSupport w u := 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 62–71; source file SHA-256 ba13bc319dc0b6baacbd98ea26d1e89628af10edec99409e87d0f01ff3d4e21c; theorem Couret.S5.subRun_exact