math-skill 3.0.1 → 3.1.0

package/knowledge-base/probability/entropy.en.md

@@ -26,7 +26,7 @@ $$I(X; Y) = H(X) - H(X|Y) = H(Y) - H(Y|X) = \sum_{x,y} p(x,y) \log \frac{p(x,y)}
 
 ## AI Design Translation
 - **Cross-Entropy Loss**: $H(p, q) = -\sum p(x)\log q(x)$, the default loss function for classification tasks; it is essentially the "coding redundancy" between the true distribution $p$ and the model distribution $q$
-- **KL Divergence** (see `kl-divergence.md`): $D_{KL}(p\|q) = H(p,q) - H(p)$, i.e., the difference between cross-entropy and entropy
+- **KL Divergence** (see `kl-divergence.en.md`): $D_{KL}(p\|q) = H(p,q) - H(p)$, i.e., the difference between cross-entropy and entropy
 - **Variational Autoencoder (VAE)**: ELBO = reconstruction likelihood $-$ KL regularization term; it fundamentally balances information compression (low $H(Z)$) against reconstruction fidelity
 
 ## Engineering Feasibility
@@ -41,7 +41,23 @@ $$I(X; Y) = H(X) - H(X|Y) = H(Y) - H(Y|X) = \sum_{x,y} p(x,y) \log \frac{p(x,y)}
 - **Sensitive to vocabulary size**: With large vocabularies (e.g., 128K tokenizers for LLMs), the peak memory usage of softmax + cross-entropy can reach tens of GB, requiring chunked/online softmax or label smoothing for mitigation.
 
 ## Further References
-- Distillation draft: `references/books/` — no dedicated information theory distillation draft at present
+- Distillation draft: `../../references/books/` — no dedicated information theory distillation draft at present
 - Cover & Thomas. *Elements of Information Theory*, 2nd Edition. Wiley, 2006
 - MacKay. *Information Theory, Inference, and Learning Algorithms*. Cambridge, 2003
-- Related knowledge cards: `probability/kl-divergence.md`, `probability/information-bottleneck.md`
+- Related knowledge cards: `kl-divergence.en.md`, `information-bottleneck.en.md`
+
+
+## Routing Extensions
+- If relative entropy is needed -> `kl-divergence.en.md` (KL divergence is relative entropy)
+- If information compression is involved -> `information-bottleneck.en.md` (information bottleneck uses entropy and mutual information)
+- If entropy-power inequality is involved -> `fisher-information.en.md` (relationship between Fisher information and entropy)
+
+## Extensible Directions
+- Renyi entropy: parameterized family of generalized entropies
+- Tsallis entropy: entropy for non-extensive statistical mechanics
+- Conditional / mutual information: multi-variable information measures
+- Entropy rate: asymptotic entropy of stochastic processes
+- Maximum entropy principle: distribution selection under minimal assumptions
+- Entropy estimation: methods for estimating entropy from samples
+- Differential entropy: entropy for continuous distributions
+- Entropy power inequality: lower bound on entropy of independent sums

package/knowledge-base/probability/entropy.md

@@ -41,7 +41,23 @@ $$I(X; Y) = H(X) - H(X|Y) = H(Y) - H(Y|X) = \sum_{x,y} p(x,y) \log \frac{p(x,y)}
 - **对 vocab 大小敏感**：大 vocab（如 LLM 的 128K tokenizer）下 softmax + 交叉熵的显存峰值可达数十 GB，需 chunked/online softmax 或 label smoothing 缓解。
 
 ## 深入参考
-- 蒸馏稿：`references/books/` 暂无专用信息论蒸馏稿
+- 蒸馏稿：`../../references/books/` 暂无专用信息论蒸馏稿
 - Cover & Thomas. *Elements of Information Theory*, 2nd Edition. Wiley, 2006
 - MacKay. *Information Theory, Inference, and Learning Algorithms*. Cambridge, 2003
-- 关联知识卡：`probability/kl-divergence.md`、`probability/information-bottleneck.md`
+- 关联知识卡：`kl-divergence.md`、`information-bottleneck.md`
+
+
+## 路由扩展
+- 若需要相对熵 → `kl-divergence.md`（KL 散度即相对熵）
+- 若涉及信息压缩 → `information-bottleneck.md`（信息瓶颈使用熵和互信息）
+- 若涉及熵-功率不等式 → `fisher-information.md`（Fisher 信息与熵的关系）
+
+## 可扩展方向
+- Renyi 熵（Renyi entropy）：广义熵的参数族
+- Tsallis 熵（Tsallis entropy）：非广延统计力学的熵
+- 条件/互信息（conditional / mutual information）：多变量信息度量
+- 熵率（entropy rate）：随机过程的渐近熵
+- 最大熵原理（maximum entropy principle）：最少假设下的分布选择
+- 熵估计（entropy estimation）：从样本估计熵的方法
+- 微分熵（differential entropy）：连续分布的熵
+- 熵功率不等式（entropy power inequality）：独立和的熵下界

package/knowledge-base/probability/fisher-information.en.md

@@ -19,7 +19,7 @@ $$D_{KL}(p_\theta \| p_{\theta + d\theta}) \approx \frac{1}{2} d\theta^T \mathca
 
 ## Applicable Problems
 - **Parameter estimation efficiency assessment**: The Cramér-Rao bound gives the theoretical limit on the precision of any unbiased estimator
-- **Natural gradient descent**: Use $\mathcal{I}(\theta)^{-1} \nabla_\theta \mathcal{L}$ instead of the naive gradient, updating along geodesic directions on the statistical manifold (see `information-geometry/natural-gradient.md`)
+- **Natural gradient descent**: Use $\mathcal{I}(\theta)^{-1} \nabla_\theta \mathcal{L}$ instead of the naive gradient, updating along geodesic directions on the statistical manifold (see `../information-geometry/natural-gradient.en.md`)
 - **Experimental design / active learning**: Select data points that maximize Fisher information, maximizing the information gain for parameter learning
 
 ## AI Design Translation
@@ -41,8 +41,22 @@ $$D_{KL}(p_\theta \| p_{\theta + d\theta}) \approx \frac{1}{2} d\theta^T \mathca
 - **Empirical Fisher ≠ True Fisher**: Replacing the expectation with a training set average introduces significant estimation bias when the sample size is insufficient, potentially causing the natural gradient direction to point in the wrong direction. This should be paired with learning rate warmup.
 
 ## Further References
-- Distillation draft: `references/books/` — no dedicated information geometry distillation draft at present
+- Distillation draft: `../../references/books/` — no dedicated information geometry distillation draft at present
 - Amari. *Information Geometry and Its Applications*. Springer, 2016
 - Amari & Nagaoka. *Methods of Information Geometry*. AMS, 2000
 - Martens. "Optimizing Neural Networks with Kronecker-Factored Approximate Curvature." *ICML*, 2015
-- Related knowledge cards: `information-geometry/natural-gradient.md`, `information-geometry/fisher-metric.md`
+- Related knowledge cards: `../information-geometry/natural-gradient.en.md`, `../information-geometry/fisher-metric.en.md`
+
+
+## Routing Extensions
+- If a geometric perspective is needed -> `../information-geometry/fisher-metric.en.md` (Fisher information as Riemannian metric)
+- If Fisher-based optimization is needed -> `../information-geometry/natural-gradient.en.md` (natural gradient driven by Fisher information)
+- If Cramer-Rao bounds are needed -> `concentration-inequality.en.md` (Fisher information and estimation accuracy bounds)
+
+## Extensible Directions
+- Observed vs expected Fisher: two types of Fisher information matrices
+- Fisher information matrix properties: positive definiteness, chain rule, sufficient statistics
+- Jeffreys prior: non-informative prior defined by Fisher information
+- Fisher information distance: Fisher metric distance between distributions
+- Mutual information and Fisher: relationship between Fisher information and mutual information
+- Fisher in deep learning: approximation methods such as K-FAC, Shampoo

package/knowledge-base/probability/fisher-information.md

@@ -19,7 +19,7 @@ $$D_{KL}(p_\theta \| p_{\theta + d\theta}) \approx \frac{1}{2} d\theta^T \mathca
 
 ## 适用问题
 - **参数估计效率评估**：Cramér-Rao 界给出任何无偏估计器精度的理论极限
-- **自然梯度下降**：用 $\mathcal{I}(\theta)^{-1} \nabla_\theta \mathcal{L}$ 替代朴素梯度，沿统计流形的测地线方向更新（详见 `information-geometry/natural-gradient.md`）
+- **自然梯度下降**：用 $\mathcal{I}(\theta)^{-1} \nabla_\theta \mathcal{L}$ 替代朴素梯度，沿统计流形的测地线方向更新（详见 `../information-geometry/natural-gradient.md`）
 - **实验设计 / 主动学习**：选择使 Fisher 信息最大的数据点采集，最大化参数学习的信息增益
 
 ## AI 设计翻译
@@ -41,8 +41,22 @@ $$D_{KL}(p_\theta \| p_{\theta + d\theta}) \approx \frac{1}{2} d\theta^T \mathca
 - **经验 Fisher ≠ 真实 Fisher**：用训练集均值替代期望，在样本量不足时估计偏差大，自然梯度方向可能指向错误方向。需与 learning rate warmup 配合。
 
 ## 深入参考
-- 蒸馏稿：`references/books/` 暂无专用信息几何蒸馏稿
+- 蒸馏稿：`../../references/books/` 暂无专用信息几何蒸馏稿
 - Amari. *Information Geometry and Its Applications*. Springer, 2016
 - Amari & Nagaoka. *Methods of Information Geometry*. AMS, 2000
 - Martens. "Optimizing Neural Networks with Kronecker-Factored Approximate Curvature." *ICML*, 2015
-- 关联知识卡：`information-geometry/natural-gradient.md`、`information-geometry/fisher-metric.md`
+- 关联知识卡：`../information-geometry/natural-gradient.md`、`../information-geometry/fisher-metric.md`
+
+
+## 路由扩展
+- 若需要几何视角 → `../information-geometry/fisher-metric.md`（Fisher 信息作为黎曼度量）
+- 若需要基于 Fisher 的优化 → `../information-geometry/natural-gradient.md`（Fisher 信息驱动的自然梯度）
+- 若需要 Cramer-Rao 界 → `concentration-inequality.md`（Fisher 信息与估计精度界）
+
+## 可扩展方向
+- 观测 vs 期望 Fisher（observed vs expected Fisher）：两种 Fisher 信息矩阵
+- Fisher 信息矩阵性质：正定性、链式法则、充分统计量
+- Jeffreys 先验（Jeffreys prior）：Fisher 信息定义的无信息先验
+- Fisher 信息距离（Fisher information distance）：分布间的 Fisher 度量距离
+- 互信息与 Fisher（mutual information and Fisher）：Fisher 信息与互信息的关系
+- 深度学习中的 Fisher（Fisher in deep learning）：K-FAC, Shampoo 等近似方法

package/knowledge-base/probability/index.en.md

@@ -0,0 +1,51 @@
+# Probability & Information Activation Index
+
+## Domain Signals
+Activate this domain direction when the problem involves:
+- Uncertainty quantification: need to quantify the concentration or tail behavior of random variables
+- Generalization bounds: need to derive theoretical upper bounds on model generalization
+- Distribution distance: need to measure the difference between two distributions
+- Information compression: need to compress representations while preserving information
+- Sample efficiency: need to analyze the ability to learn from finite samples
+- Tail control: need to control the probability of extreme deviations of random variables
+
+## Core Anchors
+- `concentration-inequality.en.md` — Concentration inequalities
+- `entropy.en.md` — Entropy
+- `kl-divergence.en.md` — KL divergence
+- `information-bottleneck.en.md` — Information bottleneck
+- `fisher-information.en.md` — Fisher information
+
+## Extended Concepts
+When core anchors are insufficient, the following concepts may need temporary activation:
+- optimal transport (Wasserstein distance, Sinkhorn): optimal transport and Wasserstein distance
+- total variation distance: total variation distance
+- f-divergence family: f-divergence family (chi-squared, Hellinger, Jensen-Shannon, etc.)
+- mutual information estimation (MINE / NWJ): neural estimation methods for mutual information
+- variational inference (ELBO / VI): variational inference and evidence lower bound
+- Markov chain Monte Carlo: Markov chain Monte Carlo methods
+- stochastic process (martingale, Brownian motion, SDE): stochastic process fundamentals
+- PAC-Bayes bounds: PAC-Bayes generalization bounds
+- Rademacher complexity: Rademacher complexity
+- VC dimension: VC dimension and hypothesis space capacity
+- generalization via compression: compression-based generalization theory
+- differential privacy: differential privacy
+- normalizing flow theory: normalizing flow theory
+- score matching: score matching
+- diffusion process theory: diffusion process theory
+
+## Reference Book Directions
+- `../../references/books/optimization-ml.en.md`: variational methods and probabilistic inference chapters
+
+## AI Translation Directions
+- concentration inequality → generalization bounds / confidence-aware predictions / tail-risk loss
+- entropy → entropy regularization / uncertainty estimation / exploration bonus
+- kl-divergence → distribution matching loss / knowledge distillation / policy regularization
+- information bottleneck → representation compression / VIB loss / uncertainty routing
+- fisher information → natural gradient / parameter sensitivity monitor / active learning
+
+## Temporary Activation Rules
+When the problem requires mathematics not in the core anchors:
+1. First check whether extended concepts contain a match
+2. If yes, generate a temporary knowledge card based on the lens
+3. If no, enter the Knowledge Gap Protocol

package/knowledge-base/probability/index.md

@@ -0,0 +1,51 @@
+# 概率与信息 激活索引 / Probability & Information Activation Index
+
+## 领域信号
+当问题涉及以下信号时，激活本领域方向：
+- 不确定性量化：需要量化随机变量的集中程度或尾部行为
+- 泛化界：需要推导模型泛化的理论上界
+- 分布距离：需要度量两个分布之间的差异
+- 信息压缩：需要在保持信息的前提下压缩表示
+- 样本效率：需要分析从有限样本中学习的能力
+- 尾部控制：需要控制随机变量的极端偏差概率
+
+## 核心锚点
+- `concentration-inequality.md` — 集中不等式
+- `entropy.md` — 熵
+- `kl-divergence.md` — KL 散度
+- `information-bottleneck.md` — 信息瓶颈
+- `fisher-information.md` — Fisher 信息
+
+## 扩展概念
+当核心锚点不够时，以下概念可能需要临时激活：
+- optimal transport（Wasserstein distance, Sinkhorn）：最优传输与 Wasserstein 距离
+- total variation distance：全变差距离
+- f-divergence family：f-散度族（chi-squared, Hellinger, Jensen-Shannon 等）
+- mutual information estimation（MINE / NWJ）：互信息的神经估计方法
+- variational inference（ELBO / VI）：变分推断与证据下界
+- Markov chain Monte Carlo：马尔可夫链蒙特卡罗方法
+- stochastic process（martingale, Brownian motion, SDE）：随机过程基础
+- PAC-Bayes bounds：PAC-Bayes 泛化界
+- Rademacher complexity：Rademacher 复杂度
+- VC dimension：VC 维与假设空间容量
+- generalization via compression：基于压缩的泛化理论
+- differential privacy：差分隐私
+- normalizing flow theory：规范化流理论
+- score matching：得分匹配
+- diffusion process theory：扩散过程理论
+
+## 参考书方向
+- `../../references/books/optimization-ml.md`：变分方法和概率推断相关章节
+
+## AI 翻译方向
+- concentration inequality → generalization bounds / confidence-aware predictions / tail-risk loss
+- entropy → entropy regularization / uncertainty estimation / exploration bonus
+- kl-divergence → distribution matching loss / knowledge distillation / policy regularization
+- information bottleneck → representation compression / VIB loss / uncertainty routing
+- fisher information → natural gradient / parameter sensitivity monitor / active learning
+
+## 临时激活规则
+当问题需要的数学不在核心锚点中时：
+1. 先检查扩展概念中是否有匹配
+2. 若有，根据透镜生成临时知识卡
+3. 若无，进入 Knowledge Gap Protocol

package/knowledge-base/probability/information-bottleneck.en.md

@@ -42,8 +42,24 @@ where $q_\phi(y|z)$ is the classifier/decoder, $r(z)$ is the prior distribution
 - **Sensitive to $\beta$ tuning**: If $\beta$ is too large, excessive compression leads to underfitting; if too small, the objective degenerates to standard ERM (no compression effect). Information plane analysis or adaptive $\beta$ scheduling is required.
 
 ## Further References
-- Distillation draft: `references/books/` — no dedicated IB distillation draft at present
+- Distillation draft: `../../references/books/` — no dedicated IB distillation draft at present
 - Tishby, Pereira, Bialek. "The Information Bottleneck Method." *arXiv:physics/0004057*, 2000
 - Alemi, Poole, Fischer, Dillon, Suresh, Murphy. "Deep Variational Information Bottleneck." *ICLR*, 2017
 - Shwartz-Ziv, Tishby. "Opening the Black Box of Deep Neural Networks via Information." *arXiv:1703.00810*, 2017
-- Related knowledge cards: `probability/entropy.md`, `probability/kl-divergence.md`
+- Related knowledge cards: `entropy.en.md`, `kl-divergence.en.md`
+
+
+## Routing Extensions
+- If the KL component in IB objective is needed -> `kl-divergence.en.md` (KL component of IB objective)
+- If rate-distortion theory is involved -> `entropy.en.md` (relationship between IB and rate-distortion theory)
+- If used for VIB loss design -> `variational-loss` (design pattern layer for variational information bottleneck loss)
+
+## Extensible Directions
+- Rate-distortion theory: optimal compression bounds from information theory
+- Deterministic IB: IB variant with deterministic encoding
+- Geometric IB: information bottleneck under geometric structure
+- IB for representation learning: feature learning under IB framework
+- IB for clustering: IB-driven clustering algorithms
+- Deep IB: information bottleneck in deep networks
+- IB with multiple bottlenecks: multi-layer information constraints
+- IB generalization bounds: theoretical connection between IB and generalization

package/knowledge-base/probability/information-bottleneck.md

@@ -42,8 +42,24 @@ $$\mathcal{L}_{VIB} = \mathbb{E}_{p(x,y)}[-\log q_\phi(y|z)] + D_{KL}(p_\theta(z
 - **$\beta$ 调参敏感**：$\beta$ 过大会过度压缩（欠拟合），过小则退化为标准 ERM（无压缩效果）。需要信息平面分析或自适应 $\beta$ 调度。
 
 ## 深入参考
-- 蒸馏稿：`references/books/` 暂无专用 IB 蒸馏稿
+- 蒸馏稿：`../../references/books/` 暂无专用 IB 蒸馏稿
 - Tishby, Pereira, Bialek. "The Information Bottleneck Method." *arXiv:physics/0004057*, 2000
 - Alemi, Poole, Fischer, Dillon, Suresh, Murphy. "Deep Variational Information Bottleneck." *ICLR*, 2017
 - Shwartz-Ziv, Tishby. "Opening the Black Box of Deep Neural Networks via Information." *arXiv:1703.00810*, 2017
-- 关联知识卡：`probability/entropy.md`、`probability/kl-divergence.md`
+- 关联知识卡：`entropy.md`、`kl-divergence.md`
+
+
+## 路由扩展
+- 若需要 IB 目标中的 KL → `kl-divergence.md`（IB 目标的 KL 分量）
+- 若涉及速率-失真理论 → `entropy.md`（IB 与率失真理论的关系）
+- 若用于 VIB 损失设计 → `variational-loss`（设计模式层的变分信息瓶颈损失）
+
+## 可扩展方向
+- 速率-失真理论（rate-distortion theory）：信息论的最优压缩界
+- 确定性 IB（deterministic IB）：确定性编码的 IB 变体
+- 几何 IB（geometric IB）：几何结构下的信息瓶颈
+- IB 用于表示学习（IB for representation learning）：IB 框架下的特征学习
+- IB 用于聚类（IB for clustering）：IB 驱动的聚类算法
+- 深度 IB（deep IB）：深度网络中的信息瓶颈
+- 多瓶颈 IB（IB with multiple bottlenecks）：多层信息约束
+- IB 泛化界（IB generalization bounds）：IB 与泛化能力的理论联系

package/knowledge-base/probability/kl-divergence.en.md

@@ -45,7 +45,20 @@ $$D_{KL}(p \| q) = H(p, q) - H(p)$$
 - **High gradient variance**: In RL (PPO/RLHF), KL estimation relies on sampling; high variance can lead to training instability. A clipped + linear approximation $\mathbb{E}[\log p - \log q]$ is commonly used in place of the exact KL.
 
 ## Further References
-- Distillation draft: `references/books/` — no dedicated information theory distillation draft at present
+- Distillation draft: `../../references/books/` — no dedicated information theory distillation draft at present
 - Cover & Thomas. *Elements of Information Theory*, Ch. 2-3. Wiley, 2006
 - Murphy. *Probabilistic Machine Learning: Advanced Topics*, Ch. 6. MIT Press, 2023
-- Related knowledge cards: `probability/entropy.md`, `probability/information-bottleneck.md`, `probability/fisher-information.md`
+- Related knowledge cards: `entropy.en.md`, `information-bottleneck.en.md`, `fisher-information.en.md`
+
+
+## Routing Extensions
+- If used for IB objective -> `information-bottleneck.en.md` (IB defines objective using KL)
+- If the absolute version is needed -> `entropy.en.md` (KL divergence reduces to entropy)
+- If local KL geometry is needed -> `fisher-information.en.md` (Fisher information is local curvature of KL)
+
+## Extensible Directions
+- f-divergence family (chi-squared, Hellinger, Jensen-Shannon, total variation): unified divergence framework
+- Reverse KL (mode-seeking): mode-seeking behavior in variational inference
+- Bregman divergence: divergence family generated by convex functions
+- Variational representations (Donsker-Varadhan, Barber-Agakov): variational upper/lower bounds of KL divergence
+- KL in exponential families: geometry of sufficient statistics

package/knowledge-base/probability/kl-divergence.md

@@ -45,7 +45,20 @@ $$D_{KL}(p \| q) = H(p, q) - H(p)$$
 - **梯度方差大**：在 RL（PPO/RLHF）中，KL 估计依赖采样，高方差可导致训练不稳定。常用 clip + 线性近似 $\mathbb{E}[\log p - \log q]$ 替代精确 KL。
 
 ## 深入参考
-- 蒸馏稿：`references/books/` 暂无专用信息论蒸馏稿
+- 蒸馏稿：`../../references/books/` 暂无专用信息论蒸馏稿
 - Cover & Thomas. *Elements of Information Theory*, Ch. 2-3. Wiley, 2006
 - Murphy. *Probabilistic Machine Learning: Advanced Topics*, Ch. 6. MIT Press, 2023
-- 关联知识卡：`probability/entropy.md`、`probability/information-bottleneck.md`、`probability/fisher-information.md`
+- 关联知识卡：`entropy.md`、`information-bottleneck.md`、`fisher-information.md`
+
+
+## 路由扩展
+- 若用于 IB 目标函数 → `information-bottleneck.md`（IB 使用 KL 定义目标）
+- 若需要绝对版本 → `entropy.md`（KL 散度退化为熵）
+- 若需要局部 KL 几何 → `fisher-information.md`（Fisher 信息是 KL 的局部曲率）
+
+## 可扩展方向
+- f-散度族（chi-squared, Hellinger, Jensen-Shannon, total variation）：统一的散度框架
+- 逆 KL（reverse KL / mode-seeking）：变分推断中的模式搜索行为
+- Bregman 散度（Bregman divergence）：凸函数生成的散度族
+- 变分表示（Donsker-Varadhan, Barber-Agakov）：KL 散度的变分上/下界
+- 指数族中的 KL（KL in exponential families）：充分统计量的几何

package/knowledge-base/topology/euler-characteristic.en.md

@@ -48,7 +48,20 @@ High GPU friendliness. Computing the Euler characteristic is extremely cheap:
 
 ## Further References
 
-- Distillation notes: references/books/smooth-manifolds.md (Ch 17--18 De Rham Cohomology, Betti numbers and cohomology)
-- Distillation notes: references/books/differential-geometry.md (Ch 4 Curves and Hypersurfaces, intuition source for Gauss curvature)
+- Distillation notes: ../../references/books/smooth-manifolds.en.md (Ch 17--18 De Rham Cohomology, Betti numbers and cohomology)
+- Distillation notes: ../../references/books/differential-geometry.en.md (Ch 4 Curves and Hypersurfaces, intuition source for Gauss curvature)
 - Original text: John M. Lee, *Introduction to Smooth Manifolds*, Ch 17--18 (de Rham cohomology and topological invariants)
 - Extended reading: Hatcher, *Algebraic Topology*, Ch 2 (standard treatment of simplicial homology and the Euler characteristic)
+
+
+## Routing Extensions
+- If multi-scale topology analysis is needed -> `persistent-homology.en.md` (persistent homology provides scale-dependent topology)
+- If curvature-topology connection is involved -> `../differential-geometry/curvature.md` (Gauss-Bonnet theorem connects curvature and Euler characteristic)
+
+## Extensible Directions
+- Betti numbers: counting independent loops at each dimension
+- Poincare polynomial: generating function of Betti numbers
+- Lefschetz fixed point theorem: Euler characteristic and map fixed points
+- Morse inequalities: relationship between critical points and Betti numbers
+- Discrete Morse theory: Morse functions on complexes
+- Euler characteristic curve: Euler characteristic variation across thresholds

package/knowledge-base/topology/euler-characteristic.md

@@ -48,7 +48,20 @@ GPU 友好度高。欧拉示性数的计算极其廉价：
 
 ## 深入参考
 
-- 蒸馏稿：references/books/smooth-manifolds.md（Ch 17-18 De Rham Cohomology，Betti 数与上同调）
-- 蒸馏稿：references/books/differential-geometry.md（Ch 4 Curves and Hypersurfaces, Gauss curvature 直觉来源）
+- 蒸馏稿：../../references/books/smooth-manifolds.md（Ch 17-18 De Rham Cohomology，Betti 数与上同调）
+- 蒸馏稿：../../references/books/differential-geometry.md（Ch 4 Curves and Hypersurfaces, Gauss curvature 直觉来源）
 - 原书：John M. Lee, *Introduction to Smooth Manifolds*, Ch 17-18（de Rham 上同调与拓扑不变量）
 - 延伸：Hatcher, *Algebraic Topology*, Ch 2（单纯同调与欧拉示性数的标准处理）
+
+
+## 路由扩展
+- 若需要多尺度拓扑分析 → `persistent-homology.md`（持续同调提供尺度依赖的拓扑）
+- 若涉及曲率-拓扑联系 → `../differential-geometry/curvature.md`（Gauss-Bonnet 定理连接曲率与 Euler 示性数）
+
+## 可扩展方向
+- Betti 数（Betti numbers）：各维度的独立环路计数
+- Poincare 多项式（Poincare polynomial）：Betti 数的生成函数
+- Lefschetz 不动点定理：Euler 示性数与映射不动点
+- Morse 不等式（Morse inequalities）：临界点与 Betti 数的关系
+- 离散 Morse 理论（discrete Morse theory）：复形上的 Morse 函数
+- Euler 示性数曲线（Euler characteristic curve）：多阈值的 Euler 示性数变化

package/knowledge-base/topology/fundamental-group.en.md

@@ -46,7 +46,21 @@ Low GPU friendliness. Computation of the fundamental group is inherently combina
 
 ## Further References
 
-- Distillation notes: references/books/smooth-manifolds.md (Ch 17--18 De Rham Cohomology, cohomology and topological invariants)
-- Distillation notes: references/books/algebraic-geometry-rising-sea.md (Section 18 Cech Cohomology, local gluing and global obstructions)
+- Distillation notes: ../../references/books/smooth-manifolds.en.md (Ch 17--18 De Rham Cohomology, cohomology and topological invariants)
+- Distillation notes: ../../references/books/algebraic-geometry-rising-sea.en.md (Section 18 Cech Cohomology, local gluing and global obstructions)
 - Original text: John M. Lee, *Introduction to Smooth Manifolds*, Ch 17 (de Rham cohomology, the loop integral perspective)
 - Extended reading: Hatcher, *Algebraic Topology*, Ch 1 (standard textbook treatment of the fundamental group, including the Seifert-van Kampen theorem)
+
+
+## Routing Extensions
+- If higher-dimensional homology is needed -> `persistent-homology.en.md` (higher homology groups)
+- If geometric structure is involved -> `../differential-geometry/curvature.md` (relationship between geometry and topology)
+
+## Extensible Directions
+- Covering space theory: Galois correspondence between fundamental group and coverings
+- Van Kampen theorem: computational tool for fundamental groups
+- Higher homotopy groups: computation and obstructions of pi_n
+- Hurewicz theorem: relationship between homotopy and homology groups
+- Loop space: space of all loops based at a point
+- Braid group: algebraic structure of braids
+- Knot group: invariants of knots

package/knowledge-base/topology/fundamental-group.md

@@ -46,7 +46,21 @@ GPU 友好度低。基本群的计算本质上是组合/代数的，而非数值
 
 ## 深入参考
 
-- 蒸馏稿：references/books/smooth-manifolds.md（Ch 17-18 De Rham Cohomology，上同调与拓扑不变量）
-- 蒸馏稿：references/books/algebraic-geometry-rising-sea.md（§18 Cech Cohomology，局部黏合与全局障碍）
+- 蒸馏稿：../../references/books/smooth-manifolds.md（Ch 17-18 De Rham Cohomology，上同调与拓扑不变量）
+- 蒸馏稿：../../references/books/algebraic-geometry-rising-sea.md（§18 Cech Cohomology，局部黏合与全局障碍）
 - 原书：John M. Lee, *Introduction to Smooth Manifolds*, Ch 17（de Rham 上同调，环路积分的视角）
 - 延伸：Hatcher, *Algebraic Topology*, Ch 1（基本群的标准教材处理，含 Seifert-van Kampen 定理）
+
+
+## 路由扩展
+- 若需要更高维同调 → `persistent-homology.md`（高阶同调群）
+- 若涉及几何结构 → `../differential-geometry/curvature.md`（几何与拓扑的关系）
+
+## 可扩展方向
+- 覆叠空间理论（covering space theory）：基本群与覆叠的 Galois 对应
+- Van Kampen 定理：基本群的计算工具
+- 高阶同伦群（higher homotopy groups）：pi_n 的计算与障碍
+- Hurewicz 定理：同伦群与同调群的关系
+- 环路空间（loop space）：基于某点的环路全体
+- 辫群（braid group）：辫子的代数结构
+- 纽群（knot group）：纽结的不变量

package/knowledge-base/topology/index.en.md

@@ -0,0 +1,48 @@
+# Topology Activation Index
+
+## Domain Signals
+Activate this domain direction when the problem involves:
+- Connectivity preservation: need to maintain or detect connectivity structure of a space
+- Representation space tearing: latent space or representation space exhibits topological tearing
+- Local-to-global consistency: whether local information can be consistently glued into a global structure
+- Multimodal alignment obstruction: whether topological obstructions exist for multimodal alignment
+- Whether compression destroys structure: whether dimensionality reduction or compression alters the topological features of data
+
+## Core Anchors
+- `persistent-homology.en.md` — Persistent homology
+- `euler-characteristic.en.md` — Euler characteristic
+- `fundamental-group.en.md` — Fundamental group
+
+## Extended Concepts
+When core anchors are insufficient, the following concepts may need temporary activation:
+- simplicial complex: simplicial complexes (Vietoris-Rips, alpha complex, etc.)
+- Cech complex: Cech complex and coverings
+- sheaf theory (section, restriction map, gluing, Cech cohomology): sheaf theory basics and Cech cohomology
+- covering space: covering spaces and covering maps
+- homotopy group: higher homotopy groups
+- CW complex: CW complexes and cell structure
+- Morse theory: Morse theory and critical point analysis
+- Betti numbers: Betti numbers and topological invariants
+- topological data analysis (Mapper algorithm): topological data analysis and Mapper algorithm
+- obstruction theory: obstruction theory
+- classifying space: classifying spaces
+- K-theory: K-theory
+- cobordism: cobordism theory
+
+## Reference Book Directions
+- `../../references/books/smooth-manifolds.en.md`: Chapters 17-18, covering homology theory basics
+- `../../references/books/algebraic-geometry-rising-sea.en.md`: Cech cohomology sections
+
+## AI Translation Directions
+- persistent homology → representation topology monitor / topological regularization loss
+- euler characteristic → complexity metric / model selection criterion
+- fundamental group → loop structure detection / cycle-preserving compression
+- sheaf / gluing → cross-modal consistency loss / multi-view alignment
+- obstruction theory → alignment failure signal / topological bottleneck detection
+- simplicial complex → higher-order token relation graph / hypergraph attention
+
+## Temporary Activation Rules
+When the problem requires mathematics not in the core anchors:
+1. First check whether extended concepts contain a match
+2. If yes, generate a temporary knowledge card based on the lens
+3. If no, enter the Knowledge Gap Protocol

package/knowledge-base/topology/index.md

@@ -0,0 +1,48 @@
+# 拓扑 激活索引 / Topology Activation Index
+
+## 领域信号
+当问题涉及以下信号时，激活本领域方向：
+- 连通性保持：需要保持或检测空间的连通性结构
+- 表示空间断裂：隐空间或表示空间出现拓扑断裂
+- 局部到全局一致性：局部信息是否能一致地拼接成全局结构
+- 多模态对齐 obstruction：多模态对齐是否存在拓扑障碍
+- 压缩是否破坏结构：降维或压缩是否改变了数据的拓扑特征
+
+## 核心锚点
+- `persistent-homology.md` — 持续同调
+- `euler-characteristic.md` — Euler 示性数
+- `fundamental-group.md` — 基本群
+
+## 扩展概念
+当核心锚点不够时，以下概念可能需要临时激活：
+- simplicial complex：单纯复形（Vietoris-Rips, alpha complex 等）
+- Cech complex：Cech 复形与覆盖
+- sheaf theory（section, restriction map, gluing, Cech cohomology）：层论基础与 Cech 上同调
+- covering space：覆叠空间与覆叠映射
+- homotopy group：高阶同伦群
+- CW complex：CW 复形与胞腔结构
+- Morse theory：Morse 理论与临界点分析
+- Betti numbers：Betti 数与拓扑不变量
+- topological data analysis（Mapper algorithm）：拓扑数据分析与 Mapper 算法
+- obstruction theory：障碍理论
+- classifying space：分类空间
+- K-theory：K 理论
+- cobordism：配边理论
+
+## 参考书方向
+- `../../references/books/smooth-manifolds.md`：第 17-18 章，覆盖同调论基础
+- `../../references/books/algebraic-geometry-rising-sea.md`：Cech 上同调部分
+
+## AI 翻译方向
+- persistent homology → representation topology monitor / topological regularization loss
+- euler characteristic → complexity metric / model selection criterion
+- fundamental group → loop structure detection / cycle-preserving compression
+- sheaf / gluing → cross-modal consistency loss / multi-view alignment
+- obstruction theory → alignment failure signal / topological bottleneck detection
+- simplicial complex → higher-order token relation graph / hypergraph attention
+
+## 临时激活规则
+当问题需要的数学不在核心锚点中时：
+1. 先检查扩展概念中是否有匹配
+2. 若有，根据透镜生成临时知识卡
+3. 若无，进入 Knowledge Gap Protocol

package/knowledge-base/topology/persistent-homology.en.md

@@ -48,7 +48,22 @@ Limited GPU friendliness, which is the main bottleneck for deploying persistent
 
 ## Further References
 
-- Distillation notes: references/books/smooth-manifolds.md (Ch 17--18 De Rham Cohomology, conceptual origin of topological invariants)
-- Distillation notes: references/books/algebraic-geometry-rising-sea.md (Section 18 Cech Cohomology, Section 23 Derived Functors, cohomology computations)
+- Distillation notes: ../../references/books/smooth-manifolds.en.md (Ch 17--18 De Rham Cohomology, conceptual origin of topological invariants)
+- Distillation notes: ../../references/books/algebraic-geometry-rising-sea.en.md (Section 18 Cech Cohomology, Section 23 Derived Functors, cohomology computations)
 - Original text: John M. Lee, *Introduction to Smooth Manifolds*, Ch 17--18 (de Rham cohomology)
 - Extended reading: Edelsbrunner & Harer, *Computational Topology: An Introduction* (standard textbook on persistent homology)
+
+
+## Routing Extensions
+- If topological invariant computation is needed -> `euler-characteristic.en.md` (Euler characteristic as alternating sum of Betti numbers)
+- If 1-dimensional topology analysis is needed -> `fundamental-group.en.md` (fundamental group captures loop structure)
+- If used for information-preserving compression -> `../probability/information-bottleneck.md` (topology-preserving information compression)
+
+## Extensible Directions
+- Simplicial complex types (Cech, Vietoris-Rips, alpha): advantages and disadvantages of different constructions
+- Sheaf theory: local-to-global consistent data structures
+- Mapper algorithm: visualization and clustering based on persistent homology
+- Topological data analysis (TDA): complete TDA methodology
+- Persistence image / landscape: vectorized representations of persistence diagrams
+- Multiparameter persistence: homology with multi-scale filtrations
+- Zigzag persistence: persistent homology allowing bidirectional filtrations

package/knowledge-base/topology/persistent-homology.md

@@ -48,7 +48,22 @@ GPU 友好度有限，是持续同调落地的主要瓶颈：
 
 ## 深入参考
 
-- 蒸馏稿：references/books/smooth-manifolds.md（Ch 17-18 De Rham Cohomology，拓扑不变量概念来源）
-- 蒸馏稿：references/books/algebraic-geometry-rising-sea.md（§18 Cech Cohomology, §23 Derived Functors，上同调计算）
+- 蒸馏稿：../../references/books/smooth-manifolds.md（Ch 17-18 De Rham Cohomology，拓扑不变量概念来源）
+- 蒸馏稿：../../references/books/algebraic-geometry-rising-sea.md（§18 Cech Cohomology, §23 Derived Functors，上同调计算）
 - 原书：John M. Lee, *Introduction to Smooth Manifolds*, Ch 17-18（de Rham 上同调）
 - 延伸：Edelsbrunner & Harer, *Computational Topology: An Introduction*（持续同调标准教材）
+
+
+## 路由扩展
+- 若需要拓扑不变量的计算 → `euler-characteristic.md`（Euler 示性数作为 Betti 数的交替和）
+- 若需要 1 维拓扑分析 → `fundamental-group.md`（基本群捕捉环路结构）
+- 若用于信息保持压缩 → `../probability/information-bottleneck.md`（拓扑保持的信息压缩）
+
+## 可扩展方向
+- 单纯复形类型（Cech, Vietoris-Rips, alpha）：不同复形构造的优缺点
+- 层论（sheaf theory）：局部到全局的一致数据结构
+- Mapper 算法：基于持续同调的可视化与聚类
+- 拓扑数据分析（topological data analysis）：TDA 的完整方法论
+- 持续图像/景观（persistence image / landscape）：持续图的向量化表示
+- 多参数持续（multiparameter persistence）：多尺度过滤的同调
+- zigzag 持续（zigzag persistence）：允许双向过滤的持续同调

package/lenses/spectral.en.md

@@ -17,7 +17,7 @@ This is a "decomposer's" perspective — breaking complex linear operators (matr
 ## What Problems It Is Not Suited For
 
 - Problems dominated by nonlinear effects — spectral decomposition is a linear tool
-- Operators that are not diagonalizable (non-normal matrices, defective matrices) — Jordan form is required
+- Operators that are non-diagonalizable or non-normal — Jordan form is mainly theoretical; for numerical / engineering use prefer Schur decomposition, SVD, or pseudospectral stability analysis
 - Problems that require preserving global topological structure — spectral methods may destroy topology
 
 ## Which Knowledge Domains It Routes To

package/lenses/spectral.md

@@ -17,7 +17,7 @@
 ## 不适合什么问题
 
 - 非线性效应主导的问题——谱分解是线性工具
-- 算子本身不可对角化（非正规矩阵、亏损矩阵）——需要 Jordan 形式
+- 算子本身不可对角化或非正规——Jordan 形式主要用于理论分析，数值/工程上优先用 Schur 分解、SVD 或 pseudospectrum 稳定性分析
 - 需要保留全局拓扑结构的问题——谱方法可能破坏拓扑
 
 ## 会路由到哪些知识域

package/lenses/topological.en.md

@@ -23,7 +23,7 @@ Topology is a way of "ignoring precise measurements and focusing only on qualita
 
 - `topology/persistent-homology`: Fundamental group, homology groups, Betti numbers, and cohomology — computational tools for topological invariants
 - **tda**: Persistent homology, filtrations, and simplicial complexes — extracting topological features from data
-- `topology/fundamental-group`: Sheaf cohomology and Čech cohomology — algebraic criteria for local-to-global consistency
+- `topology/fundamental-group`: Fundamental group, loop homotopy classes, covering spaces — detecting non-contractible loops and path-connectivity structure
 
 ## What AI Designs It May Inspire
 

package/lenses/topological.md

@@ -23,7 +23,7 @@
 
 - `topology/persistent-homology`：基本群、同调群、Betti 数、上同调——拓扑不变量的计算工具
 - **tda**：持续同调、滤流、单纯复形——从数据中提取拓扑特征
-- `topology/fundamental-group`：层上同调、Cech 上同调——从局部到全局的一致性代数判据
+- `topology/fundamental-group`：基本群、环路同伦类、覆盖空间——检测不可收缩环路与路径连通性结构
 
 ## 可能产生哪些 AI 设计