analysis-plan

Convert theory-first research ideas into proof-oriented analysis plans.

2|1|Updated May 7, 2026
One-click install
npx skills add https://github.com/shenmuxing/EtaSkill --skill analysis-plan-shenmuxing
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: analysis-plan
Source: https://github.com/shenmuxing/EtaSkill/tree/main/skill-examples/analysis-plan
Command: npx skills add https://github.com/shenmuxing/EtaSkill --skill analysis-plan-shenmuxing

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

This Skill helps convert an early-stage theory idea into a compact, proof-oriented research plan so you can clarify what must be proved, what assumptions are needed, and where the idea could fail before investing in experiments.

Core Features & Use Cases

  • Theory Framing: Classify the research object as a theorem, counterexample, lower bound, convergence claim, unification, or diagnostic principle.
  • Proof Obligation Mapping: Break the idea into precise claims, supporting lemmas, proof levers, and failure modes that can be checked independently.
  • Risk and Novelty Review: Surface boundary cases, disproof paths, and closest prior-work overlap so the plan is auditable and publication-ready.
  • Use Case: A researcher has a promising algorithmic hypothesis and wants a structured path to determine whether it is provable, falsifiable, or too weak to pursue.

Quick Start

Use the analysis-plan skill to turn this research idea into a theorem target, list the assumptions, and draft the proof obligations.

Frequently Asked Questions about analysis-plan

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

FAQPage Schema
How do I convert a research idea into a proof plan for theorem targeting?

A proof plan maps your assumptions to specific claims, identifies proof levers, and outlines disproof paths so you can check if a theorem is provable or falsifiable before investing in experiments.

What is proof obligation mapping for non-experimental research workflows?

Proof obligation mapping decomposes a theory-first hypothesis into precise claims, supporting lemmas, and independent failure modes to create an auditable, publication-ready research plan.

How do I hunt for counterexamples and assess disproof paths for a hypothesis?

Assess disproof paths by surfacing boundary cases and mapping failure modes to determine whether your hypothesis is falsifiable, provable, or too weak to pursue before committing to a full proof.

Can I use this approach for convergence analysis and lower-bound framing?

Yes, the approach supports convergence analysis and lower-bound framing by requiring explicit assumptions, claim decomposition, and boundary-case validation to structure these non-experimental research workflows.

When do I need to validate boundary cases and assumptions for a research plan?

Validate boundary cases and assumptions when converting an early-stage theory idea into an auditable research plan to clarify what must be proved and identify where the idea could fail before experimentation.

What are the limitations of theory-first planning for algorithmic hypotheses?

Theory-first planning is limited to non-experimental workflows and may not suit hypotheses that cannot be framed as theorems, counterexamples, or convergence claims, requiring explicit assumptions and claim decomposition to proceed.