math-skill 2.1.0 → 3.0.0

package/skills/symmetry-invariance/SKILL.en.md

@@ -1,135 +0,0 @@
----
-name: symmetry-invariance
-description: |
-  Trigger for group theory analysis, invariant computation, Galois theory, Noether's theorem, orbit classification, quotient space reasoning, symmetry breaking; or designing equivariance/conservation/invariant structures (e.g. SO(3)/SE(3) equivariant nets, tropical semiring) for algorithms.
----
-
-# ⚛️ Symmetry & Invariance
-
-> "Finding the properties that remain unchanged under transformations, revealing their underlying laws."
->
-> — Group Theory, Invariant Theory, Noether's Theorem
->
-> Sophus Lie wanted to forge a dragon-slaying sword — to solve all differential equations. Though not every dragon was slain, the forging technique (the Lie group–Lie algebra correspondence) was passed down and later applied to linearizing nonlinear problems, describing physical symmetries, and robot state estimation. The most fascinating aspect of mathematics is that tools invented for specific problems often reveal far greater value in entirely different domains. This is the archetype of "cross-domain activation."
-
-## Core Principle
-
-**Find what remains unchanged amid change — this is the shortcut to understanding complex systems. Symmetry is not merely "aesthetically pleasing"; it is a manifestation of the deep structure of a system. Every symmetry corresponds to a conserved quantity (Noether's theorem), and every invariant is a key to simplifying a problem.**
-
-> **Mathematical Formalization**
->
-> A group **G** acts on a set **X**: φ: G×X→X (φ(e,x)=x, φ(g,φ(h,x))=φ(gh,x)).
->
-> An **invariant** f: X→Y satisfies f(g·x)=f(x) ∀g∈G. Formally: f is G-invariant ⇔ f: X/G → Y is a function on the quotient space. Invariants distinguish only between orbits, not elements within the same orbit.
->
-> An **orbit** is O(x)={g·x : g∈G}; the equivalence relation x~y ⇔ ∃g∈G, y=g·x gives X/~ = X/G. The **quotient space** X/G consists of all orbits. Classification is essentially working on X/G; finding invariants means finding functions that are constant on each orbit.
->
-> The **stabilizer** is Stab(x)={g∈G : g·x=x}, and |O(x)|=|G|/|Stab(x)| — the larger the orbit, the fewer symmetries remain.
->
-> Core intuition: **Invariant = function constant on orbits = function on the quotient space X/G**. A complete set of invariants embeds X/G into a simpler space, achieving full classification.
->
-> Hierarchy of symmetries: geometric symmetry (O(n)/E(n), invariants: distance, area); algebraic symmetry (Galois theory, discriminant); physical symmetry (Lie groups, energy/momentum/angular momentum); structural invariance (isomorphism/homotopy equivalence).
->
-> **Reynolds operator**: For a finite group G, R(f)=1/|G| Σ f(g·x), R²=R, and the image is precisely the set of all invariants. **Burnside's lemma**: |X/G|=1/|G| Σ |Fix(g)|. **Lie algebra generators**: T_a·f=0 are differential equations whose solutions yield invariants. **Noether's theorem**: Continuous symmetry → conserved current Jμ, ∂_μ Jμ=0. **Galois theory**: An equation is solvable by radicals ⇔ Gal(f) is a solvable group.
->
-> See `original-texts.md` for details.
-
-## GPU-Friendliness (Cross-Cutting Check)
-
-Whether symmetry/invariant structures can run on GPU depends on the degree to which group operations can be "tensorized" — evaluated through the eight dimensions in `../../references/gpu-friendly-math.md`:
-
-- **Group action is tensorizable → friendly**: If the group action is linear (matrix multiplication), then the equivariant layer = GEMM (e.g., SO(3)-equivariant layers use batched GEMM on spherical harmonics / representation matrices).
-- **Reynolds averaging**: Averaging over a finite group = summing over |G| transformed results, which can be batched in parallel (friendly); however, when |G| is very large this becomes unfriendly → use continuous approximation via the Lie algebra.
-- **Invariants as regularization / constraints**: As loss terms they are local and cheap (friendly); as exact symbolic computations they are unfriendly.
-- **Tropical semiring**: The "symmetry" over min/+ algebra can be mapped to GEMM-like structures (friendly; see `../../references/gpu-friendly-math.md` for examples).
-- **Anti-pattern**: Forcing exact classification that requires per-orbit symbolic determination into training — intractable.
-
-Eight-dimension minimum criteria (formal terms): **Tensorization** checks whether the group action can be batched across features; **GEMM-mappability** checks whether representation matrices / spherical harmonics / projections reduce to matrix multiplication; **complexity** examines group order, number of orbits, and integration/quadrature scale; **memory and KV-cache** checks whether multiple replicas / multi-orbit features explode memory; **low-precision stability** checks whether equivariance errors, gauge choices, and normalization remain robust; **parallelism and communication** checks whether group elements / spatial points can be processed in parallel; **sparse structure** checks whether equivariant connections are block-structured; **operator fusion** checks whether group action, aggregation, and projection can be fused.
-
-> Used together with `../../references/books/micro-lie-theory.md` (SO(3)/SE(3) equivariance), `abstract-algebra.md` (groups/semirings), `differential-geometry.md` (gauge symmetry).
-
-## When NOT to Use
-
-- **The system is completely asymmetric with no regularity** — no group action to exploit.
-- **Exact numerical solutions are needed** — symmetry provides structural information, not specific values (it tells you "what is equal" but not "equal to what").
-- **Symmetry breaking is the core mechanism** (phase transitions, spontaneous breaking) — one should analyze the breaking pattern G→H rather than search for invariants.
-- **The problem scale is very small** — the overhead of symmetry analysis may exceed that of direct computation.
-- **The group structure is too complex** — when |G| is very large, X/G is no simpler than X, and the invariants themselves may be more complex.
-
-## When to Use
-
-- Facing a complex system and seeking simplifying clues; needing to classify/identify objects (using orbits X/G).
-- Searching for conserved quantities or invariants (functions constant on orbits); reducing variables / dimensionality (quotient space, fundamental domain).
-- Determining equation solvability (Galois); counting symmetric configurations (Burnside/Pólya).
-- Inferring symmetry from conservation laws (inverse Noether).
-- **Designing equivariant/invariant networks or operators** (SO(3)/SE(3) equivariance, tropical semiring routing, conservation regularization).
-
-## Method
-
-### Step 1: Identify Transformations
-List all transformations the system may undergo, organize them into candidate symmetry groups, and verify the four axioms (closure / associativity / identity / inverse). Spatial transformations → E(n)/O(n)/similarity group; temporal → R or Z₂; algebraic → S_n/GL(n)/SL(n); logical → Z₂/Aut; gauge → U(1)/SU(2)/SU(3) (Lie groups, paired with Lie algebras). If the axioms are not satisfied, identify the actual structure (semigroup? groupoid?) — do not blindly treat it as a group. Pitfall: projections are not invertible and thus do not form a group; compositions of reflections yield rotations (closure holds).
-
-### Step 2: Find Invariants
-For G acting on X, find f such that f(g·x)=f(x).
-- **Finite groups**: Reynolds operator R(f)=1/|G| Σ f(g·x) (projection onto invariants, R²=R); Burnside's lemma |X/G|=1/|G| Σ |Fix(g)| counts orbits; elementary symmetric polynomials e_k form a complete set of invariants for S_n acting on R^n.
-- **Continuous groups (Lie groups)**: Use Lie algebra generators T_a·f=0 to solve for invariants (each generator removes one degree of freedom); integrating Killing vector fields yields invariant coordinates (e.g., SO(3) → r=√(x²+y²+z²)).
-- **Fixed-point analysis**: Stab(x) reveals the local degree of symmetry.
-- Common invariants: geometric (length/angle/Euler characteristic), physical (energy/momentum/angular momentum), algebraic (discriminant/trace/determinant/characteristic polynomial coefficients), combinatorial (number of orbits/equivalence class sizes).
-
-### Step 3: Use Invariants to Simplify
-- **Quotient space reasoning**: Work on X/G rather than X; |X| objects → |X/G| orbits (e.g., 230 space groups → 230 types in X/G).
-- **Fundamental domain** D: Each orbit intersects D in exactly one point, so one only needs to analyze D (O(2) → half-plane; SO(3) → spherical triangle; SL(2,Z) → |z|≥1, |Re(z)|≤1/2).
-- **Variable reduction**: Replace constrained variables with invariants (energy conservation eliminates one dynamical variable; angular momentum conservation → only the radial part matters; central force field L²=const → one-dimensional radial equation).
-
-### Step 4: Classify via Symmetry
-**Orbit–Stabilizer** |O(x)|=|G|/|Stab(x)|: the larger the stabilizer, the more symmetric the object and the smaller the orbit. Objects in the same orbit share all G-invariant values. Key question: Are the invariants complete? That is, does f(x)=f(y) ⇒ x and y are in the same orbit? If incomplete, different orbits may share the same invariant values, requiring more invariants or a finer group. Complete examples: S_n → e₁..e_n; O(n) → r²=Σx_i²; SL(2,C) → discriminant Δ=b²-4ac.
-
-### Step 5: Check Symmetry Breaking
-- **Spontaneous breaking**: The equations possess symmetry G, but solutions satisfy only H⊂G (the vacuum selects a direction, G→H). Goldstone's theorem: continuous G→H breaking produces dim(G/H) massless Goldstone modes (ferromagnet SO(3)→SO(2) yields 2 modes; superfluid U(1)→{e} yields 1 mode).
-- **Explicit breaking**: The equations themselves do not satisfy G (external forces / mass terms, e.g., quark masses break chiral symmetry SU(2)_L×SU(2)_R→SU(2)_V).
-- **Key analysis points**: Identify G→H, compute the number of Goldstone modes dim(G/H), and ensure the effective theory after breaking remains H-invariant.
-
-### Step 6: Algebraic Symmetry (Galois)
-Gal(f) is the permutation group of the roots. **An equation is solvable by radicals ⇔ Gal(f) is a solvable group** (subgroup chain G=G₀⊃...⊃G_k={e}, where each quotient is cyclic). Intuition for solvability: each quotient group corresponds to one radical extraction; a non-solvable group means "irreducible complexity." General equations of degree ≥5 have Gal(f)=S_5, which is not solvable (A_5 is the smallest non-solvable simple group); degree 4 has S_4, which is solvable; cyclotomic → cyclic group, solvable. Paradigm: **problem structure → permutation group → group solvability → problem solvability**.
-
-### Step 7: Physical Symmetry (Noether)
-**Noether's theorem**: The action S=∫L dt is invariant under G ⇒ conserved current Jμ, ∂_μ Jμ=0. Correspondences: time translation → energy; spatial translation → momentum; rotation → angular momentum; gauge U(1) → charge. Quantum: symmetry G → unitary representation on Hilbert space → irreducible representations classify energy levels → Wigner–Eckart theorem → selection rules. Hierarchy: classical (Lagrangian symmetry → Noether → simplified equations) → quantum (selection rules / degeneracies / Wigner–Eckart) → field theory (gauge symmetry → particle classification → Standard Model SU(3)×SU(2)×U(1)).
-
-## Common Errors
-
-| Error | Critique | Correct Approach |
-|-------|----------|-----------------|
-| Overlooking hidden symmetries | Surface asymmetry may conceal deeper symmetry, leading to unnecessary complexity | Try different representations (coordinate / basis changes) to find deeper symmetries |
-| Confusing approximate with exact symmetry | Approximate symmetry yields only approximate "conservation"; errors accumulate over time | Distinguish exact from approximate invariants; annotate the degree of approximation |
-| Overextending symmetry arguments | Not every problem has symmetry; forcing it leads to incorrect conclusions | Verify that the symmetry actually exists before using it; check the group axioms |
-| Ignoring symmetry breaking | Breaking may be the key mechanism | Attend to both symmetry and breaking; analyze G→H |
-| Failing to verify group properties | A candidate set of transformations may not satisfy closure / inverse | Verify all four axioms; if not satisfied, identify the actual structure |
-| Confusing orbit invariants with general invariants | f constant on O(x) ≠ f constant on X (the latter is trivially uninformative) | Be explicit that the invariant is G-invariant (constant on each orbit) |
-| Confusing discrete and continuous symmetries | Discrete groups do not admit Reynolds averaging (|G| may be infinite); continuous groups require the Lie algebra | Use Burnside counting for discrete groups; use the Lie algebra + Noether for continuous groups |
-| Intractable equivariant structures | Forcing exact classification requiring per-orbit symbolic determination into GPU training | Tensorize group actions, use linear representations to map to GEMM, pass the eight-dimension gate |
-
-## Operating Procedure
-
-When this skill is triggered, the output must include:
-
-1. **Transformation inventory**: `[Transformation N]: [description] [type]`, organized into candidate groups, noting which axioms were verified (closure ✓/✗ …)
-2. **Invariant discovery**: `[Under group G]: [invariant Y] remains unchanged`; for finite groups write the Reynolds form; use Burnside to count orbits
-3. **Simplification strategy**: `[Using invariant Y]: [how to simplify]`; note whether working on X/G or fundamental domain D, and estimate the dimensionality reduction
-4. **Symmetry classification**: `[Object x]: |O(x)|=, |Stab(x)|=`, orbit classification results, assessment of invariant completeness
-5. **Symmetry breaking check**: `[Symmetry Z]: [present/broken], mode [spontaneous/explicit]`; for continuous breaking note the number of Goldstone modes dim(G/H) and the effective group H
-6. **Algebraic / Physical symmetry**: For equation solving, note Gal(f) and its solvability; for physical systems, note the Noether correspondence `[Symmetry group G]: [Conservation law]`
-7. **Conclusion**: Which invariants were found, how much dimensionality reduction was achieved, and the classification results
-8. **[GPU feasibility]** (if used for algorithm / equivariant design) — whether group actions can be tensorized to GEMM, pass the eight-dimension gate, and annotate as friendly / retrofittable / unfriendly
-
-**The output must not present analysis alone without a conclusion.**
-
-## Relations to Other Skills
-
-- **Transformation thinking**: Symmetry is precisely invariance under transformations — two sides of the same coin.
-- **Abstraction thinking**: Invariants are the highest level of abstraction — independent of any particular representation.
-- **Modeling thinking**: Physical models are often guided by symmetry principles.
-- **Axiomatic thinking**: Group theory axioms are the mathematical foundation of symmetry.
-- **Topological thinking**: Topological invariants (Euler characteristic, homotopy groups) are invariants under continuous transformations.
-- **Algorithmic thinking**: Group-theoretic algorithms exploit symmetry for acceleration (e.g., FFT exploits the cyclic group structure).
-- **Discrete / Combinatorial thinking**: Pólya counting is the weighted generalization of Burnside's lemma.
-- **Modern mathematics activation**: `../../references/books/micro-lie-theory.md` (SO(3)/SE(3) equivariance, Lie group optimization), `abstract-algebra.md` (groups/semirings), `differential-geometry.md` (gauge symmetry/fiber bundles).

package/skills/symmetry-invariance/SKILL.md

@@ -1,139 +0,0 @@
----
-name: symmetry-invariance
-description: |
-  触发：群论分析、不变量计算、Galois 理论、Noether 定理、轨道分类、商空间推理、对称性破缺分析；或为算法设计等变性/守恒量/不变结构（如 SO(3)/SE(3) 等变网络、热带半环）时调用。
-  English: Trigger for group theory analysis, invariant computation, Galois theory, Noether's theorem, orbit classification, quotient space reasoning, symmetry breaking; or designing equivariance/conservation/invariant structures (e.g. SO(3)/SE(3) equivariant nets, tropical semiring) for algorithms.
----
-
-> **语言路由**：若用户消息为英文，请读取并遵循同目录下的 `SKILL.en.md`，按其操作规程以英文输出；中文消息则继续使用本文件。
-
-# ⚛️ 对称与不变性 / Symmetry & Invariance
-
-> "寻找事物在变换下保持不变的性质，揭示其内在规律。"
-> "Finding the properties that remain unchanged under transformations, revealing their underlying laws."
->
-> —— 群论、不变量理论、Noether 定理 / Group Theory, Invariant Theory, Noether's Theorem
->
-> Sophus Lie 想打造一把屠龙刀——解通微分方程。虽未屠尽所有的龙，但这把刀的锻造工艺（李群-李代数对应）流传了下来，后来用于线性化非线性问题、描述物理对称性、机器人状态估计。数学最迷人的地方：为特定问题发明的工具，在完全不同领域展现出远超初衷的价值。这正是「跨领域激活」的原型。
-
-## 核心原则 / Core Principle
-
-**在变化中寻找不变——这是理解复杂系统的捷径。对称性不是'好看'，而是系统深层结构的体现。每一个对称性都对应一个守恒量（Noether 定理），每一个不变量都是简化问题的钥匙。**
-
-> **数学形式化 / Mathematical Formalization**
->
-> 群 **G** 作用在集合 **X** 上：φ: G×X→X（φ(e,x)=x, φ(g,φ(h,x))=φ(gh,x)）。
->
-> **不变量** f: X→Y 使 f(g·x)=f(x) ∀g∈G。形式化：f 是 G-不变量 ⇔ f: X/G → Y 为商空间上的函数。不变量只区分轨道，不区分同轨道内元素。
->
-> **轨道** O(x)={g·x : g∈G}，等价关系 x~y ⇔ ∃g∈G, y=g·x，X/~ = X/G。**商空间** X/G 由所有轨道构成。分类的本质是在 X/G 上工作；找不变量即找在每条轨道取常值的函数。
->
-> **稳定子** Stab(x)={g∈G : g·x=x}，|O(x)|=|G|/|Stab(x)|——轨道越大对称越少。
->
-> 核心直觉：**不变量 = 轨道上的常值函数 = 商空间 X/G 上的函数**。完备不变量集将 X/G 嵌入更简单空间，实现完全分类。
->
-> 对称层次：几何对称（O(n)/E(n)，不变量距离面积）；代数对称（Galois 理论，判别式）；物理对称（Lie 群，能量/动量/角动量）；结构不变（同构/同伦等价）。
->
-> **Reynolds 算子**：有限群 G，R(f)=1/|G| Σ f(g·x)，R²=R，像正是所有不变量。**Burnside 引理**：|X/G|=1/|G| Σ |Fix(g)|。**Lie 代数生成元**：T_a·f=0 为微分方程，解之得不变量。**Noether 定理**：连续对称 → 守恒流 Jμ, ∂_μ Jμ=0。**Galois 理论**：方程可用根式求解 ⇔ Gal(f) 可解群。
->
-> 详细见 `original-texts.md`。
-
-## GPU 友好性 / GPU-Friendliness（横切检查）
-
-对称/不变结构能否上 GPU，取决于群操作的「张量化」程度——过 `../../references/gpu-friendly-math.md` 八维：
-
-- **群作用可张量化 → 友好**：若群作用是线性（矩阵乘），则等变层 = GEMM（如 SO(3) 等变用球谐/表示矩阵的批量 GEMM）。
-- **Reynolds 平均**：有限群平均 = 对 |G| 个变换结果求和，可批量并行（友好）；但 |G| 极大时不友好→用 Lie 代数连续近似。
-- **不变量作正则/约束**：作损失项时局部、廉价（友好）；作精确符号计算时不友好。
-- **热带半环**：min/+ 代数上的"对称"可落 GEMM-like 结构（友好，见 `../../references/gpu-friendly-math.md` 范例）。
-- **反模式**：把需要逐轨道符号判定的精确分类硬塞进训练——不可算。
-
-八维最低判定（正式术语）：**张量化**看群作用是否可批量作用于特征；**GEMM 可映射**看表示矩阵/球谐/投影是否落矩阵乘；**复杂度**看群阶、轨道数、积分/求积规模；**显存与 KV-Cache**看多副本/多轨道特征是否爆炸；**低精度稳定**看等变误差、规范选择、归一化是否稳健；**并行与通信**看群元素/空间点能否并行；**稀疏结构**看等变连接是否块结构化；**算子融合**看 group action、聚合、投影能否融合。
-
-> 配合 `../../references/books/micro-lie-theory.md`（SO(3)/SE(3) 等变）、`abstract-algebra.md`（群/半环）、`differential-geometry.md`（规范对称）。
-
-## 不适用场景 / When NOT to Use
-
-- **系统完全不对称且无规律**——无群作用可利用。
-- **需要精确数值解**——对称性给结构信息而非具体数值（告诉你"什么相等"不告诉你"等于多少"）。
-- **对称破缺是核心机制**（相变、自发破缺）——应转向分析破缺模式 G→H 而非找不变量。
-- **问题规模极小**——对称分析开销可能超过直接求解。
-- **群结构过于复杂**——|G| 极大时 X/G 不比 X 简单，不变量本身可能更复杂。
-
-## 何时使用 / When to Use
-
-- 面对复杂系统想找简化线索；需要分类/识别对象（利用轨道 X/G）。
-- 寻找回滚量或不变量（轨道上常值的函数）；减少变量/降维（商空间、基本域）。
-- 判断方程可解性（Galois）；计数对称构型（Burnside/Pólya）。
-- 从守恒律反推对称性（逆 Noether）。
-- **设计等变/不变网络或算子**（SO(3)/SE(3) 等变、热带半环路由、守恒正则）。
-
-## 方法流程 / Method
-
-### 第一步：识别可能的变换 / Identify Transformations
-列出系统可能经历的所有变换，组织为候选对称群，验证四条公理（封闭/结合/单位/逆）。空间变换→E(n)/O(n)/相似群；时间→R 或 Z₂；代数→S_n/GL(n)/SL(n)；逻辑→Z₂/Aut；规范→U(1)/SU(2)/SU(3)（Lie 群，配 Lie 代数）。不满足公理则识别实际结构（半群？广群？），不可盲目当群。陷阱：投影不可逆不是群；反射复合为旋转（封闭成立）。
-
-### 第二步：寻找不变量 / Find Invariants
-对 G 作用于 X，找 f(g·x)=f(x)。
-- **有限群**：Reynolds 算子 R(f)=1/|G| Σ f(g·x)（投影到不变量，R²=R）；Burnside 引理 |X/G|=1/|G| Σ |Fix(g)| 计轨道数；初等对称多项式 e_k 是 S_n 作用于 R^n 的完备不变量集。
-- **连续群（Lie 群）**：用 Lie 代数生成元 T_a·f=0 解不变量（每个生成元减一自由度）；Killing 向量场积分得不变坐标（如 SO(3)→r=√(x²+y²+z²)）。
-- **不动点分析**：Stab(x) 揭示局部对称程度。
-- 常见不变量：几何（长度/角度/欧拉示性数）、物理（能量/动量/角动量）、代数（判别式/迹/行列式/特征多项式系数）、组合（轨道数/等价类大小）。
-
-### 第三步：利用不变量简化 / Use Invariants to Simplify
-- **商空间推理**：在 X/G 上工作而非 X，|X| 对象→|X/G| 轨道（如 230 空间群→230 种 X/G）。
-- **基本域** D：每条轨道恰与 D 交于一点，只分析 D（O(2)→半平面；SO(3)→球面三角；SL(2,Z)→|z|≥1, |Re(z)|≤1/2）。
-- **变量缩减**：用不变量替代被约束变量（能量守恒减一动力学变量；角动量守恒→只关心径向；中心力场 L²=常数→一维径向方程）。
-
-### 第四步：利用对称性分类 / Classify via Symmetry
-**轨道-稳定子** |O(x)|=|G|/|Stab(x)|：稳定子越大对象越对称、轨道越小。同轨道对象共享所有 G-不变量值。关键问题：不变量是否完备？即 f(x)=f(y) ⇒ x,y 同轨道？不完备→不同轨道可有相同不变量值，需更多不变量或更精细群。完备例子：S_n→e₁..e_n；O(n)→r²=Σx_i²；SL(2,C)→判别式 Δ=b²-4ac。
-
-### 第五步：检查对称性破缺 / Check Symmetry Breaking
-- **自发破缺**：方程有对称 G，解只满足 H⊂G（真空选方向，G→H）。Goldstone 定理：连续 G→H 破缺产生 dim(G/H) 个无质量 Goldstone 模（铁磁 SO(3)→SO(2) 得 2 模；超流 U(1)→{e} 得 1 模）。
-- **显式破缺**：方程本身不满足 G（外力/质量项，如夸克质量破手征对称 SU(2)_L×SU(2)_R→SU(2)_V）。
-- **分析要点**：识别 G→H，算 Goldstone 模数 dim(G/H)，破缺后有效理论仍需 H-不变。
-
-### 第六步：代数对称分析 / Algebraic Symmetry (Galois)
-Gal(f) 为根的置换群。**方程可用根式求解 ⇔ Gal(f) 可解群**（子群链 G=G₀⊃...⊃G_k={e}，每步为循环商群）。可解直觉：每步商群对应一次根式提取；不可解群意味"不可绕过的复杂性"。≥5 次一般方程 Gal(f)=S_5 不可解（A_5 最小非可解单群）；4 次 S_4 可解；圆可分→循环群可解。范式：**问题结构→置换群→群可解性→问题可解性**。
-
-### 第七步：物理对称分析 / Physical Symmetry (Noether)
-**Noether 定理**：作用量 S=∫L dt 在 G 下不变 ⇒ 守恒流 Jμ, ∂_μ Jμ=0。对应：时间平移→能量；空间平移→动量；旋转→角动量；规范 U(1)→电荷。量子：对称 G→Hilbert 空间酉表示→不可约表示分类能级→Wigner-Eckat→选择规则。层次：经典（Lagrangian 对称→Noether→简化方程）→量子（选择规则/简并/Wigner-Eckart）→场论（规范对称→粒子分类→标准模型 SU(3)×SU(2)×U(1)）。
-
-## 常见错误 / Common Errors
-
-| 错误 / Error | 数学批评 / Critique | 正确做法 / Correct Approach |
-|-------------|-------------------|---------------------------|
-| 忽视隐藏对称性 | 表面不对称但深层有对称，遗漏致不必要复杂化 | 尝试不同表示（坐标/基底变换）找深层对称 |
-| 混淆近似与精确对称 | 近似对称"守恒"仅近似，误差随时间积累 | 区分精确/近似不变量，标注近似程度 |
-| 对称性论证过度 | 不是所有问题都有对称，强行引入得错误结论 | 确认对称确实存在再使用，验证群公理 |
-| 忽视对称破缺 | 破缺可能才是关键机制 | 同时关注对称与破缺，分析 G→H |
-| 未验证群性质 | 候选变换集未必满足封闭/逆 | 逐一验证四公理，不满足则识别实际结构 |
-| 混淆轨道不变量与一般不变量 | f 在 O(x) 常值 ≠ f 在 X 常值（后者平凡无信息） | 明确是 G-不变（每轨道常值） |
-| 混淆离散与连续对称 | 离散群无 Reynolds 平均（|G| 或无穷）；连续群需 Lie 代数 | 离散用 Burnside 计数；连续用 Lie 代数+Noether |
-| 等变结构不可算 | 把需逐轨道符号判定的精确分类塞进 GPU 训练 | 群作用张量化、用线性表示落 GEMM，过八维门 |
-
-## 操作规程 / Operating Procedure
-
-当本 skill 被触发时，输出必须包含：
-
-1. **变换清单**：`[变换N]: [描述] [类型]`，组织为候选群，标注验证了哪些公理（封闭✓/✗…）
-2. **不变量发现**：`[在群G下]: [不变量Y] 保持不变`；有限群写 Reynolds 形式；用 Burnside 计轨道数
-3. **简化策略**：`[利用不变量Y]: [如何简化]`；标注是否在 X/G 或基本域 D 上工作，估计维度缩减
-4. **对称分类**：`[对象x]: |O(x)|=, |Stab(x)|=`，轨道分类结果，评估不变量完备性
-5. **对称破缺检查**：`[对称性Z]: [存在/破缺]，方式[自发/显式]`；连续破缺标注 Goldstone 模数 dim(G/H) 与有效群 H
-6. **代数/物理对称**：方程求解标 Gal(f) 及可解性；物理系统标 Noether 对应 `[对称群G]: [守恒律]`
-7. **结论**：发现哪些不变量、实现多少维度缩减、分类结果
-8. **[GPU 可行性]**（若用于算法/等变设计）— 群作用能否张量化落 GEMM，过八维门，标注友好/可改造/不友好
-
-**输出不得只给分析而无结论。**
-
-## 与其他 skill 的关系 / Relations to Other Skills
-
-- **变换思想**：对称性就是变换下的不变性——一体两面。
-- **抽象化思想**：不变量是最高层次的抽象——独立于具体表示。
-- **建模思想**：物理模型常以对称性原理为指导。
-- **公理化思想**：群论公理是对称性的数学基础。
-- **拓扑思想**：拓扑不变量（欧拉示性数、同伦群）是连续变换下的不变量。
-- **算法思想**：群算法利用对称加速（如 FFT 利用循环群结构）。
-- **离散/组合思想**：Pólya 计数是 Burnside 引理的加权推广。
-- **现代数学激活**：`../../references/books/micro-lie-theory.md`（SO(3)/SE(3) 等变、李群优化）、`abstract-algebra.md`（群/半环）、`differential-geometry.md`（规范对称/纤维丛）。

package/skills/symmetry-invariance/original-texts.en.md

@@ -1,206 +0,0 @@
-# Mathematical Sources and Classic Texts
-
-## Group Theory (Galois, 1830s)
-
-**Evariste Galois** (1811-1832), on the eve of his death in a duel at age 20, founded group theory:
-
-> "Whether an equation can be solved by radicals depends on the structure of the permutation group of its roots."
-
-**Definition of a group**: A set G equipped with a binary operation · satisfying:
-1. **Closure**: For all a,b in G, a·b is in G
-2. **Associativity**: For all a,b,c in G, (a·b)·c = a·(b·c)
-3. **Identity element**: There exists e in G such that for all a in G, e·a = a·e = a
-4. **Inverse element**: For all a in G, there exists a^(-1) in G such that a·a^(-1) = a^(-1)·a = e
-
-**A group is the mathematical language of symmetry.**
-
-## Fundamental Theorem of Galois Theory
-
-The heart of Galois theory is the following profound correspondence:
-
-> Given a field extension L/K, if L is a Galois extension of K, then there is an order-reversing bijection between subgroups of the Galois group Gal(L/K) and intermediate fields between K and L.
-
-This reveals **a deep duality between algebraic structure (groups) and field structure (field extensions)**:
-- Subgroup H corresponds to the fixed field L^H
-- Normal subgroup corresponds to a Galois sub-extension
-- Index of a subgroup corresponds to the degree of the intermediate field
-
-**Historical significance**: This correspondence transforms "solvability of equations" into "solvability of groups" -- solvable groups correspond to equations solvable by radicals, thereby completely resolving the question of why equations of degree five and above cannot be solved by radicals.
-
-## Klein's Erlangen Program (1872)
-
-> "A geometry is the study of invariants under the action of a transformation group."
-
-Klein proposed using group theory to unify the various geometries:
-- Euclidean geometry = invariants under isometric transformations
-- Affine geometry = invariants under affine transformations
-- Projective geometry = invariants under projective transformations
-
-**Far-reaching impact**: The Erlangen Program not only unified the geometries of its time, but also anticipated the central 20th-century idea that "structure determines geometry" -- from topology to differential geometry, all can be subsumed under the framework of "group + invariants."
-
-## Lie Groups and Lie Algebras (1870s)
-
-**Sophus Lie** (1842-1899) extended Galois's finite group ideas to continuous transformation groups:
-
-> "Continuous symmetries are captured by infinitesimal generators; the Lie algebra is the local linearization of the Lie group."
-
-Key concepts:
-- **Lie group**: A structure that is simultaneously a group and a smooth manifold (e.g., SO(n), SU(n), GL(n,R))
-- **Lie algebra**: The tangent space of a Lie group at the identity, equipped with the Lie bracket [X,Y]
-- **Exponential map** exp: g -> G, recovering global symmetry from infinitesimal generators
-
-**Classification milestone**: Cartan's classification of semisimple Lie algebras (1894) yields four infinite families A_n, B_n, C_n, D_n and five exceptional algebras G_2, F_4, E_6, E_7, E_8 -- the "periodic table" of the world of continuous symmetries.
-
-**Physical significance**: The gauge group SU(3)xSU(2)xU(1) of particle physics is a direct application of Lie group theory.
-
-## Noether's Theorem (1915)
-
-> **Emmy Noether** (1882-1935): Every continuous symmetry corresponds to a conserved quantity.
-
-| Symmetry | Conserved Quantity |
-|----------|-------------------|
-| Time translation invariance | Conservation of energy |
-| Spatial translation invariance | Conservation of momentum |
-| Rotational invariance | Conservation of angular momentum |
-| Gauge invariance | Conservation of electric charge |
-
-**Significance**: This is one of the most profound theorems in physics -- it reveals the deep connection between the symmetries of nature and conservation laws. Noether proved this theorem in 1915 to resolve the problem of energy conservation in general relativity for Hilbert; its influence has far exceeded its original motivation.
-
-## Representation Theory (Frobenius, Schur, 1896-1905)
-
-> "To understand a group, the best way is to see how it acts on vector spaces."
-
-**Georg Frobenius** (1849-1917) invented the character theory of groups in 1896; **Issai Schur** (1875-1941) further developed the classification of irreducible representations:
-
-- **Group representation**: A homomorphism rho: G -> GL(V), mapping abstract group elements to linear transformations
-- **Character** chi(g) = Tr(rho(g)), the "fingerprint" of a representation -- distinct irreducible representations have distinct characters
-- **Irreducible representation**: A representation that cannot be further decomposed; the fundamental building block of representation theory
-
-**Core theorems**:
-- Maschke's theorem: Under appropriate conditions, every representation of a finite group decomposes completely into a direct sum of irreducible representations
-- Schur's lemma: Homomorphisms between irreducible representations are extremely simple (either zero or an isomorphism)
-- Character orthogonality relations: Characters of distinct irreducible representations are mutually orthogonal -- providing arithmetic constraints for classification
-
-**Applications span mathematics and physics**: From the classification of finite groups to the theory of angular momentum in quantum mechanics, representation theory is the bridge that transforms abstract symmetry into computable quantities.
-
-## Classification of Finite Simple Groups (1980s-2004)
-
-> "The classification of finite simple groups is the most enormous theorem in mathematical history -- its proof spans decades, hundreds of papers, and hundreds of mathematicians."
-
-**Finite simple groups** are the "atoms" of group theory -- groups that cannot be decomposed into smaller normal subgroups. The classification theorem asserts:
-
-**Every finite simple group belongs to one of the following categories**:
-1. **Cyclic groups** Z_p (p prime) -- the simplest simple groups
-2. **Alternating groups** A_n (n >= 5) -- the core of permutation groups
-3. **Groups of Lie type** (16 infinite families) -- including Chevalley groups, twisted groups, etc.
-4. **26 sporadic simple groups** -- the largest being the **Monster group** M, of order approximately 8x10^53
-
-The **ATLAS of Finite Groups** (1985) is the standard reference for this classification, recording structural data for all simple groups.
-
-**The miracle of the Monster group**: The surprising connection between the Monster and modular forms (McKay's "monstrous moonshine" conjecture, proved by Borcherds in 1998) reveals a deep link between finite groups and number theory -- Borcherds was awarded the Fields Medal for this work.
-
-## Burnside's Lemma
-
-> A finite group G acts on a set X. The number of orbits = (1/|G|) * Sum|X^g|, where X^g is the set of elements fixed by the transformation g.
-
-**Application**: Symmetry simplifies counting problems -- rather than enumerating one by one, one need only compute the average number of fixed points. Although named after Burnside, this result was in fact discovered earlier by Cauchy (1845) and Frobenius (1887) -- mathematical naming conventions are not always just.
-
-## Coxeter Groups (1934)
-
-**H.S.M. Coxeter** (1907-2003) systematically studied discrete symmetry groups generated by reflections:
-
-> "Coxeter groups are generated by reflections, with relations specified only by orders -- the ultimate classification framework for discrete geometric symmetry."
-
-Key structures:
-- **Coxeter diagram**: Each node represents a reflection generator; edges are labeled by orders m_ij
-- **Classification of finite Coxeter groups**: Parallel to Cartan's classification of semisimple Lie algebras -- A_n, B_n, D_n, H_3, H_4, I_2(n), etc.
-- The symmetry groups of **regular polyhedra and regular polytopes** are all Coxeter groups
-
-The **H_4** group (order 14400) is the symmetry group of the 4-dimensional 120-cell/600-cell, one of the most exquisite examples among finite Coxeter groups.
-
-**Impact**: Coxeter group theory unifies the theory of regular polyhedra, crystallography, Weyl groups in Lie theory, and the Bruhat decomposition in combinatorics.
-
-## Crystallographic Groups and 230 Space Groups
-
-> "The mathematical classification of crystal symmetry -- the 230 space groups exhaust all possible symmetry types for three-dimensional crystals."
-
-**History**:
-- **32 crystallographic point groups**: Classified independently by Schoenflies (1891) and Fedorov (1890)
-- **230 space groups**: The complete classification including translational symmetry (screw axes, glide planes), accomplished by Fedorov and Schoenflies
-- **Two-dimensional case**: 17 wallpaper groups, a more concise classification
-
-**Mathematical significance**: This is a classic example of "classifying natural structures using group theory" -- crystallography directly validates the spirit of the Erlangen Program. The International Tables for Crystallography serve as the standard reference for this classification.
-
-**Four dimensions and beyond**: The number of crystallographic groups grows dramatically in higher dimensions (4783 space groups in 4 dimensions), demonstrating the explosive complexity of symmetric structures as dimension increases.
-
-## Spontaneous Symmetry Breaking (Goldstone 1961; Higgs 1964)
-
-> "When the ground state of a system does not inherit the symmetry of its laws, the symmetry is spontaneously broken -- the most dramatic manifestation of symmetry in physics."
-
-**Goldstone's theorem** (1961): Spontaneous breaking of a continuous symmetry necessarily produces massless excitations (Goldstone bosons).
-
-**Higgs mechanism** (1964): When a gauge symmetry is spontaneously broken, Goldstone bosons are "eaten," becoming the mass of gauge fields -- this is precisely the mechanism by which W/Z particles acquire mass in the Standard Model of particle physics. The 2012 discovery of the Higgs boson at the LHC confirmed this theory.
-
-**Mathematical structure**: Let a group G act on a potential V(phi). If G is a symmetry but the minimum phi_0 is preserved only by a subgroup H of G, then the symmetry is broken from G to H, producing dim(G/H) Goldstone modes.
-
-**Philosophical significance**: The laws of nature are symmetric, but nature itself can be asymmetric -- symmetry guarantees not symmetric reality, only symmetric possibility.
-
-## Gauge Symmetry (Yang-Mills, 1954)
-
-> "Gauge symmetry is local -- the symmetry transformation can be chosen independently at each spacetime point. This demands the introduction of gauge fields to maintain consistency."
-
-**Yang-Mills theory** (1954): Yang Chen-Ning and Mills generalized the electromagnetic gauge principle (U(1)) to non-Abelian groups (SU(2)), founding non-Abelian gauge field theory.
-
-**The gauge group of the Standard Model**: SU(3)_C x SU(2)_L x U(1)_Y
-- SU(3): Color symmetry -> strong interaction (QCD)
-- SU(2)xU(1): Electroweak symmetry -> after Higgs breaking, yields electromagnetic U(1)
-
-**Yang-Mills existence and mass gap**: One of the seven Millennium Prize Problems of the Clay Mathematics Institute -- proving the mass gap of Yang-Mills theory remains unsolved and is one of the deepest open problems in mathematical physics.
-
-## Parity Violation (Wu Experiment, 1957)
-
-> "Physical laws may not hold in the mirror world -- this shatters one of the most intuitive symmetries of nature."
-
-**History**: Lee Tsung-Dao and Yang Chen-Ning (1956) proposed that the weak interaction might not conserve parity; **Chien-Shiung Wu** confirmed this prediction in 1957 with a Co-60 beta-decay experiment.
-
-**Significance**: Before this, physicists universally believed that parity conservation (left-right symmetry) was a fundamental principle of nature. The Wu experiment demonstrated that the weak interaction distinguishes left from right -- the first experimental evidence that symmetry is not universally valid, profoundly altering physicists' worldview.
-
-**Aftermath**: Parity violation led to the introduction of CP symmetry; in 1964, the Cronin-Fitch experiment discovered that CP is also violated, further narrowing the symmetries of nature.
-
-## CPT Symmetry in Particle Physics
-
-> "The CPT theorem asserts: any Lorentz-invariant local quantum field theory must be invariant under the combined C (charge conjugation), P (parity), and T (time reversal) transformation."
-
-**Components of CPT**:
-- **C** (charge conjugation): particle <-> antiparticle
-- **P** (parity): spatial inversion (mirror image)
-- **T** (time reversal): reversal of the direction of time flow
-
-Individually, C, P, and T can each be violated (the weak interaction violates P and C; K-meson decay violates CP), but the **combined CPT must be conserved** -- this is the most robust symmetry bulwark of quantum field theory. If CPT were experimentally violated, the foundational framework of quantum field theory would need to be rebuilt.
-
-## Weyl's Symmetry (1952)
-
-**Hermann Weyl** (1885-1955), in his later work *Symmetry* (1952), offered philosophical reflections on symmetry:
-
-> "Symmetry, as wide or as narrow as you may define its meaning, is one idea by which man through the ages has tried to comprehend and create order, beauty, and perfection."
-
-Weyl explores this theme from four perspectives: art (decorative patterns, architecture), nature (crystals, flowers), mathematics (group theory), and physics (relativity, quantum mechanics). This book fuses mathematical rigor with philosophical depth, and stands as an exemplary work of the "humanistic tradition in mathematics."
-
-## The Power of Invariants
-
-> "Finding what does not change amid change is the shortcut to understanding the world."
-
-Classic examples:
-- **Euler characteristic**: No matter how a polyhedron is continuously deformed, V - E + F = 2 remains invariant
-- **Topological genus**: A donut and a coffee cup share the same topological structure (one hole)
-- **Undecidability of the halting problem**: No matter how algorithms are improved, certain problems are inherently uncomputable
-
-## Symmetry and Everyday Life
-
-- **Temporal symmetry**: If the structure of one's day exhibits symmetry (e.g., a cycle of waking early, working, and resting), life becomes more efficient
-- **Information symmetry**: Symmetry of information is a prerequisite for fairness in games; asymmetry of information is the source of strategy
-- **Structural symmetry**: Symmetry in organizational structures (e.g., symmetric reporting relationships) typically implies stability
-
----
-
-**Summary**: Symmetry and invariants form the central thread of mathematics and physics. From Galois's finite groups to Lie's continuous groups, from Klein's geometric program to Noether's conservation laws, from the abstract structures of representation theory to the gauge symmetries of particle physics -- group theory provides a unified syntax, and invariants provide the semantics. This thread runs through pure mathematics and applied science alike, and stands as one of humanity's most powerful tools for understanding the order of the world.