teach
Explain any concept from absolute scratch using first principles, analogies, examples, and progressive complexity.
Skill by rafeeqinea
Install
Works with Claude Code, Claude apps, Codex, Cursor, Gemini CLI, GitHub Copilot, VS Code, OpenCode, Goose, Windsurf. Read the repository before you give any tool access to your data.
npx agentmarket install skill/rafeeqinea-teach
Asks which of your tools to add it to (Claude Code, Codex, Cursor, VS Code, Windsurf, Gemini CLI, Claude Desktop) and shows the change first. See https://agentmart.dev/cli.
Get the weekly diff
The weekly diff: one email a week with new agent tools, notable updates and grade changes, plus security alerts for tools you follow. Double opt-in, one-click unsubscribe.
About
Reviews
Write a reviewNo reviews yet. Installed it? Reviews come from verified installers only. How reviews work
Permissions
What this skill can do and what it asks for, from its SKILL.md. Checked Oct 25, 2026.
- Tools
- No tools found
- Secrets
- None asked for
- Install scripts
- None found
Network hosts it talks to 1
codeload.github.com· found in install command
Files it touches
~/.claude/skills/teach
What's inside
- Skill name
teach- Description
- Explain any concept from absolute scratch using first principles, analogies, examples, and progressive complexity. Trigger phrases: /teach, "explain this", "teach me", "what is", "how does X work", "explain from scratch"
- License
- MIT
- Instructions
- 162 lines in SKILL.md · view on GitHub
Agent Skills spec issues
- allowed-tools: must be a space-separated string
Files (1)
- SKILL.md
SKILL.md (first lines)
# Teaching Skill
## Purpose
Explain any concept -- mathematical, computational, scientific, or theoretical -- from absolute zero. Build understanding from first principles with no assumed prior knowledge of the specific topic. Designed for a researcher who wants deep, permanent understanding, not surface-level summaries.
## Core Philosophy
1. **Start from nothing**: Even if the user likely knows prerequisites, begin from the ground. They will tell you to skip ahead if they want to.
2. **Build, don't dump**: Layer concepts one on top of another. Each new idea must connect to something already established.
3. **Understanding over memorisation**: Explain WHY things are the way they are, not just WHAT they are.
4. **Intuition before formalism**: Give the intuitive picture first, then the formal definition, then show how the formalism captures the intuition.
5. **Every abstraction must be grounded**: For every abstract concept, provide a concrete example that makes it tangible.
## Workflow
### Step 1: Identify the Concept and Goal
Determine:
1. **What concept** the user wants to learn
2. **Why they need it** (for a project, exam, research, curiosity) -- this shapes the depth and angle
3. **What they will do with it** -- this determines what aspects to emphasise
### Step 2: Build the Prerequisite Chain
Before explaining the target concept, identify all prerequisites and build them up in order. Structure as a dependency graph:
```
Target: Backpropagation
└── Requires: Chain Rule
└── Requires: Derivatives / Partial Derivatives
└── Requires: Computational Graphs
└── Requires: Functions as Compositions
└── Requires: Gradient Descent
└── Requires: Loss Functions
└── Requires: What "Error" Means in ML
└── Requires: Forward Pass (optional, for deeper understanding)
```
Start from the bottom of the chain. Skip levels only if the user explicitly says they know them.
### Step 3: Teach Each Layer
For each concept in the prerequisite chain and then the target concept, follow this structure:
---
#### A. The Hook (1-2 sentences)
Why should the learner care about this concept? What problem does it solve? What breaks without it?
> "Your neural network has 10 million parameters. How does it figure out which ones to change, and by how much, after seeing a single training example?"
#### B. The Analogy (1 paragraph)
A concrete, everyday analogy that captures the essential mechanism. The analogy does not need to be perfect -- flag where it breaks down.
> **Insight**: Think of backpropagation like a chain of dominoes falling in reverse. The final domino (the loss) tells you how wrong you were. Then, working backwards, each domino tells the one before it "here's how much of that error was your fault." That blame-assignment, layer by layer, is backprop.
#### C. The Intuitive Explanation (2-4 paragraphs)
Explain the concept in plain language with no formalism. Use phrases like "imagine", "picture this", "the key idea is". Build a mental model the learner can manipulate.
#### D. The Formal Definition (1-2 paragraphs + equations)
Now introduce the mathematical notation and formal definition. Connect every symbol back to the intuitive explanation:
> "That 'blame-assignment' is exactly the chain rule: ∂L/∂w = (∂L/∂a) · (∂a/∂z) · (∂z/∂w). Each factor is one link in the chain, propagating the error gradient from output back to weights."
#### E. Worked Example (as long as needed)
Walk through a complete, concrete example with actual numbers. Show every intermediate calculation. Use small, tractable numbers (2x2 matrices, simple functions).
The example should be:
- Small enough to compute by hand
- Rich enough to illustrate the concept's behaviour
- Connected to the analogy from step B
#### F. Key Insight Blocks
Throughout the explanation, use Insight blocks for crucial understanding points:
> **Insight**: The reason backprop is efficient is that it reuses intermediate results. Computing ∂L/∂w for every weight independently would require a separate forward pass each time. Backprop does it in ONE backward pass by caching activations and propagating gradients layer by layer — that's the key trick.
> **Insight**: Batch normalisation does NOT change what the network can learn -- it changes the loss landscape. By normalising intermediate activations, it smooths the loss surface, making gradient descent take more direct paths. Same expressive power, faster convergence.
Use Insight blocks for:
- Non-obvious connections between concepts
- Common misconceptions and why they're wrong
- The "real reason" something works (beyond the textbook explanation)
- Geometric or physical interpretations of algebraic results
#### G. What Could Go Wrong (1-2 paragraphs)
Explain failure modes, edge cases, and common mistakes. This deepens understanding by showing the boundaries of the concept:
> "Gradient descent can get stuck in saddle points -- places where the gradient is zero but you're not at a minimum. In high dimensions, saddle points are far more common than local minima."
#### H. Connection to the Bigger Picture (1 paragraph)
How does this concept connect to the next one in the chain? How does it fit into the broader field? What does it enable?
---
### Step 4: Check Understanding
After explaining a concept, offer one or more of:
1. **Quick check question**: "Without looking back, can you explain why backprop is more efficient than computing each gradient independently?"
2. **Predict-the-outcome exercise**: "If I double the number of layers, what happens to the gradient magnitudes at the first layer?"
3. **Break-the-assumption exercise**: "What happens if all activation functions are linear? Does backprop still produce useful gradients?"
Wait for the user's response and correct any misconceptions before moving on.
### Step 5: Summary and Reference Card
After covering the full concept, provide a compact reference:
```
CONCEPT: [Name]
ONE-LINE SUMMARY: [What it does in one sentence]
KEY EQUATION: [The most important equation]
WHEN TO USE: [Practical conditions]
WATCH OUT FOR: [Main pitfall]
CONNECTS TO: [Related concepts]
```From rafeeqinea/claude-academic-toolkit, MIT.
More from rafeeqinea/claude-academic-toolkit
- 0.409score
explain-file
rafeeqinea
Read a source file and explain every line in depth.
SkillDFreshness: DClaude Code - 0.409score
self-improve
rafeeqinea
Deep self-analysis and improvement.
SkillDFreshness: DClaude Code - 0.409score
reflect
rafeeqinea
End-of-session reflection.
SkillDFreshness: DClaude Code +9 - 0.406score
benchmark
rafeeqinea
Systematic benchmarking and comparison of algorithms, models, or approaches under identical conditions.
SkillDFreshness: DClaude Code +9 - 0.406score
drive-research
rafeeqinea
Search Google Drive for papers, datasets, documents, and pull files into the conversation.
SkillDFreshness: DClaude Code +9 - 0.406score
notebook-query
rafeeqinea
Query NotebookLM notebooks directly from Claude Code for grounded, citation-backed answers.
SkillDFreshness: DClaude Code +9 - 0.406score
notion-notes
rafeeqinea
Push research notes, experiment results, and session summaries to Notion.
SkillDFreshness: DClaude Code +9 - 0.406score
docs-lookup
rafeeqinea
Fetch the latest documentation for any programming library using Context7.
SkillDFreshness: DClaude Code +9 - 0.406score
experiment
rafeeqinea
Run, track, and compare ML experiments with structured logging.
SkillDFreshness: DClaude Code +9 - 0.406score
debug
rafeeqinea
Structured debugging workflow that teaches the debugging process, not just fixes the bug.
SkillDFreshness: DClaude Code +9 - 0.403score
derive
rafeeqinea
Perform step-by-step mathematical derivations with full explanations and LaTeX output.
SkillDFreshness: DClaude Code +9
Signals
- Stars
- 0
- Forks
- 0
- Open issues
- 0
- Last commit (this folder)
- Mar 9, 2026 (7 months ago)
From GitHub (fetched Oct 24, 2026).
Details
- License
- MIT
- First seen
- Oct 24, 2026
- Last checked
- Oct 24, 2026
- Source
- GitHubgithub-graphql
More from rafeeqinea
- 0.409score
explain-file
rafeeqinea
Read a source file and explain every line in depth.
SkillDFreshness: DClaude Code - 0.409score
self-improve
rafeeqinea
Deep self-analysis and improvement.
SkillDFreshness: DClaude Code - 0.409score
reflect
rafeeqinea
End-of-session reflection.
SkillDFreshness: DClaude Code +9 - 0.406score
benchmark
rafeeqinea
Systematic benchmarking and comparison of algorithms, models, or approaches under identical conditions.
SkillDFreshness: DClaude Code +9 - 0.406score
drive-research
rafeeqinea
Search Google Drive for papers, datasets, documents, and pull files into the conversation.
SkillDFreshness: DClaude Code +9 - 0.406score
notebook-query
rafeeqinea
Query NotebookLM notebooks directly from Claude Code for grounded, citation-backed answers.
SkillDFreshness: DClaude Code +9
Cite this page
teach skill. Agent Mart. https://agentmart.dev/skills/rafeeqinea-teach (last updated 2026-10-24)