math-skill 2.1.0 → 3.0.1

package/knowledge-base/optimization/proximal-method.md

@@ -0,0 +1,52 @@
+# 近端方法 (Proximal Methods)
+
+## 最小定义
+
+对不可微或非光滑目标函数 $f(x) = g(x) + h(x)$（$g$ 光滑、$h$ 可能不可微但"简单"），用近端算子 $\text{prox}_{\eta h}(v) = \arg\min_x \{h(x) + \frac{1}{2\eta}\|x - v\|^2\}$ 代替对 $h$ 的梯度。近端方法将不可微部分封装为一个闭式子问题。
+
+## 核心公式
+
+- 近端算子：$\text{prox}_{\eta h}(v) = \arg\min_x \left\{h(x) + \frac{1}{2\eta}\|x - v\|^2\right\}$
+- 近端梯度下降 (ISTA)：$x_{k+1} = \text{prox}_{\eta h}(x_k - \eta \nabla g(x_k))$
+- 加速近端梯度 (FISTA)：$y_k = x_k + \frac{k-1}{k+2}(x_k - x_{k-1})$，$x_{k+1} = \text{prox}_{\eta h}(y_k - \eta \nabla g(y_k))$，收敛率 $O(1/k^2)$ vs. ISTA 的 $O(1/k)$
+- Soft-thresholding（$\ell_1$ 近端）：$\text{prox}_{\eta\|\cdot\|_1}(v)_i = \text{sign}(v_i)\max(|v_i| - \eta, 0)$
+- 投影（指示函数近端）：$\text{prox}_{\eta \delta_\mathcal{C}}(v) = \text{proj}_\mathcal{C}(v)$
+- 核范数近端（奇异值软阈值）：$\text{prox}_{\eta\|\cdot\|_*}(A) = U(\Sigma - \eta I)_+ V^H$
+- Moreau envelope：$h_\eta(v) = \min_x \{h(x) + \frac{1}{2\eta}\|x-v\|^2\}$（$h$ 的光滑近似）
+- ADMM 分裂：$\min f(x) + g(z)$ s.t. $Ax + Bz = c$，交替更新 $x, z, u$（对偶变量）
+
+## 适用问题
+
+- 稀疏训练 / $\ell_1$ 正则化：权重稀疏化、特征选择
+- 低秩矩阵恢复：核范数正则化（矩阵补全、鲁棒 PCA）
+- 分组稀疏 / Group Lasso：$\sum_g \|w_g\|_2$ 正则化（结构化剪枝）
+- 约束优化的算子分裂：ADMM 将复杂约束分解为简单子问题
+- 量化感知训练：将权重量化建模为近端算子（round + straight-through gradient）
+
+## AI 设计翻译
+
+- **Soft-thresholding 做稀疏训练**：$\text{prox}_{\eta\lambda\|\cdot\|_1}(w) = \text{sign}(w) \odot \max(|w| - \eta\lambda, 0)$，实现为 `w.sign() * (w.abs() - eta * lam).clamp(min=0)`，纯 elementwise，$O(d)$，零额外显存。每次 SGD 更新后做一次 soft-thresholding 即可得到稀疏权重。
+- **奇异值软阈值做低秩正则**：$\text{prox}_{\eta\|\cdot\|_*}(W) = U(\Sigma - \eta)_+ V^H$。需 SVD，大矩阵用随机化 SVD 近似：先做 randomized SVD 到 rank $r$，再对 $\Sigma$ 做 elementwise soft-threshold，重构。核心是 matmul 链 + elementwise。
+- **Group Lasso 结构化剪枝**：$\text{prox}_{\eta\sum_g\|w_g\|_2}(w)_g = w_g \cdot \max(1 - \eta/\|w_g\|_2, 0)$。按通道/头分组后，每组独立做 soft-thresholding（norm + elementwise scale），$O(d)$。实现为 reshape + norm(dim) + clamp + mul。
+- **ADMM 做分布式训练**：$\min \sum_i f_i(x_i) + g(z)$ s.t. $x_i = z$。各节点独立更新 $x_i$（本地 SGD），server 更新 $z = \text{prox}_{g/\rho}(\bar{x} + u)$（聚合 + 近端），$u$ 对偶变量更新。通信效率高于 all-reduce（只需传 $x_i$ 和 $z$）。
+- **量化近端算子**：将权重量化建模为 $\text{prox}(w) = \Delta \cdot \text{round}(w/\Delta)$，反向传播用 straight-through estimator（STE）：$\partial \text{prox}/\partial w \approx 1$。实现为 `w_q = (w / delta).round() * delta`，forward 是 elementwise round + mul，backward 是 identity。
+
+## 工程可行性
+
+- **主要操作**：近端算子多为 elementwise（soft-thresholding、clamp、group norm）或 matmul + 小 SVD（核范数）。梯度步 = 标准反向传播。
+- **GPU 友好度**：极高。$\ell_1$ 近端 = elementwise；group lasso 近端 = reshape + norm + scale = elementwise；核范数近端 = matmul + 小 SVD。FISTA 的动量项也是 elementwise。ADMM 的通信模式适配数据并行。
+- **复杂度**：ISTA/FISTA 每步 = 一次梯度计算 + 一次近端算子（$O(d)$ elementwise）；核范数近端 = $O(nd^2)$（随机化 SVD 降到 $O(ndk)$）；ADMM 每节点 = 本地 SGD + $O(d)$ 通信。
+- **低精度**：elementwise 近端算子在 bf16 下稳定（不涉及精细数值运算）。SVD 类近端需在 fp32 下计算。FISTA 的动量累积在 bf16 下可能丢精度，建议用 fp32 存储 $y_k$。
+
+## 风险与失效条件
+
+- **核范数近端的 SVD 开销**：大矩阵每步完整 SVD 是 $O(n^3)$，不可行。解决：(1) 随机化 SVD 近似；(2) 因子化 $\|W\|_* = \min_{W=UV^T} \frac{1}{2}(\|U\|_F^2 + \|V\|_F^2)$ 转为对 $U, V$ 的光滑优化，无需 SVD。
+- **FISTA 的重启问题**：FISTA 的 $y_k$ 序列可能振荡（非单调），导致实际收敛慢于理论。解决：adaptive restart（当 $f(x_{k+1}) > f(x_k)$ 时重置动量 $t_k = 1$），实现为简单的 if 判断。
+- **ADMM 的 $\rho$ 参数敏感**：$\rho$ 过大导致子问题病态，$\rho$ 过小导致对偶收敛慢。解决：adaptive $\rho$（根据 primal/dual residual 比值自动调整），每若干步 $\rho \leftarrow \rho \cdot \tau$（$\tau > 1$ 若 primal residual $>$ dual residual）。
+- **近端算子无闭式解**：并非所有 $h(x)$ 都有闭式 prox。复杂正则项（如 TV 正则、重叠 group lasso）需内层迭代求解。解决：用 Dykstra 算法分裂为多个简单 prox 的组合，或改用 ADMM 分裂。
+- **Straight-Through Estimator 的偏差**：量化 prox 的 STE 梯度有偏（$\partial \text{round}/\partial w = 0$ 几乎处处），长期训练可能发散。解决：用 learnable scale factor 补偿，或加噪声的量化（stochastic rounding）。
+
+## 深入参考
+
+- 蒸馏稿：references/books/optimization-ml.md（Ch 8 梯度法 §8.3 收敛分析、Ch 11 拟牛顿 §11.5 BFGS、Ch 24 约束算法 §24.5 增广 Lagrange）
+- 原书：Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 24 (Constrained Algorithms §24.5 Augmented Lagrangian) + Parikh & Boyd, *Proximal Algorithms*, Foundations and Trends in Optimization, 2014

package/knowledge-base/optimization/riemannian-optimization.en.md

@@ -0,0 +1,51 @@
+# Riemannian Optimization
+
+## Minimal Definition
+
+Optimization on smooth manifolds $\mathcal{M}$ (e.g., the orthogonal group $O(n)$, Stiefel manifold, Grassmann manifold, hyperbolic space). Core idea: project the Euclidean gradient onto the tangent space of the manifold, update along geodesics (or retractions), and ensure iterates remain on the manifold.
+
+## Core Formulas
+
+- Riemannian gradient: $\text{grad} f(x) = \text{proj}_{T_x\mathcal{M}}(\nabla f(x))$ (Euclidean gradient projected onto the tangent space)
+- Riemannian gradient descent: $x_{k+1} = R_{x_k}(-\alpha_k \cdot \text{grad} f(x_k))$, where $R$ is a retraction
+- Tangent space of the orthogonal group $O(n)$: $T_Q O(n) = \{Q\Omega : \Omega^T = -\Omega\}$ (left multiplication by skew-symmetric matrices)
+- Cayley retraction for the orthogonal group: $R_Q(\xi) = Q(I + \frac{1}{2}\Omega)^{-1}(I - \frac{1}{2}\Omega)$, $\xi = Q\Omega$
+- Polar decomposition retraction: $R_Q(\xi) = (Q + \xi)(I + \xi^T\xi)^{-1/2}$ (projection onto the nearest orthogonal matrix)
+- Newton-Schulz orthogonalization: $X_{k+1} = \frac{1}{2}X_k(3I - X_k^T X_k)$, converging to the nearest orthogonal matrix
+- Hyperbolic space (Poincaré ball): $\text{grad}_{\mathcal{H}} f = \frac{(1-\|x\|^2)^2}{4} \nabla f(x)$
+
+## Applicable Problems
+
+- Orthogonal weight constraints: $W^TW = I$ preserves eigenvalue moduli at 1, stabilizing RNN/SSM training
+- Muon optimizer: projects the gradient onto the nearest orthogonal matrix as the update direction (a cheap surrogate with "second-order flavor")
+- Low-rank subspace tracking: online PCA on the Grassmann manifold
+- Hyperbolic embeddings: Poincaré embeddings for hierarchical structures (trees, taxonomies)
+- Metric learning: distance metrics on the SPD matrix manifold (covariance matrix space)
+
+## AI Design Translation
+
+- **Muon optimizer (orthogonalized gradient updates)**: Projects the momentum matrix $M$ onto the nearest orthogonal matrix via Newton-Schulz iteration: $X_{k+1} = \frac{1}{2}X_k(3I - X_k^TX_k)$, converging in 5 steps. Update $W \leftarrow W - \alpha \cdot U$ ($U$ being the orthogonalized result). The core is a pure matmul chain, 2 matmul operations per step, fully tensor-core-friendly, stable under bf16.
+- **Manifold perspective on spectral normalization**: The constraint $\sigma_{\max}(W) = 1$ is equivalent to projection onto a tangent direction of the Stiefel manifold. Power iteration for direction estimation + normalization = an approximate Riemannian gradient projection. Implementation is identical to standard spectral norm.
+- **Orthogonal RNN**: Hidden state recurrence $h_t = \sigma(W h_{t-1} + U x_t)$, constraining $W \in O(n)$ to avoid vanishing/exploding gradients. During training, uses the Cayley parameterization $W = (I-A)(I+A)^{-1}$ ($A$ skew-symmetric), with backpropagation computing unconstrained gradients with respect to $A$. The core is matrix inversion $O(n^3)$ (acceptable for small layer dimensions).
+- **Poincaré embeddings (hyperbolic space)**: Embeds hierarchical data into the Poincaré ball $\mathcal{B}^n = \{x : \|x\| < 1\}$. Distance $d(x,y) = \text{arcosh}(1 + 2\|x-y\|^2 / ((1-\|x\|^2)(1-\|y\|^2)))$. The gradient is simply scaled by the metric factor $(1-\|x\|^2)^2/4$. Implemented as elementwise scaling, $O(d)$.
+- **Subspace learning on the Grassmann manifold**: Treats low-rank subspaces as points on the Grassmann manifold, updated online via Riemannian SGD. More suitable for streaming data than SVD. The projection $P = QQ^T$ update is implemented via QR decomposition, with the core being matmul + thin QR.
+
+## Engineering Feasibility
+
+- **Primary operations**: Riemannian gradient projection = matmul ($Q^T \nabla$ to obtain the tangent space component); retraction = matmul + small-matrix inversion / Newton-Schulz (pure matmul); hyperbolic metric = elementwise.
+- **GPU friendliness**: High (Newton-Schulz orthogonalization = pure matmul chain) to moderate (Cayley retraction requires $n \times n$ matrix inversion, where $n$ is the layer dimension; feasible via cuSOLVER when $n \leq 1024$). The metric scaling for hyperbolic embeddings is pure elementwise.
+- **Complexity**: Newton-Schulz per step $O(n^3)$ (where $n$ is the layer dimension, not total model parameters); Cayley $O(n^3)$; hyperbolic gradient $O(d)$; Grassmann QR $O(nd^2)$.
+- **Low precision**: Newton-Schulz is stable under bf16 (pure matmul iteration, no division or square roots); Cayley retraction's matrix inversion may fail under bf16 (fp32 required); the hyperbolic metric's denominator approaches zero as $\|x\| \to 1$, requiring clamping to prevent overflow.
+
+## Risks and Failure Conditions
+
+- **Inversion overhead of Cayley / matrix exponential maps**: $O(n^3)$ matrix inversion per step becomes a bottleneck when layer dimension $> 4096$. Solution: switch to Newton-Schulz orthogonalization (pure matmul) or approximate retractions via polar decomposition.
+- **Numerical overflow in hyperbolic space**: As $\|x\| \to 1$, $d(x,y) \to \infty$ and the metric factor $(1-\|x\|^2)^{-2} \to \infty$, causing gradient explosion. Solution: clamp $\|x\| \leq 1 - \epsilon$ ($\epsilon \sim 10^{-5}$), or use the Lorentz model (a numerically more stable hyperbolic parameterization).
+- **Retraction vs. exponential map**: Retraction is a first-order approximation of the exponential map, with reduced accuracy at large step sizes. For learning-rate-sensitive optimization problems, the true exponential map may be needed (at higher cost).
+- **Unboundedness of non-compact manifolds**: SPD manifolds / hyperbolic space are non-compact, and optimization paths may diverge to infinity. Regularization or trust-region constraints are needed.
+- **Conflict between orthogonal constraints and BatchNorm**: The affine transformation in BatchNorm breaks orthogonality. Either disable BN scale/shift after orthogonally constrained layers, or switch to GroupNorm.
+
+## Further References
+
+- Distilled notes: references/books/matrix-analysis.md (Section 7.3 Polar Decomposition, Newton-Schulz Iteration, Section 2.6 SVD and Orthogonal Factors)
+- Original text: Horn & Johnson, *Matrix Analysis* 2nd Ed., Chapter 7 Section 7.3 (Polar Decomposition) + Absil, Mahony, Sepulchre, *Optimization Algorithms on Matrix Manifolds*, Princeton University Press, 2008

package/knowledge-base/optimization/riemannian-optimization.md

@@ -0,0 +1,51 @@
+# 黎曼优化 (Riemannian Optimization)
+
+## 最小定义
+
+在光滑流形 $\mathcal{M}$（如正交群 $O(n)$、Stiefel 流形、Grassmann 流形、双曲空间）上做优化。核心思想：将欧氏空间的梯度投影到流形的切空间，沿测地线（或收缩映射）更新，保证迭代始终在流形上。
+
+## 核心公式
+
+- 黎曼梯度：$\text{grad} f(x) = \text{proj}_{T_x\mathcal{M}}(\nabla f(x))$（欧氏梯度投影到切空间）
+- 黎曼梯度下降：$x_{k+1} = R_{x_k}(-\alpha_k \cdot \text{grad} f(x_k))$，$R$ 为收缩映射（retraction）
+- 正交群 $O(n)$ 的切空间：$T_Q O(n) = \{Q\Omega : \Omega^T = -\Omega\}$（反对称矩阵左乘）
+- 正交群收缩映射（Cayley）：$R_Q(\xi) = Q(I + \frac{1}{2}\Omega)^{-1}(I - \frac{1}{2}\Omega)$，$\xi = Q\Omega$
+- 极分解收缩：$R_Q(\xi) = (Q + \xi)(I + \xi^T\xi)^{-1/2}$（投影到最近正交矩阵）
+- Newton-Schulz 正交化：$X_{k+1} = \frac{1}{2}X_k(3I - X_k^T X_k)$，收敛到最近正交矩阵
+- 双曲空间（Poincaré ball）：$\text{grad}_{\mathcal{H}} f = \frac{(1-\|x\|^2)^2}{4} \nabla f(x)$
+
+## 适用问题
+
+- 正交权重约束：$W^TW = I$ 保持特征值模长为 1，稳定 RNN/SSM 训练
+- Muon 优化器：将梯度投影到最近正交矩阵作为更新方向（"二阶味"的廉价替代）
+- 低秩子空间追踪：Grassmann 流形上的在线 PCA
+- 双曲嵌入：层次结构（树、taxonomy）的 Poincaré 嵌入
+- 度量学习：SPD 矩阵流形（协方差矩阵空间）上的距离度量
+
+## AI 设计翻译
+
+- **Muon 优化器 (正交化梯度更新)**：将动量矩阵 $M$ 通过 Newton-Schulz 迭代投影到最近正交矩阵：$X_{k+1} = \frac{1}{2}X_k(3I - X_k^TX_k)$，5 步收敛。更新 $W \leftarrow W - \alpha \cdot U$（$U$ 为正交化结果）。核心是纯 matmul 链，每步 2 次 matmul，完全 tensor core 友好，bf16 稳定。
+- **谱归一化的流形视角**：约束 $\sigma_{\max}(W) = 1$ 等价于在 Stiefel 流形的某个切方向上做投影。Power iteration 估计方向 + 归一化 = 一种近似的黎曼梯度投影。实现同标准 spectral norm。
+- **正交 RNN (orthogonal RNN)**：隐藏状态递推 $h_t = \sigma(W h_{t-1} + U x_t)$，约束 $W \in O(n)$ 避免梯度消失/爆炸。训练时用 Cayley 参数化 $W = (I-A)(I+A)^{-1}$（$A$ 反对称），反向传播走 $A$ 的无约束梯度。核心是矩阵求逆 $O(n^3)$（层维度小，可接受）。
+- **Poincaré 嵌入 (双曲空间)**：将层次数据嵌入 Poincaré ball $\mathcal{B}^n = \{x : \|x\| < 1\}$。距离 $d(x,y) = \text{arcosh}(1 + 2\|x-y\|^2 / ((1-\|x\|^2)(1-\|y\|^2)))$。梯度乘以度量因子 $(1-\|x\|^2)^2/4$ 即可。实现为 elementwise 缩放，$O(d)$。
+- **Grassmann 流形上的子空间学习**：将低秩子空间视为 Grassmann 流形上的点，用黎曼 SGD 在线更新。比 SVD 更适合 streaming 数据。投影 $P = QQ^T$ 的更新通过 QR 分解实现，核心是 matmul + thin QR。
+
+## 工程可行性
+
+- **主要操作**：黎曼梯度投影 = matmul（$Q^T \nabla$ 得切空间分量）；收缩映射 = matmul + 小矩阵求逆 / Newton-Schulz（纯 matmul）；双曲度量 = elementwise。
+- **GPU 友好度**：高（Newton-Schulz 正交化 = 纯 matmul 链）到中等（Cayley 映射需 $n \times n$ 矩阵求逆，$n$ 为层维度，$n \leq 1024$ 时 cuSOLVER 可行）。双曲嵌入的度量缩放是纯 elementwise。
+- **复杂度**：Newton-Schulz 每步 $O(n^3)$（但 $n$ 为层维度，非模型总参数量）；Cayley $O(n^3)$；双曲梯度 $O(d)$；Grassmann QR $O(nd^2)$。
+- **低精度**：Newton-Schulz 在 bf16 下稳定（纯 matmul 迭代，不涉及除法/开方）；Cayley 映射的求逆在 bf16 下可能失败（需 fp32）；双曲度量在 $\|x\| \to 1$ 时分母趋零，需 clamp 防溢出。
+
+## 风险与失效条件
+
+- **Cayley / 矩阵指数映射的求逆开销**：每步 $O(n^3)$ 矩阵求逆，层维度 $> 4096$ 时成为瓶颈。解决：改用 Newton-Schulz 正交化（纯 matmul）或 polar decomposition 的近似收缩。
+- **双曲空间的数值溢出**：$\|x\| \to 1$ 时 $d(x,y) \to \infty$，度量因子 $(1-\|x\|^2)^{-2} \to \infty$，梯度爆炸。解决：clamp $\|x\| \leq 1 - \epsilon$（$\epsilon \sim 10^{-5}$），或用 Lorentz 模型（数值更稳定的双曲参数化）。
+- **收缩映射 vs. 指数映射**：收缩映射（retraction）是指数映射的一阶近似，大步长时精度下降。对学习率敏感的优化问题，可能需要真正的指数映射（更贵）。
+- **非紧凑流形的无界性**：SPD 流形 / 双曲空间非紧，优化路径可能跑到无穷远。需加正则化或信赖域约束。
+- **正交约束与 BatchNorm 冲突**：BatchNorm 的仿射变换破坏正交性。需在正交约束层后禁用 BN 的 scale/shift，或改用 GroupNorm。
+
+## 深入参考
+
+- 蒸馏稿：references/books/matrix-analysis.md（§7.3 极分解、Newton-Schulz 迭代、§2.6 SVD 与正交因子）
+- 原书：Horn & Johnson, *Matrix Analysis* 2nd Ed., Chapter 7 §7.3 (Polar Decomposition) + Absil, Mahony, Sepulchre, *Optimization Algorithms on Matrix Manifolds*, Princeton University Press, 2008

package/knowledge-base/overview.en.md

@@ -1,228 +1,39 @@
-# Mathematical Knowledge System Overview
+# Knowledge Base Navigation
 
-## Overview
+> This file is the v3 knowledge base index, helping you find specific knowledge cards from problem types.
 
-The mathematical knowledge system is the structured framework of the discipline of mathematics, spanning from foundational concepts to cutting-edge subfields. It describes not only the hierarchical relationships among sub-disciplines, but also how mathematical methods complement and synergize across different problem domains.
+## Knowledge Base Structure
 
-This overview is designed to help you:
+The knowledge base is organized by mathematical domain, with 7 domains and 31 knowledge cards. Each card contains: minimal definition, core formulas, applicable problems, AI design translation, engineering feasibility, risks and failure conditions.
 
-- Quickly locate the discipline and method area to which a mathematical problem belongs;
-- Understand the correspondence between the 16 thinking weapons in this project (15 weapons + math-research-activator) and mathematical sub-disciplines;
-- Build a holistic understanding from problem to tool, from concept to application.
+| Domain | Directory | Cards | Typical Applications |
+|--------|-----------|-------|---------------------|
+| Matrix Analysis | `matrix-analysis/` | projection, spectral-decomposition, low-rank-approximation, positive-semidefinite, matrix-perturbation | LoRA, spectral normalization, condition number monitoring |
+| Optimization | `optimization/` | lagrangian-duality, convex-optimization, constrained-optimization, riemannian-optimization, proximal-method | GAN minimax, weight constraints, Muon optimizer |
+| Differential Geometry | `differential-geometry/` | manifold, tangent-space, metric-tensor, geodesic, curvature, connection | Natural gradient, manifold optimization, K-FAC |
+| Lie Theory | `lie-theory/` | group-action, lie-group, lie-algebra, representation, equivariance | Equivariant networks, SO(3) parameterization, spherical harmonics |
+| Topology | `topology/` | persistent-homology, euler-characteristic, fundamental-group | Topological regularization, latent space monitoring |
+| Probability & Information | `probability/` | concentration-inequality, entropy, kl-divergence, information-bottleneck, fisher-information | VAE, knowledge distillation, generalization bounds |
+| Information Geometry | `information-geometry/` | natural-gradient, fisher-metric | Natural gradient descent, Fisher-Rao metric |
 
-The development of mathematics has been jointly driven by logical reasoning, scientific needs, and cross-disciplinary applications.
+## From Problem to Knowledge Card
 
-## 1. The Three Foundational Pillars of Mathematics
+| Problem Type | Recommended Cards |
+|-------------|-------------------|
+| Need dimensionality reduction/compression | low-rank-approximation, projection |
+| Need constrained optimization | constrained-optimization, lagrangian-duality |
+| Need equivariance/symmetry | group-action, equivariance, representation |
+| Need stable training | matrix-perturbation, positive-semidefinite, fisher-information |
+| Need manifold parameterization | manifold, riemannian-optimization, tangent-space |
+| Need information compression | information-bottleneck, entropy, kl-divergence |
+| Need topological regularization | persistent-homology, euler-characteristic |
 
-The edifice of modern mathematics is built on **set theory** and **mathematical logic**. The three foundational disciplines are:
+## Relationship to Thinking Lenses
 
-### Algebra
+Thinking lenses (`../lenses/`) handle "what perspective to use"; the knowledge base provides "concrete mathematical tools." Typical chain:
 
-The study of numbers, structures, relationships, and symbolic operations.
+```
+Lens diagnosis → Knowledge card provides tools → Design pattern translates to AI module
+```
 
-| Level | Content | Core Concepts |
-|-------|---------|--------------|
-| Elementary Algebra | Equations, inequalities, polynomial operations | Variables, identities, operation laws |
-| Advanced Algebra (Linear Algebra) | Vector spaces, linear transformations, matrices | Linear spaces, bases, dimension, eigenvalues |
-| Abstract Algebra | Groups, rings, fields | Algebraic structures, homomorphisms, isomorphisms |
-| Category Theory | Abstract theory of objects and morphisms | Functors, natural transformations, universal properties |
-
-### Geometry
-
-The study of space, shape, structure, and their relationships.
-
-| Level | Content | Core Concepts |
-|-------|---------|--------------|
-| Euclidean Geometry | Plane and solid geometry | Points, lines, planes, angles, distances |
-| Analytic Geometry | Studying geometry via algebraic methods | Coordinate systems, equations, curves |
-| Non-Euclidean Geometry | Geometries with modified parallel postulates | Hyperbolic geometry, elliptic geometry |
-| Differential Geometry | Studying geometry via calculus | Curvature, geodesics, manifolds |
-| Fractal Geometry | Self-similar geometric structures | Fractal dimension, iterated function systems |
-
-### Analysis
-
-The study of functions, limits, continuity, differentiation, and integration.
-
-| Level | Content | Core Concepts |
-|-------|---------|--------------|
-| Calculus | Limits, derivatives, integrals | Continuity, differentiability, integrability |
-| Mathematical Analysis | Rigorous limit theory | $\varepsilon$-$\delta$ language, uniform convergence |
-| Real Analysis | Measure theory, Lebesgue integration | Measure spaces, $L^p$ spaces |
-| Complex Analysis | Theory of complex functions | Analytic functions, residues, conformal mappings |
-| Functional Analysis | Analysis on infinite-dimensional spaces | Banach spaces, Hilbert spaces, operators |
-| Differential Equations | ODEs and PDEs | Existence, uniqueness, stability, numerical methods |
-
-## 2. Major Branches
-
-### 1. Number Theory
-
-The study of integer properties, such as prime distribution, congruences, and Diophantine equations.
-
-- **Elementary Number Theory**: Divisibility, congruences, primes
-- **Analytic Number Theory**: Using analytical methods for number-theoretic problems (e.g., the Prime Number Theorem)
-- **Algebraic Number Theory**: Using algebraic methods for number-theoretic problems (e.g., algebraic number fields)
-- **Geometric Number Theory**: Using geometric methods for number-theoretic problems
-
-### 2. Probability & Statistics
-
-The study of random phenomena and data analysis, widely applied in finance, biology, and social sciences. Corresponding thinking weapons: **Probability & Statistics**, **Information Theory**, **Causal Inference**.
-
-- **Probability Theory**: Random variables, distributions, limit theorems → See **Probability & Statistics** (Kolmogorov axioms)
-- **Mathematical Statistics**: Parameter estimation, hypothesis testing, regression analysis → See **Probability & Statistics** (regression modeling, experimental design)
-- **Stochastic Processes**: Markov chains, Brownian motion, martingale theory
-- **Bayesian Statistics**: Priors, posteriors, MCMC → See **Information Theory** (maximum entropy principle)
-
-### 3. Topology
-
-The study of invariant properties of spaces under continuous deformation. Corresponding thinking weapon: **Topological Thinking**.
-
-- **Point-Set Topology**: Open sets, closed sets, connectedness, compactness → See **Symmetry & Invariance** (invariant perspective)
-- **Algebraic Topology**: Homotopy, homology, cohomology → See **Topological Thinking** (fundamental group, Betti numbers)
-- **Differential Topology**: Manifolds, tangent spaces, differential forms
-
-### 4. Discrete Mathematics
-
-Set theory, graph theory, mathematical logic, etc. — the mathematical foundation of computer science. Corresponding thinking weapons: **Algorithmic & Computational Thinking**, **Discrete & Combinatorial Thinking**.
-
-- **Set Theory**: Sets, relations, functions, cardinality, ordinals
-- **Graph Theory**: Graphs, paths, connectivity, coloring, network flows
-- **Mathematical Logic**: Propositional logic, predicate logic, computability → See **Axiomatic Thinking**, **Logical Deduction**
-- **Combinatorics**: Counting, permutations and combinations, generating functions → See **Discrete & Combinatorial Thinking**
-- **Algorithms & Complexity**: Sorting, searching, P/NP, decidability → See **Algorithmic & Computational Thinking**
-
-### 5. Applied Mathematics Branches
-
-Applying mathematical methods to real-world problems. Corresponding thinking weapons: **Optimization**, **Information Theory**, **Game Theory**, **Algorithmic & Computational Thinking**, **Causal Inference**.
-
-- **Operations Research**: Linear programming, integer programming, dynamic programming, queueing theory → See **Optimization** (LP/IP/DP taxonomy), **Algorithmic & Computational Thinking** (solution algorithms)
-- **Control Theory**: System control, optimal control, robust control → See **Optimization** (optimal control as variational optimization)
-- **Information Theory**: Entropy, channel capacity, data compression, coding theory → See **Information Theory** (Shannon entropy, coding theorems)
-- **Game Theory**: Strategic interaction, equilibrium analysis, mechanism design → See **Game Theory** (Nash equilibrium, minimax)
-- **Causal Inference**: Causal graph models, intervention analysis, counterfactual reasoning → See **Causal Inference** (DAGs, do-calculus)
-- **Financial Mathematics**: Option pricing, risk management, stochastic calculus → See **Modeling** (Black-Scholes), **Probability & Statistics**
-- **Computational Mathematics**: Numerical analysis, finite elements, Monte Carlo methods → See **Algorithmic & Computational Thinking** (numerical algorithms)
-- **Mathematical Foundations of Machine Learning**: Optimization, statistical learning theory, kernel methods → See **Optimization**, **Probability & Statistics**, **Information Theory** (MDL/AIC)
-
-## 3. Hierarchical Structure of the Knowledge System
-
-From a learning-path perspective, mathematical knowledge can be organized into levels:
-
-### Foundation Level
-
-Number sense, logic and classification, arithmetic, and basic geometry.
-
-- Concepts and operations of numbers
-- Basic logical reasoning
-- Arithmetic operations (addition, subtraction, multiplication, division)
-- Basic geometric shapes and properties
-
-### Algebra Level
-
-Variables, equations, functions, geometric proofs.
-
-- Algebraic expressions and equations
-- Function concepts and basic function families
-- Plane geometry proofs
-- Vectors and coordinates
-
-### Synthesis Level
-
-Functions and derivatives, calculus, sequences, solid geometry, advanced probability and statistics.
-
-- Limits and continuity
-- Differentiation and integration
-- Sequences and series
-- Solid geometry
-- Probability distributions and statistical inference
-
-### Frontier Level
-
-Mathematical analysis, advanced algebra, analytic/differential geometry, number theory, topology, etc.
-
-- Rigorous analytical theory ($\varepsilon$-$\delta$)
-- Abstract algebraic structures (groups, rings, fields)
-- Manifolds and differential geometry
-- Algebraic/analytic number theory
-- Point-set/algebraic topology
-- Functional analysis and operator theory
-
-## 4. Levels of Mathematical Thinking Methods
-
-| Level | Thinking Method | Description |
-|-------|----------------|-------------|
-| Foundation | Logical deduction, inductive analogy | The basis of all mathematical thinking |
-| Method | Axiomatization, abstraction, modeling | Methods for constructing mathematical theories |
-| Tool | Optimization, transformation, probability & statistics | Tools for solving concrete problems |
-| Extension | Algorithms & computation, information theory, game theory, causal inference | Tools applied to computation, information, interaction, and causation |
-| Philosophy | Symmetry & invariance, topological thinking, discrete & combinatorial thinking | Philosophical perspectives for understanding structure and essence |
-
-## 5. Connections Between Mathematics and Other Disciplines
-
-| Discipline | Mathematical Tools Used | Typical Applications |
-|-----------|------------------------|---------------------|
-| Physics | Calculus, linear algebra, group theory | Mechanics, quantum mechanics, relativity |
-| Computer Science | Discrete mathematics, graph theory, probability | Algorithm analysis, cryptography, AI |
-| Economics | Optimization, game theory, differential equations | Market equilibrium, pricing models |
-| Biology | Differential equations, statistics, graph theory | Population dynamics, systems biology |
-| Engineering | Differential equations, Fourier analysis, numerical methods | Control systems, signal processing |
-| Social Sciences | Statistics, game theory, network analysis | Social networks, decision analysis |
-
-## 6. Mapping Thinking Weapons to Mathematical Branches
-
-The 16 thinking weapons in this project (15 specialized weapons + 1 math-research-activator auto-trigger entry point) do not exist in isolation; they form a complementary toolkit with mathematical branches. Below is a simplified mapping to help you find suitable mathematical methods directly from problem types. v2 also includes `references/books/*.md` × 7 volumes covering algebraic geometry / differential geometry / Lie theory / abstract algebra / matrix analysis / optimization / manifolds and other modern mathematical structures, activated on demand into algorithm design (see README "Three-Layer Progressive Disclosure").
-
-| Thinking Weapon | Corresponding Mathematical Branch | Typical Methods / Concepts |
-|----------------|----------------------------------|---------------------------|
-| 🧭 Math Research Activator | Meta-cognition, problem classification, modern math mapping | Diagnosis → Mapping → Routing → GPU Filtering, dual acceptance gates |
-| 📐 Axiomatic Thinking | Mathematical logic, set theory | Axiomatic systems, formal languages, consistency, independence |
-| 🧩 Abstraction | Algebra, category theory, topology | Abstract structures, isomorphisms, universal properties |
-| 🧠 Logical Deduction | Mathematical logic, proof theory | Propositional logic, predicate logic, inference rules |
-| 🌉 Modeling | Applied mathematics, statistics | Equation-based modeling, dimensional analysis, validation |
-| ⚖️ Optimization | Optimization theory, operations research | Convex optimization, KKT conditions, dynamic programming |
-| 🎲 Probability & Statistics | Probability theory, mathematical statistics | Random variables, hypothesis testing, regression analysis |
-| 🔄 Transformation | Analysis, generating functions | Fourier, Laplace, algebraic transformations |
-| ⚛️ Symmetry & Invariance | Group theory, geometry | Group actions, invariants, quotient spaces |
-| 📈 Induction & Analogy | Elementary mathematics, number theory | Inductive proofs, analogical reasoning, pattern recognition |
-| 🖥️ Algorithmic & Computational Thinking | Computation theory, discrete mathematics | Complexity, computability, algorithm paradigms |
-| 📡 Information Theory | Information theory, statistical learning | Entropy, mutual information, coding limits |
-| 🎯 Game Theory | Mathematical economics, mechanism design | Nash equilibrium, incentive compatibility, optimal strategy |
-| 🔗 Causal Inference | Causal inference, statistics | DAGs, do-calculus, intervention analysis |
-| 🌀 Topological Thinking | Topology, algebraic topology | Homotopy, homology, topological invariants |
-| 🧮 Discrete & Combinatorial Thinking | Combinatorics, graph theory | Pigeonhole principle, generating functions, enumeration |
-
-## 7. How to Choose a Thinking Weapon
-
-When facing a problem, the most important first step is not "analyze hard," but "choose the right tool." Here is a selection guide:
-
-### Quick Selection Guide
-
-| Core Problem Characteristic | Most Likely Suitable Thinking Weapon |
-|----------------------------|-------------------------------------|
-| Multi-party interaction; my optimum depends on others | 🎯 Game Theory |
-| Uncertainty / randomness | 🎲 Probability & Statistics |
-| Optimal choice under constraints | ⚖️ Optimization |
-| Difficult to handle from current perspective | 🔄 Transformation |
-| Need to extract essential structure | 🧩 Abstraction |
-| Need rigorous reasoning and verification | 🧠 Logical Deduction |
-| Need to discover patterns from experience | 📈 Induction & Analogy |
-| Need to build a predictive model | 🌉 Modeling |
-| Invariance amid change | ⚛️ Symmetry & Invariance |
-| Need executable steps | 🖥️ Algorithmic & Computational Thinking |
-| Counting / structure over finite objects | 🧮 Discrete & Combinatorial Thinking |
-
-### Using the Activator
-
-If you are unsure which tool to use, simply invoke the math-research-activator via the `/ask` command. It will diagnose the problem, map to modern mathematical structures, recommend the 1–3 most suitable thinking weapons, and perform GPU feasibility filtering. When algorithm / kernel / model code appears in the workspace, the activator will also intervene automatically.
-
-### Path
-
-v2 has removed the "research / life dual-path" and unified into a single research / algorithm path: preserving complete mathematical notation and derivations, and enforcing the GPU 8-dimension gate when used for algorithm / operator design.
-
-## 8. How to Use This Overview
-
-- Start from the problem characteristics: determine whether it is "structural," "dynamic," "stochastic," "interactive," or "countable."
-- Consult the Quick Selection Guide or use the `/ask` command to find the closest thinking weapon.
-- Combined with the "Hierarchical Structure of the Knowledge System," judge whether the current problem is better suited to foundational approaches or frontier methods.
-- If the problem spans multiple categories, invoke multiple thinking weapons simultaneously — e.g., "Modeling + Optimization," "Probability + Causation," "Abstraction + Algorithms."
-- For algorithm / operator design problems, let the activator transfer modern mathematical structures (algebraic geometry / Lie theory / topology, etc.) into the design and pass them through the GPU 8-dimension gate.
-- When studying or reading literature, use this overview as an organizing framework to place scattered concepts into a unified knowledge map.
+For deeper study, `../references/books/*.md` provides 7 book distillations.