跳至正文
OpenAgentSkill
浏览已开放 · 目录记录日期 2026-11-21 · 自动更新和账户服务暂时关闭。
效率与协作

math-proof

Write clear, detailed mathematical proofs for academic papers. Use when

Moran Koren <korenmor@bgu.ac.il> (Ben-Gurion University of the Negev) · 已有静态检查记录

安装与使用

运行命令前先阅读来源与依赖说明。复制命令不会自动安装或执行。

npx skills add morankor/theorist-toolbox --skill math-proof

技能说明


name: math-proof description: Write clear, detailed mathematical proofs for academic papers. Use when the user asks to prove a result, derive an equation, justify a claim analytically, or expand a proof sketch into a full proof. Also trigger on "prove", "show analytically", "derive", "justify mathematically", or "write a proof". author: Moran Koren korenmor@bgu.ac.il (Ben-Gurion University of the Negev)

Math proof

Author: Moran Koren, Ben-Gurion University of the Negev (korenmor@bgu.ac.il). Part of the Theorist Toolbox.

Write rigorous mathematical proofs suitable for peer-reviewed academic papers. Every step should be explicit enough that a reader can verify it without filling in gaps. The proof must be a complete proof, not a proof outline — each step should be carefully explained and documented.

Trigger phrases

  • /math-proof
  • "prove this"
  • "show analytically"
  • "derive this result"
  • "justify mathematically"
  • "write a proof"
  • "expand this proof"

Proof strategy

Before writing a single line of algebra, invest time in planning:

Choose an approach before committing

Consider at least two proof strategies and state why you chose one:

  • Direct proof: Assume hypotheses, derive conclusion step by step.
  • Proof by contradiction: Assume the negation; derive a contradiction.
  • Proof by contrapositive: Prove $\neg Q \Rightarrow \neg P$ instead of $P \Rightarrow Q$.
  • Mathematical induction: Base case plus inductive step.
  • Constructive proof: Exhibit the object whose existence you claim.
  • Proof by exhaustion: Enumerate all cases and handle each.

Attack the hardest step first

Identify the single most technically demanding step before starting. If you cannot see how to close that step, the entire proof strategy may be wrong. Discovering this before writing three pages of algebra saves significant effort.

Prove simpler cases as scaffolding

Before tackling the general claim, prove it for a simple special case ($n=1$, $x=0$, a symmetric configuration, etc.). The special case often reveals the structure of the general proof. Label these explicitly as "Special case" or "Warm-up" — they are scaffolding, not the proof itself.

Retrieve before you generate (RAG)

Before writing any algebra, inventory your tools:

  1. List all theorems and lemmas you expect to use, by name.
  2. For each, confirm it is either (a) well-known (Wikipedia page, standard undergraduate course) or (b) something you will prove inline.
  3. Check whether a weaker version of the claim — or a closely related result — is already proved earlier in the paper or in a standard reference. Reuse it rather than reprove it.

Do not attempt the main proof without first knowing which tools are in your kit. Discovering mid-proof that a key lemma is either false or requires its own long proof is the most common cause of a failed proof attempt.

Sub-agent decomposition

For complex proofs, treat each major sub-claim as an independent proof task:

  1. Identify independent sub-claims: What facts must be true for the main proof to go through? State each as a precise formal claim.
  2. Prove each sub-claim in isolation: Each lemma proof stands alone — it should not assume facts from sibling lemmas unless they are explicitly passed in as hypotheses.
  3. Assemble the main proof last: The main proof should be short and structural, citing the proved lemmas rather than re-deriving their content.
  4. Check the assembly: Verify that the hypotheses of each lemma are actually satisfied at the call site in the main proof.

This mirrors how AlphaProof handled IMO problems: individual sub-goals are proved and verified independently, then composed into a complete solution. A gap in assembly — using a lemma whose hypotheses are not met — is as fatal as a gap in the lemma itself.

AlphaProof-inspired pipeline

AlphaProof (DeepMind, 2024) solved IMO problems at silver-medal level using a five-stage loop. Apply the same loop to any proof task:

Stage 1 — Formalize

Translate the natural-language claim into a precise formal statement before touching any algebra:

  • Write hypotheses as a bulleted list of mathematical conditions.
  • Write the conclusion as a single mathematical statement.
  • Assign explicit names to all objects, functions, and parameters.
  • Surface all implicit assumptions (e.g., $n \in \mathbb{N}$, $f$ continuous, $\varepsilon > 0$) and write them down.

If you cannot write a clean formal statement, the claim is ambiguous. Clarify with the user before proceeding.

Stage 2 — Retrieve

Inventory relevant results (see "Retrieve before you generate" in Proof Strategy above). Do not enter Stage 3 until your toolkit is assembled.

Stage 3 — Generate with sub-agent decomposition

Decompose into independent sub-claims and prove each in isolation (see "Sub-agent decomposition" above). Consider multiple proof strategies in parallel; abandon any path where the hardest step is not closable.

Stage 4 — Verify

Apply the mechanistic verifiability check to every line (see Core Principles). For maximum rigor, translate the proof into Lean 4 (see "Lean verification" below). Only accept a step that survives this check.

Stage 5 — Iterate

If verification fails at a step, do not patch around it. Return to Stage 3, understand why the step fails, and either find a new proof path or state explicitly what additional lemma would be needed to close the gap. A confident-sounding patch over a failed step is worse than an honest "this step requires further work."

Core principles

No gaps between steps

Every transition from one equation to the next must be justified. If you use the quotient rule, say so. If you substitute a definition, point to which definition. If a sign is negative, explain why. The reader should never need to work out an intermediate step on their own.

Bad: $$\frac{d}{d\rho}\frac{n_G

阅读完整来源 ↗