跳到主要内容
知仓学习社ZHICANG

limits-colimits

Problem-solving strategies for limits colimits in category theory

不碰外部(只输出文字)无严重或高危命中parcadei/Continuous-Claude-v3

它会碰到什么

扫了多少1 个文本文件,2 KB
它会碰到什么不碰外部(只输出文字)
命中总数0 处
命中统计严重 0 · 高 0 · 中 0 · 低 0

这一栏是扫描器报的事实,不是结论。命中多不等于有毒(安全工具、规则库、示例脚本本来就会包含危险写法),命中少也不等于干净。它和你手上的凭据、文件、网络有什么关系,需要你自己看。

技能内容

Limits Colimits

When to Use

Use this skill when working on limits-colimits problems in category theory.

Decision Tree

  1. Identify Limit Type
  • Product: limit of discrete diagram
  • Equalizer: limit of parallel pair f, g: A -> B
  • Pullback: limit of A -> C <- B
  • Terminal object: limit of empty diagram
  • Lean 4: CategoryTheory.Limits namespace
  1. Verify Universal Property
  • Cone from L with projections pi_i: L -> D_i
  • For any cone from X, unique morphism u: X -> L
  • Triangles commute: pi_i . u = cone_i
  • Lean 4: IsLimit.lift gives the unique morphism
  1. Colimit (Dual)
  • Coproduct: colimit of discrete diagram
  • Coequalizer: colimit of parallel pair
  • Pushout: colimit of A <- C -> B
  • Initial object: colimit of empty diagram
  1. Compute Limits Concretely
  • In Set: product = Cartesian product
  • Equalizer = {x | f(x) = g(x)}
  • Pullback = {(a,b) | f(a) = g(b)}
  • sympy_compute.py solve "f(a) == g(b)"
  1. Preservation
  • Right adjoint preserves limits
  • Left adjoint preserves colimits
  • Representable functors preserve limits
  • Lean 4: Adjunction.rightAdjointPreservesLimits
  • See: .claude/skills/lean4-limits/SKILL.md for exact syntax

Tool Commands

Lean4_Limit

# Lean 4: import CategoryTheory.Limits.Shapes.Products

Lean4_Universal

# Lean 4: IsLimit.lift cone -- unique morphism from universal property

Sympy_Pullback

uv run python -m runtime.harness scripts/sympy_compute.py solve "f(a) == g(b)"

Lean4_Build

lake build  # Compiler-in-the-loop verification

Cognitive Tools Reference

See .claude/skills/math-mode/SKILL.md for full tool documentation.

想直接用这个技能?

本站把开放许可(MIT / Apache 等)的技能按仓库打包整理到网盘,点一下转存到你自己的网盘,不用一个个从 GitHub 拉。许可未声明的技能只给原始仓库链接,不打包。