Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The empty subproduct mask has rank zero

Proved
Couret.S5.rank_initial

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

couret-programmecouret-unification-20261108

The tabulated rank of mask zero is

r(0)=0.r(0)=0.r(0)=0.

This initializes the finite rank argument.

Preamble
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Std
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
import Definitions.Def_Couret_RankBlock00_bd2f9788729f
set_option maxRecDepth 100000
set_option maxHeartbeats 4000000
namespace Couret
namespace S5
Formal statement
theorem rank_initial : rank 0 = 0 := 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/RankChecks.lean, lines 21–21; source file SHA-256 b8d60d7ded486a808030beca51d8511969230b1e678abc7a67c0f65b3a068232; theorem Couret.S5.rank_initial

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