derive-theoretical-result
关于
This skill generates rigorous, step-by-step derivations of formulas or theorems from first principles, explicitly justifying each logical step. It's designed for use cases like proving mathematical statements, verifying textbook results, or creating self-contained proofs for papers. Key features include checking special cases and building upon established theorems for verification or adaptation.
快速安装
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
Produce a rigorous, step-by-step derivation of a theoretical result starting from stated axioms, first principles, or established theorems. Every algebraic or logical step is explicitly justified, limiting cases are verified, and the final result is presented with a complete notation glossary.
When to Use
- Deriving a formula, relation, or theorem from first principles (e.g., deriving the Euler-Lagrange equation from the action principle)
- Proving a mathematical statement by logical deduction from axioms
- Re-deriving a textbook result to verify it or adapt it to a modified context
- Extending a known result to a more general setting (e.g., from flat spacetime to curved spacetime)
- Producing a self-contained derivation for a paper, thesis, or technical report
Inputs
- Required: Target result to derive (equation, inequality, theorem statement, or relation)
- Required: Starting point (axioms, postulates, previously established results, or Lagrangian/Hamiltonian)
- Optional: Preferred proof technique (direct, by contradiction, by induction, variational, constructive)
- Optional: Notation conventions to follow (if matching a specific textbook or collaborator's conventions)
- Optional: Known intermediate results that may be cited without re-derivation
Procedure
Step 1: State Starting Assumptions and Target Result
Write the derivation's contract explicitly before any calculation:
- Axioms and postulates: List every assumption the derivation rests on. For physics, this includes the symmetry group, the action principle, or the postulates of quantum mechanics. For mathematics, this includes the axiom system and any previously proven lemmas.
- Target result: State the result to be derived in precise mathematical notation. If the result is an equation, write both sides. If it is an inequality, state the direction and the conditions for equality.
- Scope and restrictions: State the domain of validity (e.g., "valid for non-relativistic, spinless particles in three dimensions"). Identify what the derivation does not cover.
- Notation declaration: Define every symbol that will appear. This prevents ambiguity and makes the derivation 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]
- ...
Got: A complete, unambiguous statement of what is being derived from what, with all notation defined upfront.
If fail: If the target result is ambiguous or the starting assumptions are incomplete, clarify before proceeding. A derivation with hidden assumptions is unreliable.
Step 2: Identify Required Mathematical Machinery
Survey the tools needed and verify their applicability:
- Algebraic techniques: Identify required manipulations (tensor algebra, commutator algebra, matrix operations, series expansions). Verify that the structures involved satisfy the prerequisites (e.g., convergence conditions for series, invertibility for matrix operations).
- Calculus and analysis: Identify whether the derivation requires ordinary or partial differentiation, integration (and over what domain), functional derivatives, contour integration, or distribution theory. Verify regularity conditions (differentiability, integrability, analyticity).
- Symmetry and group theory: Identify representation-theoretic tools needed (irreducible representations, Clebsch-Gordan coefficients, character orthogonality, Wigner-Eckart theorem).
- Topology and geometry (if applicable): Identify geometric structures (manifolds, fiber bundles, connections) and topological constraints (boundary terms, winding numbers, index theorems).
- Known identities and lemmas: Collect the specific identities that will be invoked (e.g., Jacobi identity, Bianchi identity, integration by parts, Stokes' theorem). State each one explicitly so the derivation can cite them 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]
Got: A checklist of mathematical tools with their applicability conditions verified for the specific problem at hand.
If fail: If a required tool has unverified prerequisites (e.g., term-by-term differentiation of a series whose uniform convergence is unknown), flag it as a gap. Either prove the prerequisite or state it as an additional assumption.
Step 3: Execute Derivation with Step-by-Step Justification
Carry out the derivation with every step labeled and justified:
- One operation per step: Each numbered step performs exactly one algebraic or logical operation. Do not combine multiple manipulations into a single step.
- Justification labels: Tag each step with its justification. Common labels:
[by assumption]-- invoking a stated axiom or assumption[by definition]-- using a previously declared definition[by {identity name}]-- applying a named identity (e.g., "by Jacobi identity")[by Step N]-- citing a previous step in this derivation[by {theorem name}]-- invoking an external theorem (stated in Step 2)
- Intermediate checkpoints: After every 5-10 steps, pause and verify:
- Units/dimensions are consistent on both sides
- Known symmetries are preserved
- The expression has the correct transformation properties
- Branch points: If the derivation branches (e.g., case analysis for degenerate vs. non-degenerate eigenvalues), treat each branch as a labeled sub-derivation and merge the results.
## 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
Got: A linear sequence of steps from the starting point to the target result, with no gaps in logic. Every step is independently verifiable.
If fail: If a step does not follow from the previous one, the derivation has a gap. Either insert the missing intermediate steps or identify the additional assumption needed. Never skip a step with "it can be shown that" unless the omitted result is a well-known identity listed in Step 2.
Step 4: Check Limiting Cases and Special Values
Validate the derived result against known physics or mathematics:
-
Limiting cases: Identify at least three limiting cases where the result should reduce to something known:
- A simpler, previously derived formula (e.g., non-relativistic limit of a relativistic result)
- A trivial case (e.g., setting a coupling constant to zero)
- An extreme parameter regime (e.g., high-temperature or low-temperature limit)
-
Special values: Substitute specific values of parameters where the answer is known independently (e.g., n=1 for the hydrogen atom, d=3 for three-dimensional results).
-
Symmetry checks: Verify that the result transforms correctly under the symmetry group. If the result should be a scalar, check that it is invariant. If it should be a vector, check its transformation law.
-
Consistency with related results: Check that the derived result is consistent with other known results in the same theory (e.g., Ward identities, sum rules, reciprocity relations).
## Limiting Case Verification
| Case | Condition | Expected Result | Derived Result | Match |
|------|-----------|----------------|----------------|-------|
| [name] | [parameter limit] | [known result] | [substitution] | [Yes/No] |
| ... | ... | ... | ... | ... |
Got: All limiting cases and special values produce the expected results. The derivation is internally consistent.
If fail: A failed limiting case indicates an error in the derivation. Trace the failure back by checking which step first produces an expression that fails the limit. Common causes: incorrect sign, missing factor of 2 or pi, wrong combinatorial coefficient, or a step where an order of limits matters.
Step 5: Present Complete Derivation with Notation Glossary
Assemble the final, polished derivation:
- Narrative structure: Write a brief introductory paragraph stating the physical or mathematical motivation, the approach, and the main result.
- Derivation body: Present the steps from Step 3, cleaned up for readability. Group related steps into logical blocks with descriptive headings (e.g., "Expanding the action to second order", "Applying the stationary phase condition").
- Result box: State the final result in a highlighted block, clearly separated from the derivation.
- Notation glossary: Compile every symbol used in the derivation with its meaning, units (if physical), and first occurrence.
- Assumptions summary: List all assumptions in a single place, distinguishing fundamental postulates from technical assumptions (e.g., 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. ...
Got: A self-contained document that a reader can follow from start to finish without consulting external references, except for the explicitly cited identities and theorems.
If fail: If the derivation is too long for a single document (more than ~50 steps), break it into lemmas. Derive each lemma separately, then assemble the main result by citing the lemmas.
Validation
- All starting assumptions are explicitly stated before the first calculation step
- Every derivation step has a labeled justification (no unjustified leaps)
- Units and dimensions are consistent at every intermediate checkpoint
- At least three limiting cases are checked and produce expected results
- Special values match independently known answers
- The result transforms correctly under the stated symmetry group
- A notation glossary defines every symbol used
- The derivation is complete: no steps are deferred with "it can be shown"
- The domain of validity is explicitly stated with the final result
Pitfalls
- Hidden assumptions: Assuming a function is analytic, a series converges, or an integral exists without stating it. Every regularity condition is an assumption and must be declared.
- Sign errors: The most common mechanical error. Verify signs at every step by tracking them through substitutions. Cross-check against dimensional analysis (a sign error often produces a dimensionally inconsistent expression).
- Dropped boundary terms: When integrating by parts or applying Stokes' theorem, boundary terms vanish only if specific conditions are met. State why they vanish (e.g., "because the field decays faster than 1/r at infinity").
- Order of limits: Taking limits in the wrong order can give different results (e.g., thermodynamic limit before zero-temperature limit). State the order explicitly and justify it.
- Circular reasoning: Using the result to be derived as an intermediate step. This is especially subtle when the result is a well-known formula that "seems obvious." Every step must follow from the stated starting point, not from familiarity with the answer.
- Notation collisions: Using the same symbol for different quantities (e.g., 'E' for energy and for electric field). The notation glossary prevents this, but only if it is written before the derivation rather than after.
Related Skills
formulate-quantum-problem-- formulate the quantum mechanical framework before deriving results from itsurvey-theoretical-literature-- find prior derivations of the same or related results 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代理同时执行调查修复。它通过并发处理多个独立问题显著提升故障排查效率,特别适用于测试文件、子系统等无共享状态的场景。
