math-skill 3.0.0 → 3.1.0

package/lenses/topological.md

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

package/lenses/variational.en.md

@@ -1,4 +1,4 @@
-# ⚖️ Variational Lens
+# Variational Lens
 
 > Pursue the best among the feasible under constraints — convexity determines difficulty, duality reveals structure
 

package/lenses/variational.md

@@ -1,4 +1,4 @@
-# ⚖️ 变分透镜
+# 变分透镜
 
 > 在约束下追求可行中的最优——凸性决定难度，对偶揭示结构
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-skill",
-  "version": "3.0.0",
+  "version": "3.1.0",
   "description": "面向 AI 架构创新的数学研究操作系统 v3：三层正交架构（思想透镜 / 数学知识库 / 设计翻译层），自动诊断用户意图并路由。Math Research OS for AI architecture design: thinking lenses + math knowledge base + design translation layer with auto intent diagnosis.",
   "keywords": [
     "math",
@@ -71,10 +71,10 @@
     "references/"
   ],
   "scripts": {
-    "validate": "bash tests/validate.sh || powershell -ExecutionPolicy Bypass -File tests/validate.ps1",
-    "validate:sh": "bash tests/validate.sh",
-    "validate:win": "powershell -ExecutionPolicy Bypass -File tests/validate.ps1",
+    "validate": "node -e \"const fs=require('fs'),cp=require('child_process');if(fs.existsSync('tests/validate.sh'))process.exit(cp.spawnSync('bash',['tests/validate.sh'],{stdio:'inherit'}).status||0);if(fs.existsSync('tests/validate.ps1'))process.exit(cp.spawnSync('powershell',['-ExecutionPolicy','Bypass','-File','tests/validate.ps1'],{stdio:'inherit'}).status||0);console.log('tests/ not available in published package');\"",
+    "validate:sh": "test -f tests/validate.sh && bash tests/validate.sh || echo 'tests/ not available in published package'",
+    "validate:win": "powershell -ExecutionPolicy Bypass -Command \"if (Test-Path tests/validate.ps1) { & tests/validate.ps1 } else { Write-Host 'tests/ not available in published package' }\"",
     "pack": "npm pack",
     "prepublishOnly": "npm run validate"
   }
-}
+}

package/references/agentic-workflow.en.md

@@ -7,7 +7,7 @@
 
 1. **The mathematical foundation of this AI revolution is the first time 20th-century mathematics has stepped onto the commercial computing stage** — category theory, algebraic topology, algebraic geometry. The mathematical foundations of most mainstream algorithms still largely rest on the calculus and linear algebra of 1800–1900. Activating modern mathematics in algorithm design is the most important task during the algorithm exploration phase.
 2. **Humility**: The breadth of knowledge from the pre-training stage already surpasses any individual. **More knowledge is learned from the model than taught to it.** Letting go of the bias toward "teaching the model" usually yields better results.
-3. **Mathematical beauty ≠ computability**: Many mathematically elegant constructs break down in the face of GPU parallelism and low-precision arithmetic errors. Every deliverable must pass the acceptance gate defined in `gpu-friendly-math.md`.
+3. **Mathematical beauty ≠ computability**: Many mathematically elegant constructs break down in the face of GPU parallelism and low-precision arithmetic errors. Every deliverable must pass the acceptance gate defined in `gpu-friendly-math.en.md`.
 
 ## Division of Labor
 
@@ -28,7 +28,7 @@
 
 1. **Diagnosis**: What is the algorithmic structure / bottleneck of the problem? (Do not start by piling on math tutorials.)
 2. **Cross-domain activation**: Scan `books/*.md` for transferable modern mathematical structures, **enumerate multiple candidates** (leveraging the model's large-context advantage).
-3. **Dual acceptance gate**: Each candidate passes two gates — (1) Mathematically correct (differentiable, self-consistent, with correctness guarantees); (2) GPU-feasible (the eight dimensions of `gpu-friendly-math.md`).
+3. **Dual acceptance gate**: Each candidate passes two gates — (1) Mathematically correct (differentiable, self-consistent, with correctness guarantees); (2) GPU-feasible (the eight dimensions of `gpu-friendly-math.en.md`).
 4. **Iterative tracking**: Record candidates, scores, and status in a markdown test plan, converging step by step.
 
 ## Markdown Test Plan Template / Tracking Template
@@ -38,7 +38,7 @@ Record research tasks in a table that the Agent can continuously update:
 ```markdown
 | Candidate Structure | Math Correctness | GPU 8-Dim | Complexity | Status | Notes / Next Steps |
 |--------------------|-----------------|-----------|------------|--------|-------------------|
-| Tropical gating replacing TopK | ✅ Differentiable relaxation | 1✅2❌3✅… | Sub-quadratic (per-token) | Verifying | Compare with SWA baseline |
+| Tropical gating replacing TopK | [v] Differentiable relaxation | 1[v]2[x]3[v]… | Sub-quadratic (per-token) | Verifying | Compare with SWA baseline |
 | …                  |                 |           |            | Todo   |                   |
 ```
 

package/references/agentic-workflow.md

@@ -40,7 +40,7 @@
 ```markdown
 | 候选结构 | 数学正确性 | GPU 八维 | 复杂度 | 状态 | 备注/下一步 |
 |---------|-----------|---------|-------|------|-----------|
-| 热带门控替代 TopK | ✅ 可微松弛 | 1✅2❌3✅… | 亚二次(逐token) | 验证中 | 对比 SWA 基线 |
+| 热带门控替代 TopK | [v] 可微松弛 | 1[v]2[x]3[v]… | 亚二次(逐token) | 验证中 | 对比 SWA 基线 |
 | …            |           |         |       | 待办 |           |
 ```
 

package/references/books/abstract-algebra.en.md

@@ -0,0 +1,124 @@
+# Abstract Algebra
+
+> **Contemporary Abstract Algebra**, Eighth Edition -- Joseph A. Gallian -- Brooks/Cole, Cengage Learning.
+> This file is an "activation" reference: mapping the book's group/ring/field structures to ML/algorithms/Infra, not reproducing the original text. For full-fidelity lookups see the "Deep-dive Entry" at the end.
+
+## Overview
+
+This book is a standard undergraduate abstract algebra textbook whose main thread is a three-part progression: **groups -> rings -> fields**. Starting from axioms, it emphasizes **symmetry, structure-preserving maps (homomorphisms/isomorphisms), quotient structures, and the classification and counting of finite objects**. The value for AI lies not in the theorems themselves but in the **language of "remaining invariant under some transformation"** that it provides -- this is the algebraic foundation for equivariant networks, permutation-invariant aggregation, coding, and hashing.
+
+One-sentence activation insight: **Symmetry is a free inductive bias**. Rather than forcing the model to learn from data that "a rotated cat is still the same cat," one can build the symmetry group G's action directly into the network architecture, sharing parameters along orbits -- saving parameters while providing generalization guarantees. The main line -- groups (the transformations themselves) -> rings (algebra with two operations, whose relaxation yields generalized matrix multiplication) -> fields (arithmetically closed and exact, yielding coding and hashing) -- exactly covers the three Infra needs of "equivariance / generalized GEMM / fault-tolerant computation."
+
+**Boundaries of this book (to avoid misuse)**: Gallian is an elementary undergraduate textbook; it **covers rings but not semirings** (the tropical semiring requires axiom relaxation on your own); representation theory only reaches the level of finite abelian groups and **does not develop non-abelian representation theory or character theory**; it does not touch category theory, modules, or homological algebra. When these more modern tools are needed, this book serves only as an "activation starting point," and deeper study requires turning to specialized texts on representation theory / algebraic geometry.
+
+Actual chapter map (grouped by topic; chapter numbers taken from the book's table of contents):
+
+- **Group foundations**: 1 Introduction to Groups (dihedral group D_n as the symmetry group exemplar), 2 Groups, 3 Finite Groups; Subgroups, 4 Cyclic Groups.
+- **Symmetry and actions**: 5 Permutation Groups (orbit / stabilizer), 6 Isomorphisms, 7 Cosets and Lagrange's Theorem, 8 External Direct Products.
+- **Quotients and homomorphisms**: 9 Normal Subgroups and Factor Groups, 10 Group Homomorphisms, 11 Fundamental Theorem of Finite Abelian Groups.
+- **Rings**: 12 Introduction to Rings, 13 Integral Domains, 14 Ideals and Factor Rings, 15 Ring Homomorphisms, 16 Polynomial Rings, 17 Factorization of Polynomials, 18 Divisibility in Integral Domains.
+- **Fields and extensions**: 19 Vector Spaces, 20 Extension Fields, 21 Algebraic Extensions, **22 Finite Fields**, 23 Geometric Constructions.
+- **Advanced group theory**: 24 Sylow Theorems, 25 Finite Simple Groups, 26 Generators and Relations.
+- **Applications of symmetry**: 27 Symmetry Groups, 28 Frieze and Crystallographic Groups, **29 Symmetry and Counting** (Burnside counting), 30 Cayley Digraphs of Groups.
+- **Coding and Galois**: **31 Introduction to Algebraic Coding Theory** (Hamming codes, linear codes over finite fields), **32 An Introduction to Galois Theory**, 33 Cyclotomic Extensions.
+
+## Core Structures Transferable to AI/Infra
+
+| Algebraic structure (Ch) | One-line essence | ML/Infra correspondence |
+|---|---|---|
+| **Group action** (5, 29) | G acts on input space; orbit-stabilizer theorem \|orbit\|=\|G\|/\|stab\| | Equivariant layers + **weight sharing**: parameters reused along an orbit |
+| **Homomorphism** (10, 15) | Operation-preserving map phi(ab)=phi(a)phi(b) | **Representation** = homomorphism G->GL(V) (in the book GL(2,F)); learnable linear actions |
+| **Quotient structure** (9, 14) | Quotienting by a normal subgroup/ideal = "forgetting" a symmetry direction | Pooling / coarsening / equivariant downsampling: quotienting by S_n = permutation-invariant aggregation |
+| **Cyclic & finite abelian groups** (4, 11) | Z_n's periodic structure; any finite abelian group ~ product of cyclic groups | DFT/FFT, cyclic convolution, RoPE (representation of SO(2)/cyclic rotations) |
+| **Ring** (12-14) -> axiom relaxation | Drop the additive inverse axiom -> **semiring** (the book only covers rings; semirings require axiom relaxation) | Generalized matrix multiply: replacing (x,+) with (+, min/max) yields **min-plus / tropical semiring** GEMM |
+| **Finite field GF(p^n)** (22, 16, 17) | Finite elements, arithmetically closed and exact | Error-correcting codes, hashing/LSH, CRC, Shamir secret sharing, quantization codebooks |
+| **Linear code** (31) | k-dimensional subspace over finite field F, generator matrix G, Hamming distance/weight | Robust storage/communication, gradient compression, fault-tolerant training, secure aggregation |
+
+### Three Most Valuable Activated Mappings (Expanded)
+
+- **Group action -> Equivariance + weight sharing**: The orbit-stabilizer theorem \|orbit\|=\|G\|/\|stab\| (Ch 5) is precisely the algebraic explanation for "weight sharing" -- inputs on the same orbit share a single set of parameters, and the number of independent parameters is compressed by a factor of \|G\|. The equivariance constraint f(g x)=rho(g) f(x) unifies a family of real models: CNN (translation group), Group Equivariant CNN (D_n rotation/reflection steerable filters), DeepSets / Set Transformer (S_n permutation-invariant), E(3)-equivariant GNN (rigid-body group, molecules/point clouds).
+- **Ring axiom relaxation -> Semiring -> Generalized GEMM**: Chapters 12-14 of this book give the two operations (+,x) and axioms of a ring; **dropping the additive inverse** (i.e., no longer requiring subtraction to be invertible) yields a semiring. Abstracting the general matrix multiply C=A (x) B by replacing (x,+) with an arbitrary semiring ((.),(+)) allows a single codebase to express standard GEMM, Boolean reachability (AND,OR), shortest path/Viterbi/DTW (+, min). This is the unified perspective that puts "dynamic programming" inside matrix multiplication.
+- **Finite fields -> Exactly reproducible arithmetic**: GF(p^n) (Ch 22, constructed from a polynomial ring modulo an irreducible polynomial, see Ch 16-17) has arithmetically closed and **floating-point-error-free** operations, making it naturally suited for scenarios requiring reproducibility, verifiability, and error correction: Reed-Solomon / Hamming error-correcting codes (Ch 31), Shamir secret sharing (polynomial interpolation over GF(p)), consistent hashing and LSH.
+
+## Problem Types Suited for Activation
+
+- Input has **clear symmetry**: translation, rotation, reflection (D_n), permutation (S_n), periodicity (Z_n) -- want equivariance/invariance rather than learning it from data augmentation.
+- Need **hard selection / discrete routing** that remains end-to-end differentiable (Top-K, shortest path, alignment) -- can use semiring relaxation.
+- Need **robust compression / communication / storage**: fault tolerance and compression for KV-Cache, gradients, checkpoints.
+- Need to embed **periodic / cyclic structure** into positional encoding or token mixing.
+- Need to express a **constraint / conservation law** as a learnable linear map that naturally maps to GEMM.
+
+## Possible Algorithmic Inspirations
+
+1. **G-equivariant layer** (source: 5, 6, 10): Implement the symmetry group G's action as permutation/rotation matrices rho(g), with weights shared along orbits, enforcing f(g x)=rho(g) f(x). In practice, for each g in G the input is transformed by rho(g) then passed through the same set of weights, and the results are aggregated -- equivalent to expanding the convolution kernel into a [\|G\|, C_out, C_in] batched GEMM, reducing independent parameters by a factor of \|G\|. Deployed models: CNN (translation), G-CNN (D_n steerable filters), DeepSets/Set Transformer (S_n), E(3)-equivariant GNN (point clouds/molecules).
+2. **Tropical / min-plus attention and routing** (source: 12-14 ring axiom relaxation): Replace softmax's (x,)+exp with (+, min/max) min-plus matmul: score(+) = min_k(Q_ik + K_kj). Hard Top-K routing -> tropical semiring **piecewise-linear gating** (sub-differentiable -- breakpoints need LogSumExp smoothing, which recovers standard softmax; an alternative to the non-differentiable argmax). Viterbi, DTW, and shortest paths are all instances of this min-plus matmul -- see the Tropical Gating example in `../gpu-friendly-math.en.md` (used only for low-dimensional gating and **not on Tensor Cores** -- max/min runs on CUDA cores, while the main trunk still uses standard (x,+) GEMM).
+3. **Permutation-invariant aggregation** (source: 9, 29): Quotienting by the S_n action yields sum/max/mean pooling -- naturally O(n) and parallel-friendly, the algebraic foundation for DeepSets rho(Sigma phi(x_i)) and GNN message passing. Burnside counting (Ch 29) can estimate "how many essentially distinct configurations exist" at design time, for predicting parameter savings and data deduplication benefits.
+4. **Finite-field coding for Infra** (source: 22, 31): Linear codes c=mG (generator matrix G over GF(q)) for fault-tolerant storage and gradient compression, with Hamming distance providing a lower bound on error-correcting capability; Shamir secret sharing (polynomial interpolation over GF(p), recoverable from t shards) for secure aggregation in federated learning; finite-field hashing/CRC for deduplication and consistency verification. Commonality: pure int/bitwise operations, placed in pre/post-processing on data flows.
+5. **Cyclic group representations -> Frequency-domain token mixing** (source: 4, 11): The irreducible representations of Z_n are the DFT basis, giving rise to FFT convolution (O(n log n) replacing O(n^2)), RoPE (encoding positions as SO(2) rotations, i.e., unitary representations of Z), and cyclic/relative positional encodings. The finite abelian group classification theorem (Ch 11) guarantees that any such periodic structure can be decomposed into cyclic components for FFT.
+6. **Fourier / spectral methods on groups** (source: 10 homomorphism + 4/11): Extending the irreducible decomposition of representation theory to general finite groups yields the group convolution theorem -- spectral GNNs and spherical CNNs (harmonic analysis on SO(3)) are special cases; the cost is that fast transforms for non-abelian groups may not exist and complexity must be assessed.
+
+## GPU Friendliness Warning
+
+> The sole source for eight-dimension criteria and scoring rules: `../gpu-friendly-math.en.md` (Tensorization / GEMM-mappability / Complexity / Memory / Low-precision / Parallelism / Sparsity / Operator fusion). Here we give only per-dimension verdicts for the book's structures.
+
+**Focus A: Can semiring GEMM run on Tensor Cores? -- Not by default.**
+
+- **D2 GEMM-mappability ([x] unfriendly)**: Tensor Core hardware only performs (x,+) MAC (fp16/bf16/fp8 accumulated into fp32). Min-plus / max-plus uses (+, min/max), which is **not natively supported**; naive tropical GEMM degenerates to CUDA core scalar comparisons and cannot leverage Tensor Cores.
+- **D3 Complexity ([x])**: Min-plus matrix multiplication has no Strassen-style sub-cubic speedup (equivalent to the APSP hard problem); naive O(n^3).
+- **D5 Low-precision ([v])**: Tropical uses max/min, no exp overflow risk; numerically robust.
+- **D8 Differentiability / Operator fusion ([~] adaptable)**: min/max is non-differentiable; requires relaxation.
+- **Adaptations (-> eight-dimension friendly)**: (1) log-sum-exp smoothing of min/max recovers (x,+) stable softmax, back on Tensor Cores; (2) confine tropical operations **to low-dimensional gating only**, keeping the main trunk on standard (x,+) GEMM (the Tropical Gating example in the reference file = D1 [v] Tensorization / D2 [x] not Tensor Core GEMM / D3 [v] per-token gating sub-quadratic, D8 needs LogSumExp smoothing); (3) blocking -- standard GEMM within blocks, min-plus reduction between blocks.
+
+**Focus B: Can group operations be tensorized? -- Small groups yes, large groups and exact arithmetic no.**
+
+- **Finite group actions (D1/D2 [v])**: Permutation matrices / dense representation matrices -> batched GEMM; G-CNN has been engineered. Orthogonal rotation/permutation matrices are numerically stable under bf16 (D5 [v]).
+- **Large group enumeration (D3/D4 [x])**: \|S_n\|=n! explodes; explicitly enumerating group elements -> memory and compute blow up. **Adaptation**: Use only generators (Ch 26 Generators and Relations) + Cayley graphs (Ch 30) for local propagation, without materializing the entire group.
+- **Permutation = gather/scatter (D7/D1/D8 [x])**: Implementation as irregular gather/scatter causes warp divergence. **Adaptation**: Pre-compile fixed permutation patterns into structured sparsity or dense indexing.
+- **Finite fields / modular arithmetic (D2 [x], D1/D6 [v])**: mod p, GF(2^n), XOR, table lookups **are not floating-point MAC** and cannot use Tensor Cores, but are highly parallel on int/bitwise kernels. Conclusion: **suitable for pre/post-processing in coding/hashing, never to be placed in the training main-trunk GEMM**. Galois / exact-field arithmetic requires int, is non-differentiable, violating D8.
+
+**Scoring conclusion**: Group equivariance (small groups, dense representations) and frequency-domain structures = mathematical beauty x GPU friendliness, can enter the main trunk; semirings, finite fields, exact Galois = require relaxation/isolation first, otherwise can only serve as auxiliary operators or offline tools.
+
+**Worked example comparison (candidate x eight-dimension verdict):**
+
+| Candidate design | Algebraic source (Ch) | Key dimension verdicts | Enter main trunk? |
+|---|---|---|---|
+| Equivariant layer (small groups D_n/S_n, permutation+rotation matrices) | 5, 6, 10 | 1[v] 2[v] 5[v], large groups 3/4[x] | [v] (limited to small groups/generators) |
+| Tropical gating (low-dim min-plus replacing hard Top-K) | 12-14 relaxation | 1[v] 2[v] 8 needs relaxation, main trunk still (x,+) | [v] (gating only) |
+| Pure min-plus main-trunk attention | 12-14 relaxation | 2[x] Tensor Core unsupported, 3[x] O(n^3) | [x] (needs log-sum-exp smoothing first) |
+| Finite-field coding for KV/gradient compression | 22, 31 | 2[x] not floating-point MAC, 1/6[v] int parallel | [x] main trunk / [v] pre/post-processing |
+| Cyclic group representations (FFT/RoPE token mixing) | 4, 11 | 1[v] 2[v] 3[v] (n log n) | [v] |
+
+## Which Thinking Lens to Invoke
+
+- **Primary: `symmetry` (symmetry and invariance)** -- group actions, equivariance/invariance, orbit-stabilizer are the largest interface between this book and ML.
+- **Secondary: `categorical`** -- extract the common structure of groups/rings/fields, see through "different modules are actually the same algebraic object."
+- **Secondary: `axiomatization`** -- relax ring axioms to get semirings, check one by one whether assumed algebraic properties truly hold (guard against false symmetry).
+- **Secondary: `duality`** -- homomorphisms/isomorphisms as equivalence transformations, FFT/frequency-domain transforms to simplify problems.
+- **Secondary: `algorithmic`** -- finite group counting (Burnside, Ch 29), coding (Ch 31), finite field enumeration (Ch 22).
+
+Typical combination chain: First `symmetry` to identify the group and invariants in the problem -> `categorical` to extract the common algebraic structure -> `axiomatization` to verify axioms truly hold (guard against false symmetry, guard against misusing subtraction) -> `duality` to realize as a learnable linear map -> finally pass through the `../gpu-friendly-math.en.md` eight-dimension acceptance gate.
+
+## Anti-patterns
+
+- **Forcing "group elegance" into the main trunk without Tensor Core support**: tropical / finite-field arithmetic used as GEMM, actually runs as CUDA core scalar throughout.
+- **Enumerating the entire group** instead of using generators (\|S_n\|=n! / \|GL\| blows memory).
+- **Insisting on exact Galois / finite-field structures**: leads to non-differentiability, requires int, blocks end-to-end gradients.
+- **Over-constraining with symmetry**: writing "approximately symmetric / pseudo-symmetric" patterns as hard equivariance, stifling expressiveness and model exploration (echoing the agentic-workflow principle of "don't hardcode subjective biases").
+- **Confusing rings with semirings**: assuming additive inverses exist for subtraction/inversion, which fails under min-plus -> correctness errors.
+- **Building a pile of modules for "group elegance"**: when existing equivariant libraries/FFT suffice, don't create new skills; first exhaust existing model capabilities, then add structure (echoing the agentic-workflow principle of "don't create a bunch of skills right away").
+- **Treating homomorphisms as isomorphisms**: Homomorphisms can lose information (have a kernel); mistakenly treating them as invertible bijections leads to reconstruction/decoding errors.
+
+## Deep-dive Entry
+
+> **Bibliographic information**: Joseph A. Gallian, *Contemporary Abstract Algebra*, 8th Edition, Brooks/Cole, Cengage Learning, 2013. ISBN 978-1-133-59971-5.
+>
+> **Activation method**: Place `Contemporary Abstract Algebra.pdf` in the `math_book/` folder at the project root; the Agent can then automatically search the original text. The PDF is not distributed via npm/git (copyright reasons) and must be obtained separately.
+
+> **Full-fidelity lookup = Agent automatically searches the local PDF**: `math_book/Contemporary Abstract Algebra.pdf`. When precise definitions/theorems/examples are needed, have the Agent do targeted skimming by the following actual chapter numbers; do not paraphrase from memory. If the deployment environment lacks `math_book/`, stop at this distillation level.
+
+- **Ch 5 Permutation Groups** -- Orbit / stabilizer: the root of equivariant weight sharing.
+- **Ch 22 Finite Fields** -- GF(p^n) construction and arithmetic: the foundation for coding/hashing/secure aggregation.
+- **Ch 29 Symmetry and Counting** -- Burnside counting: estimating equivalence class count / parameter savings.
+- **Ch 31 Introduction to Algebraic Coding Theory** -- Hamming codes, linear codes over finite fields (generator matrix, Hamming distance/weight): compression and fault tolerance.
+- **Ch 32 An Introduction to Galois Theory** -- The symmetry group of field extensions: an exemplar of structured transformations (deployment requires passing the GPU gate first).
+- (Semiring relaxation starting point: Ch 12-14 ring axioms -> drop additive inverse -> tropical semiring.)

package/references/books/abstract-algebra.md

@@ -1,4 +1,4 @@
-# 🔢 抽象代数 / Abstract Algebra
+# 抽象代数 / Abstract Algebra
 
 > **Contemporary Abstract Algebra**, Eighth Edition · Joseph A. Gallian · Brooks/Cole, Cengage Learning.
 > 本文件是「激活」参考：把书里的群/环/域结构映射到 ML/算法/Infra，不复述原文。全保真回查见文末「深挖入口」。
@@ -63,18 +63,18 @@
 
 **焦点 A：半环 GEMM 能上 Tensor Core 吗？——默认不能。**
 
-- **维度 2 GEMM 可映射（❌不友好）**：Tensor Core 硬件只做 (×,+) 的 MAC（fp16/bf16/fp8 累加到 fp32）。min-plus / max-plus 用的是 (+, min/max)，**非原生**，朴素 tropical GEMM 退化到 CUDA core 标量比较，吃不到 Tensor Core。
-- **维度 3 复杂度（❌）**：min-plus 矩阵乘没有 Strassen 式亚立方加速（等价于 APSP 难题），朴素 O(n³)。
-- **维度 5 低精度（✅）**：tropical 用 max/min，无 exp 上溢，反而数值稳健。
-- **维度 8 可微/融合（⚠️可改造）**：min/max 不可微，需松弛。
-- **改造（→ 八维转友好）**：① log-sum-exp 软化 min/max 退回 (×,+) 稳定 softmax，重上 Tensor Core；② 把热带运算**只放在低维门控**，主干仍走标准 (×,+) GEMM（范例文件中 Tropical Gating = dim 1✅张量化 / 2❌非 Tensor Core GEMM / 3✅逐 token 门控亚二次，dim 8 需 LogSumExp 软化）；③ 分块——块内标准 GEMM、块间 min-plus 归约。
+- **D2 GEMM 可映射（[x]不友好）**：Tensor Core 硬件只做 (×,+) 的 MAC（fp16/bf16/fp8 累加到 fp32）。min-plus / max-plus 用的是 (+, min/max)，**非原生**，朴素 tropical GEMM 退化到 CUDA core 标量比较，吃不到 Tensor Core。
+- **D3 复杂度（[x]）**：min-plus 矩阵乘没有 Strassen 式亚立方加速（等价于 APSP 难题），朴素 O(n³)。
+- **D5 低精度（[v]）**：tropical 用 max/min，无 exp 上溢，反而数值稳健。
+- **D8 可微/融合（[~]可改造）**：min/max 不可微，需松弛。
+- **改造（→ 八维转友好）**：① log-sum-exp 软化 min/max 退回 (×,+) 稳定 softmax，重上 Tensor Core；② 把热带运算**只放在低维门控**，主干仍走标准 (×,+) GEMM（范例文件中 Tropical Gating = D1[v] / D2[x] 非 Tensor Core GEMM / D3[v] 逐 token 门控亚二次，D8 需 LogSumExp 软化）；③ 分块——块内标准 GEMM、块间 min-plus 归约。
 
 **焦点 B：群操作能张量化吗？——小群能，大群和精确算术不能。**
 
-- **有限群作用（维度 1/2 ✅）**：置换矩阵 / 稠密表示矩阵 → batched GEMM，G-CNN 已工程化。正交的旋转/置换矩阵在 bf16 下数值稳定（维度 5 ✅）。
-- **大群枚举（维度 3/4 ❌）**：\|Sₙ\|=n! 爆炸，显式枚举群元素 → 显存与算力爆。**改造**：只用生成元（26 Generators and Relations）+ Cayley 图（30）做局部传播，不物化整群。
-- **置换 = gather/scatter（维度 7/1/8 ❌）**：实现为不规则 gather/scatter 会 warp divergence。**改造**：固定置换模式预编译为结构化稀疏或 dense 索引。
-- **有限域 / 模算术（维度 2 ❌、维度 1/6 ✅）**：mod p、GF(2ⁿ)、XOR、查表**不是浮点 MAC**，吃不到 Tensor Core，但在 int/bitwise kernel 上高并行。结论：**适合放编码/哈希的前后处理，绝不放进训练主干 GEMM**。Galois/精确域算术要求 int、不可微，违反维度 8。
+- **有限群作用（D1/D2 [v]）**：置换矩阵 / 稠密表示矩阵 → batched GEMM，G-CNN 已工程化。正交的旋转/置换矩阵在 bf16 下数值稳定（D5 [v]）。
+- **大群枚举（D3/D4 [x]）**：\|Sₙ\|=n! 爆炸，显式枚举群元素 → 显存与算力爆。**改造**：只用生成元（26 Generators and Relations）+ Cayley 图（30）做局部传播，不物化整群。
+- **置换 = gather/scatter（D7/D1/D8 [x]）**：实现为不规则 gather/scatter 会 warp divergence。**改造**：固定置换模式预编译为结构化稀疏或 dense 索引。
+- **有限域 / 模算术（D2 [x]、D1/D6 [v]）**：mod p、GF(2ⁿ)、XOR、查表**不是浮点 MAC**，吃不到 Tensor Core，但在 int/bitwise kernel 上高并行。结论：**适合放编码/哈希的前后处理，绝不放进训练主干 GEMM**。Galois/精确域算术要求 int、不可微，违反 D8。
 
 **判分结论**：群等变（小群、稠密表示）与频域结构 = 数学美 × GPU 友好，可进主干；半环、有限域、精确 Galois = 需先松弛/隔离，否则只能当辅助算子或离线工具。
 
@@ -82,11 +82,11 @@
 
 | 候选设计 | 代数来源（章） | 关键维度裁决 | 进主干？ |
 |---|---|---|---|
-| 群等变层（小群 Dₙ/Sₙ，置换+旋转矩阵）| 5, 6, 10 | 1✅ 2✅ 5✅，群大时 3/4❌ | ✅（限小群/生成元）|
-| 热带门控（低维 min-plus 取代硬 Top-K）| 12–14 松弛 | 1✅ 2✅ 8 需松弛，主干仍 (×,+) | ✅（仅门控）|
-| 纯 min-plus 主干注意力 | 12–14 松弛 | 2❌ Tensor Core 不支持、3❌ O(n³) | ❌（先 log-sum-exp 软化）|
-| 有限域编码压缩 KV/梯度 | 22, 31 | 2❌ 非浮点 MAC，1/6✅ int 并行 | ❌主干 / ✅前后处理 |
-| 循环群表示（FFT/RoPE token mixing）| 4, 11 | 1✅ 2✅ 3✅（n log n）| ✅ |
+| 群等变层（小群 Dₙ/Sₙ，置换+旋转矩阵）| 5, 6, 10 | 1[v] 2[v] 5[v]，群大时 3/4[x] | [v]（限小群/生成元）|
+| 热带门控（低维 min-plus 取代硬 Top-K）| 12–14 松弛 | 1[v] 2[v] 8 需松弛，主干仍 (×,+) | [v]（仅门控）|
+| 纯 min-plus 主干注意力 | 12–14 松弛 | 2[x] Tensor Core 不支持、3[x] O(n³) | [x]（先 log-sum-exp 软化）|
+| 有限域编码压缩 KV/梯度 | 22, 31 | 2[x] 非浮点 MAC，1/6[v] int 并行 | [x]主干 / [v]前后处理 |
+| 循环群表示（FFT/RoPE token mixing）| 4, 11 | 1[v] 2[v] 3[v]（n log n）| [v] |
 
 ## 该调用哪个思想透镜
 
@@ -94,7 +94,7 @@
 - **副：`categorical`**——提取群/环/域的公共结构，看穿"不同模块其实是同一代数对象"。
 - **副：`axiomatization`**——放松环公理得半环、逐条核对所设代数性质是否真成立（防伪对称）。
 - **副：`duality`**——同态/同构作等价转换、FFT/频域变换简化问题。
-- **副：`discrete-combinatorial`**——有限群计数（Burnside, 29）、编码（31）、有限域枚举（22）。
+- **副：`algorithmic`**——有限群计数（Burnside, 29）、编码（31）、有限域枚举（22）。
 
 典型组合链：先 `symmetry` 识别问题里的群与不变量 → `categorical` 抽出公共代数结构 → `axiomatization` 核对公理是否真成立（防伪对称、防误用减法）→ `duality` 落成可学习线性映射 → 最后过 `../gpu-friendly-math.md` 八维门。
 
@@ -110,7 +110,7 @@
 
 ## 深挖入口
 
-> **📖 书目信息**：Joseph A. Gallian, *Contemporary Abstract Algebra*, 8th Edition, Brooks/Cole, Cengage Learning, 2013. ISBN 978-1-133-59971-5.
+> **书目信息**：Joseph A. Gallian, *Contemporary Abstract Algebra*, 8th Edition, Brooks/Cole, Cengage Learning, 2013. ISBN 978-1-133-59971-5.
 >
 > **启用方式**：将 `Contemporary Abstract Algebra.pdf` 放入项目根目录的 `math_book/` 文件夹，Agent 即可自动搜索原文。PDF 不随 npm/git 分发（版权原因），需自行获取。
 

package/references/books/algebraic-geometry-rising-sea.en.md

@@ -0,0 +1,171 @@
+# Algebraic Geometry (The Rising Sea)
+
+> *The Rising Sea: Foundations of Algebraic Geometry*, Ravi Vakil, Princeton University Press, 2025 edition (ISBN 978-0-691-26866-8).
+> The title is taken from Grothendieck's "rising tide" (la mer monte) metaphor: rather than attacking nut-like problems head-on, let the waters of abstraction (categories, sheaves, cohomology) slowly rise, silently submerging and dissolving the problems.
+> This file distills this "rising-tide abstraction" into activatable algorithmic structures for AI/GPU -- taking only the most transferable skeleton, not restating the original proofs.
+
+## Overview
+
+This book builds modern Grothendieck-school algebraic geometry from scratch across roughly 30 chapters: the core is to **translate geometric objects into commutative algebra**, then use **sheaves + cohomology** to measure "whether local data can be glued into global data."
+
+For AI, what is truly transferable is not elliptic curves or divisors, but three pieces of abstract machinery:
+
+- **Sheaves = local data + consistent gluing** -- the ontology of geometry-aware aggregation on graphs.
+- **Cohomology = obstruction measure for global consistency** -- an algebraic criterion for hallucination/inconsistency.
+- **Categories = unified interface for different constructions** -- gathering heterogeneous operators into a single set of adjoint relationships.
+
+In one sentence: **sheaves govern "how to assemble local into global," cohomology governs "what goes wrong when assembly fails," and categories govern "saying all of this in one unified language."**
+
+### Actual Chapter Map
+
+By the book's chapter numbers (`*`/`**` denote advanced sections):
+
+- **Part I Preliminaries**
+  - **Sec. 1 Just Enough Category Theory to Be Dangerous**: Sec. 1.1 categories and functors, Sec. 1.2 universal properties, Sec. 1.3 limits and colimits, Sec. 1.4 adjoints, Sec. 1.5 abelian categories, Sec. 1.6* spectral sequences.
+  - **Sec. 2 Sheaves**: Sec. 2.1 motivation (sheaf of smooth functions), Sec. 2.2 sheaf and presheaf definitions, Sec. 2.3 morphisms, Sec. 2.4 stalks & sheafification, Sec. 2.5 sheaf on a base, Sec. 2.6 OX-modules form an abelian category, Sec. 2.7 inverse image sheaf.
+- **Part II Schemes**: Sec. 3 sets and topological spaces of affine schemes (Zariski topology, generic point), Sec. 4 structure sheaf and scheme definition, Sec. 5 properties of schemes, Sec. 6 quasicoherent sheaves.
+- **Part III Morphisms of Schemes**: Sec. 7 morphisms of schemes (Sec. 7.7 Grassmannian first construction), Sec. 8 various finiteness morphisms (Sec. 8.4 Chevalley's theorem and elimination theory), Sec. 9 closed embeddings, Sec. 10 fiber products and base change (Sec. 10.6 Segre embedding), Sec. 11 separated and proper morphisms, varieties.
+- **Part IV "Geometric" Properties of Schemes**: Sec. 12 dimension, Sec. 13 regularity and smoothness (Sec. 13.1 Zariski tangent space).
+- **Part V Quasicoherent Sheaves on Schemes and Applications**: Sec. 14 vector bundles "=" locally free sheaves, Sec. 15 line bundles, maps to projective space, and divisors (Sec. 15.4 line bundles and Weil divisors), Sec. 16 line bundle properties (Sec. 16.2 ample/very ample, Sec. 16.4 Grassmannian as moduli space), Sec. 17 projective morphisms and relative Spec/Proj.
+  - **Sec. 18 Cech Cohomology of Quasicoherent Sheaves**: Sec. 18.1 desired properties, Sec. 18.2 definition and proofs, Sec. 18.3 cohomology of line bundles on projective space, Sec. 18.4 Riemann-Roch and arithmetic genus, Sec. 18.5 Serre duality first glimpse.
+  - Sec. 19 applications: curves, Sec. 20* intersection theory glimpse, Sec. 21 differentials, Sec. 22 Riemann-Hurwitz formula.
+- **Part VI More Cohomological Tools**: **Sec. 23 Derived functors (Sec. 23.5 Cech cohomology agrees with derived-functor cohomology)**, Sec. 24 flatness, Sec. 25 cohomology and base change.
+
+> Note: **Tropical geometry** is the "skeletonization" of algebraic geometry over the tropical/min-plus semiring, the tropicalization of the projective varieties in Sec. 15-17; the book does not have a dedicated chapter for it. The "tropical gating" below draws on this as a mathematical source, and references are **not tied to specific chapter numbers** (to avoid fabrication).
+
+## Core Structures Transferable to AI/Infra
+
+First the overview mapping, then detailed expansion:
+
+| Mathematical concept (book section) | AI/ML correspondence | Engineering implementation |
+|---|---|---|
+| Sheaf (Sec. 2) | Geometry-aware information aggregation on graphs | Node = section, edge = transformation in message passing |
+| Restriction map (Sec. 2.3, 14) | Directional feature transformation on edges | One low-rank linear map per edge = small GEMM |
+| Sheaf Laplacian (Sec. 2, 14) | Geometric attention/diffusion operator | Propagation on L = delta^T delta |
+| Cohomology H^0/H^1 (Sec. 18, 23) | Global consistency / hallucination criterion | Cech H^1 regularizer |
+| Category + adjoint (Sec. 1.3-1.4) | Unified operator interface | pullback = alignment, pushforward = aggregation |
+| Grassmannian + Plucker (Sec. 7.7, 16.4) | Subspace compression encoding | Plucker coordinate block summaries to compress KV-Cache |
+| Flatness (Sec. 24) | Smooth distribution transition criterion | Fiber without jumps -> no rank collapse signal |
+
+**1. Sheaf -> geometry-aware information aggregation on graphs** (Sec. 2)
+
+- **Ontology**: a sheaf systematically assigns "to each open set/node a data space (stalk/section) + restriction maps along inclusion relations + a gluing axiom (local consistency implies global gluing)."
+- **Mapping**: node features = sections, edges = restriction maps, message passing = enforcing consistency of adjacent sections under restrictions.
+- **Implementation**: this is precisely the ontology of **cellular sheaf diffusion / sheaf neural networks**; standard GNNs are the "trivial sheaf" special case -- the sheaf structure injects directional geometric inductive bias into every edge.
+
+**2. Restriction map -> one low-rank linear transformation per edge** (Sec. 2.3, 14)
+
+- **Ontology**: each edge carries a learned linear map F(U) -> F(V).
+- **Operator**: this defines the **sheaf Laplacian** L = delta^T delta (where delta is the coboundary operator); diffusion/attention is propagation on L; when all restriction maps are identity, this reduces to the standard graph Laplacian.
+- **Implementation**: each edge map is low-rank -> a sequence of **small GEMMs**, naturally landing on Tensor Cores; the rank is a tunable expressivity knob.
+
+**3. Cohomology -> global consistency / hallucination criterion** (Sec. 18, 23)
+
+- **H^0** = global sections: all locally consistent data that can truly be glued into a global solution.
+- **H^1** = **gluing obstruction**: pairwise locally consistent yet unable to assemble globally -- i.e., "self-consistent contradictions." Formally H^1 = ker delta^1 / im delta^0.
+- **Criterion**: gives hallucination an **algebraic criterion** -- H^1 != 0 <=> the model is locally confident but globally conflicting.
+- **Computability boundary**: **Cech cohomology (Sec. 18.2)** is computed directly from the overlaps of a cover, locally and cheaply; Sec. 23.5 proves that under good conditions it agrees with the expensive derived-functor cohomology -- this boundary line determines "which cohomology can run on a GPU."
+
+**4. Category + universal properties + adjoints -> unified abstract interface** (Sec. 1)
+
+- **Ontology**: pullback / pushforward (f^*, f_*) are an adjoint pair (Sec. 1.4); products, coproducts, fiber products are unified as (co)limits (Sec. 1.3).
+- **Implementation**: using one abstract interface to unify different operators -- **pullback = feature alignment/resampling, pushforward = aggregation/pooling** -- with the adjoint relationship automatically guaranteeing compatibility, reducing hyperparameters and alignment bugs.
+
+**5. Proj / projective + Plucker coordinates -> subspace compression encoding** (Sec. 7.7, 16.4, 15)
+
+- **Ontology**: the Grassmannian parameterizes "k-dimensional subspaces," embedded into projective space via the **Plucker embedding (explicitly appearing in this book)** using exterior product coordinates (Plucker coordinates).
+- **Implementation**: the subspace spanned by a set of KV vectors can be summarized by a small number of Plucker/exterior-product coordinates as **block summaries**, thereby compressing the KV-Cache -- storing "the subspace" rather than individual vectors.
+
+**6. Flatness -> geometric criterion for smooth distribution transitions** (Sec. 24)
+
+- **Ontology**: fibers of a flat morphism vary continuously without jumps over the base.
+- **Implementation**: can serve as a geometric correctness signal for "smooth distribution transfer, no rank collapse" during training/fine-tuning (somewhat theoretical; implementation requires careful validation).
+
+## Problem Types Suited for Activation
+
+- **Attention and message passing on graph/set structures**: nodes carry heterogeneous feature spaces, edges carry directional transformations -> sheaf diffusion is more expressive than plain GNNs.
+- **Multi-source/multi-view consistency**: multimodal, multi-agent, retrieval-augmented (RAG) local evidence to be glued into global answers -> H^0/H^1 measures consistency.
+- **Hallucination / self-consistency detection and regularization**: need a differentiable penalty for "locally self-consistent but globally contradictory" -> Cech H^1 regularizer.
+- **Memory compression for long-context inference**: KV subspace redundancy is high -> Plucker-style block summaries.
+- **Sparse routing / gating (MoE, Top-K)**: need differentiable approximation of discrete choices -> tropical semiring piecewise-linear gating.
+- **Need a framework unifying heterogeneous operators**: using the pullback/pushforward adjoint pair to unify alignment and aggregation.
+
+## Possible Algorithmic Inspirations
+
+**Tropical Sheaf Attention Trilogy** (consistent with the candidate validation examples in `../gpu-friendly-math.en.md`):
+
+1. **Tropical Gating**
+   - Replace hard Top-K routing with **piecewise-linear** scoring on the max-plus semiring.
+   - Sub-differentiable (kink points need LogSumExp softening; after softening it reverts to standard softmax), tensorizable but **not Tensor Core GEMM** (max/min falls on CUDA cores) -- replacing non-differentiable discrete choices.
+2. **Cellular Sheaf Diffusion**
+   - Attention = diffusion on a learnable sheaf Laplacian.
+   - One **low-rank restriction map per edge (= small GEMM)**, injecting edge-direction geometric inductive bias into attention.
+3. **Cech Cohomology Regularizer**
+   - Compute first-order Cech H^1 on a **fixed finite cover** of attention maps.
+   - Serves as a hallucination/inconsistency penalty term; local and cheap. Differentiability requires a proxy (e.g., H^1-component projection norm ||(I - P_{im delta^0}) c||^2, differentiable via SVD/pseudoinverse, non-smooth at rank jumps), not exact Betti numbers.
+
+**Other point inspirations:**
+
+- **Low-rank basis KV compression (Grassmannian/Plucker perspective)**: represent each block's KV subspace by its **low-rank basis** (low-rank decomposition, kn or k(n-k) parameters) to compress memory. Note: Plucker coordinates themselves, at low rank, number C(n,k) and actually **expand** rather than compress, so the true compression comes from the low-rank basis rather than Plucker coordinates -- "Plucker" is a borrowed name. Compression ratio depends on the block's original redundancy and must be measured empirically.
+- **Tropical-semiring MoE routing**: routing logits are piecewise-linear on max-plus, yielding **structured sparse** and differentiable expert selection.
+- **Adjoint Pull/Push operator pair**: implementing up/downsampling and alignment/aggregation as an adjoint pair, enforcing compatibility and reducing hyperparameters.
+
+## GPU Friendliness Warning
+
+> **Required reading and sole authority**: `../gpu-friendly-math.en.md`
+> Eight-dimension scorecard: D1 Tensorization, D2 GEMM-mappability, D3 Complexity, D4 Memory/KV, D5 Low-precision stability, D6 Parallelism & communication, D7 Sparse structure, D8 Operator fusion.
+> **Mathematical beauty != computable**; any dimension that is "unfriendly and not reformable" means elimination.
+
+**Can land as GEMM / sub-quadratic (friendly [v]):**
+
+| Construction | Dimensions hit | Notes |
+|---|---|---|
+| Low-rank restriction maps | D1, D2, D4 | Batched small GEMM, saturates Tensor Cores, low-rank saves memory |
+| Tropical gating | D1, D3 (not D2) | Tensorizable, per-token gating is sub-quadratic; **not GEMM** (does not land on Tensor Cores); sub-differentiable, max kink points need LogSumExp softening |
+| Cech H^1 regularizer (fixed cover) | D3, D8 | Locally cheap, fusible with attention kernel (FlashAttention-style) |
+| Low-rank basis block summaries (Plucker perspective) | D4 | Low-rank decomposition compresses KV, large inference memory reduction (compression ratio needs empirical measurement) |
+
+**Beautiful but not computable (unfriendly [x], prohibited from training forward pass):**
+
+- **Derived functor cohomology for general sheaf cohomology (Sec. 23)**
+  - Requires injective resolutions + spectral sequences, belonging to **symbolic algebra**.
+  - No tensorization, no GEMM, not sub-quadratic, not differentiable -> violates D1, D2, D3, D5, D8.
+  - Can only be done offline, small-scale, for analysis; **use only the Cech version that agrees with it (Sec. 23.5) and restrict to fixed covers**.
+- **Topological layers of Spec/Proj (Zariski topology, generic point, Sec. 3-4)**: discrete non-numerical structures, not differentiable -> violates D1. Serve only as conceptual scaffolding.
+- **Ideal elimination / Groebner bases (Chevalley's theorem and elimination theory, Sec. 8.4)**: combinatorial explosion, serial, unstructured -> violates D3, D6, D7.
+- **Dynamic / unstructured Cech covers**: if the cover changes with input or overlaps are irregular, H^1 computation degenerates into random gather/scatter -> violates D7. **Must use fixed finite covers + structured (block/banded) overlaps.**
+
+## Which Design Lens to Invoke
+
+- **topological (primary)**: cohomology, H^1 obstructions, invariants under continuous deformation -- precisely the motivating theme of sheaf/cohomology activation.
+- **categorical**: extracting the essence of message passing via "sheaf = local data + gluing," abstracting engineering operators as restriction maps.
+- **duality**: tropicalization, Plucker embedding, pullback/pushforward -- using equivalence transformations to move hard-to-compute problems into computable coordinate systems.
+- **symmetry**: projective invariance, gauge symmetry, sheaf covariance, constraining the model's equivariant structure.
+- **axiomatization**: treating the sheaf axioms (locality + gluing) and the cohomology long exact sequence as correctness constraints, auditing "whether the required consistency is violated."
+
+## Anti-patterns
+
+- **Putting abstract/derived-functor cohomology directly into the training forward pass**: symbolic computation, gradient-free, not computable -- the classic "beautiful but not computable," violating the GPU eight dimensions. Use Cech + fixed covers with differentiable proxies.
+- **Introducing the full Scheme/Proj machinery to "look advanced"** when the task only needs a graph Laplacian: over-engineering, violating "Simplicity First." Ask first: "does a trivial sheaf (= standard GNN) suffice?"
+- **Treating Zariski topology / generic points and other discrete structures as differentiable objects** to optimize: type error.
+- **Making Cech covers dynamic with unstructured overlaps**: degenerates into random memory access, destroying GPU parallelism (D7).
+- **Using the max-plus semiring as an exact semiring** without relaxing at non-differentiable points: gradient breaks, training stalls.
+- **Blindly trusting H^1=0 to mean "no hallucination"**: it only guarantees local gluing consistency under the chosen cover, not factual correctness; it is a structural consistency signal, not a truth criterion.
+
+## Deep Dive Entry
+
+> **Bibliographic info**: Ravi Vakil, *The Rising Sea: Foundations of Algebraic Geometry*, Princeton University Press, 2025. ISBN 978-0-691-26866-8.
+>
+> **Activation method**: Place `The Rising Sea Foundations of Algebraic Geometry.pdf` in the `math_book/` folder at the project root; the Agent can then automatically search the original text. The PDF is not distributed via npm/git (copyright reasons); obtain it independently.
+
+**Full-fidelity lookup**: when the summary is insufficient to support design, have the Agent automatically retrieve the local PDF
+`math_book/The Rising Sea Foundations of Algebraic Geometry.pdf`
+(using `pdftotext -f <start> -l <end>` for targeted pages, **do not dump the entire book**).
+
+Actual chapter numbers worth deep reading:
+
+1. **Sec. 2 Sheaves** (focus on Sec. 2.2 definitions, Sec. 2.4 stalks and sheafification, Sec. 2.5 sheaf on a base, Sec. 2.7 inverse image sheaf) -- the mathematical foundation for cellular sheaf diffusion and restriction maps.
+2. **Sec. 18 Cech Cohomology of Quasicoherent Sheaves** (Sec. 18.1 desired properties, Sec. 18.2 definition and proofs, Sec. 18.4 Riemann-Roch, Sec. 18.5 Serre duality first glimpse) -- the source and computability boundary for H^1 hallucination regularization.
+3. **Sec. 23 Derived Functors** (Sec. 23.5 Cech cohomology agrees with derived-functor cohomology) -- drawing the red line between "computable Cech vs. non-computable derived functors."
+4. **Sec. 7.7 + Sec. 16.4 Grassmannian** (together with Sec. 15 line bundles and divisors; Plucker embedding appears within this framework) -- the geometric basis for Plucker KV compression.
+5. **Sec. 1 Category Theory** (Sec. 1.3 limits/colimits, Sec. 1.4 adjoints) -- the pullback/pushforward adjoint pair and unified operator interfaces.

package/references/books/algebraic-geometry-rising-sea.md

@@ -1,4 +1,4 @@
-# 🌊 代数几何（The Rising Sea）/ Algebraic Geometry
+# 代数几何（The Rising Sea）/ Algebraic Geometry
 
 > 《The Rising Sea: Foundations of Algebraic Geometry》，Ravi Vakil 著，Princeton University Press，2025 年版（ISBN 978-0-691-26866-8）。
 > 书名取自 Grothendieck 的"涨潮（la mer monte）"比喻：不正面强攻坚果般的难题，而是让抽象之水（范畴、层、上同调）缓缓上涨，悄无声息地淹没并瓦解问题。
@@ -116,7 +116,7 @@
 > 八维记分卡：①张量化 ②GEMM 可映射 ③复杂度 ④显存/KV ⑤低精度稳定 ⑥并行与通信 ⑦稀疏结构 ⑧算子融合。
 > **数学美 ≠ 可算**；任一维"不友好且不可改造"即淘汰。
 
-**可落 GEMM / 亚二次（友好 ✅）：**
+**可落 GEMM / 亚二次（友好 [v]）：**
 
 | 构造 | 命中维度 | 说明 |
 |---|---|---|
@@ -125,7 +125,7 @@
 | Čech H¹ 正则（固定覆盖） | ③⑧ | 局部廉价，可与注意力 kernel 融合（FlashAttention 式）|
 | 低秩基底块摘要（Plücker 视角） | ④ | 低秩分解压缩 KV，推理显存大降（压缩率需实测） |
 
-**美但不可算（不友好 ❌，禁止塞进训练 forward）：**
+**美但不可算（不友好 [x]，禁止塞进训练 forward）：**
 
 - **一般层上同调的导出函子计算（derived functor cohomology，§23）**
   - 需内射分解（injective resolution）+ 谱序列（spectral sequence），属**符号代数**。
@@ -137,11 +137,11 @@
 
 ## 该调用哪个思想透镜
 
-- **topological-thinking（🌀 拓扑思想）** — 主力：上同调、H¹ 障碍、连续变形下的不变量，正是层/上同调激活的母题。
+- **topological（拓扑透镜）** — 主力：上同调、H¹ 障碍、连续变形下的不变量，正是层/上同调激活的母题。
 - **categorical（范畴化透镜）**：用"层 = 局部数据 + 黏合"提取消息传递的本质，把工程算子抽象为限制映射。
 - **duality（对偶透镜）**：tropicalization、Plücker 嵌入、pullback/pushforward —— 用等价转换把难算问题搬到可算坐标系。
-- **symmetry（⚛️ 对称与不变性）**：射影不变、规范（gauge）对称、层的协变性，约束模型的等变结构。
-- **axiomatization（📐 公理化）**：把层公理（局部性 + 黏合）、上同调长正合列当作正确性约束，审查"该有的一致性是否被违反"。
+- **symmetry（对称与不变性）**：射影不变、规范（gauge）对称、层的协变性，约束模型的等变结构。
+- **axiomatization（公理化）**：把层公理（局部性 + 黏合）、上同调长正合列当作正确性约束，审查"该有的一致性是否被违反"。
 
 ## 反模式
 
@@ -154,7 +154,7 @@
 
 ## 深挖入口
 
-> **📖 书目信息**：Ravi Vakil, *The Rising Sea: Foundations of Algebraic Geometry*, Princeton University Press, 2025. ISBN 978-0-691-26866-8.
+> **书目信息**：Ravi Vakil, *The Rising Sea: Foundations of Algebraic Geometry*, Princeton University Press, 2025. ISBN 978-0-691-26866-8.
 >
 > **启用方式**：将 `The Rising Sea Foundations of Algebraic Geometry.pdf` 放入项目根目录的 `math_book/` 文件夹，Agent 即可自动搜索原文。PDF 不随 npm/git 分发（版权原因），需自行获取。