SKILL·3AFBE1

derive-theoretical-result

pjt222
Updated 1 month ago
9 views
21
3
21
View on GitHub
Otherai

About

This skill enables Claude to perform rigorous, step-by-step derivations of formulas or theorems from first principles, explicitly justifying each step. It's designed for use cases like proving mathematical statements, verifying textbook results, or creating self-contained derivations for academic work. Key features include checking special cases and building upon established axioms or theorems with logical deduction.

Quick Install

Claude Code

Recommended
Primary
npx skills add pjt222/agent-almanac -a claude-code
Plugin CommandAlternative
/plugin add https://github.com/pjt222/agent-almanac
Git CloneAlternative
git clone https://github.com/pjt222/agent-almanac.git ~/.claude/skills/derive-theoretical-result

Copy and paste this command in Claude Code to install this skill

Documentation

Derive Theoretical Result

Rigorous step-by-step derivation from axioms/first principles/theorems. Every step justified. Limiting cases checked. Final result + notation glossary.

Use When

  • Formula/theorem from first principles (e.g., Euler-Lagrange from action)
  • Math proof by logic from axioms
  • Re-derive textbook → verify/adapt
  • Extend known → more general (flat → curved spacetime)
  • Self-contained → paper/thesis/report

In

  • Required: Target result (equation, inequality, theorem, relation)
  • Required: Starting point (axioms, postulates, prior results, Lagrangian/Hamiltonian)
  • Optional: Proof technique (direct, contradiction, induction, variational, constructive)
  • Optional: Notation conventions
  • Optional: Known intermediate results citable w/o re-deriving

Do

Step 1: State assumptions + target

Contract before calc:

  1. Axioms + postulates: Every assumption listed. Physics: symmetry group, action principle, QM postulates. Math: axiom sys + prior lemmas.
  2. Target: Precise notation. Equation → both sides. Inequality → direction + equality conds.
  3. Scope: Domain of validity (e.g., "non-relativistic, spinless, 3D"). State what not covered.
  4. Notation: Define every symbol. Self-contained.
## Derivation Contract
- **Starting from**: [axioms, postulates, or established results]
- **Target**: [precise mathematical statement]
- **Domain of validity**: [restrictions and assumptions]
- **Notation**:
  - [symbol]: [meaning and units]
  - ...

→ Complete unambiguous statement. Notation up front.

If err: Target ambiguous/assumptions incomplete → clarify before proceed. Hidden assumptions → unreliable.

Step 2: Math toolkit

Tools + applicability:

  1. Algebra: Tensor, commutator, matrix, series. Verify prereqs (convergence, invertibility).
  2. Calc/analysis: ODE/PDE, integration + domain, functional derivs, contour, distributions. Verify regularity (differentiability, integrability, analyticity).
  3. Symmetry/group theory: Irreps, Clebsch-Gordan, character orthogonality, Wigner-Eckart.
  4. Topology/geometry (if applicable): Manifolds, bundles, connections + topo constraints (boundary terms, winding, index).
  5. Identities/lemmas: Specific ones invoked (Jacobi, Bianchi, integration by parts, Stokes). State explicitly, cite by name.
## Mathematical Toolkit
- **Algebra**: [techniques and prerequisites]
- **Analysis**: [calculus tools and regularity conditions]
- **Symmetry**: [group theory tools]
- **Identities to invoke**: [list with precise statements]

→ Checklist w/ applicability verified.

If err: Unverified prereqs (e.g., term-by-term diff w/o uniform convergence) → flag gap. Prove or state as additional assumption.

Step 3: Execute w/ justification

Every step labeled + justified:

  1. One op per step: No combining.
  2. Justification labels:
    • [by assumption] — stated axiom/assumption
    • [by definition] — prior definition
    • [by {identity name}] — named identity (e.g., "by Jacobi identity")
    • [by Step N] — prior step
    • [by {theorem name}] — external theorem (Step 2)
  3. Checkpoints (every 5-10 steps):
    • Units/dimensions consistent
    • Symmetries preserved
    • Correct transformation props
  4. Branches: Case analysis → each branch labeled sub-derivation, merge.
## Derivation

**Step 1.** [Starting expression]
*Justification*: [by assumption / definition]

**Step 2.** [Result of operation on Step 1]
*Justification*: [specific reason]

...

**Checkpoint (after Step N).** Verify:
- Dimensions: [check]
- Symmetry: [check]

...

**Step M.** [Final expression = Target result]
*Justification*: [final operation]  QED

→ Linear sequence, no logic gaps. Every step verifiable.

If err: Step doesn't follow → gap. Insert intermediates or identify new assumption. No "it can be shown" unless well-known identity listed Step 2.

Step 4: Limiting cases + special values

Validate vs known:

  1. Limits (≥3): Simpler prior formula (non-rel limit), trivial case (coupling=0), extreme regime (high/low T).

  2. Special values: Known independent (n=1 hydrogen, d=3).

  3. Symmetry: Correct under group. Scalar → invariant. Vector → transforms right.

  4. Consistency: Ward identities, sum rules, reciprocity.

## Limiting Case Verification
| Case | Condition | Expected Result | Derived Result | Match |
|------|-----------|----------------|----------------|-------|
| [name] | [parameter limit] | [known result] | [substitution] | [Yes/No] |
| ... | ... | ... | ... | ... |

→ All limits + special values match. Internally consistent.

If err: Failed limit → err in derivation. Trace to first step producing fail. Common: sign, missing 2/π, wrong combinatorial coeff, wrong order of limits.

Step 5: Final w/ notation glossary

Polished:

  1. Narrative: Intro para → motivation, approach, main result.
  2. Body: Steps from Step 3 cleaned. Group → logical blocks w/ headings.
  3. Result box: Highlighted, separated.
  4. Glossary: Every symbol + meaning + units + first occurrence.
  5. Assumptions summary: All in one place, postulates vs technical (smoothness, convergence).
## Final Result

> **Theorem/Result**: [precise statement with equation number]

## Notation Glossary
| Symbol | Meaning | Units | First appears |
|--------|---------|-------|---------------|
| [sym] | [meaning] | [units or dimensionless] | [Step N] |
| ... | ... | ... | ... |

## Assumptions
1. [Fundamental postulate 1]
2. [Technical assumption 1]
3. ...

→ Self-contained doc, followable start to finish w/o external refs (except cited identities + theorems).

If err: Too long (>~50 steps) → break into lemmas. Derive each, assemble main result citing lemmas.

Check

  • All starting assumptions stated before first calc
  • Every step labeled justification (no unjustified leaps)
  • Units/dimensions consistent at every checkpoint
  • ≥3 limiting cases checked + match
  • Special values match known
  • Result transforms correctly under stated symmetry
  • Glossary defines every symbol
  • No deferred "it can be shown"
  • Domain of validity stated w/ result

Traps

  • Hidden assumptions: Analyticity, convergence, integral existence w/o stating. Every regularity cond = assumption, declare.
  • Sign errs: Most common mech err. Track at every step. Cross-check dim analysis (sign err → dim inconsistent).
  • Dropped boundary terms: Integration by parts / Stokes → boundary terms vanish only under conds. State why (e.g., "field decays > 1/r at infinity").
  • Order of limits: Wrong order → diff results (thermodynamic before zero-T). State order explicit + justify.
  • Circular reasoning: Using result as intermediate. Subtle for "obvious" formulas. Every step from stated start, not answer familiarity.
  • Notation collisions: Same symbol for diff quantities (E = energy + E-field). Glossary prevents — IF written before derivation.

  • formulate-quantum-problem — formulate QM framework before deriving
  • survey-theoretical-literature — find prior derivations for comparison

GitHub Repository

pjt222/agent-almanac
Path: i18n/caveman-ultra/skills/derive-theoretical-result
0
agentsagentskillsai-assisted-developmentclaude-codeskillsteams
FAQ

Frequently asked questions

What is the derive-theoretical-result skill?

derive-theoretical-result is a Claude Skill by pjt222. Skills package instructions and resources that Claude loads on demand, so Claude can perform derive-theoretical-result-related tasks without extra prompting.

How do I install derive-theoretical-result?

Use the install commands on this page: add derive-theoretical-result to Claude Code as a plugin, or clone its repository into your skills directory, then restart Claude so it picks up the skill.

What category does derive-theoretical-result belong to?

derive-theoretical-result is in the Other category, tagged ai.

Is derive-theoretical-result free to use?

Yes. derive-theoretical-result is listed on AIMCP and free to install. It runs inside Claude, so no separate service account is required to use the skill itself.

Related Skills

llamaguard
Other

LlamaGuard is Meta's 7-8B parameter model for moderating LLM inputs and outputs across six safety categories like violence and hate speech. It offers 94-95% accuracy and can be deployed using vLLM, Hugging Face, or Amazon SageMaker. Use this skill to easily integrate content filtering and safety guardrails into your AI applications.

View skill
cost-optimization
Other

This Claude Skill helps developers optimize cloud costs through resource rightsizing, tagging strategies, and spending analysis. It provides a framework for reducing cloud expenses and implementing cost governance across AWS, Azure, and GCP. Use it when you need to analyze infrastructure costs, right-size resources, or meet budget constraints.

View skill
quantizing-models-bitsandbytes
Other

This skill quantizes LLMs to 8-bit or 4-bit precision using bitsandbytes, achieving 50-75% memory reduction with minimal accuracy loss. It's ideal for running larger models on limited GPU memory or accelerating inference, supporting formats like INT8, NF4, and FP4. The skill integrates with HuggingFace Transformers and enables QLoRA training and 8-bit optimizers.

View skill
sports-betting-analyzer
Other

This Claude Skill analyzes sports betting markets including spreads, over/unders, and prop bets by examining historical trends and situational statistics to identify value bets. It provides structured markdown output with actionable recommendations for educational purposes. Developers should use this for sports betting analysis tools while noting it's designed for entertainment/education only.

View skill