proof-writer

Generates a structured mathematical proof package with assumptions and dependencies.

Updated Apr 8, 2026
One-click install
npx skills add https://github.com/KYRIE66nb/codex-omx-public-config --skill proof-writer-kyrie66nb
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: proof-writer
Source: https://github.com/KYRIE66nb/codex-omx-public-config/tree/main/home/.codex/skills/proof-writer
Command: npx skills add https://github.com/KYRIE66nb/codex-omx-public-config --skill proof-writer-kyrie66nb

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Writing rigorous mathematical proofs for theories in ML/AI and related fields often requires assembling precise claims, assumptions, and formal steps. This skill delivers a structured, verifiable proof package that captures exact statements and dependencies rather than informal sketches.

Core Features & Use Cases

  • Complete proof package drafting: generate a full, justification-rich proof document for a stated theorem, lemma, proposition, or corollary.
  • Gap analysis and correction: identify missing steps and propose corrected claims with proofs.
  • Context extraction and workflow automation: collect exact claims, assumptions, notation, and nearby lemmas from local notes or drafts to streamline proof development.

Quick Start

Provide the exact theorem statement and any assumptions, and I will generate the Proof Package ready for review.

Frequently Asked Questions about proof-writer

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I write a rigorous mathematical proof for an AI or ML theorem?

To write a rigorous mathematical proof, provide the exact theorem statement and explicit assumptions to generate a structured proof package. This outputs a step-by-step, justification-heavy document detailing the exact claim, strategy, and open risks.

What is the best way to formalize assumptions and dependencies for a lemma?

Formalizing assumptions and dependencies for a lemma requires creating a structured dependency map within a PROOF_PACKAGE.md file. This process captures exact statements and nearby lemmas to automate rigorous proof development rather than informal sketches.

Can I identify missing steps and gaps in a formal mathematical proof?

Yes, you can identify missing steps in formal mathematical proofs through gap analysis. This process locates gaps in your reasoning and proposes corrected claims with corresponding justifications to ensure mathematical clarity.

How do I extract exact claims and notation from local drafts to streamline proof development?

Extracting exact claims and notation from local drafts uses context extraction to collect assumptions and nearby lemmas. This workflow automation streamlines proof development by assembling precise statements into a structured verifiable format.

Does generating a complete proof package require a specific file format?

Generating a complete proof package requires a PROOF_PACKAGE.md target file format. This structure ensures the output document captures exact claims, explicit assumptions, and a structured dependency map for verifiable formal reasoning.

When should I avoid using automated proof drafting for mathematical theorems?

You should avoid automated proof drafting when you only need informal sketches or lack explicit assumptions and a structured dependency map. The process requires formalization inputs to deliver justification-heavy documents with exact claims and open risks.