proof-writer

Draft rigorous mathematical proofs for ML/AI theory claims.

1|Updated Mar 26, 2026
One-click install
npx skills add https://github.com/Lingrongye/federated-learning --skill proof-writer-lingrongye
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: proof-writer
Source: https://github.com/Lingrongye/federated-learning/tree/main/Auto-claude-code-research-in-sleep/skills/proof-writer
Command: npx skills add https://github.com/Lingrongye/federated-learning --skill proof-writer-lingrongye

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Writes rigorous mathematical proofs for ML/AI theory. Transform user claims into formal, verifiable arguments and identify gaps in reasoning.

Core Features & Use Cases

  • Fills in missing proof steps and formalizes proof sketches for theorems, lemmas, propositions, and corollaries in ML/AI contexts.
  • Validates assumptions, notation, and structure, offering stepwise justification and error checks against standard mathematical frameworks.
  • Use Case: A researcher asks to prove a claimed convergence theorem under specified learning dynamics; the tool outputs a complete proof or a corrected claim with justification.

Quick Start

Provide an exact theorem statement and assumptions, then request a complete or corrected proof draft.

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/AI theorems?

To write rigorous ML/AI proofs, provide an exact theorem statement and explicit assumptions to formalize your claim into a structured proof package with step-by-step justifications and a dependency map.

Can I use this to formalize proof sketches and fill in missing steps for lemmas?

Yes, you can formalize proof sketches and fill in missing steps for theorems, lemmas, propositions, and corollaries by validating your notation and assumptions against standard mathematical frameworks.

What is the best way to prove a claimed convergence theorem under specified learning dynamics?

The best way to prove a convergence theorem is to supply the exact claim and learning dynamics, which generates a complete proof draft or a corrected claim with stepwise justification and error checks.

Does formalizing ML/AI theory proofs require exact notation and assumptions?

Yes, formalizing ML/AI proofs requires exact claim normalization, explicit assumptions, and notation to identify gaps in reasoning and output verifiable mathematical arguments.

Why does my ML/AI theorem proof draft have gaps in reasoning?

Your proof draft has reasoning gaps due to unnormalized claims or implicit assumptions, which this approach identifies by validating structure and applying error checks against standard mathematical frameworks.

What should I provide to get a corrected proof draft for my research notes?

You should provide an exact theorem statement and assumptions from your research notes to receive a formalized, verifiable proof draft or a corrected claim with structured justification.