math-skill 2.1.0 → 3.0.1

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.

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

@@ -1,221 +0,0 @@
-# 数学出处与经典文献 / Mathematical Sources and Classic Texts
-
-## 群论 / Group Theory (Galois, 1830s)
-
-**Évariste Galois**（1811-1832）在 20 岁死于决斗前夜，开创了群论：
-
-> "一个方程是否能用根式求解，取决于其根的置换群的结构。"
-> "Whether an equation can be solved by radicals depends on the structure of the permutation group of its roots."
-
-**群的定义**：一个集合 G 配备二元运算 ·，满足：
-1. **封闭性**：∀a,b ∈ G, a·b ∈ G
-2. **结合律**：∀a,b,c ∈ G, (a·b)·c = a·(b·c)
-3. **单位元**：∃e ∈ G, ∀a ∈ G, e·a = a·e = a
-4. **逆元**：∀a ∈ G, ∃a⁻¹ ∈ G, a·a⁻¹ = a⁻¹·a = e
-
-**群是对称性的数学语言。**
-
-## 伽罗瓦理论基本定理 / Fundamental Theorem of Galois Theory
-
-伽罗瓦理论的核心是以下深刻对应：
-
-> 给定域扩张 L/K，若 L 是 K 的伽罗瓦扩张，则伽罗瓦群 Gal(L/K) 的子群与 L/K 的中间域之间存在一一对应（反序保持）。
-> Given a Galois extension L/K, there is an order-reversing bijection between subgroups of Gal(L/K) and intermediate fields between K and L.
-
-这揭示了 **代数结构（群）与域结构（域扩张）的深层对偶性**：
-- 子群 H ↔ 固定域 L^H
-- 正规子群 ↔ 伽罗瓦子扩张
-- 子群的指数 ↔ 中间域的次数
-
-**历史意义**：这一对应将 "方程可解性" 转化为 "群的可解性"——可解群对应根式可解方程，从而彻底解决了五次及以上方程不可根式求解的问题。
-
-## Klein 爱尔兰根纲领 / Klein's Erlangen Program (1872)
-
-> "一种几何学就是研究一个变换群作用下的不变量。"
-> "A geometry is the study of invariants under the action of a transformation group."
-
-Klein 提出用群论来统一各种几何学：
-- 欧几里得几何 = 等距变换下的不变量
-- 仿射几何 = 仿射变换下的不变量
-- 射影几何 = 射影变换下的不变量
-
-**深远影响**：爱尔兰根纲领不仅统一了当时的几何学，更预示了 20 世纪数学中 "结构决定几何" 的核心思想——从拓扑到微分几何，均可纳入 "群+不变量" 的框架。
-
-## Lie 群与 Lie 代数 / Lie Groups and Lie Algebras (1870s)
-
-**Sophus Lie**（1842-1899）将 Galois 的有限群思想推广到连续变换群：
-
-> "连续对称性应由无穷小生成元来刻画——Lie 代数是 Lie 群的局部线性化。"
-> "Continuous symmetries are captured by infinitesimal generators; the Lie algebra is the local linearization of the Lie group."
-
-关键概念：
-- **Lie 群**：既是群又是光滑流形的结构（如 SO(n)、SU(n)、GL(n,R)）
-- **Lie 代数**：Lie 群在单位元处的切空间，配备 Lie 括号 [X,Y]
-- **指数映射** exp: g → G，从无穷小生成元恢复全局对称性
-
-**分类里程碑**：半单 Lie 代数的 Cartan 分类（1894）给出四种无限族 A_n, B_n, C_n, D_n 和五个例外代数 G₂, F₄, E₆, E₇, E₈——这是连续对称性世界中的 "元素周期表"。
-
-**物理意义**：粒子物理中的规范群 SU(3)×SU(2)×U(1) 正是 Lie 群理论的直接应用。
-
-## Noether 定理 / Noether's Theorem (1915)
-
-> Emmy Noether（1882-1935）：每一个连续对称性都对应一个守恒量。
-> Every continuous symmetry corresponds to a conserved quantity.
-
-| 对称性 / Symmetry | 守恒量 / Conserved Quantity |
-|-------------------|---------------------------|
-| 时间平移不变性 | 能量守恒 |
-| 空间平移不变性 | 动量守恒 |
-| 旋转不变性 | 角动量守恒 |
-| 规范不变性 | 电荷守恒 |
-
-**意义**：这是物理学中最深刻的定理之一——它揭示了自然界的对称性与守恒律之间的深层联系。Noether 在 1915 年为 Hilbert 解决广义相对论中的能量守恒问题而证明此定理，其影响远超最初的动机。
-
-## 表示论 / 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）在 1896 年发明了群的特征标理论，**Issai Schur**（1875-1941）进一步发展了不可约表示的分类：
-
-- **群表示**：同态 ρ: G → GL(V)，将抽象群元素映射为线性变换
-- **特征标** χ(g) = Tr(ρ(g))，是表示的 "指纹"——不同不可约表示有不同特征标
-- **不可约表示**：不能进一步分解的表示，是表示论的基本构件
-
-**核心定理**：
-- Maschke 定理：有限群的表示在适当条件下完全可分解为不可约表示之和
-- Schur 引理：不可约表示之间的同态极为简单（零或同构）
-- 特征标正交关系：不同不可约表示的特征标彼此正交——这给出了分类的算术约束
-
-**应用遍及数学与物理**：从有限群的分类到量子力学中的角动量理论，表示论是将抽象对称性转化为可计算量的桥梁。
-
-## 有限单群分类 / 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."
-
-**有限单群**是群论的 "原子"——不可分解为更小的正规子群的群。分类定理断言：
-
-**所有有限单群属于以下类别**：
-1. **循环群** Z_p（p 为素数）——最简单的单群
-2. **交错群** A_n（n ≥ 5）——置换群的核心
-3. **Lie 型群**（16 个无限族）——包括 Chevalley 群、扭曲群等
-4. **26 个散在单群**——最大的是 **Monster 群** M，阶 ≈ 8×10⁵³
-
-**ATLAS of Finite Groups**（1985）是这一分类的标准参考书，记录了所有单群的结构数据。
-
-**Monster 群的奇迹**：Monster 与模形式之间的惊人联系（McKay 的 "月光猜想"、Borcherds 的证明，1998）揭示了有限群与数论的深层联系——Borcherds 因此获 Fields 奖。
-
-## Burnside 引理 / Burnside's Lemma
-
-> 一个有限群 G 作用在集合 X 上，轨道数 = (1/|G|) Σ|X^g|，其中 X^g 是在变换 g 下不变的元素集合。
-
-**应用**：计数问题中利用对称性简化——不需要逐个计数，只需计算平均固定点数。此结果虽以 Burnside 命名，实则由 Cauchy（1845）和 Frobenius（1887）更早发现——数学命名的惯例并不总是公正的。
-
-## Coxeter 群 / Coxeter Groups (1934)
-
-**H.S.M. Coxeter**（1907-2003）系统研究了由反射生成的离散对称群：
-
-> "Coxeter 群是由反射生成的群，其生成关系仅涉及阶数——这是离散几何对称性的终极分类框架。"
-> "Coxeter groups are generated by reflections, with relations specified only by orders—the ultimate classification framework for discrete geometric symmetry."
-
-关键结构：
-- **Coxeter 图**：每个节点代表一个反射生成元，边标注阶数 m_ij
-- **有限 Coxeter 群分类**：与半单 Lie 代数的 Cartan 分类平行——A_n, B_n, D_n, H₃, H₄, I₂(n) 等
-- **正多面体与正多胞体**的对称群均为 Coxeter 群
-
-**H₄** 群（阶 14400）是 4 维 120 -cell / 600-cell 的对称群，是有限 Coxeter 群中最精妙的例子之一。
-
-**影响**：Coxeter 群理论统一了正多面体理论、晶体学、Lie 理论中的 Weyl 群，以及组合学中的 Bruhat 分解。
-
-## 晶体学群与 230 空间群 / Crystallographic Groups and 230 Space Groups
-
-> "晶体对称性的数学分类——230 个空间群穷尽了三维晶体所有可能的对称类型。"
-> "The mathematical classification of crystal symmetry—the 230 space groups exhaust all possible symmetry types for three-dimensional crystals."
-
-**历史**：
-- **32 个晶体点群**：由 Schoenflies（1891）和 Fedorov（1890）独立分类
-- **230 个空间群**：含平移对称（螺旋轴、滑移面）的完整分类，由 Fedorov 和 Schoenflies 完成
-- **二维情形**：17 个壁纸群（wallpaper groups），分类更为简洁
-
-**数学意义**：这是 "用群论分类自然结构" 的经典范例——晶体学直接验证了爱尔兰根纲领的精神。国际晶体学表（International Tables for Crystallography）是这一分类的标准参考。
-
-**四维及以上**：高维晶体学群的数量急剧增长（4 维有 4783 个空间群），展示了维数增加后对称结构的爆炸性复杂化。
-
-## 自发对称性破缺 / 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 定理**（1961）：连续对称性的自发破缺必然产生无质量的激发态（Goldstone 玻色子）。
-
-**Higgs 机制**（1964）：当规范对称性被自发破缺时，Goldstone 玻色子被 "吃掉"，转化为规范场的质量——这正是粒子物理 Standard Model 中 W/Z 粒子获得质量的机制。2012 年 LHC 发现 Higgs 粒子，确认了这一理论。
-
-**数学结构**：设群 G 作用于势能 V(φ)，若 G 对称但极小值点 φ₀ 仅被 G 的子群 H 保持，则对称性从 G 破缺到 H，产生 dim(G/H) 个 Goldstone 模。
-
-**哲学意义**：自然定律是对称的，但自然界可以不对称——对称性不保证对称的现实，只保证对称的可能性。
-
-## 规范对称性 / 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 理论**（1954）：杨振宁与 Mills 将电磁规范原理（U(1)）推广到非阿贝尔群（SU(2)），开创了非阿贝尔规范场论。
-
-**Standard Model 的规范群**：SU(3)_C × SU(2)_L × U(1)_Y
-- SU(3)：色对称性 → 强相互作用（QCD）
-- SU(2)×U(1)：电弱对称性 → 经 Higgs 破缺后给出电磁 U(1)
-
-**Yang-Mills 存性与质量间隙**：Clay 数学研究所的七大千禧问题之一——证明 Yang-Mills 理论的质量间隙至今未解决，是数学物理最深层的开放问题之一。
-
-## 宇称不守恒 / Parity Violation (Wu Experiment, 1957)
-
-> "物理定律可能在镜像世界中不成立——这打破了自然界最基本的直觉对称性。"
-> "Physical laws may not hold in the mirror world—this shatters the most intuitive symmetry of nature."
-
-**历史**：李政道与杨振宁（1956）提出弱相互作用可能不守恒宇称；**吴健雄**（Chien-Shiung Wu）在 1957 年用 Co-60 β 衰变实验确认了这一预言。
-
-**意义**：在此之前，物理学家普遍相信宇称守恒（左右对称）是自然的基本原理。Wu 实验证明弱相互作用区分左右——这是对称性并非普遍有效的第一个实验证据，深刻改变了物理学家的世界观。
-
-**后续**：宇称破缺导致引入 CP 对称性；1964 年 Cronin-Fitch 实验发现 CP 也破缺，进一步缩小了自然界的对称性。
-
-## CPT 对称性 / CPT Symmetry in Particle Physics
-
-> "CPT 定理断言：任何 Lorentz 不变的局部量子场论必须在 C（电荷共轭）、P（宇称）、T（时间反演）的联合变换下不变。"
-> "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."
-
-**CPT 的分量**：
-- **C**（电荷共轭）：粒子 ↔ 反粒子
-- **P**（宇称）：空间反演（镜像）
-- **T**（时间反演）：时间流向逆转
-
-单独的 C、P、T 均可被打破（弱相互作用破 P 和 C，K 介子衰变破 CP），但 **CPT 联合必须守恒**——这是量子场论最坚固的对称性壁垒。若 CPT 被实验打破，将意味着量子场论的基础架构需要重建。
-
-## Weyl 的对称性哲学 / Weyl's Symmetry (1952)
-
-**Hermann Weyl**（1885-1955）在晚年著作 *Symmetry*（1952）中给出了对称性的哲学沉思：
-
-> "对称性，无论广义还是狭义，都是一种理念，人类自古以来就试图借此理解和创造秩序、美与完美。"
-> "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 从艺术（装饰纹样、建筑）、自然（晶体、花朵）、数学（群论）和物理（相对论、量子力学）四个维度展开讨论。此书将数学的严谨与哲学的深邃融为一体，是 "数学人文传统" 的典范之作。
-
-## 不变量的力量 / The Power of Invariants
-
-> "在变化中找到不变的东西，这是理解世界的捷径。"
-> "Finding what does not change amid change is the shortcut to understanding the world."
-
-经典案例：
-- **Euler 示性数**：无论怎样连续变形多面体，V - E + F = 2 不变
-- **拓扑亏格**：甜甜圈和咖啡杯有相同的拓扑结构（一个洞）
-- **图灵机停机问题的不可判定性**：无论算法如何改进，某些问题本质上不可计算
-
-## 对称性与日常生活 / Symmetry and Everyday Life
-
-- **时间对称**：如果每天的安排有对称性（如早起-工作-休息的循环），生活会更高效
-- **信息对称**：博弈中信息对称是公平的前提，信息不对称是策略的来源
-- **结构对称**：组织结构中的对称性（如对称的汇报关系）通常意味着稳定
-
----
-
-**总结 / Summary**：对称性与不变量是数学与物理的核心主线。从 Galois 的有限群到 Lie 的连续群，从 Klein 的几何纲领到 Noether 的守恒定律，从表示论的抽象结构到粒子物理的规范对称——群论提供了统一的语法，不变量提供了语义。这条主线贯穿纯数学与应用科学，是人类理解世界秩序的最强有力的工具之一。

package/skills/topological-thinking/SKILL.en.md

@@ -1,124 +0,0 @@
----
-name: topological-thinking
-description: |
-  Trigger for topological data analysis (TDA), persistent homology, homology/fundamental group computation, simplicial complexes & filtrations; or designing connectivity/robustness/cohomology-consistency criteria (e.g. Čech cohomology as hallucination regularizer, sheaf attention) for algorithms.
----
-
-# 🌀 Topological Thinking
-
-> "You can stretch and bend but never tear — truly important properties survive continuous deformation."
->
-> — Topology, Homology, Topological Data Analysis
-
-## Core Principle
-
-Topology studies properties invariant under continuous deformation. A donut and a coffee cup are topologically equivalent — both have one hole. The core insight: when exact distances are unimportant, topology captures essential structure — connectivity, holes, dimension. In the context of this skill set, topological thinking directly underpins cellular-layer diffusion attention and Čech cohomology regularization (see the activator examples).
-
-> **Mathematical Formalization**
->
-> **Homeomorphism**: A continuous bijection with continuous inverse $h: X\to Y$; the standard for topological equivalence. **Homotopy**: The deformation process itself is continuous; coarser than homeomorphism. **Diffeomorphism**: A smooth bijection with smooth inverse; the standard of differential topology.
->
-> **Euler characteristic** $\chi=V-E+F$: For convex polyhedra $\chi=2$, for the torus $\chi=0$; together with orientability, it is a complete topological invariant for surfaces.
->
-> **Fundamental group** $\pi_1(X)$: Based loops modulo homotopy deformation; $\pi_1(S^1)=\mathbb{Z}$ (winding number), $\pi_1(S^2)=0$ (all loops are contractible), $\pi_1(\text{torus})=\mathbb{Z}\times\mathbb{Z}$.
->
-> **Homology groups** $H_n(X)$: Count $n$-dimensional "holes": $H_0$ = connected components, $H_1$ = 1-dimensional holes (loops), $H_2$ = 2-dimensional voids. **Betti numbers** $\beta_n=\text{rank}\, H_n$: $\beta_0$ = number of connected components, $\beta_1$ = number of 1-dimensional holes, $\beta_2$ = number of 2-dimensional voids.
->
-> **Simplicial complex**: A topological space model assembled from simplices (points / line segments / triangles). **Filtration**: Progressively increase the neighborhood radius; at each radius, construct a simplicial complex. **Persistent homology**: Compute homology groups along the filtration; long bars = genuine topological features, short bars = noise.
->
-> **Cohomology** $H^n(X)$: The dual of homology (functorial, carries a ring structure). Čech cohomology detects global consistency obstructions from local data — $H^1\neq 0$ means local fragments cannot be assembled into a globally consistent object (this is precisely the algebraic criterion for "hallucination").
->
-> See `original-texts.md` for details.
-
-## GPU-Friendliness (Cross-Cutting Check)
-
-Whether topological structures can run on GPU depends on "locality" and "tensorizability" — pass through the eight-dimensional gate in `../../references/gpu-friendly-math.md`:
-
-- **Local topological quantities → friendly**: Local homology or restriction maps per edge / per patch are small computations; batch-parallelizable and map to small GEMM operations.
-- **Čech cohomology regularization**: Used as a local consistency loss — cheap, fusible (friendly); this is the key component of Tropical Sheaf Attention.
-- **Persistent homology (TDA)**: Constructing simplicial complexes and boundary matrix reduction often involves irregular sparsity / serial reduction — a classic "beautiful but intractable" case → reform via approximation / sampling / distributed computation.
-- **Global exact homology computation**: Symbolic computation, non-trainable, not friendly.
-- **Anti-pattern**: Embedding structures requiring global exact topological determination into the forward pass — intractable.
-
-Eight-dimensional minimum assessment (formal terms): **Tensorization** — whether topological quantities admit local batching; **GEMM-mappability** — whether restriction maps, boundary operators, and local Laplacians fall into matrix multiplication; **Complexity** — whether persistent homology / boundary matrix reduction is superlinear; **Memory and KV-Cache** — whether simplicial complexes, boundary matrices, and cover overlaps are compressible; **Low-precision stability** — whether small singular values, sorting, and thresholding are numerically robust; **Parallelism and communication** — whether cover patches / local complexes are independent; **Sparse structure** — whether the complex / graph is structurally sparse; **Operator fusion** — whether local consistency losses can be fused.
-
-> Use in conjunction with `../../references/books/algebraic-geometry-rising-sea.md` (sheaves / Čech cohomology → attention and hallucination regularization), `smooth-manifolds.md`, `differential-geometry.md`.
-
-## When NOT to Use
-
-- **Exact measurements are needed** — topology only captures qualitative structure (connectivity, holes); it provides no distances or angles.
-- **Metric properties are central** — topologically equivalent spaces can have completely different metric behavior.
-- **Purely discrete structures with no continuity** — topology is grounded in continuity.
-- **Precise numerical decisions are required** (the question is "how much" rather than "is it connected") — the topological perspective is too coarse.
-
-## When to Use
-
-- Need qualitative classification (not "how large" or "how far," but "is it connected" or "how many holes"); shape matters more than size.
-- Need robustness analysis (invariants guarantee that properties do not vanish under continuous perturbation).
-- Data has shape features that standard statistics cannot capture (clusters, voids, ring structures).
-- Need invariants that survive deformation (topological insulators, topological error correction).
-- **Design global consistency criteria for attention / representation learning** (Čech cohomology as hallucination regularizer, sheaf diffusion).
-
-## Method
-
-### Step 1: Identify Continuity Requirements
-Specify the equivalence standard: homeomorphism / homotopy / diffeomorphism. Determine what may vary (distances, angles, sizes) and what must remain fixed (number of holes, connectivity, dimension). Core distinction: variable (surface / metric) vs. invariant (structure / topology).
-
-### Step 2: Find Topological Invariants
-- **Euler characteristic** $\chi=V-E+F$ (together with orientability, a complete invariant for surfaces).
-- **Connectivity** (path-connectedness): Number of connected components $= \text{rank}\, H_0$; **Compactness** (Heine-Borel: compact in $\mathbb{R}^n$ $\iff$ bounded and closed).
-- **Fundamental group** $\pi_1(X)$; **Homology groups** $H_n$ ($H_0$ = components, $H_1$ = 1-dimensional holes, $H_2$ = 2-dimensional voids); **Betti numbers** $\beta_n=\text{rank}\, H_n$.
-- **Cohomology** $H^n$ (dual of homology, functorial; Čech cohomology detects global consistency obstructions).
-
-### Step 3: Classify Using Invariants
-Same $\chi$ → same surface type; same $\pi_1$ → same homotopy type; compact surfaces are completely classified by orientability + $\chi$. Classification relies on invariants — look past the surface to the structure.
-
-### Step 4: Construct Topological Models
-- **Data**: For point clouds, construct a filtration; compute the simplicial complex and homology at each radius; extract persistent homology (barcode / persistence diagram; long bars = genuine features, short bars = noise).
-- **Networks**: Connected components (reachability), cycles (redundant paths), clustering coefficients; network topology determines information propagation and robustness.
-- **Systems**: Phase-space attractor topology — fixed points (points), limit cycles ($S^1$), chaotic attractors (fractals).
-- **Algorithms**: Use sheaves / Čech cohomology to make the question "can local fragments be assembled into a globally consistent object" into a computable algebraic obstruction.
-
-### Step 5: Verify Topological Equivalence
-Attempt to construct an explicit homeomorphism / homotopy equivalence; check that invariants match. Different invariants → topologically distinct (reliable negative); all invariants match → possibly equivalent (invariants may be incomplete; cannot confirm).
-
-### Step 6: Topological Reasoning and Applications
-- "$\pi_1(X)\neq 0$ → non-contractible loops exist → the system has unreachable states"
-- "$X$ is connected → paths exist → transitions are always possible"
-- "$\beta_1=3$ → the data has 3 significant ring structures"
-- "$H^1\neq 0$ → local fragments are globally inconsistent → hallucination / inconsistency signal"
-
-## Common Errors
-
-| Error | Critique | Correct Approach |
-|---|---|---|
-| Confusing topological equivalence with geometric similarity | Topological equivalence only requires homeomorphism, not metric proximity | Distinguish "topologically identical" from "geometrically similar" |
-| Ignoring dimensional differences | $\mathbb{R}^1$ and $\mathbb{R}^2$ are not homeomorphic (invariance of domain, Brouwer) | Dimensional invariance is a mandatory check |
-| Confusing connected with path-connected | Connected $\neq$ path-connected (topologist's sine curve); path-connected $\Rightarrow$ connected, but not vice versa | Explicitly label which notion of connectivity is used |
-| Over-reliance on a single invariant | $\chi$ alone cannot distinguish all spaces (many spaces share $\chi=0$) | Use combinations of invariants; annotate uncertainty when incomplete |
-| Ignoring local vs. global topology | Local connectivity does not guarantee global connectivity; local homeomorphism $\neq$ global homeomorphism | Check local and global invariants separately |
-| Confusing homology with homotopy | $H_1(X)$ is the abelianization of $\pi_1(X)$; homology is a coarsening of homotopy | Specify whether $\pi_1$ (homotopy) or $H_1$ (homology) is used |
-| Embedding global exact homology into training | Persistent homology / symbolic homology involves irregular sparsity and serial reduction; intractable | Use local cohomology losses / approximation / sampling; pass through the GPU eight-dimensional gate |
-
-## Operating Procedure
-
-The output must include:
-
-1. **Continuity requirements**: `[Homeomorphism / Homotopy / Diffeomorphism], variable: [distances / angles / sizes], invariant: [hole count / connectivity / dimension]`
-2. **Invariants**: `$\chi=$ , $\pi_1=$ , $\beta_n=$ , $H_0=$ , $H_1=$ , $H_2=$ , compactness = [yes / no]`
-3. **Classification**: `[Orientable / Non-orientable], $\chi=$ → [surface type]; $\pi_1=$ → [homotopy type]`
-4. **Topological model**: `[Simplicial complex / Filtration / Network graph / Phase space / Sheaf-Čech], construction method: [description]`
-5. **Equivalence verification**: `[Invariants all match / differences found], conclusion: [equivalent / distinct / uncertain]`
-6. **Reasoning**: `Because [topological property] → [conclusion]`
-7. **[GPU Feasibility]** (if used for algorithm design) — whether topological quantities are local and batchable / GEMM-mappable; pass through the eight-dimensional gate; reform global exact homology via approximation.
-
-**Output must not consist of analysis alone without conclusions.**
-
-## Relations to Other Skills
-
-- **Symmetry and Invariance**: Topological invariants are invariants under continuous transformations — sharing the "find the invariants" logic, but topology focuses on continuous deformation rather than group actions.
-- **Abstraction Thinking**: Topology is the abstraction of spatial structure — remove the metric, keep only open sets and continuity.
-- **Transformation Thinking**: Continuous deformation is a special class of transformations; homeomorphisms and homotopies are both transformations.
-- **Modeling Thinking**: TDA is data modeling — use persistent homology to build topological models of point clouds and discover shapes that statistics misses.
-- **Probability and Statistics**: TDA complements statistical shape analysis — statistics focuses on means and variances (quantities), TDA focuses on connectivity and voids (qualities); they are complementary.
-- **Modern Mathematics Activation**: `../../references/books/algebraic-geometry-rising-sea.md` (sheaves / Čech cohomology → sheaf attention and hallucination regularization), `smooth-manifolds.md`, `differential-geometry.md`.