derive-theoretical-result
Über
Diese Fähigkeit ermöglicht es Claude, strenge, schrittweise Herleitungen von Formeln oder Theoremen aus ersten Prinzipien durchzuführen und jeden Schritt explizit zu begründen. Sie ist für Anwendungsfälle wie das Beweisen mathematischer Aussagen, das Überprüfen von Lehrbuchresultaten oder das Erstellen eigenständiger Herleitungen für akademische Arbeiten konzipiert. Zu den Hauptmerkmalen gehören das Überprüfen von Spezialfällen und das logisch-deduktive Aufbauen auf etablierten Axiomen oder Theoremen.
Schnellinstallation
Claude Code
Empfohlennpx 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-resultKopieren Sie diesen Befehl und fügen Sie ihn in Claude Code ein, um diese Fähigkeit zu installieren
Dokumentation
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 Repository
Verwandte Skills
llamaguard
AndereLlamaGuard ist Metas 7-8B-Parameter-Modell zur Moderation von LLM-Eingaben und -Ausgaben in sechs Sicherheitskategorien wie Gewalt und Hassrede. Es bietet eine Genauigkeit von 94-95 % und kann mit vLLM, Hugging Face oder Amazon SageMaker eingesetzt werden. Nutzen Sie diese Skill, um Inhaltsfilterung und Sicherheitsguardrails einfach in Ihre KI-Anwendungen zu integrieren.
cost-optimization
AndereDiese Claude Skill unterstützt Entwickler bei der Optimierung von Cloud-Kosten durch Ressourcen-Dimensionierung, Tagging-Strategien und Ausgabenanalysen. Sie bietet einen Rahmen zur Senkung von Cloud-Ausgaben und zur Implementierung von Kosten-Governance für AWS, Azure und GCP. Nutzen Sie sie, wenn Sie Infrastrukturkosten analysieren, Ressourcen richtig dimensionieren oder Budgetvorgaben einhalten müssen.
quantizing-models-bitsandbytes
AndereDiese Fähigkeit quantisiert LLMs auf 8-Bit- oder 4-Bit-Präzision mittels bitsandbytes und erreicht dabei eine Speicherreduzierung von 50–75 % bei minimalem Genauigkeitsverlust. Sie ist ideal für den Betrieb größerer Modelle mit begrenztem GPU-Speicher oder zur Beschleunigung von Inferenzvorgängen und unterstützt Formate wie INT8, NF4 und FP4. Die Fähigkeit integriert sich in HuggingFace Transformers und ermöglicht QLoRA-Training sowie 8-Bit-Optimierer.
dispatching-parallel-agents
AndereDiese Claude-Fähigkeit verteilt mehrere Agenten, um drei oder mehr unabhängige Probleme gleichzeitig zu untersuchen und zu beheben. Sie ist für Szenarien konzipiert, die unabhängige Fehler umfassen, die ohne gemeinsamen Zustand oder Abhängigkeiten gelöst werden können. Die Kernfähigkeit ist die parallele Problemlösung, bei der pro unabhängigem Problembereich ein Agent zugewiesen wird, um die Effizienz zu maximieren.
