Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Residue subproducts exactly represent all divisor residues

Proved
Couret.fullSupport_mod30_iff_divisor

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

couret-programmecouret-unification-20261108

Write C=Z/2Z×Z/4ZC=\mathbb Z/2\mathbb Z\times\mathbb Z/4\mathbb ZC=Z/2Z×Z/4Z, with residue map ρ\rhoρ taking (0,0),(0,1),(0,2),(0,3),(1,0),(1,1),(1,2),(1,3)(0,0),(0,1),(0,2),(0,3),(1,0),(1,1),(1,2),(1,3)(0,0),(0,1),(0,2),(0,3),(1,0),(1,1),(1,2),(1,3) to 1,7,19,13,11,17,29,231,7,19,13,11,17,29,231,7,19,13,11,17,29,23, respectively. Let www be a word of natural primes, with total product nnn coprime to 30. For every u∈Cu\in Cu∈C,

u∈Uall(encode⁡30(w))  ⟺  ∃d∣n, d mod 30=ρ(u).u\in U_{\rm all}(\operatorname{encode}_{30}(w))\iff\exists d\mid n,\ d\bmod30=\rho(u).u∈Uall​(encode30​(w))⟺∃d∣n, dmod30=ρ(u).

Selections may be empty or full; the empty factorization n=1n=1n=1 is allowed.

Preamble
import Definitions.Def_Couret_ModularDivisorBridge_2d9305253316
import Std
import Theorems.Thm_Couret_coprime30_of_dvd
import Theorems.Thm_Couret_fullSupport_iff_divisor
import Theorems.Thm_Couret_fullSupport_map_iff
import Definitions.Def_Couret_DivisorCompleteness_e4011d047800

/-!
COU-87 S2M, 2026-10-30: the exact bridge from natural divisors to the
eight-letter modulo-30 automaton. Prime occurrences need not be distinct.
No finite 147-state / 101-class table is imported here.
-/

universe v
namespace Couret



namespace Choice











end Choice

























Formal statement
theorem fullSupport_mod30_iff_divisor (w : Word Nat) (hp : w.primeFactors)
    (hc : Nat.gcd (total natProduct w) 30 = 1) (u : Code30) :
    fullSupport mod30Product (w.map encode30) u ↔
      ∃ d : Nat, d ∣ total natProduct w ∧ d % 30 = residue30 u := 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/ModularDivisorBridge.lean, lines 162–171; source file SHA-256 f72e04425efd9d90f42cc1765e52bcd661653cc739601fb88631de6f94f69c41; theorem Couret.fullSupport_mod30_iff_divisor

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