Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appending a monoid element updates proper products

Proved
Couret.properSupport_snoc

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

Let MMM be a commutative monoid on a type α\alphaα, www a nonempty word, and g,u∈αg,u\in\alphag,u∈α. Then

u∈PM(wg)  ⟺  u∈PM(w) ∨ ∃v∈PM(w), gv=u ∨ u=total⁡M(w) ∨ u=g.u\in P_M(wg)\iff u\in P_M(w)\ \lor\ \exists v\in P_M(w),\ gv=u\ \lor\ u=\operatorname{total}_M(w)\ \lor\ u=g.u∈PM​(wg)⟺u∈PM​(w) ∨ ∃v∈PM​(w), gv=u ∨ u=totalM​(w) ∨ u=g.

Here PMP_MPM​ uses nonempty proper choices of positions, so repeated entries are allowed.

Preamble
import Definitions.Def_Couret_SupportSemantics_a8ae2832b450
import Std
import Theorems.Thm_Couret_Choice_eval_allSkip
import Theorems.Thm_Couret_Choice_eval_of_not_omitted
import Theorems.Thm_Couret_Choice_eval_of_not_picked
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











Formal statement
theorem properSupport_snoc (M : CMonoid α) (w : Word α) (hw : w.nonempty)
    (g u : α) :
    properSupport M (.snoc w g) u ↔
      properSupport M w u ∨
      (∃ v, properSupport M w v ∧ M.mul g v = u) ∨
      u = total M w ∨ u = g := by sorry




























/- 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. -/


























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 177–213; source file SHA-256 d67147f5a0bd9f4d541f1eb4f8b15d92c422e93056e459a13a8312006a871dc3; theorem Couret.properSupport_snoc

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me