derive-theoretical-result
정보
이 스킬은 클로드가 공식이나 정리를 첫 원리부터 엄격하게 단계별로 유도하며, 각 단계를 명시적으로 정당화할 수 있게 합니다. 수학적 명제 증명, 교과서 결과 검증, 학술 작업을 위한 자체 포함 유도문 작성과 같은 사용 사례를 위해 설계되었습니다. 주요 기능으로는 특수 사례 검증과 확립된 공리나 정리를 논리적 추론으로 확장하는 것이 포함됩니다.
빠른 설치
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-resultClaude 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는 폭력 및 혐오 발언 등 6가지 안전 범주에서 LLM 입력과 출력을 조정하기 위한 Meta의 70-80억 파라미터 모델입니다. 94-95% 정확도를 제공하며 vLLM, Hugging Face 또는 Amazon SageMaker를 사용해 배포할 수 있습니다. 이 기술을 사용하여 AI 애플리케이션에 콘텐츠 필터링 및 안전 가드레일을 손쉽게 통합하세요.
cost-optimization
기타이 Claude Skill은 리소스 적정화, 태깅 전략, 지출 분석을 통해 개발자들이 클라우드 비용을 최적화할 수 있도록 지원합니다. AWS, Azure, GCP에서 클라우드 비용을 절감하고 비용 거버넌스를 구현하기 위한 프레임워크를 제공합니다. 인프라 비용을 분석하거나, 리소스를 적정화하거나, 예산 제약을 충족해야 할 때 사용하세요.
quantizing-models-bitsandbytes
기타이 스킬은 bitsandbytes를 사용하여 LLM을 8비트 또는 4비트 정밀도로 양자화하며, 최소한의 정확도 손실로 50-75%의 메모리 감소를 달성합니다. 제한된 GPU 메모리에서 더 큰 모델을 실행하거나 추론을 가속화하는 데 이상적이며, INT8, NF4, FP4와 같은 형식을 지원합니다. 이 스킬은 HuggingFace Transformers와 통합되어 QLoRA 학습 및 8비트 옵티마이저를 가능하게 합니다.
dispatching-parallel-agents
기타이 Claude Skill은 3개 이상의 독립적인 문제를 동시에 조사하고 해결하기 위해 다중 에이전트를 배치합니다. 공유 상태나 의존성 없이 해결 가능한 무관련 장애 시나리오에 맞게 설계되었습니다. 핵심 기능은 병렬 문제 해결로, 각 독립 문제 영역마다 하나의 에이전트를 할당하여 효율성을 극대화합니다.
