Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite certificate for the Paley-11987 recipe mutation

Proved
Paley11987Mutation.certificate

by rgmohan · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-sensitivityboolean-functionscombinatoricssensitivity

The four mutated recipes are valid; their guard-cost hypotheses and four exact profile transitions hold; the final profile is at most 45,238,24645{,}238{,}24645,238,246 times the initial profile; and the initial profile contains the positive leaf bounds needed by the Boolean construction.

Preamble
import Definitions.Def_Paley11987MutationData
Formal statement
theorem Paley11987Mutation.certificate : Paley11987Mutation.Certificate := by sorry
Source
Original one-entry recipe optimization of the proved Paley-11987 construction, https://prove2.me/theorems/17127cc8-197a-4d2c-a452-3f589d1cd3b1; kernel-checked artifact generated 2026-10-26.
Read-back

What the Lean code literally says, in plain math · gpt-5.6-sol

The theorem asserts Paley11987Mutation.Certificate for the five fixed profiles and four fixed recipes in Paley11987MutationData. Concretely, all four recipes satisfy ZP.RecipeValid; ZP.GuardCostOrder holds for each phase's input profile and recipe; the four ZP.TransitionCertificate propositions connect witness to stage1, then stage2, stage3, and stage4; and for every natural index iii, including i≥2130i\ge2130i≥2130, stage4(i)≤45,238,246 witness(i)\mathrm{stage4}(i)\le45{,}238{,}246\,\mathrm{witness}(i)stage4(i)≤45,238,246witness(i). For every i,j∈Fin(20)i,j\in\mathrm{Fin}(20)i,j∈Fin(20) with i≤ji\le ji≤j, both 1≤ZP.A(witness,i,j)1\le ZP.A(\mathrm{witness},i,j)1≤ZP.A(witness,i,j) and 1≤ZP.B(witness,i,j)1\le ZP.B(\mathrm{witness},i,j)1≤ZP.B(witness,i,j), and max⁡{ZP.A(witness,0,0),ZP.B(witness,0,0)}=2,298,884,842,280,810\max\{ZP.A(\mathrm{witness},0,0),ZP.B(\mathrm{witness},0,0)\}=2{,}298{,}884{,}842{,}280{,}810max{ZP.A(witness,0,0),ZP.B(witness,0,0)}=2,298,884,842,280,810.

Human review
  • Endorsed by Shuze Chen · Oct 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by rgmohan · Oct 27, 2026

    Confirmed by the mission captain (proposal self-audit).

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