math-skill 2.1.0 → 3.0.1

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.

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

@@ -1,164 +0,0 @@
-# 数学出处与经典文献 / Mathematical Sources and Classic Texts
-
-## 欧拉示性数 / Euler Characteristic (Euler, 1752)
-
-> "对于任何凸多面体，顶点数 - 边数 + 面数 = 2。"
-> "For any convex polyhedron, the number of vertices minus edges plus faces equals 2."
-
-**Leonhard Euler**（1707-1783）在 1752 年发现了多面体的这一不变量：
-
-V - E + F = 2
-
-这一公式看似简单，实则深刻——它对所有凸多面体成立，无论多面体是立方体（8-12+6=2）、四面体（4-6+4=2）还是十二面体（20-30+12=2）。欧拉示性数是曲面的拓扑不变量：连续变形不改变 χ 的值。球面 χ = 2，环面 χ = 0，双环面 χ = -2——每增加一个洞，χ 减少 2。
-
-**推广**：对任意曲面 S，χ(S) = 2 - 2g（可定向，亏格 g）或 χ(S) = 2 - g（不可定向，亏格 g）。欧拉示性数与可定向性共同构成紧致曲面的完全分类不变量。
-
-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). Euler characteristic and orientability together form a complete set of classification invariants for compact surfaces.
-
-## Poincaré 猜想与 Perelman 证明 / Poincaré Conjecture & Perelman's Proof (2004)
-
-> "每一个单连通的紧致三维流形都同胚于三维球面 S³。"
-> "Every simply-connected closed 3-manifold is homeomorphic to the 3-sphere S³."
-
-**Henri Poincaré**（1854-1912）在 1904 年提出这一猜想——它成为数学史上最著名的未解问题之一，困扰数学家整整一百年。
-
-**Grigori Perelman**（1966-）在 2002-2003 年间在网上发布三篇论文，利用 **Ricci 流**（Hamilton 提出的微分几何工具）结合手术（surgery）技术完成了证明。Perelman 拒绝了 2006 年的 Fields 奖和 2010 年的 Clay 千禧奖百万美元奖金——数学史上最戏剧性的一幕。
-
-**Ricci 流**的直觉：流形上的度量随时间演化，使得曲率趋于均匀——就像热传导使温度分布趋于均匀。当曲率集中在某处时（"脖子"），用手术切除并补上标准球面，继续 Ricci 流。最终流形被分解为若干几何片（Thurston 的几何化猜想），每片都有标准度量——Poincaré 猜想是几何化猜想的特例。
-
-Perelman's proof used **Ricci flow** (a tool introduced by Hamilton) combined with surgery. The intuition: the metric on a manifold evolves over time, making curvature tend toward uniformity — like heat diffusion making temperature 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); Poincaré is a special case. Perelman declined the 2006 Fields Medal and 2010 Clay Millennium Prize — the most dramatic episode in mathematical history.
-
-## 基本群 / Fundamental Group (Poincaré, 1895)
-
-> "基本群 π₁(X) 是所有基于基点的环路在同伦变形下的等价类——它捕获空间的'不可收缩环路'结构。"
-> "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é** 在 1895 年的论文 *Analysis Situs* 中引入了基本群的概念——这是代数拓扑的奠基之作。
-
-核心例子：
-- **π₁(S¹) = Z**——圆周上的环路按绕圈次数分类：绕 n 次的环路不能连续变形为绕 m 次的环路（n ≠ m）
-- **π₁(S²) = 0**——球面上所有环路都可收缩为一点——球面"没有洞"
-- **π₁(环面) = Z × Z**——两个独立方向的绕圈，组合为 (m, n) 绕圈次数
-- **π₁(实射影平面 RP²) = Z₂**——只有两类环路：可收缩的（绕偶数次）和不可收缩的（绕奇数次）
-
-**关键性质**：同胚空间有同构的基本群（拓扑不变量）；但基本群不是完备不变量——不同空间可以有相同的基本群（如 S² 和 S³ 的 π₁ 都是 0，但它们不同胚）。
-
-Core examples: π₁(S¹) = Z (winding number classifies loops); π₁(S²) = 0 (all loops contractible — sphere has "no holes"); π₁(torus) = Z × Z (winding in two independent directions); π₁(RP²) = Z₂ (even vs odd winding). Key property: homeomorphic spaces have isomorphic fundamental groups (topological invariant); but π₁ is not a complete invariant — different spaces can share the same π₁ (e.g., S² and S³ both have π₁ = 0 but are not homeomorphic).
-
-## 同调群 / Homology Groups
-
-> "同调群 H_n(X) 计算空间中 n 维'洞'的数量——它将拓扑直觉转化为可计算的代数量。"
-> "Homology groups H_n(X) count n-dimensional 'holes' in a space — translating topological intuition into computable algebraic quantities."
-
-**单纯同调的计算流程**：
-1. 构造单纯复形 K（用三角形/四面体等单纯形近似空间）
-2. 定义边界算子 ∂_n: C_n → C_{n-1}（每个 n-单纯形的边界是 (n-1)-单纯形的组合）
-3. 关键性质 ∂² = 0（边界的边界为零）
-4. 同调群 H_n(K) = ker(∂_n) / im(∂_{n+1})——"环路"模去"边界"——真正的洞不是任何更高维单纯形的边界
-
-**直觉**：H₀ = 连通分量数（零维"洞"= 分离的碎片），H₁ = 1 维洞数（不可填充的环路），H₂ = 2 维空洞数（不可填充的空腔）。Betti 数 β_n = rank H_n(X) 是洞的计数。
-
-**同调 vs 同伦**：H₁(X) 是 π₁(X) 的 Abel 化（H₁ = π₁/[π₁, π₁]，去掉交换子的约束）。同调计算更容易（线性代数），但信息更少（丢失了非交换结构）；同伦信息更丰富但计算更难。选择取决于问题需求——需要精细分类用 π₁，需要快速计算用 H₁。
-
-Simplicial homology computation: (1) build simplicial complex K; (2) define boundary operator ∂_n: C_n → C_{n-1}; (3) key property ∂² = 0; (4) H_n(K) = ker(∂_n) / im(∂_{n+1}) — "cycles" modulo "boundaries" — true holes are not boundaries of higher-dimensional simplices. Intuition: H₀ = connected components, H₁ = 1-holes (unfillable loops), H₂ = 2-voids (unfillable cavities). Betti numbers β_n = rank H_n. Homology vs homotopy: H₁(X) = π₁(X) abelianized. Homology is easier to compute (linear algebra) but less informative; homotopy is richer but harder. Choose based on needs — π₁ 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）在 2009 年创立了 Ayasdi 公司，将持续同调推向应用。
-
-**持续同调的计算流程**：
-1. 从点云数据出发，构造滤流（filtration）：从小到大改变邻域半径 ε
-2. 对每个 ε，构建 Vietoris-Rips 复形 VR_ε（距离 ≤ ε 的点对连线，三点互距 ≤ ε 则填三角形）
-3. 对每个 ε 计算同调群 H_n(VR_ε)
-4. 记录每个拓扑特征的"出生时间"（ε_birth）和"死亡时间"（ε_death）
-5. 输出条形码图（barcode）或持续图（persistence diagram: 点 (ε_birth, ε_death))
-
-**稳定性定理**：持续图之间的 Wasserstein 蕴距离 ≤ 数据之间的 Hausdorff 蕴距离——数据的微小扰动只导致持续图的微小变化。这保证了 TDA 的鲁棒性：噪声产生短条，真实特征产生长条。
-
-**应用**：肿瘤基因数据的拓扑结构发现新的癌症亚型；传感器网络覆盖空洞检测；材料科学中相变拓扑标志；金融市场中市场崩溃前的拓扑预警。
-
-Computation: (1) from point cloud, build filtration by varying neighborhood radius ε; (2) for each ε, construct Vietoris-Rips complex; (3) compute H_n at each ε; (4) record birth and death times; (5) output barcode or persistence diagram. Stability theorem: Wasserstein distance between diagrams ≤ Hausdorff distance between data — small data perturbation → small diagram perturbation. Noise produces short bars, real features produce long bars. Applications: tumor genomic topology revealing new cancer subtypes; sensor network coverage hole detection; phase transition signatures in materials science; topological early warning of market crashes in finance.
-
-## Brouwer 不动点定理 / Brouwer Fixed Point Theorem (1911)
-
-> "每一个连续映射 f: Dⁿ → Dⁿ 都有不动点——即存在 x₀ 使得 f(x₀) = x₀。"
-> "Every continuous map f: Dⁿ → Dⁿ has a fixed point — there exists x₀ with f(x₀) = x₀."
-
-**L.E.J. Brouwer**（1881-1966）在 1911 年证明此定理——讽刺的是，Brouwer 后来成为直觉主义的创始人，反对他自己定理所依赖的排中律。
-
-**直觉**：搅动杯中的咖啡，停搅后必有至少一点回到原位——因为搅动是圆盘上的连续映射，必有不动点。
-
-**应用**：
-- **博弈论**（Nash，1950）：Nash 均衡的存在性依赖于 Brouwer 不动点定理——每个有限博弈至少存在一个混合策略 Nash 均衡
-- **经济学**：一般均衡理论（Arrow-Debreu）的不动点证明——市场均衡的存在性
-- **微分方程**：Peano 存在定理的证明用到不动点方法
-
-Intuition: stir coffee in a cup, stop — some point must return to its original position, since stirring is a continuous map on a disk, which must have a fixed point. Applications: Nash equilibrium existence (Nash 1950) — every finite game has at least one mixed-strategy Nash equilibrium; economics — general equilibrium theory (Arrow-Debreu) uses fixed-point proof; differential equations — Peano existence theorem via fixed-point methods.
-
-## Jordan 曲线定理 / Jordan Curve Theorem
-
-> "R² 中每条简单闭曲线将平面分成两个区域——内部和外部。"
-> "Every simple closed curve in R² divides the plane into two regions — interior and exterior."
-
-**看似显然却极难证明**——Jordan（1892）的原始证明有漏洞，Veblen（1905）给出第一个严格证明。定理的困难在于：闭曲线可以有极其复杂的拓扑行为（如 Osgood 曲线，面积可以任意大），直觉上的"显然"在数学上需要精细的拓扑论证。
-
-**推广**：Jordan-Brouwer 分离定理——Rⁿ 中每个与 S^{n-1} 同胚的子集将 Rⁿ 分成两个连通区域。维数越高，证明越复杂。
-
-Seemingly obvious yet extremely hard to prove — Jordan's original proof (1892) had gaps; Veblen (1905) gave the first rigorous proof. The difficulty: closed curves can have 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 = more complex proofs.
-
-## 纽结理论 / Knot Theory
-
-> "纽结的分类依靠不变量——Jones 多项式、Alexander 多项式等区分不同纽结类型。"
-> "Knot classification relies on invariants — Jones polynomial, Alexander polynomial, etc. distinguish different knot types."
-
-纽结理论研究 R³ 中简单闭曲线的等价类（同痕 isotopy 下的分类）。核心问题：两个纽结能否通过连续变形（不切断不粘合）相互转化？
-
-**关键不变量**：
-- **Alexander 多项式**（1928）：第一个纽结多项式不变量，但不完备（不同纽结可有相同 Alexander 多项式）
-- **Jones 多项式**（1984）：Vaughan Jones 的发现——与统计力学和量子场论有深层联系，Jones 因此获 1990 年 Fields 奖
-- **纽结群** π₁(R³ - K)：纽结在三维空间中的补空间的基本群
-
-**应用**：DNA 拓扑——超螺旋（supercoiling）、纽结（knotted DNA）和链环（catenanes）影响 DNA 复制与转录；酶（拓扑异构酶 topoisomerase）改变 DNA 的拓扑结构，相当于进行"拓扑手术"。分子纽结化学——合成拓扑复杂的分子结构。
-
-Knot theory studies equivalence classes of simple closed curves in R³ under isotopy. Key invariants: Alexander polynomial (1928, first polynomial invariant but incomplete); Jones polynomial (1984, deep connections to statistical mechanics and QFT, Jones won 1990 Fields Medal); knot group π₁(R³ - K). Applications: DNA topology — supercoiling, knotted DNA, and catenanes affect replication and transcription; topoisomerase enzymes perform "topological surgery" on DNA. 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."
-
-**分类定理**（Möbius 1861, Dyck 1888 完善）：
-
-可定向曲面：S² (χ=2), 环面 T² (χ=0), 双环面 (χ=-2), 三环面 (χ=-4), ... — 亏格 g 的曲面 χ = 2 - 2g
-
-不可定向曲面：RP² (χ=1), Klein 瓶 (χ=0), ... — 亏格 g 的不可定向曲面 χ = 2 - g
-
-**标准形式**：每个紧致曲面同胚于若干环面或若干 RP² 的连通和（connected sum）。可定向：#g T²（g 个环面的连通和）；不可定向：#g RP²（g 个射影平面的连通和）。
-
-**分类的完备性**：(可定向性, χ) 是完备不变量集——两个紧致曲面同胚 iff 它们有相同的可定向性和相同的 χ。
-
-Classification theorem: orientable surfaces S² (χ=2), torus T² (χ=0), double torus (χ=-2), ... genus g surface χ = 2-2g. Non-orientable: RP² (χ=1), Klein bottle (χ=0), ... genus g non-orientable χ = 2-g. Standard form: every compact surface is homeomorphic to a connected sum of tori or projective planes. Completeness: (orientability, χ) is a complete invariant set — two compact surfaces are homeomorphic iff they share the same orientability and Euler characteristic.
-
-## Morse 理论 / Morse Theory
-
-> "光滑函数的临界点编码了流形的拓扑——Morse 理论将分析与拓扑联系起来。"
-> "Critical points of a smooth function encode the manifold's topology — Morse theory bridges analysis and topology."
-
-**Marston Morse**（1892-1977）建立了这一理论：
-
-**Morse 函数** f: M → R 的每个临界点 p（df(p) = 0）都是非退化的（Hessian 矩阵的行列式 ≠ 0）。临界点的指标（index）= Hessian 中负特征值的个数 = 临界点处"向下方向"的维数。
-
-**核心定理**：Morse 不等式将临界点数与 Betti 数联系起来：
-- c_k ≥ β_k（k 维临界点数 ≥ k 维 Betti 数）
-- c_k - c_{k-1} + ... ± c_0 ≥ β_k - β_{k-1} + ... ± β_0
-
-**直觉**：随着 f 的值从低到高扫描 M，每次经过一个指标为 k 的临界点，流形的拓扑发生一次"k 维附着"——相当于粘上一个 k 维胞腔。整个流形的拓扑由所有临界点及其指标完全决定。
-
-Intuition: scanning M from low to high values of f, each critical point of index k triggers a "k-dimensional attachment" — gluing a k-cell. The manifold's entire topology is determined by all critical points and their indices. Core theorem: Morse inequalities relate critical point counts to Betti numbers — c_k ≥ β_k. Morse theory bridges differential analysis (critical points) and algebraic topology (homology).
-
----
-
-**总结 / Summary**：拓扑思想贯穿数学的核心——从 Euler 的示性数到 Poincaré 的基本群，从同调群的可计算性到持续同调的数据应用，从不动点定理的应用力量到纽结理论的生物关联，拓扑提供了"连续变形下什么不变"的统一视角。它告诉我们：真正重要的性质，不是精确的度量，而是结构的本质——连通、洞、维数、可定向性。这些性质在拉伸与弯曲中存活，在撕裂与粘合中改变——这正是拓扑区别于几何的根本界限。

package/skills/transformation/SKILL.en.md

@@ -1,120 +0,0 @@
----
-name: transformation
-description: |
-  Trigger when a problem is intractable in its current representation and needs a mathematical transform into an equivalent simpler problem; or finding an equivalent but more GPU-friendly representation (e.g. convolution->GEMM, spectral transform) for algorithm/operator design.
----
-
-# Transformation
-
-> "Complex problem -> equivalent simple problem; the key is finding the right transformation and its inverse."
->
-> -- Fourier, Laplace, Coordinate Transform
-
-## Core Principle
-
-**The same problem can have different representations. Choosing a good representation (or transformation) can make a difficult problem simple.** The essence of a transformation is not to change the problem itself, but to change the perspective from which it is viewed.
-
-> **Mathematical Formalization**
->
-> Let a transformation $T: D_1 \to D_2$. $T$ is useful if and only if three conditions hold simultaneously: (1) **Computability**: $T(x)$ can be explicitly computed; (2) **Simplification**: the problem is more tractable in $D_2$ (e.g., differentiation -> multiplication, convolution -> multiplication); (3) **$T^{-1}$ exists**: the solution in $D_2$ can be mapped back to the original solution in $D_1$.
->
-> Core question: **Under what conditions does $T^{-1}$ exist?** Existence determines equivalence, and the domain of convergence determines validity. Properties: equivalence (no information loss, requiring $T^{-1}$ to exist), simplification, invertibility (when $T^{-1}$ exists and is computable, the transformation is exact rather than approximate).
-
-## GPU-Friendliness (Cross-Cutting Check)
-
-In algorithm design, the value of a transformation often manifests as "converting an unfriendly operation into a GPU-friendly one" -- pass the eight-dimensional gate in `../../references/gpu-friendly-math.md`:
-
-- **Convolution -> GEMM** (im2col / Winograd): Converts irregular convolution into matrix multiplication, fully utilizing Tensor Cores (friendly, but watch for memory expansion).
-- **Spectral transforms (FFT / DCT)**: $O(N^2)\to O(N\log N)$, batch-parallelizable; but butterfly communication patterns require attention to memory access.
-- **Duality transforms (Legendre / Fenchel)**: Converts constrained optimization into a dual problem -- friendly if the dual is more GEMM-amenable.
-- **Transforms as compression**: Frequency-domain sparsity means only significant coefficients need to be stored (KV / activation compression, friendly).
-- **Anti-patterns**: The transform itself requires $O(n^2)$ global rearrangement and cannot be fused -- "beautiful but incomputable"; the inverse transform is not numerically stable (ill-conditioned).
-
-Eight-dimensional minimum assessment (formal terms): **Tensorization** -- whether the transform / inverse transform can be batched; **GEMM-mappability** -- whether it can be rewritten as GEMM / convolution / FFT / batched solve; **Complexity** -- the transform must reduce, not increase, the computational order; **Memory & KV-Cache** -- whether im2col, frequency-domain caches, and block summaries save memory rather than explode it; **Low-precision stability** -- inverse transform, orthogonalization, normalization; **Parallelism & communication** -- butterfly / scan / block communication patterns; **Sparse structure** -- whether frequency-domain / block sparsity is structured; **Operator fusion** -- whether the transform-core operation-inverse transform chain can be fused or recomputed.
-
-> Cross-reference `../../references/books/matrix-analysis.md` (spectral / low-rank), `optimization-ml.md` (duality).
-
-## When NOT to Use
-
-- **The problem is already simple enough** -- no transformation is needed.
-- **The transformation loses critical information** (irreversible, and the lost information is precisely what matters) -- choose an information-preserving transformation.
-- **Only qualitative understanding is needed** -- transformations are typically quantitative tools.
-- **Convergence conditions are not satisfied** -- forcing a transformation produces meaningless results.
-
-## When to Use
-
-- The problem is difficult to analyze or solve in its current form; revealing hidden structure in data (periodic signals -> frequency spectrum).
-- Simplifying complex operations into simpler ones (convolution -> multiplication); linearizing nonlinear problems; decoupling coupled variables.
-- **Finding an equivalent but more GPU-friendly representation for an operator** (convolution -> GEMM, sparse -> structured, frequency-domain compression).
-
-## Method
-
-### Step 1: Analyze the Difficulty of the Current Representation
-Why is the current form hard to work with? Is the computation complex (e.g., ODEs are hard to solve directly)? Is the structure opaque (periodicity is invisible in the time domain)? Are variables coupled? Identifying "where the difficulty lies" is a prerequisite for choosing a transformation; selecting a transform without diagnosis is blind operation.
-
-### Step 2: Select the Transformation
-Choose based on the type of difficulty; for each candidate, verify the formula, domain mapping, convergence conditions, and simplification effect:
-
-| Transform | Formula | Domain Mapping | Convergence / Validity | Simplification Effect |
-|---|---|---|---|---|
-| Fourier | $F(\omega)=\int f(t)e^{-i\omega t}\,dt$ | $t\in\mathbb{R}\to\omega\in\mathbb{R}$ | Dirichlet: absolutely integrable, finitely many extrema/discontinuities | Differentiation -> multiplication, convolution -> multiplication |
-| Laplace | $F(s)=\int_0^\infty f(t)e^{-st}\,dt$ | $t\in[0,\infty)\to s\in\mathbb{C},\;\text{Re}(s)>\alpha$ | $\exists\alpha: \int|f(t)|e^{-\alpha t}\,dt<\infty$ | Constant-coefficient ODE -> algebraic equation, incorporates initial conditions |
-| Z-transform | $F(z)=\sum f[n]z^{-n}$ | $n\in\mathbb{N}\to z\in\mathbb{C},\;|z|>R$ | $\exists R: \sum|f[n]|R^{-n}<\infty$ | Difference equation -> algebraic equation |
-| Generating function | $G(x)=\sum a_n x^n$ | $n\in\mathbb{N}\to x,\;|x|<\rho$ | $\exists\rho: \sum|a_n|\rho^n$ converges | Recurrence -> differential equation |
-| Legendre | $f^*(p)=\sup_x(px-f(x))$ | $x\to p=f'(x)$ | When $f$ is convex and differentiable, $p\leftrightarrow x$ is a bijection | Convex optimization -> dual, Lagrangian -> Hamiltonian |
-| Wavelet | $W(a,b)=\int f(t)\psi_{a,b}(t)\,dt$ | $t\in\mathbb{R}\to(a,b)$ | $f\in L^2$, $\psi$ admissible | Time-frequency localization, multi-scale analysis |
-
-### Step 3: Execute the Transformation
-Transform the problem into the new representation space, strictly following the formula. A transformation is not an escape from the problem; it is a re-expression of the same problem in a more effective language.
-
-### Step 4: Verify Convergence and Domain Conditions
-**Before applying transformation results, one must verify convergence conditions**: For Fourier, check Dirichlet conditions ($\int|f|\,dt<\infty$); for Laplace, determine the region of convergence $\text{Re}(s)>\alpha$ (outside this region $F(s)$ is undefined); for the Z-transform, determine $|z|>R$ (the inverse transform depends on the choice of region of convergence); for generating functions, determine the radius of convergence $\rho$; for wavelets, verify the admissibility condition of the mother wavelet. Skipping this step is the largest source of errors.
-
-### Step 5: Solve in the Transformed Space
-In the new representation the problem is often simpler; all operations must be carried out within the valid domain of the transform. The value of the transformed space lies in making originally hidden structure visible.
-
-### Step 6: Apply the Inverse Transform to Return to the Original Space
-Map the solution back to the language of the original problem. The existence of the inverse transform requires conditions: Fourier inverse $f(t)=(1/2\pi)\int F(\omega)e^{i\omega t}\,d\omega$ (requires $F$ to be absolutely integrable); Laplace inverse via the Bromwich integral $f(t)=(1/2\pi i)\int F(s)e^{st}\,ds$ ($\gamma>\alpha$, to the right of the region of convergence); Z-inverse $f[n]=(1/2\pi i)\oint F(z)z^{n-1}\,dz$ (contour within the region of convergence); generating function $a_n=G^{(n)}(0)/n!$ or $[x^n]G(x)$. The transformation is merely a means; the final answer must be in the original space.
-
-### Step 7: Verify Equivalence
-Confirm that the transformation has not lost critical information and that the inverse-transformed result is indeed a solution of the original problem: Was the inverse transform executed within the correct region of convergence? Does the original function satisfy the prerequisite conditions? Were boundary / initial conditions correctly encoded? Equivalence is the bottom line of transformation theory -- a transformation must be a verifiably equivalent operation, not an approximation or an evasion.
-
-## Common Errors
-
-| Error | Critique | Correct Approach |
-|---|---|---|
-| Choosing an inappropriate transformation | Fails to simplify and instead increases complexity | Select the transformation based on problem characteristics |
-| Using an irreversible transformation that loses information | Cannot return to the original problem after transformation | Verify invertibility or confirm that the lost information is not critical |
-| Forgetting the inverse transform | After obtaining a solution in the new space, forgetting to transform back | The final answer must be in the original space |
-| Ignoring domain changes after transformation | The transformation may alter the domain or introduce singularities | Check the post-transformation domain and boundary conditions |
-| Treating the transformation as magic | A transformation only changes the representation, not the essence of the problem | A transformation is a tool; understanding is the core competency |
-| Applying Fourier to non-integrable functions | When $\int|f|\,dt=\infty$, $F(\omega)$ may be meaningless | First check Dirichlet conditions; if not satisfied, use generalized functions or Laplace |
-| Ignoring the Laplace region of convergence | $F(s)$ is defined only for $\text{Re}(s)>\alpha$ | Restrict all operations to the region of convergence |
-| Assuming all transformations are invertible | Some transformations are not invertible under certain conditions (e.g., non-convex Legendre) | Verify invertibility conditions before applying the inverse transform |
-| Overlooking discrete transforms (DFT/FFT) | Continuous transforms are not applicable to discrete data | Use the DFT for discrete data: $X[k]=\sum x[n]e^{-i2\pi kn/N}$ |
-| Post-transformation incomputability / non-fusibility | The transform requires $O(n^2)$ global rearrangement or an ill-conditioned inverse | Evaluate the GPU eight-dimensional gate; if necessary, choose a fusible, numerically stable equivalent transformation |
-
-## Operating Procedure
-
-The output must include:
-
-1. **Difficulty of the current representation**: `[Difficulty]: [Description]`
-2. **Transformation selection**: `[Transform]: [Choice] because [Reason], formula [Formula], convergence conditions [Conditions], expected simplification [Effect]`
-3. **Transformation execution**: The problem form after transformation
-4. **Convergence and domain verification**: `[Verification]: [Whether conditions are satisfied, region of convergence]`
-5. **Solution in transformed space**: The solution method under the new representation
-6. **Inverse transform**: The solution translated back to the original space, noting inverse-transform conditions
-7. **Equivalence verification**: Is it invertible? Is information lost? Is the region of convergence correct?
-8. **[GPU viability]** (if used for operator design) -- whether the transformation converts the operation into GEMM / fusible / numerically stable form; pass the eight-dimensional gate
-
-**Output must not consist of analysis alone without conclusions.**
-
-## Relations to Other Skills
-
-- **Abstraction**: A transformation is also an act of abstraction -- representing the same object in a new structure.
-- **Symmetry and invariance**: Properties that remain unchanged under a transformation are precisely the symmetries of that transformation.
-- **Optimization**: Transforming to the dual space sometimes makes optimization easier.
-- **Modeling**: A transformation is often a key step in solving a model.
-- **Algorithmic thinking**: The FFT reduces the DFT from $O(N^2)$ to $O(N\log N)$, exemplifying how transformation ideas serve computational efficiency.
-- **Information theory**: Coding is transformation -- source coding transforms data into an efficient representation; channel coding transforms it into a noise-resistant representation.
-- **Modern mathematics activation**: `../../references/books/matrix-analysis.md` (spectral / low-rank transforms), `algebraic-geometry-rising-sea.md` (Plücker coordinates for KV compression, tropical gating), `optimization-ml.md` (duality transforms).