derive-theoretical-result
关于
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.
快速安装
Claude Code
推荐npx skills add pjt222/agent-almanac -a claude-code/plugin add https://github.com/pjt222/agent-almanacgit clone https://github.com/pjt222/agent-almanac.git ~/.claude/skills/derive-theoretical-result在 Claude Code 中复制并粘贴此命令以安装该技能
技能文档
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:
- Axioms + postulates: Every assumption listed. Physics: symmetry group, action principle, QM postulates. Math: axiom sys + prior lemmas.
- Target: Precise notation. Equation → both sides. Inequality → direction + equality conds.
- Scope: Domain of validity (e.g., "non-relativistic, spinless, 3D"). State what not covered.
- 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:
- Algebra: Tensor, commutator, matrix, series. Verify prereqs (convergence, invertibility).
- Calc/analysis: ODE/PDE, integration + domain, functional derivs, contour, distributions. Verify regularity (differentiability, integrability, analyticity).
- Symmetry/group theory: Irreps, Clebsch-Gordan, character orthogonality, Wigner-Eckart.
- Topology/geometry (if applicable): Manifolds, bundles, connections + topo constraints (boundary terms, winding, index).
- 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:
- One op per step: No combining.
- 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)
- Checkpoints (every 5-10 steps):
- Units/dimensions consistent
- Symmetries preserved
- Correct transformation props
- 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:
-
Limits (≥3): Simpler prior formula (non-rel limit), trivial case (coupling=0), extreme regime (high/low T).
-
Special values: Known independent (n=1 hydrogen, d=3).
-
Symmetry: Correct under group. Scalar → invariant. Vector → transforms right.
-
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:
- Narrative: Intro para → motivation, approach, main result.
- Body: Steps from Step 3 cleaned. Group → logical blocks w/ headings.
- Result box: Highlighted, separated.
- Glossary: Every symbol + meaning + units + first occurrence.
- 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 derivingsurvey-theoretical-literature— find prior derivations for comparison
GitHub 仓库
相关推荐技能
llamaguard
其他LlamaGuard是Meta推出的7-8B参数内容审核模型,专门用于过滤LLM的输入和输出内容。它能检测六大安全风险类别(暴力/仇恨、性内容、武器、违禁品、自残、犯罪计划),准确率达94-95%。开发者可通过HuggingFace、vLLM或Sagemaker快速部署,并能与NeMo Guardrails集成实现自动化安全防护。
cost-optimization
其他这个Claude Skill帮助开发者优化云成本,通过资源调整、标记策略和预留实例来降低AWS、Azure和GCP的开支。它适用于减少云支出、分析基础设施成本或实施成本治理策略的场景。关键功能包括提供成本可视化、资源规模调整指导和定价模型优化建议。
quantizing-models-bitsandbytes
其他这个Skill使用bitsandbytes库量化大语言模型,能在GPU内存有限时通过8位或4位量化减少50-75%内存占用,同时保持精度损失最小。它支持INT8、NF4、FP4等多种量化格式,可与HuggingFace Transformers无缝集成,适用于需要部署更大模型或加速推理的场景。还提供QLoRA训练和8位优化器支持,让开发者能轻松实现高效模型压缩。
dispatching-parallel-agents
其他该Skill用于并行处理3个以上无依赖关系的独立故障,可为每个问题域分派专属Claude代理同时执行调查修复。它通过并发处理多个独立问题显著提升故障排查效率,特别适用于测试文件、子系统等无共享状态的场景。
