
Categories Functors
- 1 installs
- 3.9k repo stars
- Updated January 26, 2026
- parcadei/continuous-claude-v3
Guides Claude through category-theory problems on categories and functors, verifying axioms and functor properties with Lean 4 theorems.
About
A decision-tree skill for verifying category axioms and functor properties, writing Lean 4 proofs for associativity and composition preservation. A developer uses it when they want Claude to reason about covariant, contravariant, and forgetful functors.
- Category axiom and functor-property verification in Lean 4
- Covariant, contravariant, full, and faithful functor types
Categories Functors by the numbers
- 1 all-time installs (skills.sh)
- Ranked #1,803 of 2,064 Data Science & ML skills by installs in the Skillselion catalog
- Data as of Aug 5, 2026 (Skillselion catalog sync)
npx skills add https://github.com/parcadei/continuous-claude-v3 --skill categories-functorsAdd your badge
Show developers this skill is listed on Skillselion. Paste this into your README.
| Installs | 1 |
|---|---|
| repo stars | ★ 3.9k |
| Last updated | January 26, 2026 |
| Repository | parcadei/continuous-claude-v3 ↗ |
What it does
Guides Claude through category-theory problems on categories and functors, verifying axioms and functor properties with Lean 4 theorems.
Files
Categories Functors
When to Use
Use this skill when working on categories-functors problems in category theory.
Decision Tree
1. Verify Category Axioms
- Objects and morphisms (arrows) defined?
- Identity morphism for each object: id_A: A -> A
- Composition associative: (f . g) . h = f . (g . h)
- Write Lean 4:
theorem assoc : (f ≫ g) ≫ h = f ≫ (g ≫ h) := Category.assoc
2. Check Functor Properties
- F: C -> D maps objects to objects, arrows to arrows
- Preserves identity: F(id_A) = id_{F(A)}
- Preserves composition: F(g . f) = F(g) . F(f)
- Write Lean 4:
theorem comp : F.map (g ≫ f) = F.map g ≫ F.map f := F.map_comp
3. Functor Types
- Covariant: preserves arrow direction
- Contravariant: reverses arrow direction
- Faithful/Full: injective/surjective on Hom-sets
- Equivalence: full, faithful, essentially surjective
4. Common Functors
- Forgetful functor: forgets structure (e.g., Grp -> Set)
- Free functor: left adjoint to forgetful
- Hom functor: Hom(A, -) or Hom(-, B)
- Power set functor: Set -> Set via X |-> P(X)
5. Verify with Lean 4
- Compiler-in-the-loop: write proof,
lake buildchecks - Mathlib has full category theory library
- See:
.claude/skills/lean4-functors/SKILL.mdfor exact syntax
Tool Commands
Lean4_Category
# Lean 4 with Mathlib: import CategoryTheory.Category.BasicLean4_Functor
# Lean 4: theorem map_comp (F : C ⥤ D) : F.map (g ≫ f) = F.map g ≫ F.map f := F.map_compLean4_Build
lake build # Compiler-in-the-loop verificationCognitive Tools Reference
See .claude/skills/math-mode/SKILL.md for full tool documentation.