Finite certificate for the Paley-11987 recipe mutation
ProvedPaley11987Mutation.certificateThe four mutated recipes are valid; their guard-cost hypotheses and four exact profile transitions hold; the final profile is at most times the initial profile; and the initial profile contains the positive leaf bounds needed by the Boolean construction.
import Definitions.Def_Paley11987MutationData
theorem Paley11987Mutation.certificate : Paley11987Mutation.Certificate := by sorry
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 , including , . For every with , both and , and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.