Subproduct rank certificate for mask 32
ProvedCouret.S5.rank_row_32couret-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_32 : RankFacts 32 := 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/RankBlock02.lean, lines 7–7; source file SHA-256 892ab82a03f018203ff4eb8a8bebb5d1750d0fb2cf1a92836703e32648dc36b2; theorem Couret.S5.rank_row_32