Subproduct rank certificate for mask 65
ProvedCouret.S5.rank_row_65couret-programmecouret-unification-20261108
Let be the fixed subproduct mask, let be its tabulated rank, and let be its support in the residue-code group , with identity . For every residue code , write for the mask after adjoining that code. Then
The last assertion includes every code without restrictions. This certificate provides one row of the finite rank argument for the five-factor threshold.
Preamble
import Definitions.Def_Couret_RankBlock00_bd2f9788729f import Std import Definitions.Def_Couret_RankBlock00_bd2f9788729f set_option maxRecDepth 100000 set_option maxHeartbeats 4000000 namespace Couret namespace S5
Formal statement
theorem rank_row_65 : RankFacts 65 := 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/RankBlock04.lean, lines 8–8; source file SHA-256 68222c858830a0c00cda6c41384eaefb0092251c70b6430ca331c5231337e785; theorem Couret.S5.rank_row_65