math-skill 3.0.1 → 3.1.1

package/design-patterns/representation/subspace-alignment.en.md

@@ -10,9 +10,9 @@ Use when two or more representation spaces need to be aligned to a common subspa
 Core requirement: **find the optimal linear/nonlinear mapping between two spaces such that corresponding semantics are aligned**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (Grassmann manifold, principal angles), lenses/variational.md (Procrustes problem)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (SVD, orthogonal Procrustes),
-  knowledge-base/differential-geometry/manifold.md (Grassmann distance, geodesics)
+- Lenses: ../../lenses/geometric.en.md (Grassmann manifold, principal angles), ../../lenses/variational.en.md (Procrustes problem)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (SVD, orthogonal Procrustes),
+  ../../knowledge-base/differential-geometry/manifold.en.md (Grassmann distance, geodesics)
 
 ## Required Mathematical Background
 - **Orthogonal Procrustes Problem**: min_{W in O(d)} ||AW - B||_F^2
@@ -71,17 +71,17 @@ Online Subspace Tracking (adaptation at inference):
 - **Chunked SVD**: Use randomized SVD approximation at large scale; sufficient precision and faster
 
 ## GPU Feasibility
-- **Tensorization**: A^T @ B is standard GEMM (d x N) @ (N x d); SVD has cuSOLVER implementations
-- **GEMM-mappable**: Procrustes core requires 1 GEMM + 1 SVD; CCA requires 2 GEMMs + 1 SVD
-- **Complexity**: GEMM O(N * d^2); SVD O(d^3) (d typically < 1024, acceptable); online tracking O(d^2)
-- **Memory & KV-Cache**: Storing covariance matrix d x d (~4 MB for d = 1024); no KV-Cache overhead
-- **Low-precision stability**: SVD strongly recommended in fp32; whitening matrix inversion requires fp32 + epsilon regularization
-- **Parallelism & Communication**: Subspace angle computations for multiple expert pairs are independent and parallel; CCA GEMMs are highly parallel
-- **Sparse structure**: When source/target representations are sparse, covariance matrix Sigma is sparse, enabling sparse SVD
-- **Operator fusion**: Whitening (mean-sub -> cov -> inv_sqrt -> transform) can be partially fused
+- **D1[v]**: A^T @ B is standard GEMM (d x N) @ (N x d); SVD has cuSOLVER implementations
+- **D2[v]**: Procrustes core requires 1 GEMM + 1 SVD; CCA requires 2 GEMMs + 1 SVD
+- **D3[v]**: GEMM O(N * d^2); SVD O(d^3) (d typically < 1024, acceptable); online tracking O(d^2)
+- **D4[v]**: Storing covariance matrix d x d (~4 MB for d = 1024); no KV-Cache overhead
+- **D5[~]**: SVD strongly recommended in fp32; whitening matrix inversion requires fp32 + epsilon regularization
+- **D6[v]**: Subspace angle computations for multiple expert pairs are independent and parallel; CCA GEMMs are highly parallel
+- **D7[~]**: When source/target representations are sparse, covariance matrix Sigma is sparse, enabling sparse SVD
+- **D8[~]**: Whitening (mean-sub -> cov -> inv_sqrt -> transform) can be partially fused
 
 ## Paper-Worthy Formulation
-"Based on orthogonal Procrustes theory, we obtain the optimal isometric mapping W* = UV^T (where USV^T = SVD(A^T B)) between source and target representations. Extending this to Deep CCA for nonlinear subspace alignment, principal angle analysis on the Grassmann manifold shows that post-alignment subspace distance converges at rate O(r/sqrt(N)), while the Barlow Twins redundancy reduction objective ensures feature dimension decorrelation."
+"Based on orthogonal Procrustes theory, we obtain the optimal isometric mapping W* = UV^T (where USV^T = SVD(A^T B)) between source and target representations. Extending this to Deep CCA for nonlinear subspace alignment, principal angles on the Grassmann manifold can measure pre/post alignment distance. Convergence rates depend on sample independence, spectral gaps, and covariance-estimation assumptions; the Barlow Twins objective penalizes cross-correlation but does not by itself guarantee semantic disentanglement, so report principal angles, CCA correlations, and downstream transfer metrics."
 
 ## Risks
 - SVD during backpropagation produces undefined gradients when singular values coincide; epsilon regularization is needed

package/design-patterns/representation/subspace-alignment.md

@@ -10,9 +10,9 @@
 核心诉求：**找到两个空间之间的最优线性/非线性映射，使对应语义对齐**。
 
 ## 数学思想来源
-- 透镜：lenses/geometric.md（Grassmann 流形、主角度）、lenses/variational.md（Procrustes 问题）
-- 知识：knowledge-base/matrix-analysis/projection.md（SVD、正交 Procrustes）、
-  knowledge-base/differential-geometry/manifold.md（Grassmann 距离、测地线）
+- 透镜：../../lenses/geometric.md（Grassmann 流形、主角度）、../../lenses/variational.md（Procrustes 问题）
+- 知识：../../knowledge-base/matrix-analysis/projection.md（SVD、正交 Procrustes）、
+  ../../knowledge-base/differential-geometry/manifold.md（Grassmann 距离、测地线）
 
 ## 需要的数学知识
 - **正交 Procrustes 问题**：min_{W∈O(d)} ‖AW - B‖_F²
@@ -71,19 +71,19 @@
 - **分块 SVD**：大规模时用 randomized SVD 近似，精度足够且更快
 
 ## GPU 可行性
-- **张量化**：A^T@B 为标准 GEMM (d×N)@(N×d)；SVD 有 cuSOLVER 实现
-- **GEMM 可映射**：Procrustes 核心 1 次 GEMM + 1 次 SVD；CCA 2 次 GEMM + 1 次 SVD
-- **复杂度**：GEMM O(N·d²)；SVD O(d³)（d 通常 <1024，可接受）；在线追踪 O(d²)
-- **显存与 KV-Cache**：存储协方差矩阵 d×d（~4MB for d=1024），不增加 KV-Cache
-- **低精度稳定**：SVD 强烈建议 fp32；白化的矩阵逆需 fp32 + ε 正则化
-- **并行与通信**：多专家对的子空间角度计算独立并行；CCA 的 GEMM 高度并行
-- **稀疏结构**：当源/目标表示稀疏时，协方差矩阵 Σ 稀疏，可用稀疏 SVD
-- **算子融合**：白化 (mean-sub → cov → inv_sqrt → transform) 可部分融合
+- **D1[v]**：A^T@B 为标准 GEMM (d×N)@(N×d)；SVD 有 cuSOLVER 实现
+- **D2[v]**：Procrustes 核心 1 次 GEMM + 1 次 SVD；CCA 2 次 GEMM + 1 次 SVD
+- **D3[v]**：GEMM O(N·d²)；SVD O(d³)（d 通常 <1024，可接受）；在线追踪 O(d²)
+- **D4[v]**：存储协方差矩阵 d×d（~4MB for d=1024），不增加 KV-Cache
+- **D5[~]**：SVD 强烈建议 fp32；白化的矩阵逆需 fp32 + ε 正则化
+- **D6[v]**：多专家对的子空间角度计算独立并行；CCA 的 GEMM 高度并行
+- **D7[~]**：当源/目标表示稀疏时，协方差矩阵 Σ 稀疏，可用稀疏 SVD
+- **D8[~]**：白化 (mean-sub → cov → inv_sqrt → transform) 可部分融合
 
 ## 论文表述方式
 "基于正交 Procrustes 理论求得源-目标表示间的最优等距映射 W*=UV^T（USV^T=SVD(A^TB)），
 将其扩展为深度 CCA 实现非线性子空间对齐，Grassmann 流形上的主角度分析表明
-对齐后子空间距离以 O(r/√N) 收敛，同时 Barlow Twins 冗余减少目标保证特征维度解耦。"
+对齐前后的子空间距离可由主角度度量。收敛速率依赖样本独立性、谱间隙和协方差估计条件；Barlow Twins 目标只惩罚交叉相关，不能单独保证语义解耦，应报告主角度、CCA 相关系数和下游迁移指标。"
 
 ## 风险
 - SVD 在反向传播时奇异值重合导致梯度未定义，需添加 ε 正则化

package/design-patterns/routing/graph-routing.en.md

@@ -10,9 +10,9 @@ Use when there exists a known or learnable topological structure among modules/e
 Core requirement: **leverage structural priors to constrain routing decisions and reduce the search space**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (graph Laplacian, spectral graph theory), lenses/probabilistic.md (message passing, information flow)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (adjacency matrix, spectral decomposition),
-  knowledge-base/optimization/lagrangian-duality.md (variational on graphs, diffusion processes)
+- Lenses: ../../lenses/geometric.en.md (graph Laplacian, spectral graph theory), ../../lenses/probabilistic.en.md (message passing, information flow)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (adjacency matrix, spectral decomposition),
+  ../../knowledge-base/optimization/lagrangian-duality.en.md (variational on graphs, diffusion processes)
 
 ## Required Mathematical Background
 - **Graph Laplacian**: L = D - A (combinatorial) or L_sym = D^{-1/2} L D^{-1/2} (normalized)
@@ -60,14 +60,14 @@ Method 3 - Hierarchical Tree Routing (O(log K) complexity):
 - **Hierarchical tree implementation**: Represented as a complete binary tree array with level-wise vectorization
 
 ## GPU Feasibility
-- **Tensorization**: GCN layers perform sparse matrix times dense matrix (SpMM), supported by both PyTorch and cuSPARSE
-- **GEMM-mappable**: score_init @ P_t in Method 1 is standard GEMM (N x K) @ (K x K)
-- **Complexity**: Method 1 O(N * K^2) diffusion + O(N * K * d) gate; Method 3 O(N * d * log K) significantly better than O(N * d * K)
-- **Memory & KV-Cache**: A matrix stored sparsely at K x K; hierarchical tree parameters d x log K are negligible
-- **Low-precision stability**: Probability matrix P and softmax in fp16 require attention to normalization precision
-- **Parallelism & Communication**: GNN message passing can be batched in parallel; hierarchical tree nodes at the same level can be evaluated independently in parallel
-- **Sparse structure**: Graph adjacency matrices are naturally sparse (degree << K); SpMM reduces from O(K^2) to O(K * avg_deg)
-- **Operator fusion**: L_norm @ H @ W in GCN can be fused into a single sparse GEMM
+- **D1[v]**: GCN layers perform sparse matrix times dense matrix (SpMM), supported by both PyTorch and cuSPARSE
+- **D2[v]**: score_init @ P_t in Method 1 is standard GEMM (N x K) @ (K x K)
+- **D3[v]**: Method 1 O(N * K^2) diffusion + O(N * K * d) gate; Method 3 O(N * d * log K) significantly better than O(N * d * K)
+- **D4[v]**: A matrix stored sparsely at K x K; hierarchical tree parameters d x log K are negligible
+- **D5[v]**: Probability matrix P and softmax in fp16 require attention to normalization precision
+- **D6[v]**: GNN message passing can be batched in parallel; hierarchical tree nodes at the same level can be evaluated independently in parallel
+- **D7[v]**: Graph adjacency matrices are naturally sparse (degree << K); SpMM reduces from O(K^2) to O(K * avg_deg)
+- **D8[v]**: L_norm @ H @ W in GCN can be fused into a single sparse GEMM
 
 ## Paper-Worthy Formulation
 "Leveraging hierarchical tree/graph topology among experts, we compress routing decisions from a flat O(N * K) search to O(N * log K) tree traversal or O(N * K * avg_deg) graph diffusion. Fiedler spectral analysis reveals that the graph's algebraic connectivity lambda_2 directly governs the diversity-coherence trade-off in routing."

package/design-patterns/routing/graph-routing.md

@@ -10,9 +10,9 @@
 核心诉求：**利用结构化先验约束路由决策，减少搜索空间**。
 
 ## 数学思想来源
-- 透镜：lenses/geometric.md（图拉普拉斯、谱图论）、lenses/probabilistic.md（消息传递、信息流）
-- 知识：knowledge-base/matrix-analysis/projection.md（邻接矩阵、谱分解）、
-  knowledge-base/optimization/lagrangian-duality.md（图上优化、扩散过程）
+- 透镜：../../lenses/geometric.md（图拉普拉斯、谱图论）、../../lenses/probabilistic.md（消息传递、信息流）
+- 知识：../../knowledge-base/matrix-analysis/projection.md（邻接矩阵、谱分解）、
+  ../../knowledge-base/optimization/lagrangian-duality.md（图上优化、扩散过程）
 
 ## 需要的数学知识
 - **图拉普拉斯**：L = D - A（组合）或 L_sym = D^{-1/2} L D^{-1/2}（归一化）
@@ -60,14 +60,14 @@
 - **层次树实现**：用完全二叉树的数组表示，level-wise 向量化
 
 ## GPU 可行性
-- **张量化**：GCN 层为稀疏矩阵×稠密矩阵 (SpMM)，PyTorch 和 cuSPARSE 均支持
-- **GEMM 可映射**：方法1 的 score_init@P_t 为标准 GEMM (N×K)@(K×K)
-- **复杂度**：方法1 O(N·K²) 扩散 + O(N·K·d) gate；方法3 O(N·d·log K) 显著优于 O(N·d·K)
-- **显存与 KV-Cache**：A 矩阵 K×K 稀疏存储；层次树参数 d×log K 极小
-- **低精度稳定**：概率矩阵 P 和 softmax 在 fp16 下需注意归一化精度
-- **并行与通信**：GNN 消息传递可批量并行；层次树同层节点独立可并行判断
-- **稀疏结构**：图邻接矩阵天然稀疏（度 << K），SpMM 加速比 O(K²) 到 O(K·avg_deg)
-- **算子融合**：GCN 的 L_norm@H@W 可融合为单次稀疏 GEMM
+- **D1[v]**：GCN 层为稀疏矩阵×稠密矩阵 (SpMM)，PyTorch 和 cuSPARSE 均支持
+- **D2[v]**：方法1 的 score_init@P_t 为标准 GEMM (N×K)@(K×K)
+- **D3[v]**：方法1 O(N·K²) 扩散 + O(N·K·d) gate；方法3 O(N·d·log K) 显著优于 O(N·d·K)
+- **D4[v]**：A 矩阵 K×K 稀疏存储；层次树参数 d×log K 极小
+- **D5[v]**：概率矩阵 P 和 softmax 在 fp16 下需注意归一化精度
+- **D6[v]**：GNN 消息传递可批量并行；层次树同层节点独立可并行判断
+- **D7[v]**：图邻接矩阵天然稀疏（度 << K），SpMM 加速比 O(K²) 到 O(K·avg_deg)
+- **D8[v]**：GCN 的 L_norm@H@W 可融合为单次稀疏 GEMM
 
 ## 论文表述方式
 "利用专家间的层次树/图拓扑结构，将路由决策从 O(N·K) 的平铺搜索压缩为 O(N·log K) 的

package/design-patterns/routing/moe-routing.en.md

@@ -9,9 +9,9 @@ Typical scenarios: (1) Sparse MoE layers -- each token selects top-k experts (k
 Core requirement: **sparse activation, load balancing, end-to-end trainability**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/variational.md (discrete variational relaxation, Gumbel-Softmax), lenses/probabilistic.md (information-theoretic routing)
-- Knowledge: knowledge-base/optimization/lagrangian-duality.md (combinatorial variational, integer programming relaxation),
-  knowledge-base/probability/entropy.md (entropy regularization, information bottleneck)
+- Lenses: ../../lenses/variational.en.md (discrete variational relaxation, Gumbel-Softmax), ../../lenses/probabilistic.en.md (information-theoretic routing)
+- Knowledge: ../../knowledge-base/optimization/lagrangian-duality.en.md (combinatorial variational, integer programming relaxation),
+  ../../knowledge-base/probability/entropy.en.md (entropy regularization, information bottleneck)
 
 ## Required Mathematical Background
 - **Mixture Model EM**: p(y|x) = sum_k pi_k(x) * p(y|x, theta_k)
@@ -66,17 +66,17 @@ Auxiliary loss:
 - **Router Z-loss**: L_z = alpha * mean(logsumexp(logits)^2) stabilizes logit magnitudes
 
 ## GPU Feasibility
-- **Tensorization**: Gate logits = X @ W_gate is standard GEMM (N x d) @ (d x K); expert computation is batched GEMM
-- **GEMM-mappable**: Gate requires 1 GEMM; each expert internally is a standard FFN (2 GEMMs + activation)
-- **Complexity**: Gate O(N * d * K); per expert O(N * d * d_ff / k); total FLOPs approximately standard FFN x k
-- **Memory & KV-Cache**: All K expert parameters stored but only k activated; activation memory approximately standard FFN x k
-- **Low-precision stability**: Gate softmax + top-k is safe in fp16; Router Z-loss requires fp32 logsumexp
-- **Parallelism & Communication**: Expert parallelism requires all-to-all communication (each GPU sends/receives N/K tokens); bandwidth-sensitive
-- **Sparse structure**: Top-k routing is naturally sparse (activates k/K fraction of parameters); sparsity = 1 - k/K
-- **Operator fusion**: Gate -> top-k -> softmax -> weighted-sum can be fused; intra-expert FFN can be fused
+- **D1[v]**: Gate logits = X @ W_gate is standard GEMM (N x d) @ (d x K); expert computation is batched GEMM
+- **D2[v]**: Gate requires 1 GEMM; each expert internally is a standard FFN (2 GEMMs + activation)
+- **D3[v]**: Gate O(N * d * K); per expert O(N * d * d_ff / k); total FLOPs approximately standard FFN x k
+- **D4[v]**: All K expert parameters stored but only k activated; activation memory approximately standard FFN x k
+- **D5[v]**: Gate softmax + top-k is safe in fp16; Router Z-loss requires fp32 logsumexp
+- **D6[~]**: Expert parallelism requires all-to-all communication (each GPU sends/receives N/K tokens); bandwidth-sensitive
+- **D7[v]**: Top-k routing is naturally sparse (activates k/K fraction of parameters); sparsity = 1 - k/K
+- **D8[v]**: Gate -> top-k -> softmax -> weighted-sum can be fused; intra-expert FFN can be fused
 
 ## Paper-Worthy Formulation
-"We employ noisy top-k gating for sparse mixture-of-experts routing, activating a k/K fraction of parameters to achieve O(K) parameter capacity at O(k) inference cost. Combined with the load-balancing auxiliary loss L_aux = K * <f, P> and Router Z-loss, expert utilization exceeds 95%, yielding X% performance improvement over dense models under the same FLOPs budget."
+"We employ noisy top-k gating for sparse mixture-of-experts routing, activating only k experts per token to reduce activated compute while using the load-balancing auxiliary loss L_aux = K * <f, P> and Router Z-loss to stabilize routing logits. A paper should report measured expert utilization, overflow rate, all-to-all communication share, and quality deltas against dense baselines under matched FLOPs / parameter budgets; do not use unmeasured fixed-percentage placeholders."
 
 ## Risks
 - Load imbalance: A few experts are over-selected (Matthew effect), while remaining experts receive insufficient training

package/design-patterns/routing/moe-routing.md

@@ -9,9 +9,9 @@
 核心诉求：**稀疏激活、负载均衡、端到端可训练**。
 
 ## 数学思想来源
-- 透镜：lenses/variational.md（离散优化松弛、Gumbel-Softmax）、lenses/probabilistic.md（信息论路由）
-- 知识：knowledge-base/optimization/lagrangian-duality.md（对偶分解、拉格朗日松弛）、
-  knowledge-base/probability/entropy.md（熵正则化、信息瓶颈）
+- 透镜：../../lenses/variational.md（离散优化松弛、Gumbel-Softmax）、../../lenses/probabilistic.md（信息论路由）
+- 知识：../../knowledge-base/optimization/lagrangian-duality.md（对偶分解、拉格朗日松弛）、
+  ../../knowledge-base/probability/entropy.md（熵正则化、信息瓶颈）
 
 ## 需要的数学知识
 - **混合模型 EM**：p(y|x) = Σ_k π_k(x) · p(y|x,θ_k)
@@ -66,19 +66,17 @@
 - **Router Z-loss**：L_z = α·mean(logsumexp(logits)²) 稳定 logits 幅度
 
 ## GPU 可行性
-- **张量化**：gate logits = X@W_gate 为标准 GEMM (N×d)@(d×K)；专家计算为 batched GEMM
-- **GEMM 可映射**：gate 1 次 GEMM；每个专家内部为标准 FFN（2 次 GEMM + activation）
-- **复杂度**：gate O(N·d·K)；每专家 O(N·d·d_ff/k)；总 FLOPs ≈ 标准 FFN × k
-- **显存与 KV-Cache**：K 个专家参数全存储但仅 k 个激活，激活显存 ≈ 标准 FFN × k
-- **低精度稳定**：gate 的 softmax + top-k 在 fp16 安全；Router Z-loss 需 fp32 logsumexp
-- **并行与通信**：专家并行需 all-to-all 通信（每个 GPU 收发 N/K 个 token），带宽敏感
-- **稀疏结构**：top-k 路由天然稀疏（激活 k/K 的参数），稀疏度 = 1 - k/K
-- **算子融合**：gate → top-k → softmax → weighted-sum 可融合；专家内 FFN 可 fuse
+- **D1[v]**：gate logits = X@W_gate 为标准 GEMM (N×d)@(d×K)；专家计算为 batched GEMM
+- **D2[v]**：gate 1 次 GEMM；每个专家内部为标准 FFN（2 次 GEMM + activation）
+- **D3[v]**：gate O(N·d·K)；每专家 O(N·d·d_ff/k)；总 FLOPs ≈ 标准 FFN × k
+- **D4[v]**：K 个专家参数全存储但仅 k 个激活，激活显存 ≈ 标准 FFN × k
+- **D5[v]**：gate 的 softmax + top-k 在 fp16 安全；Router Z-loss 需 fp32 logsumexp
+- **D6[~]**：专家并行需 all-to-all 通信（每个 GPU 收发 N/K 个 token），带宽敏感
+- **D7[v]**：top-k 路由天然稀疏（激活 k/K 的参数），稀疏度 = 1 - k/K
+- **D8[v]**：gate → top-k → softmax → weighted-sum 可融合；专家内 FFN 可 fuse
 
 ## 论文表述方式
-"采用 noisy top-k 门控实现稀疏混合专家路由，激活 k/K 比例的参数以 O(k) 推理代价
-获得 O(K) 参数容量，配合负载均衡辅助损失 L_aux = K·⟨f,P⟩ 和 Router Z-loss 保证
-专家利用率 >95%，在同等 FLOPs 预算下相比 dense 模型提升 X% 性能。"
+"采用 noisy top-k 门控实现稀疏混合专家路由，每个 token 仅激活 k 个专家以降低激活计算，同时用负载均衡辅助损失 L_aux = K·⟨f,P⟩ 和 Router Z-loss 稳定路由 logits。论文中应报告专家利用率、溢出率、all-to-all 通信占比，以及同等 FLOPs/参数预算下相对 dense baseline 的实测质量差异；不得用未实测的固定百分比占位。"
 
 ## 风险
 - 负载不均衡：少数专家被过度选择（马太效应），其余专家得不到训练

package/design-patterns/routing/optimal-transport-routing.en.md

@@ -7,9 +7,9 @@ Typical scenarios: (1) Load-balanced MoE routing -- assigning N tokens to K expe
 Core requirement: **globally optimal assignment, rather than greedy per-point decisions**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/variational.md (convex variational, duality theory), lenses/geometric.md (Wasserstein distance)
-- Knowledge: knowledge-base/optimization/lagrangian-duality.md (duality theory, constrained optimization),
-  knowledge-base/probability/entropy.md (entropy regularization, marginal constraints)
+- Lenses: ../../lenses/variational.en.md (convex variational, duality theory), ../../lenses/geometric.en.md (Wasserstein distance)
+- Knowledge: ../../knowledge-base/optimization/lagrangian-duality.en.md (duality theory, constrained optimization),
+  ../../knowledge-base/probability/entropy.en.md (entropy regularization, marginal constraints)
 
 ## Required Mathematical Background
 - **Discrete Optimal Transport**: min_{P in Pi(mu,nu)} <C, P> = sum_{ij} C_{ij} P_{ij}
@@ -32,7 +32,7 @@ Sinkhorn routing (entropy-regularized):
   for t = 1..T:                       // T = 5 ~ 20 iterations
     u = a / (K_mat @ v)              // row scaling, a = 1/N
     v = b / (K_mat^T @ u)            // column scaling, b = cap / sum(cap)
-  P = diag(u) @ K_mat @ diag(v)     // optimal transport plan, doubly stochastic matrix
+  P = diag(u) @ K_mat @ diag(v)     // optimal transport plan (satisfies marginal constraints; doubly stochastic only when N = K with uniform marginals)
   assignment = argmax(P, dim=1)      // hard assignment (at inference)
   // At training: weighted_features = P @ E  (soft assignment, differentiable)
 
@@ -59,7 +59,7 @@ Capacity constraint (b vector):
 - **Operator fusion**: The exp -> matvec -> division pipeline in a single Sinkhorn step can be fused into a CUDA kernel
 
 ## Paper-Worthy Formulation
-"We formulate token-to-expert routing as an entropy-regularized optimal transport problem, obtaining an epsilon-approximate doubly stochastic assignment matrix via the Sinkhorn-Knopp algorithm within T = 10 iterations. The transport cost is guaranteed to converge to the global optimum within O(eps * log N), while marginal constraints b precisely control the load upper bound per expert."
+"We formulate token-to-expert routing as an entropy-regularized optimal transport problem, obtaining an approximate transport plan via the Sinkhorn-Knopp algorithm within T = 10 iterations. Finite Sinkhorn iterations yield an approximate solution to the entropy-regularized problem (not the exact global optimum); approximation quality depends on the iteration count T and regularization parameter eps. Marginal constraints b control the load upper bound per expert."
 
 ## Risks
 - Excessively small eps causes numerical instability in Sinkhorn (exp overflow); requires log-domain or increasing eps

package/design-patterns/routing/optimal-transport-routing.md

@@ -9,9 +9,9 @@
 核心诉求：**全局最优分配，而非贪心逐点决策**。
 
 ## 数学思想来源
-- 透镜：lenses/variational.md（凸优化、对偶理论）、lenses/geometric.md（Wasserstein 距离）
-- 知识：knowledge-base/optimization/lagrangian-duality.md（对偶理论、约束优化）、
-  knowledge-base/probability/entropy.md（熵正则化、边际约束）
+- 透镜：../../lenses/variational.md（凸优化、对偶理论）、../../lenses/geometric.md（Wasserstein 距离）
+- 知识：../../knowledge-base/optimization/lagrangian-duality.md（对偶理论、约束优化）、
+  ../../knowledge-base/probability/entropy.md（熵正则化、边际约束）
 
 ## 需要的数学知识
 - **离散最优传输**：min_{P∈Π(μ,ν)} ⟨C, P⟩ = Σ_{ij} C_{ij} P_{ij}
@@ -34,7 +34,7 @@ Sinkhorn 路由（熵正则化）：
   for t = 1..T:                     // T=5~20 次迭代
     u = a / (K_mat @ v)            // 行缩放，a = 1/N
     v = b / (K_mat^T @ u)          // 列缩放，b = cap/sum(cap)
-  P = diag(u) @ K_mat @ diag(v)   // 最优传输计划，双随机矩阵
+  P = diag(u) @ K_mat @ diag(v)   // 最优传输计划（满足边际约束；仅当 N=K 且边际均匀时才是双随机矩阵）
   assignment = argmax(P, dim=1)    // 硬分配（推理时）
   // 训练时：weighted_features = P @ E  (软分配，可微)
 
@@ -62,8 +62,8 @@ Sinkhorn 路由（熵正则化）：
 
 ## 论文表述方式
 "将 token-to-expert 路由建模为熵正则化最优传输问题，通过 Sinkhorn-Knopp 算法在 T=10 次
-迭代内求得 ε-近似最优的双随机分配矩阵，理论保证传输代价在 O(ε·log N) 内收敛到全局最优，
-同时通过边际约束 b 精确控制各专家的负载上限。"
+迭代内求得近似最优的传输计划矩阵。有限次迭代给出熵正则化问题的近似解（非精确全局最优），
+近似质量取决于迭代次数 T 和正则化参数 ε；同时通过边际约束 b 控制各专家的负载上限。"
 
 ## 风险
 - ε 过小导致 Sinkhorn 数值不稳定（exp 溢出），需用 log-domain 或增大 ε

package/design-patterns/routing/spectral-clustering-routing.en.md

@@ -10,9 +10,9 @@ Use when routing needs to be based on the intrinsic similarity structure of toke
 Core requirement: **discover the intrinsic cluster structure of data for routing or expert initialization**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (spectral graph theory, Laplacian eigenmaps), lenses/variational.md (relaxation and approximation)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (eigendecomposition, Rayleigh quotient),
-  knowledge-base/differential-geometry/manifold.md (manifold learning, graph cuts)
+- Lenses: ../../lenses/geometric.en.md (spectral graph theory, Laplacian eigenmaps), ../../lenses/variational.en.md (relaxation and approximation)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (eigendecomposition, Rayleigh quotient),
+  ../../knowledge-base/differential-geometry/manifold.en.md (manifold learning, graph cuts)
 
 ## Required Mathematical Background
 - **Spectral Clustering (Ng-Jordan-Weiss)**:
@@ -24,8 +24,12 @@ Core requirement: **discover the intrinsic cluster structure of data for routing
   W approximately C * W_m^{-1} * C^T, reducing eigendecomposition to m x m
 - **Spectral Relaxation Continuation**: Discrete cluster assignment => continuous eigenvectors => differentiable routing
   Use softmax(U_k * W_proj) instead of hard k-means assignment
-- **Power Iteration Acceleration**: Full eigendecomposition is unnecessary; only the top k eigenvectors are needed
-  Use Lanczos/Arnoldi iteration O(N^2 * k * iter) or randomized SVD O(N * k * log k)
+- **Power Iteration Acceleration**: Full eigendecomposition is unnecessary; only the $k$ **smallest** eigenvectors of Laplacian $L$ are needed
+  ⚠ Power iteration naturally finds the **largest** eigenvectors, so it cannot be applied directly to $L$!
+  Correct approaches: (1) apply power iteration to the similarity matrix $W$ (or normalized $D^{-1/2}WD^{-1/2}$)
+  to find its largest eigenvectors (corresponding to $L$'s smallest); (2) use Lanczos on $L$ with which='SM';
+  (3) shifted inverse iteration $(L - \sigma I)^{-1}$
+  Lanczos/Arnoldi iteration O(N^2 * k * iter) or randomized SVD O(N^2 * k)
 
 ## AI Module Form
 ```
@@ -34,13 +38,16 @@ Input: X in R^{N x d}, number of clusters K
 
 Method 1 - Online Spectral Clustering Routing (periodic updates during training):
   // Update cluster centers every M steps; use nearest neighbor at inference
-  W = exp(-cdist(X_sample, X_sample) / (2 sigma^2))  // m x m sampled similarity
+  W = exp(-(cdist(X_sample, X_sample)**2) / (2 sigma^2))  // m x m RBF similarity
   L = I - D^{-1/2} W D^{-1/2}                         // normalized Laplacian
   U_k = eigsh(L, k=K, which='SM')                     // K smallest eigenvectors
   centers = kmeans(U_k, K)                             // K cluster centers
-  // Routing: project new tokens into spectral space and assign
-  proj = X @ W_proj                                    // N -> K dimensional projection (learnable)
-  assignment = argmin(cdist(proj, centers))             // nearest center assignment
+  // Routing: embed new tokens into spectral space and assign
+  // ⚠ X @ W_proj is just a learnable linear projection, NOT Nystrom extension!
+  // True Nystrom extension: v_new = (1/λ) * W(x_new, X_sample) @ v, where v is eigenvector, λ is eigenvalue
+  proj_nystrom = (1/λ_k) * W_new_sample @ U_k    // Nystrom extension: similarity from x_new to m samples × eigenvectors
+  proj = X @ W_proj                               // alternative: learnable linear projection (not Nystrom, but end-to-end trainable)
+  assignment = argmin(cdist(proj_nystrom, centers))  // nearest center assignment
 
 Method 2 - Differentiable Spectral Routing (end-to-end):
   // Use softmax relaxation instead of hard assignment
@@ -48,18 +55,22 @@ Method 2 - Differentiable Spectral Routing (end-to-end):
   A = exp(sim_matrix / tau)                            // similarity graph (learnable tau)
   D_inv_sqrt = diag(1 / sqrt(sum(A, dim=1) + eps))
   L_norm = I - D_inv_sqrt @ A @ D_inv_sqrt             // normalized Laplacian
-  // Approximate top K eigenvectors (power iteration + orthogonalization)
-  U_k = power_iteration_approx(L_norm, K, steps=5)    // N x K
+  // ⚠ Power iteration finds largest eigenvectors, but spectral clustering needs L_norm's smallest!
+  // Apply power iteration to the normalized similarity matrix: its largest eigenvectors = L_norm's smallest
+  W_norm = D_inv_sqrt @ A @ D_inv_sqrt                 // = I - L_norm
+  U_k = power_iteration_approx(W_norm, K, steps=5)    // N x K (W_norm's largest eigvecs = L_norm's smallest)
   // Soft assignment
   cluster_logits = U_k @ W_cluster                     // N x K (learnable projection)
   route_probs = softmax(cluster_logits / tau_route)     // soft routing probabilities
 
 Method 3 - Anchor Spectral Clustering (large-scale):
   anchors = kmeans_pp(X, m)                             // m anchor points, m << N
-  Z = exp(-cdist(X, anchors) / (2 sigma^2))             // N x m affinity matrix
+  Z = exp(-(cdist(X, anchors)**2) / (2 sigma^2))        // N x m RBF affinity matrix
   L_anchor = I - D_z^{-1/2} Z^T Z D_z^{-1/2}            // m x m Laplacian
   U_k = eigsh(L_anchor, K)                             // m x K eigenvectors
-  route = Z @ U_k @ W_proj                              // N x K routing scores
+  // Nystrom extension: Z @ U_k extends anchor eigenvectors to all N points (non-learnable part)
+  embedding_nystrom = Z @ U_k                          // N x K Nystrom extension embedding
+  route = embedding_nystrom @ W_proj                   // N x K routing scores after learnable projection
 ```
 
 ## Implementable Structures
@@ -75,11 +86,11 @@ Method 3 - Anchor Spectral Clustering (large-scale):
 - **Memory & KV-Cache**: N x N similarity matrix exceeds 64 MB when N > 4096; sampling-based dimensionality reduction is essential
 - **Low-precision stability**: Eigendecomposition recommended in fp32; exp(-dist/sigma^2) in fp16 requires distance clipping
 - **Parallelism & Communication**: Power iteration matvec is highly parallel; k-means assign + update steps can be batch-parallelized
-- **Sparse structure**: k-NN graph replaces fully connected graph; W sparsity > 95%, enabling SpMM acceleration
+- **Sparse structure**: k-NN graph replaces the fully connected graph; W sparsity is about $1-k_{\text{nn}}/N$, enabling SpMM acceleration
 - **Operator fusion**: Diagonal scaling in D^{-1/2} @ A @ D^{-1/2} can be fused; cdist + exp + normalize can be fused
 
 ## Paper-Worthy Formulation
-"We achieve differentiable routing via continuous relaxation of spectral clustering: constructing the normalized Laplacian of the token similarity graph, reducing the O(N^2) eigendecomposition to O(Nm + K^3) through Nystrom approximation, and enabling GPU-friendly online spectral clustering via power iteration. Clustering quality, measured by Normalized Cut, guarantees an O(sqrt(log(N/K))) approximation ratio."
+"We implement routing through a continuous relaxation of spectral clustering: construct the normalized Laplacian of the token similarity graph, use Nystrom / anchor approximations plus power iteration to avoid a full O(N^3) eigendecomposition, and express the main work as GEMM, matvecs, and k-means. Normalized Cut can be reported as a clustering-quality metric, but approximation ratios depend on graph-model, sampling, and solver assumptions and should not be claimed unconditionally."
 
 ## Risks
 - The memory and computation cost of the N x N similarity matrix does not scale for long sequences; sampling or k-NN sparsification is mandatory

package/design-patterns/routing/spectral-clustering-routing.md

@@ -10,9 +10,9 @@
 核心诉求：**发现数据内在的簇结构，用于路由或专家初始化**。
 
 ## 数学思想来源
-- 透镜：lenses/geometric.md（谱图论、拉普拉斯特征映射）、lenses/variational.md（松弛与近似）
-- 知识：knowledge-base/matrix-analysis/projection.md（特征值分解、Rayleigh 商）、
-  knowledge-base/differential-geometry/manifold.md（流形学习、图割）
+- 透镜：../../lenses/geometric.md（谱图论、拉普拉斯特征映射）、../../lenses/variational.md（松弛与近似）
+- 知识：../../knowledge-base/matrix-analysis/projection.md（特征值分解、Rayleigh 商）、
+  ../../knowledge-base/differential-geometry/manifold.md（流形学习、图割）
 
 ## 需要的数学知识
 - **谱聚类 (Ng-Jordan-Weiss)**：
@@ -24,8 +24,11 @@
   W ≈ C · W_m^{-1} · C^T，将特征分解降维到 m×m
 - **谱松弛连续化**：离散聚类分配 → 连续特征向量 → 可微路由
   用 softmax(U_k · W_proj) 替代硬 k-means 分配
-- **幂迭代加速**：不需完整特征分解，只需前 k 个特征向量
-  用 Lanczos/Arnoldi 迭代 O(N²·k·iter) 或 randomized SVD O(N·k·log k)
+- **幂迭代加速**：不需完整特征分解，只需拉普拉斯 $L$ 的前 $k$ 个**最小**特征向量
+  ⚠ 幂迭代天然找**最大**特征向量，因此不能直接对 $L$ 做幂迭代！
+  正确做法：(1) 对相似度矩阵 $W$（或归一化 $D^{-1/2}WD^{-1/2}$）做幂迭代找最大特征向量
+  （对应 $L$ 的最小特征向量）；(2) 对 $L$ 用 Lanczos + which='SM'；(3) 移位逆迭代 $(L - \sigma I)^{-1}$
+  Lanczos/Arnoldi 迭代 O(N²·k·iter) 或 randomized SVD O(N²·k)
 
 ## AI 模块形式
 ```
@@ -34,13 +37,16 @@
 
 方法1 - 在线谱聚类路由（训练时周期性更新）：
   // 每 M 步更新一次聚类中心，推理时用最近邻
-  W = exp(-cdist(X_sample, X_sample) / (2σ²))  // m×m 采样相似度
+  W = exp(-(cdist(X_sample, X_sample)**2) / (2σ²))  // m×m RBF 相似度
   L = I - D^{-1/2} W D^{-1/2}                    // 归一化拉普拉斯
   U_k = eigsh(L, k=K, which='SM')                // 前 K 个最小特征向量
   centers = kmeans(U_k, K)                        // K 个聚类中心
-  // 路由：将新 token 投影到谱空间后分配
-  proj = X @ W_proj                               // N→K 维投影（可学习）
-  assignment = argmin(cdist(proj, centers))        // 最近中心分配
+  // 路由：将新 token 嵌入到谱空间后分配
+  // ⚠ X @ W_proj 仅为可学习线性投影，不是 Nyström 扩展！
+  // 真正的 Nyström 扩展：v_new = (1/λ) * W(x_new, X_sample) @ v，其中 v 为特征向量，λ 为特征值
+  proj_nystrom = (1/λ_k) * W_new_sample @ U_k    // Nyström 扩展：x_new 到 m 个采样点的相似度 × 特征向量
+  proj = X @ W_proj                               // 替代方案：可学习线性投影（非 Nyström，但可端到端训练）
+  assignment = argmin(cdist(proj_nystrom, centers))  // 最近中心分配
 
 方法2 - 可微谱路由（端到端）：
   // 用 softmax 松弛替代硬分配
@@ -48,18 +54,22 @@
   A = exp(sim_matrix / τ)                          // 相似度图（可学习 τ）
   D_inv_sqrt = diag(1 / sqrt(sum(A, dim=1) + ε))
   L_norm = I - D_inv_sqrt @ A @ D_inv_sqrt         // 归一化拉普拉斯
-  // 近似前 K 个特征向量（幂迭代 + 正交化）
-  U_k = power_iteration_approx(L_norm, K, steps=5)  // N×K
+  // ⚠ 幂迭代找最大特征向量，但谱聚类需要 L_norm 的最小特征向量！
+  // 对归一化相似度矩阵做幂迭代：其最大特征向量 = L_norm 的最小特征向量
+  W_norm = D_inv_sqrt @ A @ D_inv_sqrt             // = I - L_norm
+  U_k = power_iteration_approx(W_norm, K, steps=5)  // N×K（W_norm 的最大特征向量 = L_norm 的最小）
   // 软分配
   cluster_logits = U_k @ W_cluster                  // N×K（可学习投影）
   route_probs = softmax(cluster_logits / τ_route)    // 软路由概率
 
 方法3 - 锚点谱聚类（大规模）：
   anchors = kmeans_pp(X, m)                         // m 个锚点，m << N
-  Z = exp(-cdist(X, anchors) / (2σ²))               // N×m 亲和矩阵
+  Z = exp(-(cdist(X, anchors)**2) / (2σ²))          // N×m RBF 亲和矩阵
   L_anchor = I - D_z^{-1/2} Z^T Z D_z^{-1/2}        // m×m 拉普拉斯
   U_k = eigsh(L_anchor, K)                          // m×K 特征向量
-  route = Z @ U_k @ W_proj                           // N×K 路由分数
+  // Nyström 扩展：Z @ U_k 将锚点特征向量扩展到全部 N 个点（非可学习部分）
+  embedding_nystrom = Z @ U_k                       // N×K Nyström 扩展嵌入
+  route = embedding_nystrom @ W_proj                 // N×K 可学习投影后的路由分数
 ```
 
 ## 可实现结构
@@ -75,13 +85,12 @@
 - **显存与 KV-Cache**：N×N 相似度矩阵在 N>4096 时 >64MB，必须采样降维
 - **低精度稳定**：特征分解建议 fp32；exp(-dist/σ²) 在 fp16 下需 clip distance
 - **并行与通信**：幂迭代的 matvec 高度并行；k-means 的 assign+update 可批并行
-- **稀疏结构**：k-NN 图替代全连接图，W 稀疏度 >95%，SpMM 加速
+- **稀疏结构**：k-NN 图替代全连接图，W 稀疏度约为 $1-k_{\text{nn}}/N$，可用 SpMM 加速
 - **算子融合**：D^{-1/2}@A@D^{-1/2} 的对角缩放可融合；cdist+exp+normalize 可融合
 
 ## 论文表述方式
-"利用谱聚类的连续松弛实现可微路由：构造 token 相似度图的归一化拉普拉斯，
-通过 Nyström 近似将 O(N²) 特征分解降为 O(Nm+K³)，配合幂迭代实现 GPU 友好的
-在线谱聚类，聚类质量以 Normalized Cut 衡量保证 O(√(log N/K)) 的近似比。"
+"利用谱聚类的连续松弛实现路由：构造 token 相似度图的归一化拉普拉斯，
+通过 Nyström / 锚点近似和幂迭代避免完整 O(N³) 特征分解，并将主要计算转化为 GEMM、matvec 与 k-means。Normalized Cut 可作为聚类质量指标，但近似比依赖图模型、采样策略和求解器假设，不能无条件宣称。"
 
 ## 风险
 - N×N 相似度矩阵的显存和计算在长序列下不可扩展，必须采样或 k-NN 稀疏化

package/knowledge-base/differential-geometry/connection.en.md

@@ -45,7 +45,22 @@ GPU friendliness: the core challenge of connections is "serial ODE integration."
 
 ## Further References
 
-- Distillation notes: references/books/differential-geometry.md (Ch 12 Connections and Covariant Derivatives, Section 12.2 Connection Forms, Section 12.4 Ehresmann, Section 12.12 G-Connections)
-- Distillation notes: references/books/differential-geometry.md (Section 6.8 Principal Bundles, Section 9.8 Electromagnetism)
+- Distillation notes: ../../references/books/differential-geometry.en.md (Ch 12 Connections and Covariant Derivatives, Section 12.2 Connection Forms, Section 12.4 Ehresmann, Section 12.12 G-Connections)
+- Distillation notes: ../../references/books/differential-geometry.en.md (Section 6.8 Principal Bundles, Section 9.8 Electromagnetism)
 - Original text: Jeffrey M. Lee, *Manifolds and Differential Geometry*, Ch 12 (Section 12.1--Section 12.12, complete connection theory)
 - Original text: Jeffrey M. Lee, *Manifolds and Differential Geometry*, Section 13.1 Levi-Civita Connection
+
+
+## Routing Extensions
+- If curvature definition is needed -> `curvature.en.md` (curvature tensor derived from connection)
+- If parallel transport and geodesics are needed -> `geodesic.en.md` (geodesics are auto-parallel curves of parallel transport)
+- If covariant derivative computation is needed -> `tangent-space.en.md` (covariant differentiation on tangent space)
+
+## Extensible Directions
+- Levi-Civita connection: unique torsion-free metric connection on Riemannian manifolds
+- Christoffel symbols: connection components in coordinate basis
+- Holonomy: effect of parallel transport around closed curves
+- Torsion: antisymmetric part of a connection
+- Affine connection: general affine connection theory
+- Ehresmann connection: horizontal distributions on fiber bundles
+- Gauge connection: gauge fields as connections in physics

package/knowledge-base/differential-geometry/connection.md

@@ -45,7 +45,22 @@ GPU 友好度：联络的核心挑战是"串行 ODE 积分"。
 
 ## 深入参考
 
-- 蒸馏稿：references/books/differential-geometry.md（Ch 12 Connections and Covariant Derivatives, §12.2 联络形式, §12.4 Ehresmann, §12.12 G-联络）
-- 蒸馏稿：references/books/differential-geometry.md（§6.8 Principal Bundles, §9.8 Electromagnetism）
+- 蒸馏稿：../../references/books/differential-geometry.md（Ch 12 Connections and Covariant Derivatives, §12.2 联络形式, §12.4 Ehresmann, §12.12 G-联络）
+- 蒸馏稿：../../references/books/differential-geometry.md（§6.8 Principal Bundles, §9.8 Electromagnetism）
 - 原书：Jeffrey M. Lee, *Manifolds and Differential Geometry*, Ch 12（§12.1-§12.12 完整联络理论）
 - 原书：Jeffrey M. Lee, *Manifolds and Differential Geometry*, §13.1 Levi-Civita Connection
+
+
+## 路由扩展
+- 若需要曲率的定义 → `curvature.md`（曲率张量由联络导出）
+- 若需要平行移动与测地线 → `geodesic.md`（测地线是平行移动的自平行曲线）
+- 若需要协变导数的具体计算 → `tangent-space.md`（切空间上的协变微分）
+
+## 可扩展方向
+- Levi-Civita 联络：黎曼流形的唯一无挠度量联络
+- Christoffel 符号：联络在坐标基下的分量
+- 和乐（holonomy）：平行移动绕闭曲线的效果
+- 挠率（torsion）：联络的非对称部分
+- 仿射联络（affine connection）：一般的仿射联络理论
+- Ehresmann 联络：纤维丛上的水平分布
+- 规范联络（gauge connection）：物理中的规范场作为联络

package/knowledge-base/differential-geometry/curvature.en.md

@@ -45,5 +45,18 @@ GPU friendliness: the core difficulty of curvature is that "the full tensor cann
 
 ## Further References
 
-- Distillation notes: references/books/differential-geometry.md (Ch 12 Section 12.5/Section 12.10 Curvature, Ch 13 Section 13.2 Riemann Curvature, Section 13.7 Jacobi Fields, Section 13.11 Rauch Comparison)
+- Distillation notes: ../../references/books/differential-geometry.en.md (Ch 12 Section 12.5/Section 12.10 Curvature, Ch 13 Section 13.2 Riemann Curvature, Section 13.7 Jacobi Fields, Section 13.11 Rauch Comparison)
 - Original text: Jeffrey M. Lee, *Manifolds and Differential Geometry*, Section 13.2 Riemann Curvature Tensor, Section 13.7 Jacobi Fields
+
+
+## Routing Extensions
+- If local geometric analysis is needed -> `metric-tensor.en.md` (metric determines local curvature)
+- If global topological analysis is needed -> `../topology/persistent-homology.md` (persistent homology captures global topology)
+- If curvature's effect on stability is involved -> `../matrix-analysis/matrix-perturbation.md` (curvature-induced perturbation amplification)
+
+## Extensible Directions
+- Sectional / Ricci / scalar curvature: curvature concepts at different dimensions
+- Gauss-Bonnet theorem: relationship between curvature and topological invariants
+- Comparison theorems (Toponogov, Bishop-Gromov): geometric comparison under curvature constraints
+- Curvature flow: mean curvature flow and Ricci flow
+- Cartan-Hadamard theorem: global structure of non-positively curved manifolds

package/knowledge-base/differential-geometry/curvature.md

@@ -45,5 +45,18 @@ GPU 友好度：曲率的核心难点是"不能物化全张量"。
 
 ## 深入参考
 
-- 蒸馏稿：references/books/differential-geometry.md（Ch 12 §12.5/§12.10 Curvature, Ch 13 §13.2 Riemann Curvature, §13.7 Jacobi Fields, §13.11 Rauch Comparison）
+- 蒸馏稿：../../references/books/differential-geometry.md（Ch 12 §12.5/§12.10 Curvature, Ch 13 §13.2 Riemann Curvature, §13.7 Jacobi Fields, §13.11 Rauch Comparison）
 - 原书：Jeffrey M. Lee, *Manifolds and Differential Geometry*, §13.2 Riemann Curvature Tensor, §13.7 Jacobi Fields
+
+
+## 路由扩展
+- 若需要局部几何分析 → `metric-tensor.md`（度量决定局部曲率）
+- 若需要全局拓扑分析 → `../topology/persistent-homology.md`（持续同调捕捉全局拓扑）
+- 若涉及曲率对稳定性的影响 → `../matrix-analysis/matrix-perturbation.md`（曲率导致的扰动放大）
+
+## 可扩展方向
+- 截面/Ricci/标量曲率（sectional / Ricci / scalar curvature）：不同维度的曲率概念
+- Gauss-Bonnet 定理：曲率与拓扑不变量的关系
+- 比较定理（Toponogov, Bishop-Gromov）：曲率约束下的几何比较
+- 曲率流（curvature flow）：平均曲率流与 Ricci 流
+- Cartan-Hadamard 定理：非正曲率流形的全局结构