proof-writer

Construct and verify mathematical proofs for ML/AI theory.

Updated Apr 18, 2026
One-click install
npx skills add https://github.com/THUFanZd/Sewed_pipeline --skill proof-writer-thufanzd
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: proof-writer
Source: https://github.com/THUFanZd/Sewed_pipeline/tree/main/.agents/skills/proof-writer
Command: npx skills add https://github.com/THUFanZd/Sewed_pipeline --skill proof-writer-thufanzd

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Writes mathematically honest proofs for ML/AI theory, including filling in missing proof steps, formalizing a proof sketch, 补全证明, 写证明, or determining whether a claimed proof can actually be completed under the stated assumptions.

Core Features & Use Cases

  • Produce a complete Proof Package containing the exact claim, explicit assumptions, notation, proof strategy, dependency map, numbered steps, and justification for every nontrivial implication.
  • Assess feasibility by classifying the claim as provable as stated, provable after weakening or extra assumptions, or not justified, and provide blockage reports when needed.
  • Provide structured outputs suitable for audit and peer review, including explicit status, dependency maps, and a dedicated "Open Risks" section for edge cases.

Quick Start

Provide a complete Proof Package for the requested theorem following the required file structure and rigorous validation steps.

Frequently Asked Questions about proof-writer

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

FAQPage Schema
How do I write rigorous mathematical proofs for ML theory?

To write rigorous mathematical proofs for ML theory, you can generate a complete Proof Package containing explicit assumptions, notation, numbered steps, and justifications for nontrivial implications. This automates proof construction and verification for theorems or lemmas.

How do I formalize a proof sketch and fill in missing steps for a theorem?

To formalize a proof sketch and fill in missing steps, provide the sketch to generate a structured proof document with a dependency map and rigorous validation. This completes the proof package by detailing every nontrivial implication required for peer review.

Can I assess if a claimed theorem is provable under the stated assumptions?

Yes, you can assess if a claimed theorem is provable under the stated assumptions by classifying the claim as provable as stated, provable after weakening, or not justified. This generates a blockage report detailing open risks and edge cases.

What is the best way to structure a proof for audit and peer review?

The best way to structure a proof for audit and peer review is to produce a Proof Package with explicit status, a dependency map, and a dedicated Open Risks section. This format ensures every nontrivial implication has explicit justification.

Does this proof-writing approach work for lemmas and corollaries in project codebases?

Yes, this proof-writing approach works for lemmas and corollaries within project codebases. It automates the rigorous construction of mathematical proofs for ML/AI theory, directly integrating the formalized proof steps and notation into your existing project files.