math-skill 2.1.0 → 3.0.1

package/commands/probability-statistics.md

@@ -1,11 +0,0 @@
----
-name: probability-statistics
-description: |
-  量化不确定性、做贝叶斯推断/假设检验/回归建模/实验设计，或为随机算法/采样/量化/训练动力学设计概率机制时调用。路由到 ../skills/probability-statistics/SKILL.md。
-  English: Trigger when quantifying uncertainty, doing Bayesian inference/hypothesis testing/regression/experimental design, or designing probabilistic mechanisms for random algorithms/sampling/quantization/training dynamics. Routes to ../skills/probability-statistics/SKILL.md.
----
-
-若用户消息为英文，读取并遵循 `../skills/probability-statistics/SKILL.en.md`，按其操作规程输出；否则读取并遵循 `../skills/probability-statistics/SKILL.md`，按其操作规程输出（用于算法/算子/GPU 设计时含 [GPU 可行性] 项）。
-
-当前问题：
-$ARGUMENTS

package/commands/symmetry-invariance.md

@@ -1,11 +0,0 @@
----
-name: symmetry-invariance
-description: |
-  做群论/不变量/Noether 定理/对称性破缺分析，或为算法设计等变性/守恒量/不变结构时调用。路由到 ../skills/symmetry-invariance/SKILL.md。
-  English: Trigger when doing group theory/invariant/Noether's theorem/symmetry-breaking analysis, or designing equivariance/conservation/invariant structures for algorithms. Routes to ../skills/symmetry-invariance/SKILL.md.
----
-
-若用户消息为英文，读取并遵循 `../skills/symmetry-invariance/SKILL.en.md`，按其操作规程输出；否则读取并遵循 `../skills/symmetry-invariance/SKILL.md`，按其操作规程输出（用于算法/算子/GPU 设计时含 [GPU 可行性] 项）。
-
-当前问题：
-$ARGUMENTS

package/commands/topological-thinking.md

@@ -1,11 +0,0 @@
----
-name: topological-thinking
-description: |
-  做拓扑数据分析/持续同调/同调与基本群计算，或为算法设计连通性/鲁棒性/上同调一致性判据时调用。路由到 ../skills/topological-thinking/SKILL.md。
-  English: Trigger when doing topological data analysis/persistent homology/homology and fundamental group computation, or designing connectivity/robustness/cohomology-consistency criteria for algorithms. Routes to ../skills/topological-thinking/SKILL.md.
----
-
-若用户消息为英文，读取并遵循 `../skills/topological-thinking/SKILL.en.md`，按其操作规程输出；否则读取并遵循 `../skills/topological-thinking/SKILL.md`，按其操作规程输出（用于算法/算子/GPU 设计时含 [GPU 可行性] 项）。
-
-当前问题：
-$ARGUMENTS

package/commands/transformation.md

@@ -1,11 +0,0 @@
----
-name: transformation
-description: |
-  问题在当前表示下难处理、需通过数学变换转为等价简单问题，或为算法/算子设计寻找更 GPU 友好的等价表示时调用。路由到 ../skills/transformation/SKILL.md。
-  English: Trigger when a problem is intractable in its current form and needs a transform into an equivalent simpler problem, or when finding a more GPU-friendly equivalent representation for algorithm/operator design. Routes to ../skills/transformation/SKILL.md.
----
-
-若用户消息为英文，读取并遵循 `../skills/transformation/SKILL.en.md`，按其操作规程输出；否则读取并遵循 `../skills/transformation/SKILL.md`，按其操作规程输出（用于算法/算子/GPU 设计时含 [GPU 可行性] 项）。
-
-当前问题：
-$ARGUMENTS

package/skills/abstraction/SKILL.en.md

@@ -1,117 +0,0 @@
----
-name: abstraction
-description: |
-  Trigger when extracting mathematical structures from complex problems, discovering cross-domain commonalities, building general theories; or finding transferable abstract structures (category/algebra/topology) for algorithm/operator design.
----
-
-# 🧩 Abstraction
-
-> "The power of mathematics lies in abstraction: ignoring contingent details to reveal necessary structures."
->
-> — Algebra, Topology, Category Theory
-
-## Core Principle
-
-**Abstraction is not distancing from reality but penetrating into it — by stripping away superficial, contingent details, one reveals deep, essential structures. Problems from different domains often share the same abstract structure.** In the context of this skill pack, abstraction is the core operation of "cross-domain activation": transferring structures from algebraic geometry / topology to algorithm design relies on identifying the abstract structures shared by both.
-
-Three progressive levels of abstraction: **Distillation** (identifying common structure across multiple instances) → **Generalization** (extending theorems from special to general cases) → **Structurization** (reconstructing the entire problem domain in the language of structure).
-
-> **Mathematical Formalization**
->
-> Category-theoretic perspective: Objects and morphisms form a category **C**; functors **F, G : C → D** preserve structure; natural transformations **η : F ⇒ G** relate functors; **Yoneda Lemma**: Hom(Hom(−, A), F) ≅ F(A), i.e., an object is completely determined by all morphisms pointing to it.
->
-> Algebraic perspective: Groups (closure, associativity, identity, inverse); rings (additive group + multiplicative semigroup + distributivity); fields (ring + multiplicative inverses); modules (vector spaces over a ring); lattices (partially ordered set + meet and join).
-
-## GPU-Friendliness (Cross-Cutting Check)
-
-Whether an abstract structure can be deployed on GPU depends on the computational form it takes once "concretized" — pass the eight dimensions of `../../references/gpu-friendly-math.md`:
-
-- **Category / algebraic structure → GEMM**: If the abstract structure can be concretized as linear maps (e.g., restriction maps, group representations), it naturally maps to Tensor Core GEMM (friendly).
-- **Universal constructions (products / coproducts / limits)**: If materialized as large intermediate tensors, memory explodes (unfriendly) → refactor into chunked / streaming or low-rank approximations.
-- **Yoneda perspective**: Replace internal structure with Hom-behavior — if the Hom-sets themselves are huge, the construction is non-computable; friendly only when Hom can be batch-tensorized.
-- **Anti-pattern**: Forcing an essentially discrete/symbolic abstraction (e.g., exact computation of general cohomology) into training is often "beautiful but not computable."
-
-Eight-dimension minimum assessment (formal terminology): **Tensorization** — whether abstract objects can be concretized as batched tensors; **GEMM-Mappability** — whether morphisms / representations / restriction maps can reduce to linear maps; **Complexity** — whether the abstraction layer introduces super-linear global constructions; **Memory & KV-Cache** — whether products / limits / Hom tables are materialized; **Low-Precision Stability** — whether concretization depends on ill-conditioned inversion or exact symbolic equalities; **Parallelism & Communication** — whether the construction is locally block-decomposable; **Sparsity Structure** — whether it yields block/banded structure rather than random access; **Operator Fusion** — whether abstract interfaces can converge into a small number of fused kernels.
-
-> In conjunction with `../../references/books/algebraic-geometry-rising-sea.md`, `abstract-algebra.md`, `smooth-manifolds.md`.
-
-## When NOT to Use
-
-- **Every detail is critical** (e.g., debugging a specific bug) — abstraction would discard key information.
-- **A specific numerical answer is needed** (e.g., "what is this integral equal to") — abstraction does not provide concrete calculations.
-- **The problem is already in its simplest form** — no further abstraction is needed.
-
-## When to Use
-
-- When facing a complex problem and not knowing where to start — first abstract out the core structure.
-- When two seemingly different problems share similarities — seek a common abstract framework.
-- When generalizing specific experience into general rules, or building cross-domain general models/theories.
-- **Transferring modern math structures to algorithm/operator design** — identifying the abstract structure the problem shares with algebraic geometry / topology / Lie theory.
-
-## Method
-
-### Step 1: Describe the Concrete Problem
-Precisely describe all elements of the problem in mathematical language — objects, relations, constraints, objectives. Abstraction begins with the concrete: before abstracting, one must fully understand the concrete objects.
-
-### Step 2: Distinguish Essential from Non-Essential Features
-Examine each feature one by one: if this feature is changed, does the core structure of the problem change? **Essential features** (those whose change fundamentally alters the nature of the problem) must be retained; **non-essential features** (those whose change leaves the structure invariant) can be ignored. Example: when studying matrix invertibility, the specific entries are non-essential (invariant under similarity transformations), while rank is essential.
-
-### Step 3: Extract the Abstract Structure
-Choose the best-matching perspective from four mathematical viewpoints and execute its operations:
-
-- **Category-theoretic perspective** (focus on relations between objects): Identify "objects" and "morphisms/relations"; check that morphisms compose and have identities → forming a category; further check for functors to known categories, natural transformations relating different functors.
-- **Algebraic perspective** (focus on operations and axioms): Identify "operations" and their properties (closure / associativity / commutativity / distributivity); match axioms against group / ring / field / module / lattice; determine the best-matching structure.
-- **Topological perspective** (focus on continuity and connectedness): Identify "continuous change / proximity / connected-separated"; construct open-set structure and verify topological axioms; identify topological invariants (connectedness, compactness, fundamental group).
-- **Analytic perspective** (focus on metrics and norms): Identify "distance / size / convergence"; verify metric/norm axioms; determine properties such as completeness/boundedness, and invoke the corresponding theorems (e.g., Banach space theory).
-
-### Step 4: Solve at the Abstract Level
-Leverage existing theory of the abstract structure. Key tools:
-- **Universal constructions**: Products (unified projections), coproducts (unified embeddings), limits/colimits (merging and gluing under compatibility conditions).
-- **Yoneda Lemma insight**: An object is completely determined by all morphisms pointing to it; to understand X, examine Hom(A,X) / Hom(X,A); to prove two objects are isomorphic, it suffices to show their morphism behavior is identical.
-
-### Step 5: Concretize Back
-Precisely translate each element of the abstract solution back into the mathematical language of the original problem, ensuring every step has a correspondence. After abstraction, one must return to the concrete; otherwise abstraction loses its meaning.
-
-### Step 6: Verify
-Is key information fully preserved through the round trip? Does the answer to the original problem have a clear counterpart in the abstract solution? After translating back to the concrete, does it indeed solve the original problem? Has any essential feature been accidentally overlooked?
-
-### Step 7: Level Progression
-- **Distillation → Generalization**: When the distilled concept has been verified across multiple instances, and the theorem's natural extension appears to hold under broader conditions → generalize.
-- **Generalization → Structurization**: When generalized theorems have accumulated enough to support a self-consistent system, and different generalizations are systematically related → structurize.
-- **No premature leaps**: If distilled concepts have not been verified across enough instances, do not rashly generalize; if generalized theorems are scattered and unsystematic, do not rashly structurize.
-
-## Common Errors
-
-| Error | Critique | Correct Approach |
-|---|---|---|
-| Over-abstraction | Abstracting away essential details, distorting the problem (e.g., dropping group inverses and retaining only a semigroup) | After each abstraction, check whether key information is preserved |
-| Under-abstraction | Retaining too many non-essential details, failing to achieve simplification | Repeatedly ask: is this detail truly necessary? |
-| Abstracting to the wrong level | Using category theory for a problem that only needs group theory; or using only set theory for a problem with group structure | Choose the level matching the problem's complexity |
-| Forgetting the functorial perspective | Looking only at internal object structure while ignoring morphisms, losing half the information | Simultaneously examine Hom(A,X) and Hom(X,A) |
-| Forgetting to return to the concrete | Staying at the abstract level without translating back to the original problem | After abstraction is complete, concretization is mandatory |
-| Abstract structure is non-computable | Forcing an essentially discrete/symbolic abstraction into GPU training | After concretization, pass the GPU eight-dimension gate; if non-computable, adapt or abandon |
-
-## Operating Procedure
-
-When this skill is triggered, the output must contain:
-
-1. **[Problem Description]:[Concrete]** — Precisely describe all elements of the problem in mathematical language
-2. **[Essential / Non-Essential]:[Distinction]** — List essential and non-essential features, annotating for each whether changing it affects the core structure
-3. **[Perspective Choice]:[One of Four]** — Select the best match from category-theoretic / algebraic / topological / analytic, and execute its operational steps
-4. **[Abstract Solution]:[Construction]** — Using universal constructions or the Yoneda perspective, provide a solution direction at the abstract level
-5. **[Concretization]:[Translation]** — Precisely translate the abstract solution back into the mathematical language of the original problem
-6. **[Verification]:[Check]** — Is key information fully preserved through the round trip?
-7. **[Level Assessment]:[Progression]** — Indicate which level (distillation / generalization / structurization) is current, and assess whether a leap is warranted
-8. **[GPU Feasibility]** (if used for algorithm/operator design) — After concretizing the abstract structure, pass the eight-dimension gate, rating friendly / retrofittable / unfriendly
-
-**Output must never provide analysis alone without a conclusion.**
-
-## Relations to Other Skills
-
-- **Axiomatization**: Abstraction is the precursor to axiomatization — first abstract the essentials, then choose the axioms.
-- **Modeling**: Modeling is the concrete application of abstraction — abstracting real-world problems into mathematical ones.
-- **Transformation**: A transformation can be seen as a form of abstraction — finding simple structure in a new representation.
-- **Induction and Analogy**: Analogy is essentially identifying the shared abstract structure between two different domains.
-- **Topological Thinking**: Topological abstraction focuses on continuity and connectedness; it is the concrete form of abstraction in spatial problems.
-- **Algorithmic Thinking**: Algorithmic abstraction focuses on the structure of computational processes, abstracting concrete implementations into algorithmic patterns and complexity classes.
-- **Modern Math Activation**: `../../references/books/algebraic-geometry-rising-sea.md` (sheaves/categories → attention), `abstract-algebra.md` (groups/semirings → equivariance and routing), `smooth-manifolds.md` (manifold structure → latent-space geometry).

package/skills/abstraction/SKILL.md

@@ -1,121 +0,0 @@
----
-name: abstraction
-description: |
-  触发：需要从复杂问题中提取数学结构、发现不同领域共性、构建通用理论；或为算法/算子设计寻找可迁移的抽象结构（范畴/代数/拓扑）时调用。
-  English: Trigger when extracting mathematical structures from complex problems, discovering cross-domain commonalities, building general theories; or finding transferable abstract structures (category/algebra/topology) for algorithm/operator design.
----
-
-> **语言路由**：若用户消息为英文，请读取并遵循同目录下的 `SKILL.en.md`，按其操作规程以英文输出；中文消息则继续使用本文件。
-
-# 🧩 抽象化思想 / Abstraction
-
-> "数学的力量在于抽象：忽略偶然细节，揭示必然结构。"
-> "The power of mathematics lies in abstraction: ignoring contingent details to reveal necessary structures."
->
-> —— 代数学、拓扑学、范畴论 / Algebra, Topology, Category Theory
-
-## 核心原则 / Core Principle
-
-**抽象不是远离现实，而是深入现实——通过忽略表面的、偶然的细节，揭示深层的、本质的结构。不同领域的问题往往共享相同的抽象结构。** 在本技能包的语境里，抽象化是「跨领域激活」的核心操作：把代数几何/拓扑的结构迁移到算法设计，靠的就是识别两者共享的抽象结构。
-
-抽象的三个层次（递进）：**提炼**（从多实例识别共同结构）→ **推广**（定理从特殊扩展到一般）→ **结构化**（用结构语言重构整个问题域）。
-
-> **数学形式化 / Mathematical Formalization**
->
-> 范畴论视角：对象与态射构成范畴 **C**；函子 **F, G : C → D** 保持结构；自然变换 **η : F ⇒ G** 联系函子；**Yoneda 引理**：Hom(Hom(−, A), F) ≅ F(A)，即一个对象由所有指向它的态射完全确定。
->
-> 代数视角：群（closure, associativity, identity, inverse）；环（加法群+乘法半群+分配律）；域（环+乘法可逆）；模（环上的向量空间）；格（偏序集+交与并）。
-
-## GPU 友好性 / GPU-Friendliness（横切检查）
-
-抽象结构能否落地 GPU，取决于其「具体化」后的计算形态——过 `../../references/gpu-friendly-math.md` 八维：
-
-- **范畴/代数结构 → GEMM**：若抽象结构可具体化为线性映射（如限制映射、群表示），则天然落到 Tensor Core GEMM（友好）。
-- **通用构造（积/余积/极限）**：若物化为大中间张量则显存爆炸（不友好）→ 改造为分块/流式或低秩近似。
-- **Yoneda 视角**：用 Hom 行为代替内部结构——若 Hom 集本身巨大则不可算；只在 Hom 可批量张量化时友好。
-- **反模式**：把一个本质离散/符号的抽象（如一般上同调的精确计算）硬塞进训练，往往"美但不可算"。
-
-八维最低判定（正式术语）：**张量化**看抽象对象能否具体化为批量张量；**GEMM 可映射**看态射/表示/限制映射能否落线性映射；**复杂度**看抽象层是否引入超线性全局构造；**显存与 KV-Cache**看是否物化积/极限/Hom 大表；**低精度稳定**看具体化后是否依赖病态求逆或精确符号等式；**并行与通信**看构造是否局部可分块；**稀疏结构**看是否为块/带状结构而非随机访存；**算子融合**看抽象接口能否收敛为少量 fused kernels。
-
-> 配合 `../../references/books/algebraic-geometry-rising-sea.md`、`abstract-algebra.md`、`smooth-manifolds.md`。
-
-## 不适用场景 / When NOT to Use
-
-- **每个细节都至关重要**（如调试一个具体 bug）——抽象会丢失关键信息。
-- **需要具体数值答案**（如"这个积分等于多少"）——抽象不提供具体计算。
-- **问题本身已是最简形式**——无需进一步抽象。
-
-## 何时使用 / When to Use
-
-- 面对复杂问题不知从何入手——先抽象出核心结构。
-- 两个看似不同的问题有相似之处——寻找共同抽象框架。
-- 需要将具体经验推广为一般规律，或建立跨领域通用模型/理论。
-- **把现代数学结构迁移到算法/算子设计**——识别问题与代数几何/拓扑/李理论共享的抽象结构。
-
-## 方法流程 / Method
-
-### 第一步：描述具体问题 / Describe the Concrete Problem
-用数学语言精确描述问题的所有要素——对象、关系、约束、目标。抽象始于具体：在抽象前必须充分了解具体对象。
-
-### 第二步：区分本质与非本质特征 / Distinguish Essential from Non-Essential
-逐项检查每个特征：若改变该特征，问题的核心结构是否改变？**本质特征**（改变后问题性质根本变化）必须保留；**非本质特征**（改变后结构不变）可忽略。例：研究矩阵可逆性时，具体数值非本质（相似变换下不变），而秩是本质的。
-
-### 第三步：提取抽象结构 / Extract the Abstract Structure
-从四个数学视角选最匹配的，执行其操作：
-
-- **范畴论视角**（关注对象间关系）：识别"对象"与"映射/关系"；检查映射可复合、有恒等→构成范畴；进一步看是否存在函子映到已知范畴、自然变换联系不同函子。
-- **代数视角**（关注运算与公理）：识别"运算"及其性质（封闭/结合/交换/分配）；对照群/环/域/模/格匹配公理；确定最匹配结构。
-- **拓扑视角**（关注连续与连通）：识别"连续变化/邻近/连通-分离"；构造开集结构验证拓扑公理；识别拓扑不变量（连通/紧致/基本群）。
-- **分析视角**（关注度量与范数）：识别"距离/大小/收敛"；验证度量/范数公理；确定完备/有界等性质，调用对应定理（如 Banach 空间理论）。
-
-### 第四步：在抽象层级求解 / Solve at the Abstract Level
-利用抽象结构已有理论求解。关键工具：
-- **通用构造**：积（统一投影）、余积（统一嵌入）、极限/余极限（兼容条件下合并与粘合）。
-- **Yoneda 引理洞察**：对象由所有指向它的态射完全确定；要理解 X，考察 Hom(A,X)/Hom(X,A) 即可；证明两对象同构只需证其态射行为一致。
-
-### 第五步：具体化回原问题 / Concretize Back
-将抽象解中每个要素精确翻译回原问题的数学语言，确保每步有对应。抽象之后必须回到具体，否则抽象失去意义。
-
-### 第六步：验证 / Verify
-往返过程中关键信息是否完整保留？原问题答案是否在抽象解中有明确对应？翻译回具体后是否确实解决原问题？是否有本质特征被意外忽略？
-
-### 第七步：层级递进 / Level Progression
-- **提炼→推广**：当提炼出的概念已在多实例验证、定理自然延伸在更宽条件下似成立时→推广。
-- **推广→结构化**：当推广定理积累到支撑自洽体系、不同推广间有系统联系时→结构化。
-- **不可跃升**：提炼概念未在足够实例验证则不贸然推广；推广定理零散不成体系则不贸然结构化。
-
-## 常见错误 / Common Errors
-
-| 错误 / Error | 批评 / Critique | 正确做法 / Correct Approach |
-|-------------|----------------|---------------------------|
-| 过度抽象 | 把本质细节也抽象掉，问题被扭曲（如丢掉群的逆元只剩半群） | 每次抽象后检查关键信息是否保留 |
-| 抽象不足 | 保留太多非本质细节，未达简化目的 | 反复问：这个细节真的必要吗 |
-| 抽象到错误层级 | 用范畴论处理只需群论的问题；或仅用集合论处理本有群结构的问题 | 选与问题复杂度匹配的层级 |
-| 忘记函子视角 | 仅看对象内部结构忽略态射，丢失一半信息 | 同时考察 Hom(A,X) 和 Hom(X,A) |
-| 忘记回到具体 | 停在抽象层面不翻译回原问题 | 抽象完成后必须具体化 |
-| 抽象结构不可算 | 把本质离散/符号的抽象硬塞进 GPU 训练 | 具体化后过 GPU 八维门，不可算则改造或放弃 |
-
-## 操作规程 / Operating Procedure
-
-当本 skill 被触发时，输出必须包含：
-
-1. **[问题描述]:[具体]** — 用数学语言精确描述问题所有要素
-2. **[本质/非本质]:[区分]** — 列出本质与非本质特征，逐项标注改变后是否影响核心结构
-3. **[视角选择]:[四选一]** — 从范畴论/代数/拓扑/分析中选最匹配的，执行其操作步骤
-4. **[抽象求解]:[构造]** — 利用通用构造或 Yoneda 视角，在抽象层级给出解法方向
-5. **[具体化]:[翻译]** — 将抽象解精确翻译回原问题数学语言
-6. **[验证]:[检查]** — 往返过程中关键信息是否完整保留
-7. **[层级判定]:[递进]** — 标注当前处于提炼/推广/结构化哪一层，评估是否应跃升
-8. **[GPU 可行性]**（若用于算法/算子设计）— 抽象结构具体化后过八维门，标注友好/可改造/不友好
-
-**输出不得只给分析而无结论。**
-
-## 与其他 skill 的关系 / Relations to Other Skills
-
-- **公理化思想**：抽象化是公理化的前置——先抽象出本质，再选择公理。
-- **建模思想**：建模是抽象化的具体应用——把现实问题抽象为数学问题。
-- **变换思想**：变换可看作一种抽象——在新表示中寻找简单结构。
-- **归纳与类比**：类比本质就是识别两不同领域的共同抽象结构。
-- **拓扑思想**：拓扑抽象关注连续与连通，是抽象化在空间问题中的具体形态。
-- **算法思想**：算法抽象关注计算过程结构，将具体实现抽象为算法模式与复杂度类。
-- **现代数学激活**：`../../references/books/algebraic-geometry-rising-sea.md`（层/范畴→注意力）、`abstract-algebra.md`（群/半环→等变与路由）、`smooth-manifolds.md`（流形结构→隐空间几何）。

package/skills/abstraction/original-texts.en.md

@@ -1,163 +0,0 @@
-# Mathematical Sources and Classic Texts
-
-## Galois Theory (1830s)
-
-> "The profundity of Galois theory: it transforms the question 'can an equation be solved by radicals?' into the structural question 'is the permutation group solvable?'"
-
-**Abstract paradigm**: Galois theory represents the earliest systematic abstraction in the history of mathematics — rising from concrete equation-solving to the symmetry structure of groups.
-- The permutation group of roots determines the solvability of an equation
-- The Galois correspondence: subgroups ↔ subfields, directly linking algebra to structure
-- Far-reaching influence: inaugurated the mode of thinking "replace calculation with structure," laying the foundation for abstract algebra
-
-**History**: Évariste Galois (1811–1832), unrecognized during his lifetime; his manuscripts were published by Liouville in 1846.
-
-## Dedekind & Noether — From Numbers to Structures
-
-> "Dedekind abstracted integers from 'counting tools' into 'ideals of rings'; Noether systematized this, making ideals the central objects of algebra."
-
-**Key contributions**:
-- **Dedekind (1831–1916)**: Founder of ideal theory — abstracted "divisibility" into "containment relations," elevating number theory to a structural level
-- **Emmy Noether (1882–1935)**:
-  - Noetherian rings: the ascending chain condition abstracts "finiteness" from concrete objects to a structural property
-  - Noether's theorem (1918): symmetries ↔ conservation laws in physics — a paradigm of abstract structure in physics
-  - Transformed abstract algebra from a "computational" to a "structural" discipline
-
-> "Noether's teaching mode: 'Es steht schon bei Dedekind' (Dedekind already wrote it) — she always traced ideas back to their structural origins."
-
-## Category Theory (Eilenberg & Mac Lane, 1945)
-
-> "The key idea of category theory: studying the morphisms (maps) between objects is more important than studying the objects themselves."
-
-**Core concepts**:
-- **Objects** and **Morphisms**
-- **Functors**: Maps between categories
-- **Natural Transformations**: Maps between functors
-- **Universal Properties**: Defining objects through their relations
-
-**The significance of abstraction**: Category theory is "the mathematics of mathematics" — it is abstract enough to describe the structure of mathematics itself.
-
-## Yoneda Lemma (1954)
-
-> "An object is completely determined by its relationships to all other objects — this is the fundamental theorem of category theory."
-
-**Mathematical meaning**:
-- Formal statement: Hom(Hom(A, —), F) ≅ F(A) — there is a one-to-one correspondence between natural transformations of a functor and the functor's evaluation at A
-- Philosophical significance: To understand a thing, one need only observe its interactions with everything else — "you are defined by your relationships"
-- The Yoneda embedding: every object A ↦ Hom(—, A); an object can be fully embedded into its "relational world"
-- Called the "first theorem" of category theory, its status is analogous to the axiom of extensionality in set theory
-
-**History**: First appeared in Nobuo Yoneda's unpublished notes, later formally expounded by Mac Lane in 1954.
-
-## Bourbaki (1935–)
-
-> "Bourbaki rewrote 20th-century mathematics with 'structures' as a unifying language — from mother structures (algebra, order, topology), everything is structure."
-
-**Core ideas**:
-- Three mother structures: algebraic, order, and topological
-- Multiple structures: formed by combining mother structures — topological groups, ordered fields, etc.
-- *Éléments de mathématique*: a systematic rewrite spanning over 40 volumes
-- Far-reaching influence: defined the organizational structure and abstract style of modern mathematics textbooks
-
-**Controversy**: Bourbaki's structuralist bias was excessively abstract, neglecting probability theory and computational mathematics — yet it was precisely this drive toward abstraction that catalyzed the birth of category theory.
-
-## Algebraic Structures
-
-Abstract algebra reveals deep commonalities among diverse mathematical objects:
-
-| Structure | Operational Requirements | Examples |
-|-----------|-------------------------|----------|
-| Semigroup | Closure, associativity | Function composition, string concatenation |
-| Monoid | Semigroup + identity element | Natural number addition, list concatenation (including the empty list) |
-| Group | Monoid + inverses | Symmetric groups, the additive group of integers |
-| Ring | Group (addition) + semigroup (multiplication) + distributivity | The ring of integers, polynomial rings |
-| Field | Ring + multiplicative inverses (for nonzero elements) | The field of rationals, the field of reals |
-| Vector Space | Additive group over a field + scalar multiplication | ℝⁿ, function spaces |
-
-**The significance of intermediate structures**: Semigroups and monoids are not "incomplete groups" — in automata theory, formal languages, and string processing, they are themselves the central objects. Abstraction does not seek the "most complete" structure but extracts precisely the properties that are needed.
-
-**The power of abstraction**: Once a theorem is proved at the abstract level, it automatically applies to all instances satisfying that structure.
-
-## Universal Algebra (Birkhoff, 1935)
-
-> "The central question of universal algebra: which equational classes can be defined by a set of equational axioms?"
-
-**Key contributions**:
-- **Birkhoff's Theorem**: A class of algebras is a variety if and only if it is closed under homomorphic images, subalgebras, and direct products (the HSP Theorem)
-- Systematic study of "algebraic structures as such" — not a particular group or ring, but "the common properties of all structures satisfying given axioms"
-- Universal algebra as a precursor to category theory: concepts such as universal properties and free objects already had their prototypes here
-- Relationship to category theory: equational classes = universal objects in the category generated by free algebras
-
-## Representation Theory (Frobenius, 1896–)
-
-> "Representation theory 'realizes' abstract groups as concrete linear transformations — making invisible symmetries visible."
-
-**Core ideas**:
-- Group representation: a group G → GL(V), mapping abstract group elements to matrices
-- Frobenius (1849–1917): Pioneered character theory of groups, using trace functions to capture irreducible representations
-- Irreducible representations: the "atoms" of a group — all representations are built from them
-- Schur's Lemma, Maschke's Theorem, and related results form the complete theory of semisimple algebras
-
-**The dual significance of abstraction**: On one hand, representation theory makes abstract objects computable; on the other hand, the classification of representations is itself a higher-level abstract problem.
-
-## Free Objects and Universal Constructions
-
-> "A free object is the most general object with 'no extra relations' — determined only by relations forced by axioms."
-
-**Core concepts**:
-- **Free group**: Generated by an alphabet, with no extra relations beyond the group axioms
-- **Free monoid**: Simply the set of strings — string concatenation is the "freest" associative operation
-- **Universal property formulation**: A free object F(A) satisfies the property that any map A → X (where X is an object in the target structure) extends uniquely to a morphism F(A) → X
-- **Left adjoint**: The left adjoint of the forgetful functor is precisely the free object — the "most general solution" of abstraction
-
-**Significance**: Free objects exemplify the paradigm of universal constructions — defining the "most general solution" with "the fewest constraints," then obtaining more specific objects by imposing additional relations.
-
-## Grothendieck & Schemes (1950s–60s)
-
-> "Grothendieck completely reconstructed algebraic geometry: no longer studying specific curves, but schemes — the most general notion of 'space'."
-
-**Revolutionary abstraction**:
-- **Schemes**: Generalized algebraic varieties to allow zero divisors and arbitrary base changes — "space" is no longer a point set but the spectrum of a ring
-- **Topoi**: A notion of "space" more general than topological spaces — a topos is a category rich enough to support an internal logic
-- **Motives**: The conjectural "universal cohomology theory" — the common root of different cohomology theories
-- **Universal construction philosophy**: Grothendieck always sought the "most general" framework first, then solved specific problems within it
-
-**Impact**: The EGA/SGA rewrite, spanning over four thousand pages, made algebraic geometry one of the most abstract yet most powerful branches of mathematics. The proof of the Weil conjectures was a direct fruit of this abstract framework.
-
-## Topology
-
-> "Topology studies properties that remain unchanged under continuous deformations."
-
-**Levels of abstraction**:
-- Metric space → topological space: discard distance, retain only the notion of "open sets"
-- Continuous functions → morphisms: discard ε-δ, retain only "the preimage of an open set is open"
-- Homeomorphism → equivalence: spaces that are "the same" in the topological sense
-
-**Classic example**: A coffee cup and a donut are homeomorphic in the topological sense — they both have exactly one hole.
-
-## Homotopy Type Theory (Voevodsky, 2009–)
-
-> "The univalence axiom of homotopy type theory asserts: isomorphic structures are identical — the ultimate form of abstraction."
-
-**Core ideas**:
-- **Univalence Axiom**: (A ≃ B) ≃ (A = B) — isomorphism and equality are equivalent
-- Philosophical impact: if two structures agree on all observable properties, they "are" the same — there is no "unobservable" identity
-- **Homotopy levels (h-levels)**: Propositions (h-level 1), sets (h-level 2), group objects (h-level 3), ... — unifying classical logic with topological intuition
-- Voevodsky (1966–2017): Fields Medalist who devoted his later career to establishing mathematics on a new foundation with greater computational reliability
-
-**Relationship to category theory**: Homotopy type theory can be viewed as the "internal language" of category theory — in the context of (∞,1)-categories, the univalence axiom arises naturally.
-
-## The Nature of Abstraction
-
-> "Abstraction means ignoring specific, contingent features and extracting general, essential structures."
-
-Abstraction is not a retreat from reality but a deeper engagement with it — by identifying the common structure underlying different phenomena, we can treat them within a unified framework.
-
-**The genealogy of abstraction**:
-- Galois (1830s): equations → group structure
-- Dedekind (1870s): numbers → ideals
-- Birkhoff (1935): concrete algebras → equational classes
-- Eilenberg–Mac Lane (1945): concrete mathematics → categories
-- Grothendieck (1960s): concrete spaces → schemes and topoi
-- Voevodsky (2010s): isomorphism → identity
-
-Each step of abstraction reveals deeper structure and enables us to address a broader class of problems.