math-skill 1.0.0 → 2.1.0

package/skills/logic-deduction/original-texts.en.md

@@ -0,0 +1,160 @@
+# Mathematical Sources and Classic Texts
+
+## Propositional Logic
+
+**Basic inference rules**:
+
+| Rule Name | Form | Validity |
+|-----------|------|----------|
+| Modus Ponens | P → Q, P ⊢ Q | Valid |
+| Modus Tollens | P → Q, ¬Q ⊢ ¬P | Valid |
+| Hypothetical Syllogism | P → Q, Q → R ⊢ P → R | Valid |
+| Disjunctive Syllogism | P ∨ Q, ¬P ⊢ Q | Valid |
+| Affirming the Consequent | P → Q, Q ⊢ P | Invalid |
+| Denying the Antecedent | P → Q, ¬P ⊢ ¬Q | Invalid |
+
+## Boolean Algebra (Boole, 1854)
+
+George Boole, in *An Investigation of the Laws of Thought* (1854), established an algebraic system for propositional logic, transforming logical reasoning into algebraic computation:
+
+> "Logic is a species of algebra whose variables take only the values 0 and 1."
+
+The core operations of Boolean algebra — ∧ (multiplication), ∨ (addition), ¬ (complement) — satisfy algebraic properties such as distributivity and De Morgan's laws. This is the algebraic dual of propositional logic: the same inferential structure can be handled either deductively or computationally. Boolean algebra later became the mathematical foundation of digital circuit design (Shannon, 1938) and computer science.
+
+## Frege's *Begriffsschrift* (1879)
+
+Frege invented the first complete formal system of first-order logic, introducing quantifiers (∀, ∃) and function symbols, demonstrating that logical reasoning can be fully mechanized. This is the starting point of modern mathematical logic — henceforth, mathematical proofs had precise syntactic rules rather than relying solely on intuitive narration.
+
+> "Can arithmetical truths be proved purely logically? The Begriffsschrift provides the instrument for this."
+
+## Peano Axioms (1889)
+
+Constructing the natural number system from logic:
+
+> 1. 0 is a natural number.
+> 2. Every natural number n has a successor S(n).
+> 3. 0 is not the successor of any natural number.
+> 4. Different natural numbers have different successors.
+> 5. (Induction Axiom) If a property holds for 0, and if it holds for n then it also holds for S(n), then the property holds for all natural numbers.
+
+This demonstrates how to construct a complete mathematical system from a minimal set of logical assumptions. The Peano axioms are a paradigm of first-order theories — a single second-order induction axiom (or a first-order induction schema) suffices to characterize the entire structure of the natural numbers.
+
+## Russell's Paradox (1901)
+
+> "Consider the set R of all sets that do not contain themselves: does R contain R?"
+
+If R ∈ R, then by definition R ∉ R; if R ∉ R, then by definition R ∈ R. The contradiction is irresolvable. This paradox directly demolished Frege's naive set theory (Frege acknowledged the fundamental flaw in his system upon receiving Russell's letter), triggering the "third crisis" of the foundations of mathematics. It gave rise to:
+
+- **ZFC Set Theory** (Zermelo-Fraenkel + Choice): Eliminates the paradox by restricting set construction rules (the Separation schema rather than unrestricted Comprehension)
+- **Type Theory** (Russell, 1908): Prohibits self-reference through a hierarchy of types
+- **Intuitionism** (Brouwer): Rejects treating infinite sets as completed objects
+
+Russell's paradox profoundly reveals that the consistency of a logical system cannot be taken for granted — it must be proved or constructively guaranteed.
+
+## ZFC as Background Logic for Mathematics
+
+Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC) is the default foundational language of contemporary mathematics — virtually all mathematical objects (numbers, functions, spaces, groups) can be defined as sets within ZFC, and all mathematical theorems can (in principle) be translated into formal proofs in ZFC.
+
+> "Mathematicians do not write ZFC proofs in daily work, but they presuppose that all proofs can in principle be formalized in ZFC."
+
+ZFC's nine axioms (Extensionality, Empty Set, Pairing, Union, Power Set, Infinity, Separation, Replacement, Choice) carefully circumvent Russell's paradox while preserving sufficient constructive power. The Axiom of Choice (AC) has provoked ongoing controversy — it permits non-constructive selections (as in Zorn's Lemma and the Well-Ordering Theorem), revealing its cost in counterintuitive results such as the Banach-Tarski decomposition.
+
+## First-Order vs Higher-Order Logic
+
+**First-Order Logic (FOL)**: Quantifiers range only over individuals (∀x, ∃x), not over predicates or functions. This is the "standard language" of mathematical logic, possessing completeness (Gödel 1929) and compactness.
+
+**Higher-Order Logic (HOL)**: Allows quantification over predicates (∀P) and functions (∀f), offering greater expressive power at a steep cost — higher-order logic is **incomplete** (no recursively enumerable proof system can capture all valid inferences) and non-compact.
+
+> "First-order logic is complete but limited in expressive power; higher-order logic is expressive but incomplete. This is a fundamental trade-off."
+
+Peano Arithmetic (PA) is a first-order theory whose induction axiom is encoded as infinitely many first-order axiom schemas; the genuine Peano axioms (with second-order induction) uniquely characterize ℕ, but first-order PA has non-standard models. This connects directly to the Löwenheim-Skolem theorem.
+
+## Gödel: Completeness (1929) vs Incompleteness (1931)
+
+**Completeness Theorem (1929)**: The deductive system of first-order logic is complete — every logically valid formula can be formally proved.
+
+> "In first-order logic, all logically valid formulas can be proved from the axioms through formal inference."
+
+**Incompleteness Theorem (1931)**: Any consistent formal system that includes basic arithmetic contains undecidable propositions — neither provable nor refutable.
+
+> "In any sufficiently strong consistent formal system T, there exists a sentence G such that T ⊬ G and T ⊬ ¬G."
+
+The crucial distinction: the Completeness Theorem states that the **logical system itself** does not miss any valid inference; the Incompleteness Theorem states that **arithmetic theory** cannot exhaust all truths. The two are not contradictory — completeness guarantees "the inference rules are sufficient," while incompleteness reveals "arithmetical truth transcends any fixed set of axioms."
+
+## Löwenheim-Skolem Theorem (1920, 1922)
+
+> "If a first-order theory T has an infinite model, then T has a model of every infinite cardinality κ ≥ ℵ₀."
+
+Downward Löwenheim-Skolem: T must have a countable model. Upward Löwenheim-Skolem: T must have models of arbitrarily large cardinality.
+
+A startling corollary: a first-order theory **cannot control the cardinality of its models**. Even though ZFC aims to describe an uncountable universe of sets, ZFC itself has countable models (the Skolem paradox). This reveals a fundamental limitation of first-order logic's expressive power — first-order sentences cannot distinguish the "internal" and "external" perspectives on "countable" versus "uncountable."
+
+## Tarski's Semantic Theory of Truth (1933)
+
+> "'Snow is white' is true if and only if snow is white."
+
+Tarski provided a formal definition of truth (the T-schema), illuminating the distinction between "truth" and "provability" in logic — "truth" is a semantic concept (dependent on models), while "provability" is a syntactic concept (dependent on proof systems). The Completeness Theorem bridges the two (in FOL, T ⊢ φ ⇔ T ⊨ φ), but in strong theories such as arithmetic they are permanently separated (Gödel's incompleteness).
+
+Tarski also proved that a sufficiently expressive language **cannot consistently define truth within itself** — a truth definition must employ a stronger metalanguage. This, together with Russell's paradox and Gödel's incompleteness, forms a triad of impossibility results concerning self-reference.
+
+## Gentzen's Natural Deduction and Sequent Calculus (1935)
+
+Gerhard Gentzen, in *Investigations into Logical Deduction*, invented two entirely new proof structures:
+
+**Natural Deduction**: Inference rules are organized around the introduction (I) and elimination (E) of each logical connective — ∧I, ∧E, →I, →E, ∀I, ∀E, etc. This captures the way mathematicians actually reason: assume a premise, derive a conclusion, then discharge the assumption (→I, i.e., conditional proof).
+
+**Sequent Calculus**: The objects of proof are sequents Γ ⊢ Δ (assumptions on the left, conclusions on the right), and rules operate between sequents. The key breakthrough: the **Cut-Elimination Theorem** (Hauptsatz) — any proof using the Cut rule can be transformed into a cut-free proof.
+
+> "The Hauptsatz states that all proofs can be transformed into cut-free proofs, eliminating all 'intermediate formulas'."
+
+Cut-elimination is the central tool of proof theory: it guarantees the subformula property (every step of a cut-free proof involves only subformulas of the final conclusion), making consistency and decidability proofs possible. Gentzen's work shifted logic from an "axiomatic" to a "structural" paradigm, founding the discipline of Proof Theory.
+
+## Turing's Halting Problem (1936)
+
+Alan Turing, in *On Computable Numbers*, defined the Turing machine and proved:
+
+> "There is no general algorithm that can decide whether an arbitrary Turing machine halts on an arbitrary input."
+
+The undecidability of the halting problem is a fundamental limitation on computation and logic. Its logical essence is equivalent to Gödel's incompleteness: if the halting problem were decidable, arithmetic incompleteness could be circumvented; if arithmetic were complete, the halting problem would be decidable. The two are duals — two faces of the same wall.
+
+A direct corollary of the halting problem: the **Entscheidungsproblem** for first-order logic is also undecidable (Church, 1936; Turing, 1936) — there is no general algorithm that can decide whether an arbitrary first-order formula is logically valid. Logical deduction can be executed, but it cannot be mechanically and fully predicted.
+
+## Resolution and Unification (Robinson, 1965)
+
+J. A. Robinson, in *A Machine-Oriented Logic Based on the Resolution Principle*, introduced the resolution rule:
+
+> "Resolve P ∨ Q and ¬P ∨ R to obtain Q ∨ R."
+
+Resolution compresses all inference into a single rule combined with the Unification algorithm — automatically finding an algebraic substitution σ that makes two terms equal, so that σ(P) = σ(P'), thereby enabling resolution on complementary literals.
+
+Resolution-unification is the mathematical core of Automated Theorem Proving and Logic Programming (e.g., Prolog). It demonstrates that proof search in first-order logic can be unified into a single algorithmic process, although efficiency issues (search space explosion) remain a severe practical challenge.
+
+## Curry-Howard Correspondence (1969)
+
+> "Propositions as types, proofs as programs."
+
+Curry (1958) first observed the correspondence between types in combinatory logic and formulas in propositional logic; Howard (1969) extended it to constructive predicate logic:
+
+| Logic Concept | Type Theory / Programming Concept |
+|---------------|-----------------------------------|
+| Proposition A | Type A |
+| A ∧ B | A × B (product type) |
+| A ∨ B | A + B (sum type) |
+| A → B | A → B (function type) |
+| ∀x. P(x) | Πx:A. P(x) (dependent function type) |
+| ∃x. P(x) | Σx:A. P(x) (dependent pair type) |
+| Constructive proof | Executable program |
+
+The Curry-Howard correspondence reveals a deep isomorphism between logical deduction and computation: a constructive proof is a program, and the execution of the program is proof normalization. This is the computational counterpart of Gentzen's cut-elimination — β-reduction is cut-elimination.
+
+This correspondence became the theoretical foundation of type theory (Martin-Löf, 1972), dependently typed programming (Coq, Agda), and Homotopy Type Theory (HoTT, 2013), unifying "proof correctness" and "program correctness" into a single problem.
+
+## Formalization of Common Logical Fallacies
+
+| Fallacy Name | Form | Counterexample |
+|--------------|------|----------------|
+| Affirming the Consequent | P → Q, Q ∴ P | "If it rains, the ground is wet; the ground is wet, therefore it rained" (could be a sprinkler) |
+| Denying the Antecedent | P → Q, ¬P ∴ ¬Q | "If it rains, the ground is wet; it did not rain, therefore the ground is not wet" (could be a sprinkler) |
+| Begging the Question (Circular Reasoning) | P ∴ P | "This book tells the truth because the book says so" |
+| Straw Man | Attacking P' ≠ P | A: "We should increase the education budget." B: "You want to give all the money to schools." |
+| Slippery Slope | A → B → ... → Z, ∴ ¬A | "Allow this → that → disaster, therefore we must not allow it." |

package/skills/math-research-activator/SKILL.en.md

@@ -0,0 +1,132 @@
+---
+name: math-research-activator
+description: |
+  Auto-trigger (requires BOTH environment AND task signals): only when **designing/improving** new model architectures/operators/attention mechanisms, **analyzing** algorithm theoretical properties (complexity, convergence, expressivity), or **transferring** modern math structures (algebraic geometry, differential geometry, Lie theory, abstract algebra, matrix analysis, optimization) into algorithm/GPU co-design. Does NOT trigger for: code review, debugging, parameter tracing, refactoring, hyperparameter tuning, or loss implementation edits. Also the manual /ask entry (weapon selector).
+---
+
+# 🧭 Math Research Activator
+
+> "The model already holds enough mathematics inside; what's missing is a cross-domain activation. The human picks the direction; the agent searches, enumerates, verifies."
+
+## Core Principle
+
+**No lengthy math tutorials.** Once triggered, immediately enter the three-step pipeline: "Diagnose → Map → GPU Screen," activating modern mathematics into algorithm/hardware design, and passing every output through the **dual acceptance gate**:
+
+1. **Mathematically correct (beautiful in math)** — self-consistent, differentiable (or relaxable to differentiable), with correctness guarantees.
+2. **GPU-feasible (friendly to GPU)** — see `../../references/gpu-friendly-math.md` eight dimensions.
+
+> This is the **sole automatic entry point** of the skill pack. It loads the methodology layer (`../../references/agentic-workflow.md`, `../../references/gpu-friendly-math.md`), the book activation layer (`../../references/books/*.md`), and the 16 thinking weapons (sibling directories `../*/SKILL.md`) on demand, keeping only the minimal trigger and diagnostic logic resident at all times — progressive disclosure to save tokens.
+
+## When to Auto-Engage
+
+**Both the "environment signal" AND the "task signal" must be satisfied simultaneously (neither alone is sufficient):**
+
+### Gate 0 · Exclusion Gate (evaluated first; if hit, do not engage)
+
+The following tasks must **never** trigger this activator, regardless of what code is in the workspace:
+- Code review / debugging / parameter-passing chain verification / interface consistency checks
+- Refactoring, renaming, removing redundant code, dead code cleanup
+- Build / packaging / CI / deployment / environment configuration
+- Pure factual queries ("what does this function do," "who receives this parameter")
+- General software engineering (file I/O, networking, data loading, logging)
+- Training script hyperparameter tuning, hyperparameter search, experiment comparison
+- Adding / modifying loss implementation details (as opposed to designing the mathematical structure of a new loss)
+
+**Rule of thumb: if the task can be accomplished by "reading code → tracing call chains → reporting results," no mathematical weapon is needed.**
+
+### Gate 1 · Environment Signal (necessary condition, not sufficient)
+
+The workspace contains at least one of the following:
+- Core model architecture code (not training scripts / data pipelines): attention/transformer/MoE implementations, `*.cu`/`*.cuh`/kernels, Triton/CUDA operators.
+- Algorithm research notes / paper review documents.
+- Design drafts or mathematical derivations for new architectures / new operators.
+
+> The mere presence of `model.py`, `trainer.py`, `config.json`, or similar routine ML engineering files **does not constitute an environment signal**.
+
+### Gate 2 · Task Signal (necessary condition, not sufficient)
+
+The user's current task explicitly involves at least one of the following:
+- **Designing or improving** a new model architecture / operator / attention mechanism (not fixing an existing implementation).
+- **Selecting or justifying** the applicability of a mathematical structure (e.g., "should we use manifold constraints," "does this structure have equivariance").
+- **Analyzing** theoretical properties of an algorithm (complexity lower bounds, convergence, expressivity, information bottleneck).
+- **Transferring** a mathematical structure from some field into algorithm/GPU design.
+
+> If the task signal is merely "code doesn't run," "parameter wasn't passed," "loss didn't take effect," or similar engineering issues, the activator does **not trigger** even if the environment signal is hit.
+
+**When NOT to engage:**
+- Gate 0 is hit (exclusion gate).
+- Either Gate 1 or Gate 2 is not satisfied.
+- The problem is not in a domain where mathematics can help.
+
+## The Activation Loop
+
+> See `../../references/agentic-workflow.md` for detailed working methodology (Human-in-the-Agent-Loop).
+
+1. **Diagnose**: What is the algorithmic structure or bottleneck? (complexity? memory/KV? numerics? parallelism? expressivity?)
+2. **Map**: Use the "Modern Math Toolbox" (below) to scan for transferable structures, **enumerating multiple candidates** (leverage the large context window — don't just give one).
+3. **Route**: Select 1–3 thinking weapons for deeper analysis (decision tree below).
+4. **GPU Screen**: Pass each candidate through the eight dimensions of `../../references/gpu-friendly-math.md`, rating "friendly / retrofittable / unfriendly" + adaptation recommendations.
+5. **Dual Acceptance Gate**: Retain only candidates that are **mathematically correct AND (eight-dimension friendly or retrofittable)**.
+6. **Track**: For complex explorations, use a markdown testplan table (template in agentic-workflow.md) to iterate toward convergence.
+
+The eight-dimension terminology must remain consistent: **Tensorization / GEMM-Mappability / Complexity / Memory & KV-Cache / Low-Precision Stability / Parallelism & Communication / Sparsity Structure / Operator Fusion**. Do not substitute vague judgments covering only a subset of dimensions for the full eight-dimension gate.
+
+## Weapon Routing
+
+Match by the core characteristic of the problem (select up to 3, label primary/secondary):
+
+1. **Multi-agent interaction** (my optimum depends on others) → `/game-theory` (primary); resource allocation + `/optimization`; information asymmetry + `/information-theory`
+2. **Uncertainty / randomness** → `/probability-statistics` (primary); need causal rather than correlational + `/causal-inference`
+3. **Optimization under constraints** → `/optimization` (primary); need to model first + `/modeling` (prerequisite)
+4. **Current form is intractable, need change of perspective / simplification** → `/transformation` (primary)
+5. **Need to extract essential structure** → `/abstraction` (primary); verify assumptions + `/axiomatization`; simplify + `/symmetry-invariance`
+6. **Need rigorous reasoning and verification** → `/logic-deduction` (primary); verify premises + `/axiomatization`
+7. **Finding patterns from data / experience** → `/induction-analogy` (primary); cross-domain transfer + `/abstraction`
+8. **Building predictive / explanatory models** → `/modeling` (primary); optimization + `/optimization`; uncertainty + `/probability-statistics`
+9. **Invariance / conservation / equivariance under change** → `/symmetry-invariance` (primary); connected structure + `/topological-thinking`
+10. **Reducing to executable steps / evaluating feasibility and complexity** → `/algorithmic-thinking` (primary)
+11. **Compression / encoding / information bottleneck / KV-Cache compression / quantization** → `/information-theory` (primary); representation transforms + `/transformation`; routing information gain + `/game-theory`
+12. **Counting / enumeration / structure of finite objects** → `/discrete-combinatorial` (primary)
+
+> **Modern math priority hint**: When the problem is "designing/improving an operator or structure," **always open the modern math toolbox first** while routing weapons — many breakthroughs come from transferring structures from algebraic geometry / differential geometry / Lie theory, rather than circling within classical tools alone.
+
+## Modern-Math Toolbox (Layer 3 · Loaded on Demand)
+
+Load the corresponding book activation file (`../../references/books/`) by problem type:
+
+| Trigger Signal | Load | Typical Activation |
+|---------|------|---------|
+| Operator = matrix multiply / spectrum / low-rank / numerical stability | `matrix-analysis.md` | GEMM formulation, low-rank compression, spectral normalization, preconditioning |
+| Training / convergence / optimizer / constraints | `optimization-ml.md` | Feasibility of adaptive / second-order optimization, dual solving |
+| Symmetry / equivariance / semiring / permutation invariance | `abstract-algebra.md` | Group-equivariant layers, tropical semiring routing, finite-field encoding |
+| Manifold constraints / latent-space geometry / differentiable structure | `smooth-manifolds.md` | Manifold optimization, Stiefel/orthogonal constraints, geodesic interpolation |
+| Metric / curvature / natural gradient / gauge / fiber bundle | `differential-geometry.md` | Natural gradient / K-FAC, information geometry, gauge equivariance |
+| Pose / SO(3) / SE(3) / state estimation / equivariance | `micro-lie-theory.md` | Lie group optimization, SE(3) equivariance, manifold loss |
+| Attention / sparsity / global consistency / KV compression | `algebraic-geometry-rising-sea.md` | Sheaf attention, Čech cohomology regularization, Plücker KV, tropical gating |
+
+## Deep-Dive Protocol
+
+- **Light**: Read `../../references/books/<book>.md` (distilled notes, shipped with the release, self-contained).
+- **Deep (full fidelity to original text required)**: If a local `math_book/<corresponding PDF>` exists, **let the agent search automatically** — `pdftotext "math_book/<file>.pdf" -` → grep keywords → Read the matching page. **No reliance on pre-embedded anchors.**
+- No PDF available (e.g., npm-installed on a different machine): Stay at the distilled-notes layer, which remains self-contained and usable.
+
+## Worked Example: Tropical Sheaf Attention
+
+A research candidate template (see `../../references/gpu-friendly-math.md` for details): tropical gating (semiring piecewise-linear replacing Top-K) + cellular sheaf diffusion (low-rank restriction maps per edge = small GEMMs) + Čech cohomology regularization (H¹ as a structural consistency signal) + Plücker KV compression. Treat this as an exploration template for "math beautiful x GPU friendly": verify complexity, memory, low-precision stability, and kernel fusibility dimension by dimension before claiming passage through the eight-dimension gate.
+
+## Operating Procedure
+
+Once triggered, the output must contain:
+1. **[Diagnosis]**: One sentence identifying the algorithmic structure/bottleneck (interaction / uncertainty / constraints / structure / dynamics / complexity / memory / numerics / parallelism).
+2. **[Mapping]**: Enumerate transferable modern math structure candidates (>=2, annotated with source book).
+3. **[Weapon Routing]**: 1–3 thinking weapons, labeled primary/secondary + trigger commands.
+4. **[GPU Screen]**: Each candidate evaluated against the eight dimensions, rated "friendly / retrofittable / unfriendly" + adaptation recommendations.
+5. **[Conclusion]**: Retain only candidates passing the dual acceptance gate; provide a testplan table when necessary.
+
+**A conclusion must always be provided — never output analysis alone without convergence.**
+
+## Relations
+
+- This entry point routes all 16 thinking weapons and loads the methodology layer and book activation layer on demand.
+- The manual entry `/ask` is equivalent to invoking this activator (weapon selector mode).
+- Review of outputs can be delegated to `agents/math-critic.md` (including the GPU feasibility dimension) for a second pass.

package/skills/math-research-activator/SKILL.md

@@ -0,0 +1,136 @@
+---
+name: math-research-activator
+description: |
+  自动触发（需同时满足环境+任务双重信号）：仅当用户在**设计或改进**新的模型架构/算子/注意力机制，或**分析**算法理论性质（复杂度、收敛性、表达力），或**迁移**现代数学结构（代数几何、微分几何、李理论、抽象代数、矩阵分析、最优化）到算法/GPU 协同设计时使用。不触发于：代码审查、debug、参数传递核查、重构、调参、loss 实现修改等纯工程任务。也作为手动 /ask 入口（武器选择器）。
+  English: Auto-trigger (requires BOTH environment AND task signals): only when **designing/improving** new model architectures/operators/attention mechanisms, **analyzing** algorithm theoretical properties (complexity, convergence, expressivity), or **transferring** modern math structures (algebraic geometry, differential geometry, Lie theory, abstract algebra, matrix analysis, optimization) into algorithm/GPU co-design. Does NOT trigger for: code review, debugging, parameter tracing, refactoring, hyperparameter tuning, or loss implementation edits. Also the manual /ask entry (weapon selector).
+---
+
+> **语言路由**：若用户消息为英文，请读取并遵循同目录下的 `SKILL.en.md`，按其操作规程以英文输出；中文消息则继续使用本文件。
+
+# 🧭 数学研究激活器 / Math Research Activator
+
+> "模型内部已有足够的数学知识，缺的只是一次跨领域的激活。人选方向，Agent 搜索、枚举、验证。"
+> "The model already holds enough mathematics inside; what's missing is a cross-domain activation. The human picks the direction; the agent searches, enumerates, verifies."
+
+## 核心原则 / Core Principle
+
+**不做大段数学科普。** 一旦触发，立即进入「诊断 → 映射 → GPU 筛选」三步，把现代数学激活进算法/硬件设计，并让每个产出过**双验收门**：
+
+1. **数学正确（beautiful in math）**——自洽、可微（或可松弛为可微）、有正确性保证。
+2. **GPU 可行（friendly to GPU）**——见 `../../references/gpu-friendly-math.md` 八维。
+
+> 这是本技能包的**唯一自动入口**。它按需加载方法论层（`../../references/agentic-workflow.md`、`../../references/gpu-friendly-math.md`）、书籍激活层（`../../references/books/*.md`）和 16 个思想武器（同级目录 `../*/SKILL.md`），常驻只保留最短的触发与诊断逻辑——渐进式披露，省 token。
+
+## 何时自动介入 / When to Auto-Engage
+
+**必须同时满足「环境信号」AND「任务信号」才考虑介入（缺一不可）：**
+
+### Gate 0 · 排除门（优先判定，命中即不介入）
+
+以下任务**无论工作区含什么代码**都不得触发本激活器：
+- 代码审查 / debug / 参数传递链核查 / 接口一致性检查
+- 重构、重命名、删除冗余代码、清理死代码
+- 构建 / 打包 / CI / 部署 / 环境配置
+- 纯事实查询（"这个函数干什么"、"这个参数传给了谁"）
+- 通用软件工程（文件 I/O、网络、数据加载、日志）
+- 训练脚本调参、超参搜索、实验对比
+- 添加 / 修改 loss 项的实现细节（非设计新 loss 的数学结构）
+
+**判断口诀：如果任务可以用"阅读代码 → 追踪调用链 → 报告结果"完成，就不需要数学武器。**
+
+### Gate 1 · 环境信号（必要条件，非充分条件）
+
+工作区含以下至少一类：
+- 模型架构核心代码（非训练脚本/数据管道）：attention/transformer/MoE 实现、`*.cu`/`*.cuh`/kernel、Triton/CUDA 算子。
+- 算法研究笔记 / 论文审查文档。
+- 新架构 / 新算子的设计稿或数学推导。
+
+> 仅有 `model.py`、`trainer.py`、`config.json` 等常规 ML 工程文件**不构成环境信号**。
+
+### Gate 2 · 任务信号（必要条件，非充分条件）
+
+用户当前任务明确涉及以下至少一项：
+- **设计或改进**一个新的模型架构 / 算子 / 注意力机制（非修复已有实现）。
+- **选择或论证**数学结构的适用性（如"该不该用流形约束"、"这个结构有没有等变性"）。
+- **分析**算法的理论性质（复杂度下界、收敛性、表达力、信息瓶颈）。
+- 把某个数学领域的结构**迁移**到算法/GPU 设计中。
+
+> 如果任务信号仅为"代码跑不通"、"参数没传过去"、"loss 没生效"等工程问题，即使环境信号命中也**不触发**。
+
+**不介入 / When NOT to use：**
+- Gate 0 命中（排除门）。
+- Gate 1 或 Gate 2 任一未命中。
+- 问题不属于数学能帮助的范畴。
+
+## 主流程 / The Activation Loop
+
+> 详细工作方式见 `../../references/agentic-workflow.md`（Human-in-the-Agent-Loop）。
+
+1. **诊断 / Diagnose**：算法结构或瓶颈是什么？（复杂度？显存/KV？数值？并行？表达力？）
+2. **映射 / Map**：用「现代数学工具箱」（下）扫描可迁移的结构，**枚举多个候选**（发挥大上下文优势，别只给一个）。
+3. **路由 / Route**：选 1–3 个思想武器深入（决策树见下）。
+4. **GPU 筛选 / Screen**：每个候选过 `../../references/gpu-friendly-math.md` 八维，给「友好/可改造/不友好」+ 改造建议。
+5. **双验收门 / Gate**：只保留**数学正确 AND（八维友好或可改造）**的候选。
+6. **追踪 / Track**：复杂探索用 markdown testplan 表（模板见 agentic-workflow.md）迭代收敛。
+
+八维正式术语必须保持一致：**张量化 / GEMM 可映射 / 复杂度 / 显存与 KV-Cache / 低精度稳定 / 并行与通信 / 稀疏结构 / 算子融合**。不要用只覆盖部分维度的模糊判断替代八维门。
+
+## 思想武器路由决策树 / Weapon Routing
+
+按问题核心特征匹配（最多选 3 个，标主/辅）：
+
+1. **多方互动**（我的最优取决于他人）→ `/game-theory`（主）；涉资源分配＋`/optimization`；信息不对称＋`/information-theory`
+2. **不确定性/随机性** → `/probability-statistics`（主）；需因果而非相关＋`/causal-inference`
+3. **约束下求最优** → `/optimization`（主）；需先建模＋`/modeling`（前置）
+4. **当前形式难处理，需换视角/化简** → `/transformation`（主）
+5. **需提取本质结构** → `/abstraction`（主）；验证假设＋`/axiomatization`；简化＋`/symmetry-invariance`
+6. **需严格推理验证** → `/logic-deduction`（主）；验证前提＋`/axiomatization`
+7. **从数据/经验找规律** → `/induction-analogy`（主）；跨域迁移＋`/abstraction`
+8. **构建预测/解释模型** → `/modeling`（主）；优化＋`/optimization`；不确定＋`/probability-statistics`
+9. **变化中的不变性/守恒/等变** → `/symmetry-invariance`（主）；连通结构＋`/topological-thinking`
+10. **化为可执行步骤/评估可行性与复杂度** → `/algorithmic-thinking`（主）
+11. **压缩/编码/信息瓶颈/KV-Cache 压缩/量化** → `/information-theory`（主）；涉及表示变换＋`/transformation`；涉及路由信息增益＋`/game-theory`
+12. **有限对象的计数/枚举/结构** → `/discrete-combinatorial`（主）
+
+> **现代数学优先提示**：当问题是「设计/改进算子或结构」时，路由武器的同时**务必先开现代数学工具箱**——很多突破来自把代数几何/微分几何/李理论的结构迁移过来，而非只在经典工具里打转。
+
+## 现代数学工具箱（Layer 3 · 按需加载）/ Modern-Math Toolbox
+
+按问题类型加载对应书籍激活文件（`../../references/books/`）：
+
+| 触发信号 | 加载 | 典型激活 |
+|---------|------|---------|
+| 算子=矩阵乘/谱/低秩/数值稳定 | `matrix-analysis.md` | GEMM 化、低秩压缩、谱归一化、预条件 |
+| 训练/收敛/优化器/约束 | `optimization-ml.md` | 自适应/二阶优化的可行性、对偶求解 |
+| 对称/等变/半环/置换不变 | `abstract-algebra.md` | 群等变层、热带半环路由、有限域编码 |
+| 流形约束/隐空间几何/可微结构 | `smooth-manifolds.md` | 流形优化、Stiefel/正交约束、测地插值 |
+| 度量/曲率/自然梯度/规范/纤维丛 | `differential-geometry.md` | 自然梯度/K-FAC、信息几何、gauge 等变 |
+| 位姿/SO(3)/SE(3)/状态估计/等变 | `micro-lie-theory.md` | 李群优化、SE(3) 等变、流形损失 |
+| 注意力/稀疏/全局一致性/KV 压缩 | `algebraic-geometry-rising-sea.md` | sheaf 注意力、Čech 上同调正则、Plücker KV、热带门控 |
+
+## 深挖回查协议 / Deep-Dive Protocol
+
+- **轻度**：读 `../../references/books/<book>.md`（蒸馏稿，发布即带，自足）。
+- **深度（需原文全保真）**：若本机存在 `math_book/<对应 PDF>`，**让 Agent 自动搜索**——`pdftotext "math_book/<file>.pdf" -` → grep 关键词 → Read 命中页。**不依赖预埋锚点。**
+- 无 PDF（如 npm 安装的他机）：停在蒸馏稿层，依然自足可用。
+
+## 范例：Tropical Sheaf Attention / Worked Example
+
+一个研究候选样板（详见 `../../references/gpu-friendly-math.md`）：热带门控（半环分段线性替代 Top-K）＋胞腔层扩散（每边低秩限制映射＝小 GEMM）＋Čech 上同调正则（H¹ 作结构一致性信号）＋Plücker KV 压缩。把它当作「math beautiful × GPU friendly」的探索模板：逐项验证复杂度、显存、低精度稳定性与 kernel 可融合性后，才能声称通过八维门。
+
+## 操作规程 / Operating Procedure
+
+触发后输出必须含：
+1. **[诊断]**：一句话点明算法结构/瓶颈（互动性/不确定性/约束/结构/动态/复杂度/显存/数值/并行）。
+2. **[映射]**：枚举可迁移的现代数学结构候选（≥2 个，标注来自哪本书）。
+3. **[武器路由]**：1–3 个思想武器，标主/辅 + 触发命令。
+4. **[GPU 筛选]**：每个候选过八维，给「友好/可改造/不友好」+ 改造建议。
+5. **[结论]**：保留同时通过双验收门的候选；必要时给 testplan 表。
+
+**必须给出结论，不得只输出分析而不收敛。**
+
+## 与其他 skill 的关系 / Relations
+
+- 本入口路由全部 16 个思想武器，并按需加载方法论层与书籍激活层。
+- 手动入口 `/ask` 等价调用本激活器（武器选择器模式）。
+- 审视产出可交 `agents/math-critic.md`（含 GPU 可行性维度）做二次把关。

package/skills/math-research-activator/original-texts.en.md

@@ -0,0 +1,105 @@
+# Intellectual Sources for the Weapon Selector
+
+## The Tradition of Problem Classification and Tool Selection
+
+### Pólya's Problem-Solving Heuristics
+
+George Pólya (1887-1985) proposed the four-step problem-solving method in *How to Solve It* (1945), which laid the foundation for modern problem-solving methodology:
+
+1. **Understanding the problem** — You must understand the problem
+2. **Devising a plan** — Find the connection between the known and the unknown
+3. **Carrying out the plan** — Check each step
+4. **Looking back** — Examine the solution obtained
+
+Pólya's central insight: **different types of problems require different problem-solving strategies**. He catalogued dozens of heuristic strategies, including:
+- If you cannot solve the proposed problem, try to solve some related problem first
+- Go back to definitions
+- From the particular to the general, and from the general to the particular
+- Consider extreme cases
+- Reason backwards
+- Draw a figure
+- Introduce auxiliary elements
+
+> "Problem solving is a practical skill, like swimming — you can learn it by imitation and practice." — Pólya
+
+Pólya's taxonomy of heuristics provides the intellectual foundation for our weapon selector: **the core characteristics of a problem (such as "does it involve uncertain quantities," "does it exhibit symmetry," "can it be decomposed into subproblems") determine the most appropriate problem-solving method**.
+
+### Newell & Simon's Problem Space Theory
+
+Allen Newell and Herbert A. Simon proposed the problem space theory in *Human Problem Solving* (1972):
+
+- **Problem Space**: The set of all possible states, including the initial state, the goal state, and the permissible operations
+- **Search Strategy**: A method for navigating from the initial state to the goal state within the problem space
+- **Heuristic Search**: Rather than exhaustively enumerating all states, use heuristic rules to select the directions most likely to lead toward the goal
+
+Core insight: **the nature of the problem space determines the choice of search strategy**. If the problem space is small, exhaustive search is feasible; if it is large, heuristics are essential; if the problem space has special structure (such as monotonicity or symmetry), that structure can be exploited to accelerate the search.
+
+> "Choosing a search strategy is the most critical decision in problem solving — the strategy determines which region of the problem space you will search." — Newell & Simon
+
+### Schoenfeld's Strategic Decision Theory
+
+Alan H. Schoenfeld, in *Mathematical Problem Solving* (1985), analyzed why students fail to solve problems even when they possess the necessary tools — the critical deficiency is not a lack of tools but a lack of **strategic decision-making ability**:
+
+- **Resources**: Knowledge, skills, tools — corresponding to our 15 intellectual weapons
+- **Heuristics**: How to use resources — corresponding to the methodological workflow for each intellectual weapon
+- **Control**: When to use which resource — corresponding to the function of the weapon selector
+- **Belief Systems**: Beliefs about mathematics and about oneself — affecting whether the appropriate tool is selected
+
+Core insight: **mastery of tools ≠ ability to solve problems. The critical difference lies at the 'control' level — knowing when to deploy which tool**. This is precisely the problem the weapon selector is designed to address.
+
+> "The students' problem is not a lack of knowledge or skill, but a lack of strategic decision-making ability — they do not know when to use which method." — Schoenfeld
+
+### Wicked Problems Theory (Rittel & Webber)
+
+Horst Rittel and Melvin Webber, in "Dilemmas in a General Theory of Planning" (1973), distinguished between "tame problems" and "wicked problems":
+
+Characteristics of tame problems:
+- Clearly defined
+- Have clear stopping conditions
+- Solutions can be objectively evaluated as right or wrong
+- Domain-specific
+
+Characteristics of wicked problems:
+- No definitive formulation — understanding the problem is itself part of solving it
+- No clear stopping conditions
+- Solutions are not right or wrong, only better or worse
+- Span multiple domains
+
+Core insight: **wicked problems require combinations of cross-domain intellectual weapons, whereas tame problems can be solved with a single tool**. The weapon selector recommends multi-tool combinations when facing wicked problems and single-tool focus when facing tame problems.
+
+> "Wicked problems have no right or wrong answers, only better or worse ways of dealing with them." — Rittel & Webber
+
+### Kahneman's Dual-System Theory
+
+Daniel Kahneman, in *Thinking, Fast and Slow* (2011), proposed the dual-system theory:
+
+- **System 1**: Fast, intuitive, automatic — responsible for the majority of everyday decisions
+- **System 2**: Slow, rational, deliberate — required for decisions demanding careful thought
+
+Core insight: **not all problems require System 2-level rational analysis**. Many everyday decisions require only intuition (System 1), and forcibly deploying intellectual weapons constitutes over-analysis. The weapon selector's "inapplicable scenarios" list is grounded in this insight — simple problems do not need tools; wicked problems do.
+
+> "Overthinking is the enemy of decision-making — some decisions are best left to intuition." — Kahneman
+
+### Lakatos's Methodology
+
+Imre Lakatos, in *Proofs and Refutations* (1976), demonstrated that mathematical knowledge does not grow linearly but evolves through a dialectical process of "conjecture → refutation → revision":
+
+- **Progressive Problemshift**: Each revision gives rise to new, deeper questions
+- **Degenerative Problemshift**: Revisions merely accommodate counterexamples without generating new insights
+
+Core insight: **tool selection itself should be a progressive problemshift** — the initial choice may not be ideal, but through post-use reflection, the ability to choose improves progressively. The weapon selector's "combination sequencing" and "auxiliary perspectives" recommendations embody this dialectical thinking.
+
+> "Knowledge is not truth descending from above, but conjecture continually refined through criticism and refutation." — Lakatos
+
+## Mapping Ideas to Practice
+
+Our weapon selector integrates all of the above intellectual traditions:
+
+| Intellectual Source | Manifestation in the Weapon Selector |
+|---------|-------------------|
+| Pólya's Heuristics | 11 characteristic branches in the decision tree — each branch corresponds to a class of heuristic strategies |
+| Newell & Simon's Problem Space | Problem characteristic dimensions — interactivity, uncertainty, constraint, structure, dynamism |
+| Schoenfeld's Strategic Selection | The core principle that "choosing the right tool matters more than brute-force analysis" |
+| Wicked Problems Theory | Multi-tool combination recommendations — wicked problems require cross-domain tool combinations |
+| Kahneman's Dual System | "Inapplicable scenarios" — simple problems do not need tools; avoid over-analysis |
+| Lakatos's Methodology | Combination sequencing advice — use the primary tool first, then supplement with auxiliary tools for additional perspectives |