math-skill 2.1.0 → 3.0.0

package/skills/symmetry-invariance/original-texts.md

@@ -1,221 +0,0 @@
-# 数学出处与经典文献 / Mathematical Sources and Classic Texts
-
-## 群论 / Group Theory (Galois, 1830s)
-
-**Évariste Galois**（1811-1832）在 20 岁死于决斗前夜，开创了群论：
-
-> "一个方程是否能用根式求解，取决于其根的置换群的结构。"
-> "Whether an equation can be solved by radicals depends on the structure of the permutation group of its roots."
-
-**群的定义**：一个集合 G 配备二元运算 ·，满足：
-1. **封闭性**：∀a,b ∈ G, a·b ∈ G
-2. **结合律**：∀a,b,c ∈ G, (a·b)·c = a·(b·c)
-3. **单位元**：∃e ∈ G, ∀a ∈ G, e·a = a·e = a
-4. **逆元**：∀a ∈ G, ∃a⁻¹ ∈ G, a·a⁻¹ = a⁻¹·a = e
-
-**群是对称性的数学语言。**
-
-## 伽罗瓦理论基本定理 / Fundamental Theorem of Galois Theory
-
-伽罗瓦理论的核心是以下深刻对应：
-
-> 给定域扩张 L/K，若 L 是 K 的伽罗瓦扩张，则伽罗瓦群 Gal(L/K) 的子群与 L/K 的中间域之间存在一一对应（反序保持）。
-> Given a Galois extension L/K, there is an order-reversing bijection between subgroups of Gal(L/K) and intermediate fields between K and L.
-
-这揭示了 **代数结构（群）与域结构（域扩张）的深层对偶性**：
-- 子群 H ↔ 固定域 L^H
-- 正规子群 ↔ 伽罗瓦子扩张
-- 子群的指数 ↔ 中间域的次数
-
-**历史意义**：这一对应将 "方程可解性" 转化为 "群的可解性"——可解群对应根式可解方程，从而彻底解决了五次及以上方程不可根式求解的问题。
-
-## Klein 爱尔兰根纲领 / Klein's Erlangen Program (1872)
-
-> "一种几何学就是研究一个变换群作用下的不变量。"
-> "A geometry is the study of invariants under the action of a transformation group."
-
-Klein 提出用群论来统一各种几何学：
-- 欧几里得几何 = 等距变换下的不变量
-- 仿射几何 = 仿射变换下的不变量
-- 射影几何 = 射影变换下的不变量
-
-**深远影响**：爱尔兰根纲领不仅统一了当时的几何学，更预示了 20 世纪数学中 "结构决定几何" 的核心思想——从拓扑到微分几何，均可纳入 "群+不变量" 的框架。
-
-## Lie 群与 Lie 代数 / Lie Groups and Lie Algebras (1870s)
-
-**Sophus Lie**（1842-1899）将 Galois 的有限群思想推广到连续变换群：
-
-> "连续对称性应由无穷小生成元来刻画——Lie 代数是 Lie 群的局部线性化。"
-> "Continuous symmetries are captured by infinitesimal generators; the Lie algebra is the local linearization of the Lie group."
-
-关键概念：
-- **Lie 群**：既是群又是光滑流形的结构（如 SO(n)、SU(n)、GL(n,R)）
-- **Lie 代数**：Lie 群在单位元处的切空间，配备 Lie 括号 [X,Y]
-- **指数映射** exp: g → G，从无穷小生成元恢复全局对称性
-
-**分类里程碑**：半单 Lie 代数的 Cartan 分类（1894）给出四种无限族 A_n, B_n, C_n, D_n 和五个例外代数 G₂, F₄, E₆, E₇, E₈——这是连续对称性世界中的 "元素周期表"。
-
-**物理意义**：粒子物理中的规范群 SU(3)×SU(2)×U(1) 正是 Lie 群理论的直接应用。
-
-## Noether 定理 / Noether's Theorem (1915)
-
-> Emmy Noether（1882-1935）：每一个连续对称性都对应一个守恒量。
-> Every continuous symmetry corresponds to a conserved quantity.
-
-| 对称性 / Symmetry | 守恒量 / Conserved Quantity |
-|-------------------|---------------------------|
-| 时间平移不变性 | 能量守恒 |
-| 空间平移不变性 | 动量守恒 |
-| 旋转不变性 | 角动量守恒 |
-| 规范不变性 | 电荷守恒 |
-
-**意义**：这是物理学中最深刻的定理之一——它揭示了自然界的对称性与守恒律之间的深层联系。Noether 在 1915 年为 Hilbert 解决广义相对论中的能量守恒问题而证明此定理，其影响远超最初的动机。
-
-## 表示论 / Representation Theory (Frobenius, Schur, 1896-1905)
-
-> "要理解一个群，最好的方式是看它如何作用于向量空间。"
-> "To understand a group, the best way is to see how it acts on vector spaces."
-
-**Georg Frobenius**（1849-1917）在 1896 年发明了群的特征标理论，**Issai Schur**（1875-1941）进一步发展了不可约表示的分类：
-
-- **群表示**：同态 ρ: G → GL(V)，将抽象群元素映射为线性变换
-- **特征标** χ(g) = Tr(ρ(g))，是表示的 "指纹"——不同不可约表示有不同特征标
-- **不可约表示**：不能进一步分解的表示，是表示论的基本构件
-
-**核心定理**：
-- Maschke 定理：有限群的表示在适当条件下完全可分解为不可约表示之和
-- Schur 引理：不可约表示之间的同态极为简单（零或同构）
-- 特征标正交关系：不同不可约表示的特征标彼此正交——这给出了分类的算术约束
-
-**应用遍及数学与物理**：从有限群的分类到量子力学中的角动量理论，表示论是将抽象对称性转化为可计算量的桥梁。
-
-## 有限单群分类 / Classification of Finite Simple Groups (1980s-2004)
-
-> "有限单群的分类是数学史上最庞大的定理——其证明跨越数十年、数百篇论文、数百位数学家。"
-> "The classification of finite simple groups is the most enormous theorem in mathematical history—its proof spans decades, hundreds of papers, and hundreds of mathematicians."
-
-**有限单群**是群论的 "原子"——不可分解为更小的正规子群的群。分类定理断言：
-
-**所有有限单群属于以下类别**：
-1. **循环群** Z_p（p 为素数）——最简单的单群
-2. **交错群** A_n（n ≥ 5）——置换群的核心
-3. **Lie 型群**（16 个无限族）——包括 Chevalley 群、扭曲群等
-4. **26 个散在单群**——最大的是 **Monster 群** M，阶 ≈ 8×10⁵³
-
-**ATLAS of Finite Groups**（1985）是这一分类的标准参考书，记录了所有单群的结构数据。
-
-**Monster 群的奇迹**：Monster 与模形式之间的惊人联系（McKay 的 "月光猜想"、Borcherds 的证明，1998）揭示了有限群与数论的深层联系——Borcherds 因此获 Fields 奖。
-
-## Burnside 引理 / Burnside's Lemma
-
-> 一个有限群 G 作用在集合 X 上，轨道数 = (1/|G|) Σ|X^g|，其中 X^g 是在变换 g 下不变的元素集合。
-
-**应用**：计数问题中利用对称性简化——不需要逐个计数，只需计算平均固定点数。此结果虽以 Burnside 命名，实则由 Cauchy（1845）和 Frobenius（1887）更早发现——数学命名的惯例并不总是公正的。
-
-## Coxeter 群 / Coxeter Groups (1934)
-
-**H.S.M. Coxeter**（1907-2003）系统研究了由反射生成的离散对称群：
-
-> "Coxeter 群是由反射生成的群，其生成关系仅涉及阶数——这是离散几何对称性的终极分类框架。"
-> "Coxeter groups are generated by reflections, with relations specified only by orders—the ultimate classification framework for discrete geometric symmetry."
-
-关键结构：
-- **Coxeter 图**：每个节点代表一个反射生成元，边标注阶数 m_ij
-- **有限 Coxeter 群分类**：与半单 Lie 代数的 Cartan 分类平行——A_n, B_n, D_n, H₃, H₄, I₂(n) 等
-- **正多面体与正多胞体**的对称群均为 Coxeter 群
-
-**H₄** 群（阶 14400）是 4 维 120 -cell / 600-cell 的对称群，是有限 Coxeter 群中最精妙的例子之一。
-
-**影响**：Coxeter 群理论统一了正多面体理论、晶体学、Lie 理论中的 Weyl 群，以及组合学中的 Bruhat 分解。
-
-## 晶体学群与 230 空间群 / Crystallographic Groups and 230 Space Groups
-
-> "晶体对称性的数学分类——230 个空间群穷尽了三维晶体所有可能的对称类型。"
-> "The mathematical classification of crystal symmetry—the 230 space groups exhaust all possible symmetry types for three-dimensional crystals."
-
-**历史**：
-- **32 个晶体点群**：由 Schoenflies（1891）和 Fedorov（1890）独立分类
-- **230 个空间群**：含平移对称（螺旋轴、滑移面）的完整分类，由 Fedorov 和 Schoenflies 完成
-- **二维情形**：17 个壁纸群（wallpaper groups），分类更为简洁
-
-**数学意义**：这是 "用群论分类自然结构" 的经典范例——晶体学直接验证了爱尔兰根纲领的精神。国际晶体学表（International Tables for Crystallography）是这一分类的标准参考。
-
-**四维及以上**：高维晶体学群的数量急剧增长（4 维有 4783 个空间群），展示了维数增加后对称结构的爆炸性复杂化。
-
-## 自发对称性破缺 / Spontaneous Symmetry Breaking (Goldstone 1961; Higgs 1964)
-
-> "当系统的基态不继承其定律的对称性时，对称性被自发打破——这是物理学中对称性最戏剧性的表现。"
-> "When the ground state of a system does not inherit the symmetry of its laws, the symmetry is spontaneously broken—the most dramatic manifestation of symmetry in physics."
-
-**Goldstone 定理**（1961）：连续对称性的自发破缺必然产生无质量的激发态（Goldstone 玻色子）。
-
-**Higgs 机制**（1964）：当规范对称性被自发破缺时，Goldstone 玻色子被 "吃掉"，转化为规范场的质量——这正是粒子物理 Standard Model 中 W/Z 粒子获得质量的机制。2012 年 LHC 发现 Higgs 粒子，确认了这一理论。
-
-**数学结构**：设群 G 作用于势能 V(φ)，若 G 对称但极小值点 φ₀ 仅被 G 的子群 H 保持，则对称性从 G 破缺到 H，产生 dim(G/H) 个 Goldstone 模。
-
-**哲学意义**：自然定律是对称的，但自然界可以不对称——对称性不保证对称的现实，只保证对称的可能性。
-
-## 规范对称性 / Gauge Symmetry (Yang-Mills, 1954)
-
-> "规范对称性是局域的——对称变换可以在时空的每个点独立选取。这要求引入规范场来维持一致性。"
-> "Gauge symmetry is local—the symmetry transformation can be chosen independently at each spacetime point. This demands the introduction of gauge fields to maintain consistency."
-
-**Yang-Mills 理论**（1954）：杨振宁与 Mills 将电磁规范原理（U(1)）推广到非阿贝尔群（SU(2)），开创了非阿贝尔规范场论。
-
-**Standard Model 的规范群**：SU(3)_C × SU(2)_L × U(1)_Y
-- SU(3)：色对称性 → 强相互作用（QCD）
-- SU(2)×U(1)：电弱对称性 → 经 Higgs 破缺后给出电磁 U(1)
-
-**Yang-Mills 存性与质量间隙**：Clay 数学研究所的七大千禧问题之一——证明 Yang-Mills 理论的质量间隙至今未解决，是数学物理最深层的开放问题之一。
-
-## 宇称不守恒 / Parity Violation (Wu Experiment, 1957)
-
-> "物理定律可能在镜像世界中不成立——这打破了自然界最基本的直觉对称性。"
-> "Physical laws may not hold in the mirror world—this shatters the most intuitive symmetry of nature."
-
-**历史**：李政道与杨振宁（1956）提出弱相互作用可能不守恒宇称；**吴健雄**（Chien-Shiung Wu）在 1957 年用 Co-60 β 衰变实验确认了这一预言。
-
-**意义**：在此之前，物理学家普遍相信宇称守恒（左右对称）是自然的基本原理。Wu 实验证明弱相互作用区分左右——这是对称性并非普遍有效的第一个实验证据，深刻改变了物理学家的世界观。
-
-**后续**：宇称破缺导致引入 CP 对称性；1964 年 Cronin-Fitch 实验发现 CP 也破缺，进一步缩小了自然界的对称性。
-
-## CPT 对称性 / CPT Symmetry in Particle Physics
-
-> "CPT 定理断言：任何 Lorentz 不变的局部量子场论必须在 C（电荷共轭）、P（宇称）、T（时间反演）的联合变换下不变。"
-> "The CPT theorem asserts: any Lorentz-invariant local quantum field theory must be invariant under the combined C (charge conjugation), P (parity), and T (time reversal) transformation."
-
-**CPT 的分量**：
-- **C**（电荷共轭）：粒子 ↔ 反粒子
-- **P**（宇称）：空间反演（镜像）
-- **T**（时间反演）：时间流向逆转
-
-单独的 C、P、T 均可被打破（弱相互作用破 P 和 C，K 介子衰变破 CP），但 **CPT 联合必须守恒**——这是量子场论最坚固的对称性壁垒。若 CPT 被实验打破，将意味着量子场论的基础架构需要重建。
-
-## Weyl 的对称性哲学 / Weyl's Symmetry (1952)
-
-**Hermann Weyl**（1885-1955）在晚年著作 *Symmetry*（1952）中给出了对称性的哲学沉思：
-
-> "对称性，无论广义还是狭义，都是一种理念，人类自古以来就试图借此理解和创造秩序、美与完美。"
-> "Symmetry, as wide or as narrow as you may define its meaning, is one idea by which man through the ages has tried to comprehend and create order, beauty, and perfection."
-
-Weyl 从艺术（装饰纹样、建筑）、自然（晶体、花朵）、数学（群论）和物理（相对论、量子力学）四个维度展开讨论。此书将数学的严谨与哲学的深邃融为一体，是 "数学人文传统" 的典范之作。
-
-## 不变量的力量 / The Power of Invariants
-
-> "在变化中找到不变的东西，这是理解世界的捷径。"
-> "Finding what does not change amid change is the shortcut to understanding the world."
-
-经典案例：
-- **Euler 示性数**：无论怎样连续变形多面体，V - E + F = 2 不变
-- **拓扑亏格**：甜甜圈和咖啡杯有相同的拓扑结构（一个洞）
-- **图灵机停机问题的不可判定性**：无论算法如何改进，某些问题本质上不可计算
-
-## 对称性与日常生活 / Symmetry and Everyday Life
-
-- **时间对称**：如果每天的安排有对称性（如早起-工作-休息的循环），生活会更高效
-- **信息对称**：博弈中信息对称是公平的前提，信息不对称是策略的来源
-- **结构对称**：组织结构中的对称性（如对称的汇报关系）通常意味着稳定
-
----
-
-**总结 / Summary**：对称性与不变量是数学与物理的核心主线。从 Galois 的有限群到 Lie 的连续群，从 Klein 的几何纲领到 Noether 的守恒定律，从表示论的抽象结构到粒子物理的规范对称——群论提供了统一的语法，不变量提供了语义。这条主线贯穿纯数学与应用科学，是人类理解世界秩序的最强有力的工具之一。

package/skills/topological-thinking/SKILL.en.md

@@ -1,124 +0,0 @@
----
-name: topological-thinking
-description: |
-  Trigger for topological data analysis (TDA), persistent homology, homology/fundamental group computation, simplicial complexes & filtrations; or designing connectivity/robustness/cohomology-consistency criteria (e.g. Čech cohomology as hallucination regularizer, sheaf attention) for algorithms.
----
-
-# 🌀 Topological Thinking
-
-> "You can stretch and bend but never tear — truly important properties survive continuous deformation."
->
-> — Topology, Homology, Topological Data Analysis
-
-## Core Principle
-
-Topology studies properties invariant under continuous deformation. A donut and a coffee cup are topologically equivalent — both have one hole. The core insight: when exact distances are unimportant, topology captures essential structure — connectivity, holes, dimension. In the context of this skill set, topological thinking directly underpins cellular-layer diffusion attention and Čech cohomology regularization (see the activator examples).
-
-> **Mathematical Formalization**
->
-> **Homeomorphism**: A continuous bijection with continuous inverse $h: X\to Y$; the standard for topological equivalence. **Homotopy**: The deformation process itself is continuous; coarser than homeomorphism. **Diffeomorphism**: A smooth bijection with smooth inverse; the standard of differential topology.
->
-> **Euler characteristic** $\chi=V-E+F$: For convex polyhedra $\chi=2$, for the torus $\chi=0$; together with orientability, it is a complete topological invariant for surfaces.
->
-> **Fundamental group** $\pi_1(X)$: Based loops modulo homotopy deformation; $\pi_1(S^1)=\mathbb{Z}$ (winding number), $\pi_1(S^2)=0$ (all loops are contractible), $\pi_1(\text{torus})=\mathbb{Z}\times\mathbb{Z}$.
->
-> **Homology groups** $H_n(X)$: Count $n$-dimensional "holes": $H_0$ = connected components, $H_1$ = 1-dimensional holes (loops), $H_2$ = 2-dimensional voids. **Betti numbers** $\beta_n=\text{rank}\, H_n$: $\beta_0$ = number of connected components, $\beta_1$ = number of 1-dimensional holes, $\beta_2$ = number of 2-dimensional voids.
->
-> **Simplicial complex**: A topological space model assembled from simplices (points / line segments / triangles). **Filtration**: Progressively increase the neighborhood radius; at each radius, construct a simplicial complex. **Persistent homology**: Compute homology groups along the filtration; long bars = genuine topological features, short bars = noise.
->
-> **Cohomology** $H^n(X)$: The dual of homology (functorial, carries a ring structure). Čech cohomology detects global consistency obstructions from local data — $H^1\neq 0$ means local fragments cannot be assembled into a globally consistent object (this is precisely the algebraic criterion for "hallucination").
->
-> See `original-texts.md` for details.
-
-## GPU-Friendliness (Cross-Cutting Check)
-
-Whether topological structures can run on GPU depends on "locality" and "tensorizability" — pass through the eight-dimensional gate in `../../references/gpu-friendly-math.md`:
-
-- **Local topological quantities → friendly**: Local homology or restriction maps per edge / per patch are small computations; batch-parallelizable and map to small GEMM operations.
-- **Čech cohomology regularization**: Used as a local consistency loss — cheap, fusible (friendly); this is the key component of Tropical Sheaf Attention.
-- **Persistent homology (TDA)**: Constructing simplicial complexes and boundary matrix reduction often involves irregular sparsity / serial reduction — a classic "beautiful but intractable" case → reform via approximation / sampling / distributed computation.
-- **Global exact homology computation**: Symbolic computation, non-trainable, not friendly.
-- **Anti-pattern**: Embedding structures requiring global exact topological determination into the forward pass — intractable.
-
-Eight-dimensional minimum assessment (formal terms): **Tensorization** — whether topological quantities admit local batching; **GEMM-mappability** — whether restriction maps, boundary operators, and local Laplacians fall into matrix multiplication; **Complexity** — whether persistent homology / boundary matrix reduction is superlinear; **Memory and KV-Cache** — whether simplicial complexes, boundary matrices, and cover overlaps are compressible; **Low-precision stability** — whether small singular values, sorting, and thresholding are numerically robust; **Parallelism and communication** — whether cover patches / local complexes are independent; **Sparse structure** — whether the complex / graph is structurally sparse; **Operator fusion** — whether local consistency losses can be fused.
-
-> Use in conjunction with `../../references/books/algebraic-geometry-rising-sea.md` (sheaves / Čech cohomology → attention and hallucination regularization), `smooth-manifolds.md`, `differential-geometry.md`.
-
-## When NOT to Use
-
-- **Exact measurements are needed** — topology only captures qualitative structure (connectivity, holes); it provides no distances or angles.
-- **Metric properties are central** — topologically equivalent spaces can have completely different metric behavior.
-- **Purely discrete structures with no continuity** — topology is grounded in continuity.
-- **Precise numerical decisions are required** (the question is "how much" rather than "is it connected") — the topological perspective is too coarse.
-
-## When to Use
-
-- Need qualitative classification (not "how large" or "how far," but "is it connected" or "how many holes"); shape matters more than size.
-- Need robustness analysis (invariants guarantee that properties do not vanish under continuous perturbation).
-- Data has shape features that standard statistics cannot capture (clusters, voids, ring structures).
-- Need invariants that survive deformation (topological insulators, topological error correction).
-- **Design global consistency criteria for attention / representation learning** (Čech cohomology as hallucination regularizer, sheaf diffusion).
-
-## Method
-
-### Step 1: Identify Continuity Requirements
-Specify the equivalence standard: homeomorphism / homotopy / diffeomorphism. Determine what may vary (distances, angles, sizes) and what must remain fixed (number of holes, connectivity, dimension). Core distinction: variable (surface / metric) vs. invariant (structure / topology).
-
-### Step 2: Find Topological Invariants
-- **Euler characteristic** $\chi=V-E+F$ (together with orientability, a complete invariant for surfaces).
-- **Connectivity** (path-connectedness): Number of connected components $= \text{rank}\, H_0$; **Compactness** (Heine-Borel: compact in $\mathbb{R}^n$ $\iff$ bounded and closed).
-- **Fundamental group** $\pi_1(X)$; **Homology groups** $H_n$ ($H_0$ = components, $H_1$ = 1-dimensional holes, $H_2$ = 2-dimensional voids); **Betti numbers** $\beta_n=\text{rank}\, H_n$.
-- **Cohomology** $H^n$ (dual of homology, functorial; Čech cohomology detects global consistency obstructions).
-
-### Step 3: Classify Using Invariants
-Same $\chi$ → same surface type; same $\pi_1$ → same homotopy type; compact surfaces are completely classified by orientability + $\chi$. Classification relies on invariants — look past the surface to the structure.
-
-### Step 4: Construct Topological Models
-- **Data**: For point clouds, construct a filtration; compute the simplicial complex and homology at each radius; extract persistent homology (barcode / persistence diagram; long bars = genuine features, short bars = noise).
-- **Networks**: Connected components (reachability), cycles (redundant paths), clustering coefficients; network topology determines information propagation and robustness.
-- **Systems**: Phase-space attractor topology — fixed points (points), limit cycles ($S^1$), chaotic attractors (fractals).
-- **Algorithms**: Use sheaves / Čech cohomology to make the question "can local fragments be assembled into a globally consistent object" into a computable algebraic obstruction.
-
-### Step 5: Verify Topological Equivalence
-Attempt to construct an explicit homeomorphism / homotopy equivalence; check that invariants match. Different invariants → topologically distinct (reliable negative); all invariants match → possibly equivalent (invariants may be incomplete; cannot confirm).
-
-### Step 6: Topological Reasoning and Applications
-- "$\pi_1(X)\neq 0$ → non-contractible loops exist → the system has unreachable states"
-- "$X$ is connected → paths exist → transitions are always possible"
-- "$\beta_1=3$ → the data has 3 significant ring structures"
-- "$H^1\neq 0$ → local fragments are globally inconsistent → hallucination / inconsistency signal"
-
-## Common Errors
-
-| Error | Critique | Correct Approach |
-|---|---|---|
-| Confusing topological equivalence with geometric similarity | Topological equivalence only requires homeomorphism, not metric proximity | Distinguish "topologically identical" from "geometrically similar" |
-| Ignoring dimensional differences | $\mathbb{R}^1$ and $\mathbb{R}^2$ are not homeomorphic (invariance of domain, Brouwer) | Dimensional invariance is a mandatory check |
-| Confusing connected with path-connected | Connected $\neq$ path-connected (topologist's sine curve); path-connected $\Rightarrow$ connected, but not vice versa | Explicitly label which notion of connectivity is used |
-| Over-reliance on a single invariant | $\chi$ alone cannot distinguish all spaces (many spaces share $\chi=0$) | Use combinations of invariants; annotate uncertainty when incomplete |
-| Ignoring local vs. global topology | Local connectivity does not guarantee global connectivity; local homeomorphism $\neq$ global homeomorphism | Check local and global invariants separately |
-| Confusing homology with homotopy | $H_1(X)$ is the abelianization of $\pi_1(X)$; homology is a coarsening of homotopy | Specify whether $\pi_1$ (homotopy) or $H_1$ (homology) is used |
-| Embedding global exact homology into training | Persistent homology / symbolic homology involves irregular sparsity and serial reduction; intractable | Use local cohomology losses / approximation / sampling; pass through the GPU eight-dimensional gate |
-
-## Operating Procedure
-
-The output must include:
-
-1. **Continuity requirements**: `[Homeomorphism / Homotopy / Diffeomorphism], variable: [distances / angles / sizes], invariant: [hole count / connectivity / dimension]`
-2. **Invariants**: `$\chi=$ , $\pi_1=$ , $\beta_n=$ , $H_0=$ , $H_1=$ , $H_2=$ , compactness = [yes / no]`
-3. **Classification**: `[Orientable / Non-orientable], $\chi=$ → [surface type]; $\pi_1=$ → [homotopy type]`
-4. **Topological model**: `[Simplicial complex / Filtration / Network graph / Phase space / Sheaf-Čech], construction method: [description]`
-5. **Equivalence verification**: `[Invariants all match / differences found], conclusion: [equivalent / distinct / uncertain]`
-6. **Reasoning**: `Because [topological property] → [conclusion]`
-7. **[GPU Feasibility]** (if used for algorithm design) — whether topological quantities are local and batchable / GEMM-mappable; pass through the eight-dimensional gate; reform global exact homology via approximation.
-
-**Output must not consist of analysis alone without conclusions.**
-
-## Relations to Other Skills
-
-- **Symmetry and Invariance**: Topological invariants are invariants under continuous transformations — sharing the "find the invariants" logic, but topology focuses on continuous deformation rather than group actions.
-- **Abstraction Thinking**: Topology is the abstraction of spatial structure — remove the metric, keep only open sets and continuity.
-- **Transformation Thinking**: Continuous deformation is a special class of transformations; homeomorphisms and homotopies are both transformations.
-- **Modeling Thinking**: TDA is data modeling — use persistent homology to build topological models of point clouds and discover shapes that statistics misses.
-- **Probability and Statistics**: TDA complements statistical shape analysis — statistics focuses on means and variances (quantities), TDA focuses on connectivity and voids (qualities); they are complementary.
-- **Modern Mathematics Activation**: `../../references/books/algebraic-geometry-rising-sea.md` (sheaves / Čech cohomology → sheaf attention and hallucination regularization), `smooth-manifolds.md`, `differential-geometry.md`.

package/skills/topological-thinking/SKILL.md

@@ -1,128 +0,0 @@
----
-name: topological-thinking
-description: |
-  触发：拓扑数据分析（TDA）、持续同调、同调/基本群计算、单纯复形与滤流构造；或为算法设计需要连通性/鲁棒性/上同调一致性判据（如 Čech 上同调作幻觉正则、sheaf 注意力）时调用。
-  English: Trigger for topological data analysis (TDA), persistent homology, homology/fundamental group computation, simplicial complexes & filtrations; or designing connectivity/robustness/cohomology-consistency criteria (e.g. Čech cohomology as hallucination regularizer, sheaf attention) for algorithms.
----
-
-> **语言路由**：若用户消息为英文，请读取并遵循同目录下的 `SKILL.en.md`，按其操作规程以英文输出；中文消息则继续使用本文件。
-
-# 🌀 拓扑思想 / Topological Thinking
-
-> "可以拉伸弯曲但不能撕裂——真正重要的性质在连续变形中不变。"
-> "You can stretch and bend but never tear — truly important properties survive continuous deformation."
->
-> —— 拓扑学、同调理论、拓扑数据分析 / Topology, Homology, Topological Data Analysis
-
-## 核心原则 / Core Principle
-
-拓扑学研究连续变形下保持不变的性质。甜甜圈与咖啡杯拓扑等价——都有一个洞。核心洞察：当精确距离不重要时，拓扑捕获本质结构——连通性、洞、维数。在本技能包语境里，拓扑思想直接支撑「胞腔层扩散注意力」与「Čech 上同调正则」（见 activator 范例）。
-
-> **数学形式化 / Mathematical Formalization**
->
-> **同胚**：连续双射且逆连续 h: X→Y，拓扑等价标准。**同伦**：变形过程本身连续，比同胚更粗。**微分同胚**：光滑双射且逆光滑，微分拓扑标准。
->
-> **欧拉示性数** χ=V−E+F：凸多面体 χ=2，环面 χ=0，配合可定向性是曲面完全拓扑不变量。
->
-> **基本群** π₁(X)：基点环路模同伦变形；π₁(S¹)=Z（绕圈数），π₁(S²)=0（所有环路可收缩），π₁(环面)=Z×Z。
->
-> **同调群** H_n(X)：n 维"洞"计数：H₀=连通分量，H₁=1 维洞（环路），H₂=2 维空洞。**Betti 数** β_n=rank H_n：β₀=连通分量数，β₁=1 维洞数，β₂=2 维空洞数。
->
-> **单纯复形**：由单纯形（点/线段/三角形）组合的拓扑空间模型。**滤流**：从小到大改邻域半径，每半径下构建单纯复形。**持续同调**：沿滤流算同调群，长条=真实拓扑特征，短条=噪声。
->
-> **上同调** Hⁿ(X)：同调的对偶（函子化、有环结构），Čech 上同调用于从局部数据检测全局一致性障碍——H¹≠0 即局部片段无法拼成全局相容对象（这正是"幻觉"的代数判据）。
->
-> 详细见 `original-texts.md`。
-
-## GPU 友好性 / GPU-Friendliness（横切检查）
-
-拓扑结构能否上 GPU，取决于「局部性」与「张量化」——过 `../../references/gpu-friendly-math.md` 八维：
-
-- **局部拓扑量 → 友好**：每条边/每块的局部同调或限制映射是小运算，可批量并行、落小 GEMM。
-- **Čech 上同调正则**：作为局部一致性损失，廉价、可融合（友好）——这是 Tropical Sheaf Attention 的关键。
-- **持续同调（TDA）**：构造单纯复形与边界矩阵约简常含不规则稀疏/串行归约——典型"美但不可算"→ 改造为近似/采样/分布式。
-- **全局精确同调计算**：符号计算，不可训练，不友好。
-- **反模式**：把需要全局拓扑精确判定的结构塞进前向——不可算。
-
-八维最低判定（正式术语）：**张量化**看拓扑量是否可局部批量；**GEMM 可映射**看限制映射、边界算子、局部拉普拉斯是否落矩阵乘；**复杂度**看持续同调/边界矩阵约简是否超线性；**显存与 KV-Cache**看单纯复形、边界矩阵、覆盖交叠是否可压缩；**低精度稳定**看小奇异值、排序、阈值是否稳健；**并行与通信**看覆盖块/局部复形是否独立；**稀疏结构**看复形/图是否结构化稀疏；**算子融合**看局部一致性 loss 是否可融合。
-
-> 配合 `../../references/books/algebraic-geometry-rising-sea.md`（层/Čech 上同调→注意力与幻觉正则）、`smooth-manifolds.md`、`differential-geometry.md`。
-
-## 不适用场景 / When NOT to Use
-
-- **需要精确测量**——拓扑只关心定性结构（连通、有洞），不给距离/角度。
-- **度量性质是核心**——拓扑等价空间可有完全不同度量行为。
-- **纯离散结构无连续性**——拓扑以连续性为基础。
-- **需要精确数值决策**（取决于"多少"而非"是否连通"）——拓扑视角过粗。
-
-## 何时使用 / When to Use
-
-- 需要定性分类（不在乎"多大""多远"，只在乎"是否连通""有多少洞"）；形状比大小重要。
-- 需要鲁棒性分析（不变量保证性质在连续扰动下不消失）。
-- 数据有标准统计无法捕获的形状（聚类、空洞、环状结构）。
-- 需要变形下存活的不变量（拓扑绝缘体、拓扑纠错）。
-- **为注意力/表示设计全局一致性判据**（Čech 上同调作幻觉正则、sheaf 扩散）。
-
-## 方法流程 / Method
-
-### 第一步：识别连续性要求
-明确等价标准：同胚/同伦/微分同胚。确定什么可变（距离、角度、大小）什么必须固定（洞数、连通性、维数）。核心区分：可变（表面/度量）vs 不变（结构/拓扑）。
-
-### 第二步：寻找拓扑不变量
-- **欧拉示性数** χ=V−E+F（配合可定向性是曲面完全不变量）。
-- **连通性**（path-connectedness）：连通分量数=rank H₀；**紧致性**（Heine-Borel：Rⁿ 中紧致⇔有界+闭）。
-- **基本群** π₁(X)；**同调群** H_n（H₀=分量, H₁=1 维洞, H₂=2 维空洞）；**Betti 数** β_n=rank H_n。
-- **上同调** Hⁿ（同调的对偶，函子化，Čech 上同调检测全局一致性障碍）。
-
-### 第三步：用不变量分类
-同 χ→同类型曲面；同 π₁→同同伦类型；紧致曲面由可定向性+χ 完全分类。分类靠不变量，不看表面看结构。
-
-### 第四步：构造拓扑模型
-- **数据**：对点云构建滤流，计算每半径下单纯复形及同调，提取持续同调（条形码/持续图，长条=真实特征，短条=噪声）。
-- **网络**：连通分量（可达性）、环路（冗余路径）、聚类系数；网络拓扑决定信息传播与鲁棒性。
-- **系统**：相空间吸引子拓扑——不动点（点）、极限环（S¹）、混沌吸引子（分形）。
-- **算法**：用层/Čech 上同调把"局部片段能否拼成全局相容对象"变成可计算的代数障碍。
-
-### 第五步：验证拓扑等价
-尝试构造显式同胚/同伦等价；检查不变量匹配。不变量不同→拓扑不同（可靠否定）；全部匹配→可能等价（不变量可能不完备，不能确定）。
-
-### 第六步：拓扑推理与应用
-- "π₁(X)≠0 → 存在不可收缩环路 → 系统有不可达状态"
-- "X 连通 → 存在路径 → 转移总可能"
-- "β₁=3 → 数据有 3 个显著环状结构"
-- "H¹≠0 → 局部片段无法全局相容 → 幻觉/不一致信号"
-
-## 常见错误 / Common Errors
-
-| 错误 / Error | 数学批评 / Critique | 正确做法 / Correct Approach |
-|-------------|-------------------|---------------------------|
-| 混淆拓扑等价与几何相似 | 拓扑等价只要求同胚，不要求度量相近 | 区分"拓扑相同"与"几何相似" |
-| 忽略维数差异 | R¹ 与 R² 不同胚（维数不变性，Brouwer） | 维数 invariance 是强制检查项 |
-| 混淆连通与道路连通 | 连通≠道路连通（拓扑学家正弦曲线）；道路连通⇒连通，反之不成立 | 明确标注用哪种连通性 |
-| 过度依赖单一不变量 | 仅 χ 无法区分所有空间（χ=0 的空间多种） | 用不变量组合；不完备时标注不确定性 |
-| 忽略局部与全局拓扑差异 | 局部连通不保证全局连通；局部同胚≠全局同胚 | 分别检查局部与全局不变量 |
-| 混淆同调与同伦 | H₁(X) 是 π₁(X) 的 Abel 化；同调是同伦的粗化 | 标注用 π₁（同伦）还是 H₁（同调） |
-| 全局精确同调塞进训练 | 持续同调/符号同调含不规则稀疏与串行归约，不可算 | 用局部上同调损失/近似/采样，过 GPU 八维门 |
-
-## 操作规程 / Operating Procedure
-
-输出必须包含：
-
-1. **连续性要求**：`[同胚/同伦/微分同胚]，可变: [距离/角度/大小]，不变: [洞数/连通性/维数]`
-2. **不变量**：`χ= π₁= β_n=, H₀= H₁= H₂=，紧致性=[是/否]`
-3. **分类**：`[可定向/不可定向], χ= → [曲面类型]；π₁= → [同伦类型]`
-4. **拓扑模型**：`[单纯复形/滤流/网络图/相空间/层-Čech]，构造方法: [描述]`
-5. **等价验证**：`[不变量是否全匹配/有不同]，结论: [等价/不同/不确定]`
-6. **推理**：`因为[拓扑性质] → [结论]`
-7. **[GPU 可行性]**（若用于算法设计）— 拓扑量是否局部、可批量/落 GEMM，过八维门；全局精确同调则改造为近似
-
-**输出不得只给分析而无结论。**
-
-## 与其他 skill 的关系 / Relations to Other Skills
-
-- **对称与不变性**：拓扑不变量是连续变换下的不变量——共享"寻找不变量"逻辑，但拓扑关注连续变形而非群作用。
-- **抽象化思想**：拓扑是空间结构的抽象——去掉度量只留开集与连续性。
-- **变换思想**：连续变形是特殊变换；同胚/同伦都是变换。
-- **建模思想**：TDA 是数据建模——用持续同调为点云建拓扑模型，发现统计遗漏的形状。
-- **概率与统计**：TDA 补充统计的形状分析——统计关注均值方差（量），TDA 关注连通空洞（质），互补。
-- **现代数学激活**：`../../references/books/algebraic-geometry-rising-sea.md`（层/Čech 上同调→sheaf 注意力与幻觉正则）、`smooth-manifolds.md`、`differential-geometry.md`。

package/skills/topological-thinking/original-texts.en.md

@@ -1,134 +0,0 @@
-# Mathematical Sources and Classic Texts
-
-## Euler Characteristic (Euler, 1752)
-
-> "For any convex polyhedron, the number of vertices minus edges plus faces equals 2."
-
-**Leonhard Euler** (1707-1783) discovered this invariant of polyhedra in 1752:
-
-V - E + F = 2
-
-This formula seems simple but is profound — it holds for all convex polyhedra, whether cube (8-12+6=2), tetrahedron (4-6+4=2), or dodecahedron (20-30+12=2). The Euler characteristic is a topological invariant of surfaces: continuous deformations do not change χ. Sphere χ = 2, torus χ = 0, double torus χ = -2 — each additional hole reduces χ by 2.
-
-**Generalization**: for any surface S, χ(S) = 2 - 2g (orientable, genus g) or χ(S) = 2 - g (non-orientable, genus g). The Euler characteristic and orientability together form a complete set of classification invariants for compact surfaces.
-
-## Poincaré Conjecture & Perelman's Proof (2004)
-
-> "Every simply-connected closed 3-manifold is homeomorphic to the 3-sphere S³."
-
-**Henri Poincaré** (1854-1912) proposed this conjecture in 1904 — it became one of the most famous unsolved problems in the history of mathematics, confounding mathematicians for a full century.
-
-**Grigori Perelman** (1966-) posted three papers online in 2002-2003, completing the proof using **Ricci flow** (a differential geometric tool introduced by Hamilton) combined with surgery techniques. Perelman declined the 2006 Fields Medal and the 2010 Clay Millennium Prize of one million dollars — the most dramatic episode in the history of mathematics.
-
-**Intuition behind Ricci flow**: the metric on a manifold evolves over time so that curvature tends toward uniformity — much like heat diffusion makes temperature distribution uniform. When curvature concentrates at a "neck," surgery cuts it out and caps it with a standard sphere, then Ricci flow continues. The manifold is eventually decomposed into geometric pieces (Thurston's geometrization conjecture), each with a standard metric — the Poincaré conjecture is a special case of the geometrization conjecture.
-
-## Fundamental Group (Poincaré, 1895)
-
-> "The fundamental group π₁(X) consists of equivalence classes of loops based at a point modulo homotopic deformation — it captures the 'non-contractible loops' structure of a space."
-
-**Poincaré** introduced the concept of the fundamental group in his 1895 paper *Analysis Situs* — the foundational work of algebraic topology.
-
-Core examples:
-- **π₁(S¹) = Z** — loops on the circle are classified by winding number: a loop winding n times cannot be continuously deformed into one winding m times (n ≠ m)
-- **π₁(S²) = 0** — all loops on the sphere are contractible to a point — the sphere "has no holes"
-- **π₁(torus) = Z × Z** — winding in two independent directions, combined as (m, n) winding numbers
-- **π₁(real projective plane RP²) = Z₂** — only two classes of loops: contractible (even winding) and non-contractible (odd winding)
-
-**Key property**: homeomorphic spaces have isomorphic fundamental groups (topological invariant); however, the fundamental group is not a complete invariant — different spaces can share the same fundamental group (e.g., S² and S³ both have π₁ = 0, but they are not homeomorphic).
-
-## Homology Groups
-
-> "Homology groups H_n(X) count n-dimensional 'holes' in a space — translating topological intuition into computable algebraic quantities."
-
-**Simplicial homology computation**:
-1. Construct a simplicial complex K (approximating the space with simplices such as triangles and tetrahedra)
-2. Define the boundary operator ∂_n: C_n → C_{n-1} (the boundary of each n-simplex is a combination of (n-1)-simplices)
-3. Key property ∂² = 0 (the boundary of a boundary is zero)
-4. Homology group H_n(K) = ker(∂_n) / im(∂_{n+1}) — "cycles" modulo "boundaries" — true holes are not boundaries of any higher-dimensional simplex
-
-**Intuition**: H₀ = number of connected components (zero-dimensional "holes" = separated pieces), H₁ = number of 1-dimensional holes (unfillable loops), H₂ = number of 2-dimensional voids (unfillable cavities). Betti numbers β_n = rank H_n(X) count the holes.
-
-**Homology vs homotopy**: H₁(X) is the abelianization of π₁(X) (H₁ = π₁/[π₁, π₁], quotienting out the commutator subgroup). Homology is easier to compute (linear algebra) but less informative (non-abelian structure is lost); homotopy is richer in information but harder to compute. The choice depends on the problem at hand — π₁ for fine classification, H₁ for fast computation.
-
-## Topological Data Analysis (Carlsson, 2009)
-
-> "Persistent homology lets data 'speak' — it discovers not means and variances, but the shape of data."
-
-**Gunnar Carlsson** (Stanford) founded Ayasdi in 2009, bringing persistent homology into applications.
-
-**Persistent homology computation**:
-1. Starting from point cloud data, construct a filtration by varying the neighborhood radius ε from small to large
-2. For each ε, construct the Vietoris-Rips complex VR_ε (connecting point pairs at distance ≤ ε, filling triangles when three points are mutually within distance ≤ ε)
-3. Compute the homology groups H_n(VR_ε) for each ε
-4. Record the "birth time" (ε_birth) and "death time" (ε_death) of each topological feature
-5. Output a barcode diagram or persistence diagram (points (ε_birth, ε_death))
-
-**Stability theorem**: the Wasserstein distance between persistence diagrams ≤ the Hausdorff distance between data sets — small perturbations of the data produce only small changes in the persistence diagram. This guarantees the robustness of TDA: noise produces short bars, real features produce long bars.
-
-**Applications**: topological structure in tumor genomic data revealing new cancer subtypes; sensor network coverage hole detection; topological signatures of phase transitions in materials science; topological early warning of market crashes in finance.
-
-## Brouwer Fixed Point Theorem (1911)
-
-> "Every continuous map f: Dⁿ → Dⁿ has a fixed point — there exists x₀ such that f(x₀) = x₀."
-
-**L.E.J. Brouwer** (1881-1966) proved this theorem in 1911 — ironically, Brouwer later became the founder of intuitionism, opposing the law of excluded middle on which his own theorem relies.
-
-**Intuition**: stir coffee in a cup, then stop — at least one point must have returned to its original position, since stirring is a continuous map on a disk, which must have a fixed point.
-
-**Applications**:
-- **Game theory** (Nash, 1950): the existence of Nash equilibrium relies on the Brouwer fixed point theorem — every finite game has at least one mixed-strategy Nash equilibrium
-- **Economics**: the fixed-point proof of general equilibrium theory (Arrow-Debreu) — existence of market equilibrium
-- **Differential equations**: the Peano existence theorem uses fixed-point methods
-
-## Jordan Curve Theorem
-
-> "Every simple closed curve in R² divides the plane into two regions — interior and exterior."
-
-**Seemingly obvious yet extremely hard to prove** — Jordan's original proof (1892) had gaps; Veblen (1905) gave the first rigorous proof. The difficulty lies in the fact that closed curves can exhibit extremely complex topological behavior (e.g., Osgood curves with arbitrarily large area); what seems "obvious" intuitively requires fine topological argumentation mathematically.
-
-**Generalization**: Jordan-Brouwer separation theorem — every subset of Rⁿ homeomorphic to S^{n-1} divides Rⁿ into two connected components. Higher dimensions entail more complex proofs.
-
-## Knot Theory
-
-> "Knot classification relies on invariants — Jones polynomial, Alexander polynomial, etc. distinguish different knot types."
-
-Knot theory studies equivalence classes of simple closed curves in R³ under isotopy (classification up to continuous deformation). The central question: can two knots be transformed into each other by continuous deformation (without cutting or gluing)?
-
-**Key invariants**:
-- **Alexander polynomial** (1928): the first polynomial knot invariant, but incomplete (different knots can share the same Alexander polynomial)
-- **Jones polynomial** (1984): Vaughan Jones's discovery — deep connections to statistical mechanics and quantum field theory; Jones received the 1990 Fields Medal for this work
-- **Knot group** π₁(R³ - K): the fundamental group of the knot complement in three-dimensional space
-
-**Applications**: DNA topology — supercoiling, knotted DNA, and catenanes affect DNA replication and transcription; enzymes (topoisomerases) alter the topological structure of DNA, effectively performing "topological surgery." Molecular knot chemistry — synthesizing topologically complex molecular structures.
-
-## Classification of Surfaces
-
-> "Compact surfaces are completely classified by orientability and Euler characteristic — the paradigm of topological classification."
-
-**Classification theorem** (Möbius 1861, Dyck 1888, completed):
-
-Orientable surfaces: S² (χ=2), torus T² (χ=0), double torus (χ=-2), triple torus (χ=-4), ... — genus g surface has χ = 2 - 2g
-
-Non-orientable surfaces: RP² (χ=1), Klein bottle (χ=0), ... — genus g non-orientable surface has χ = 2 - g
-
-**Standard form**: every compact surface is homeomorphic to a connected sum of tori or projective planes. Orientable: #g T² (connected sum of g tori); non-orientable: #g RP² (connected sum of g projective planes).
-
-**Completeness of classification**: (orientability, χ) is a complete invariant set — two compact surfaces are homeomorphic if and only if they share the same orientability and the same Euler characteristic.
-
-## Morse Theory
-
-> "Critical points of a smooth function encode the manifold's topology — Morse theory bridges analysis and topology."
-
-**Marston Morse** (1892-1977) established this theory:
-
-A **Morse function** f: M → R has the property that every critical point p (where df(p) = 0) is non-degenerate (the determinant of the Hessian matrix ≠ 0). The index of a critical point = the number of negative eigenvalues of the Hessian = the dimension of the "downward directions" at the critical point.
-
-**Core theorem**: Morse inequalities relate critical point counts to Betti numbers:
-- c_k ≥ β_k (number of k-dimensional critical points ≥ k-th Betti number)
-- c_k - c_{k-1} + ... ± c_0 ≥ β_k - β_{k-1} + ... ± β_0
-
-**Intuition**: scanning M from low to high values of f, each critical point of index k triggers a "k-dimensional attachment" — equivalent to gluing a k-cell. The entire topology of the manifold is completely determined by all critical points and their indices.
-
----
-
-**Summary**: Topological ideas pervade the core of mathematics — from Euler's characteristic to Poincaré's fundamental group, from the computability of homology groups to the data applications of persistent homology, from the applied power of fixed point theorems to the biological relevance of knot theory. Topology provides a unified perspective on "what remains invariant under continuous deformation." It tells us: what truly matters is not precise measurement, but the essence of structure — connectedness, holes, dimension, orientability. These properties survive stretching and bending, and change only under tearing and gluing — this is precisely the fundamental boundary that distinguishes topology from geometry.