Appending a residue updates proper subproducts
ProvedCouret.mod30_properSupport_snoccouret-programmecouret-unification-20261108
For a nonempty word of residue codes and codes ,
where is the set of products of nonempty proper selections and multiplication is modulo 30. The nonempty-word hypothesis is explicit.
Preamble
import Definitions.Def_Couret_SupportSemantics_a8ae2832b450
import Std
import Theorems.Thm_Couret_properSupport_snoc
import Std
/-!
COU-87, first semantic formalization, 2026-10-30.
The denotation uses independent choices of labeled occurrences, not the automaton
recurrence. Snoc words make appending an occurrence explicit. No assumption of
distinct factors is made. This file does not certify the 147/101 finite tables.
-/
universe u
namespace Couret
variable {α : Type u}
namespace Choice
end Choice
/- Concrete eight-element alphabet, with the same coordinates as the Python
verifier: 1,7,19,13 and 11,17,29,23. These finite laws use kernel `decide`,
not native_decide. -/
Formal statement
theorem mod30_properSupport_snoc (w : Word Code30) (hw : w.nonempty)
(g u : Code30) :
properSupport mod30Product (.snoc w g) u ↔
properSupport mod30Product w u ∨
(∃ v, properSupport mod30Product w v ∧ mul30 g v = u) ∨
u = total mod30Product w ∨ u = g := by sorry
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/S4/SupportSemantics.lean, lines 380–386; source file SHA-256 d67147f5a0bd9f4d541f1eb4f8b15d92c422e93056e459a13a8312006a871dc3; theorem Couret.mod30_properSupport_snoc