math-skill 1.0.0 → 2.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (87) hide show
  1. package/README.en-US.md +313 -0
  2. package/README.md +313 -278
  3. package/agents/math-critic.en.md +235 -0
  4. package/agents/math-critic.md +237 -203
  5. package/commands/abstraction.md +11 -34
  6. package/commands/algorithmic-thinking.md +11 -34
  7. package/commands/ask.md +18 -21
  8. package/commands/axiomatization.md +11 -34
  9. package/commands/causal-inference.md +11 -34
  10. package/commands/discrete-combinatorial.md +11 -34
  11. package/commands/game-theory.md +11 -34
  12. package/commands/induction-analogy.md +11 -34
  13. package/commands/information-theory.md +11 -34
  14. package/commands/logic-deduction.md +11 -34
  15. package/commands/modeling.md +11 -37
  16. package/commands/optimization.md +11 -33
  17. package/commands/probability-statistics.md +11 -36
  18. package/commands/symmetry-invariance.md +11 -34
  19. package/commands/topological-thinking.md +11 -33
  20. package/commands/transformation.md +11 -33
  21. package/knowledge-base/overview.en.md +228 -0
  22. package/knowledge-base/overview.md +230 -230
  23. package/package.json +73 -59
  24. package/references/agentic-workflow.en.md +53 -0
  25. package/references/agentic-workflow.md +55 -0
  26. package/references/books/abstract-algebra.md +124 -0
  27. package/references/books/algebraic-geometry-rising-sea.md +171 -0
  28. package/references/books/differential-geometry.md +140 -0
  29. package/references/books/matrix-analysis.md +146 -0
  30. package/references/books/micro-lie-theory.md +116 -0
  31. package/references/books/optimization-ml.md +164 -0
  32. package/references/books/smooth-manifolds.md +105 -0
  33. package/references/gpu-friendly-math.en.md +65 -0
  34. package/references/gpu-friendly-math.md +67 -0
  35. package/references/inspiration.en.md +113 -0
  36. package/{docs → references}/inspiration.md +2 -0
  37. package/skills/abstraction/SKILL.en.md +117 -0
  38. package/skills/abstraction/SKILL.md +121 -264
  39. package/skills/abstraction/original-texts.en.md +163 -0
  40. package/skills/algorithmic-thinking/SKILL.en.md +132 -0
  41. package/skills/algorithmic-thinking/SKILL.md +138 -371
  42. package/skills/algorithmic-thinking/original-texts.en.md +253 -0
  43. package/skills/axiomatization/SKILL.en.md +144 -0
  44. package/skills/axiomatization/SKILL.md +151 -213
  45. package/skills/axiomatization/original-texts.en.md +154 -0
  46. package/skills/causal-inference/SKILL.en.md +147 -0
  47. package/skills/causal-inference/SKILL.md +151 -374
  48. package/skills/causal-inference/original-texts.en.md +136 -0
  49. package/skills/discrete-combinatorial/SKILL.en.md +124 -0
  50. package/skills/discrete-combinatorial/SKILL.md +131 -286
  51. package/skills/discrete-combinatorial/original-texts.en.md +184 -0
  52. package/skills/game-theory/SKILL.en.md +117 -0
  53. package/skills/game-theory/SKILL.md +123 -318
  54. package/skills/game-theory/original-texts.en.md +131 -0
  55. package/skills/induction-analogy/SKILL.en.md +145 -0
  56. package/skills/induction-analogy/SKILL.md +152 -310
  57. package/skills/induction-analogy/original-texts.en.md +140 -0
  58. package/skills/information-theory/SKILL.en.md +134 -0
  59. package/skills/information-theory/SKILL.md +140 -242
  60. package/skills/information-theory/original-texts.en.md +127 -0
  61. package/skills/logic-deduction/SKILL.en.md +130 -0
  62. package/skills/logic-deduction/SKILL.md +135 -280
  63. package/skills/logic-deduction/original-texts.en.md +160 -0
  64. package/skills/math-research-activator/SKILL.en.md +132 -0
  65. package/skills/math-research-activator/SKILL.md +136 -0
  66. package/skills/math-research-activator/original-texts.en.md +105 -0
  67. package/skills/{meta-selector → math-research-activator}/original-texts.md +104 -104
  68. package/skills/modeling/SKILL.en.md +135 -0
  69. package/skills/modeling/SKILL.md +139 -318
  70. package/skills/modeling/original-texts.en.md +162 -0
  71. package/skills/optimization/SKILL.en.md +129 -0
  72. package/skills/optimization/SKILL.md +135 -292
  73. package/skills/optimization/original-texts.en.md +167 -0
  74. package/skills/probability-statistics/SKILL.en.md +146 -0
  75. package/skills/probability-statistics/SKILL.md +151 -312
  76. package/skills/probability-statistics/original-texts.en.md +191 -0
  77. package/skills/symmetry-invariance/SKILL.en.md +135 -0
  78. package/skills/symmetry-invariance/SKILL.md +139 -358
  79. package/skills/symmetry-invariance/original-texts.en.md +206 -0
  80. package/skills/topological-thinking/SKILL.en.md +124 -0
  81. package/skills/topological-thinking/SKILL.md +128 -273
  82. package/skills/topological-thinking/original-texts.en.md +134 -0
  83. package/skills/transformation/SKILL.en.md +120 -0
  84. package/skills/transformation/SKILL.md +124 -264
  85. package/skills/transformation/original-texts.en.md +204 -0
  86. package/docs/CLAUDE.md +0 -187
  87. package/skills/meta-selector/SKILL.md +0 -188
@@ -0,0 +1,206 @@
1
+ # Mathematical Sources and Classic Texts
2
+
3
+ ## Group Theory (Galois, 1830s)
4
+
5
+ **Evariste Galois** (1811-1832), on the eve of his death in a duel at age 20, founded group theory:
6
+
7
+ > "Whether an equation can be solved by radicals depends on the structure of the permutation group of its roots."
8
+
9
+ **Definition of a group**: A set G equipped with a binary operation · satisfying:
10
+ 1. **Closure**: For all a,b in G, a·b is in G
11
+ 2. **Associativity**: For all a,b,c in G, (a·b)·c = a·(b·c)
12
+ 3. **Identity element**: There exists e in G such that for all a in G, e·a = a·e = a
13
+ 4. **Inverse element**: For all a in G, there exists a^(-1) in G such that a·a^(-1) = a^(-1)·a = e
14
+
15
+ **A group is the mathematical language of symmetry.**
16
+
17
+ ## Fundamental Theorem of Galois Theory
18
+
19
+ The heart of Galois theory is the following profound correspondence:
20
+
21
+ > 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.
22
+
23
+ This reveals **a deep duality between algebraic structure (groups) and field structure (field extensions)**:
24
+ - Subgroup H corresponds to the fixed field L^H
25
+ - Normal subgroup corresponds to a Galois sub-extension
26
+ - Index of a subgroup corresponds to the degree of the intermediate field
27
+
28
+ **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.
29
+
30
+ ## Klein's Erlangen Program (1872)
31
+
32
+ > "A geometry is the study of invariants under the action of a transformation group."
33
+
34
+ Klein proposed using group theory to unify the various geometries:
35
+ - Euclidean geometry = invariants under isometric transformations
36
+ - Affine geometry = invariants under affine transformations
37
+ - Projective geometry = invariants under projective transformations
38
+
39
+ **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."
40
+
41
+ ## Lie Groups and Lie Algebras (1870s)
42
+
43
+ **Sophus Lie** (1842-1899) extended Galois's finite group ideas to continuous transformation groups:
44
+
45
+ > "Continuous symmetries are captured by infinitesimal generators; the Lie algebra is the local linearization of the Lie group."
46
+
47
+ Key concepts:
48
+ - **Lie group**: A structure that is simultaneously a group and a smooth manifold (e.g., SO(n), SU(n), GL(n,R))
49
+ - **Lie algebra**: The tangent space of a Lie group at the identity, equipped with the Lie bracket [X,Y]
50
+ - **Exponential map** exp: g -> G, recovering global symmetry from infinitesimal generators
51
+
52
+ **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.
53
+
54
+ **Physical significance**: The gauge group SU(3)xSU(2)xU(1) of particle physics is a direct application of Lie group theory.
55
+
56
+ ## Noether's Theorem (1915)
57
+
58
+ > **Emmy Noether** (1882-1935): Every continuous symmetry corresponds to a conserved quantity.
59
+
60
+ | Symmetry | Conserved Quantity |
61
+ |----------|-------------------|
62
+ | Time translation invariance | Conservation of energy |
63
+ | Spatial translation invariance | Conservation of momentum |
64
+ | Rotational invariance | Conservation of angular momentum |
65
+ | Gauge invariance | Conservation of electric charge |
66
+
67
+ **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.
68
+
69
+ ## Representation Theory (Frobenius, Schur, 1896-1905)
70
+
71
+ > "To understand a group, the best way is to see how it acts on vector spaces."
72
+
73
+ **Georg Frobenius** (1849-1917) invented the character theory of groups in 1896; **Issai Schur** (1875-1941) further developed the classification of irreducible representations:
74
+
75
+ - **Group representation**: A homomorphism rho: G -> GL(V), mapping abstract group elements to linear transformations
76
+ - **Character** chi(g) = Tr(rho(g)), the "fingerprint" of a representation -- distinct irreducible representations have distinct characters
77
+ - **Irreducible representation**: A representation that cannot be further decomposed; the fundamental building block of representation theory
78
+
79
+ **Core theorems**:
80
+ - Maschke's theorem: Under appropriate conditions, every representation of a finite group decomposes completely into a direct sum of irreducible representations
81
+ - Schur's lemma: Homomorphisms between irreducible representations are extremely simple (either zero or an isomorphism)
82
+ - Character orthogonality relations: Characters of distinct irreducible representations are mutually orthogonal -- providing arithmetic constraints for classification
83
+
84
+ **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.
85
+
86
+ ## Classification of Finite Simple Groups (1980s-2004)
87
+
88
+ > "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."
89
+
90
+ **Finite simple groups** are the "atoms" of group theory -- groups that cannot be decomposed into smaller normal subgroups. The classification theorem asserts:
91
+
92
+ **Every finite simple group belongs to one of the following categories**:
93
+ 1. **Cyclic groups** Z_p (p prime) -- the simplest simple groups
94
+ 2. **Alternating groups** A_n (n >= 5) -- the core of permutation groups
95
+ 3. **Groups of Lie type** (16 infinite families) -- including Chevalley groups, twisted groups, etc.
96
+ 4. **26 sporadic simple groups** -- the largest being the **Monster group** M, of order approximately 8x10^53
97
+
98
+ The **ATLAS of Finite Groups** (1985) is the standard reference for this classification, recording structural data for all simple groups.
99
+
100
+ **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.
101
+
102
+ ## Burnside's Lemma
103
+
104
+ > 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.
105
+
106
+ **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.
107
+
108
+ ## Coxeter Groups (1934)
109
+
110
+ **H.S.M. Coxeter** (1907-2003) systematically studied discrete symmetry groups generated by reflections:
111
+
112
+ > "Coxeter groups are generated by reflections, with relations specified only by orders -- the ultimate classification framework for discrete geometric symmetry."
113
+
114
+ Key structures:
115
+ - **Coxeter diagram**: Each node represents a reflection generator; edges are labeled by orders m_ij
116
+ - **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.
117
+ - The symmetry groups of **regular polyhedra and regular polytopes** are all Coxeter groups
118
+
119
+ 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.
120
+
121
+ **Impact**: Coxeter group theory unifies the theory of regular polyhedra, crystallography, Weyl groups in Lie theory, and the Bruhat decomposition in combinatorics.
122
+
123
+ ## Crystallographic Groups and 230 Space Groups
124
+
125
+ > "The mathematical classification of crystal symmetry -- the 230 space groups exhaust all possible symmetry types for three-dimensional crystals."
126
+
127
+ **History**:
128
+ - **32 crystallographic point groups**: Classified independently by Schoenflies (1891) and Fedorov (1890)
129
+ - **230 space groups**: The complete classification including translational symmetry (screw axes, glide planes), accomplished by Fedorov and Schoenflies
130
+ - **Two-dimensional case**: 17 wallpaper groups, a more concise classification
131
+
132
+ **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.
133
+
134
+ **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.
135
+
136
+ ## Spontaneous Symmetry Breaking (Goldstone 1961; Higgs 1964)
137
+
138
+ > "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."
139
+
140
+ **Goldstone's theorem** (1961): Spontaneous breaking of a continuous symmetry necessarily produces massless excitations (Goldstone bosons).
141
+
142
+ **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.
143
+
144
+ **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.
145
+
146
+ **Philosophical significance**: The laws of nature are symmetric, but nature itself can be asymmetric -- symmetry guarantees not symmetric reality, only symmetric possibility.
147
+
148
+ ## Gauge Symmetry (Yang-Mills, 1954)
149
+
150
+ > "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."
151
+
152
+ **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.
153
+
154
+ **The gauge group of the Standard Model**: SU(3)_C x SU(2)_L x U(1)_Y
155
+ - SU(3): Color symmetry -> strong interaction (QCD)
156
+ - SU(2)xU(1): Electroweak symmetry -> after Higgs breaking, yields electromagnetic U(1)
157
+
158
+ **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.
159
+
160
+ ## Parity Violation (Wu Experiment, 1957)
161
+
162
+ > "Physical laws may not hold in the mirror world -- this shatters one of the most intuitive symmetries of nature."
163
+
164
+ **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.
165
+
166
+ **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.
167
+
168
+ **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.
169
+
170
+ ## CPT Symmetry in Particle Physics
171
+
172
+ > "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."
173
+
174
+ **Components of CPT**:
175
+ - **C** (charge conjugation): particle <-> antiparticle
176
+ - **P** (parity): spatial inversion (mirror image)
177
+ - **T** (time reversal): reversal of the direction of time flow
178
+
179
+ 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.
180
+
181
+ ## Weyl's Symmetry (1952)
182
+
183
+ **Hermann Weyl** (1885-1955), in his later work *Symmetry* (1952), offered philosophical reflections on symmetry:
184
+
185
+ > "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."
186
+
187
+ 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."
188
+
189
+ ## The Power of Invariants
190
+
191
+ > "Finding what does not change amid change is the shortcut to understanding the world."
192
+
193
+ Classic examples:
194
+ - **Euler characteristic**: No matter how a polyhedron is continuously deformed, V - E + F = 2 remains invariant
195
+ - **Topological genus**: A donut and a coffee cup share the same topological structure (one hole)
196
+ - **Undecidability of the halting problem**: No matter how algorithms are improved, certain problems are inherently uncomputable
197
+
198
+ ## Symmetry and Everyday Life
199
+
200
+ - **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
201
+ - **Information symmetry**: Symmetry of information is a prerequisite for fairness in games; asymmetry of information is the source of strategy
202
+ - **Structural symmetry**: Symmetry in organizational structures (e.g., symmetric reporting relationships) typically implies stability
203
+
204
+ ---
205
+
206
+ **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.
@@ -0,0 +1,124 @@
1
+ ---
2
+ name: topological-thinking
3
+ description: |
4
+ 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.
5
+ ---
6
+
7
+ # 🌀 Topological Thinking
8
+
9
+ > "You can stretch and bend but never tear — truly important properties survive continuous deformation."
10
+ >
11
+ > — Topology, Homology, Topological Data Analysis
12
+
13
+ ## Core Principle
14
+
15
+ 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).
16
+
17
+ > **Mathematical Formalization**
18
+ >
19
+ > **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.
20
+ >
21
+ > **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.
22
+ >
23
+ > **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}$.
24
+ >
25
+ > **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.
26
+ >
27
+ > **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.
28
+ >
29
+ > **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").
30
+ >
31
+ > See `original-texts.md` for details.
32
+
33
+ ## GPU-Friendliness (Cross-Cutting Check)
34
+
35
+ Whether topological structures can run on GPU depends on "locality" and "tensorizability" — pass through the eight-dimensional gate in `../../references/gpu-friendly-math.md`:
36
+
37
+ - **Local topological quantities → friendly**: Local homology or restriction maps per edge / per patch are small computations; batch-parallelizable and map to small GEMM operations.
38
+ - **Čech cohomology regularization**: Used as a local consistency loss — cheap, fusible (friendly); this is the key component of Tropical Sheaf Attention.
39
+ - **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.
40
+ - **Global exact homology computation**: Symbolic computation, non-trainable, not friendly.
41
+ - **Anti-pattern**: Embedding structures requiring global exact topological determination into the forward pass — intractable.
42
+
43
+ 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.
44
+
45
+ > Use in conjunction with `../../references/books/algebraic-geometry-rising-sea.md` (sheaves / Čech cohomology → attention and hallucination regularization), `smooth-manifolds.md`, `differential-geometry.md`.
46
+
47
+ ## When NOT to Use
48
+
49
+ - **Exact measurements are needed** — topology only captures qualitative structure (connectivity, holes); it provides no distances or angles.
50
+ - **Metric properties are central** — topologically equivalent spaces can have completely different metric behavior.
51
+ - **Purely discrete structures with no continuity** — topology is grounded in continuity.
52
+ - **Precise numerical decisions are required** (the question is "how much" rather than "is it connected") — the topological perspective is too coarse.
53
+
54
+ ## When to Use
55
+
56
+ - Need qualitative classification (not "how large" or "how far," but "is it connected" or "how many holes"); shape matters more than size.
57
+ - Need robustness analysis (invariants guarantee that properties do not vanish under continuous perturbation).
58
+ - Data has shape features that standard statistics cannot capture (clusters, voids, ring structures).
59
+ - Need invariants that survive deformation (topological insulators, topological error correction).
60
+ - **Design global consistency criteria for attention / representation learning** (Čech cohomology as hallucination regularizer, sheaf diffusion).
61
+
62
+ ## Method
63
+
64
+ ### Step 1: Identify Continuity Requirements
65
+ 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).
66
+
67
+ ### Step 2: Find Topological Invariants
68
+ - **Euler characteristic** $\chi=V-E+F$ (together with orientability, a complete invariant for surfaces).
69
+ - **Connectivity** (path-connectedness): Number of connected components $= \text{rank}\, H_0$; **Compactness** (Heine-Borel: compact in $\mathbb{R}^n$ $\iff$ bounded and closed).
70
+ - **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$.
71
+ - **Cohomology** $H^n$ (dual of homology, functorial; Čech cohomology detects global consistency obstructions).
72
+
73
+ ### Step 3: Classify Using Invariants
74
+ 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.
75
+
76
+ ### Step 4: Construct Topological Models
77
+ - **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).
78
+ - **Networks**: Connected components (reachability), cycles (redundant paths), clustering coefficients; network topology determines information propagation and robustness.
79
+ - **Systems**: Phase-space attractor topology — fixed points (points), limit cycles ($S^1$), chaotic attractors (fractals).
80
+ - **Algorithms**: Use sheaves / Čech cohomology to make the question "can local fragments be assembled into a globally consistent object" into a computable algebraic obstruction.
81
+
82
+ ### Step 5: Verify Topological Equivalence
83
+ 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).
84
+
85
+ ### Step 6: Topological Reasoning and Applications
86
+ - "$\pi_1(X)\neq 0$ → non-contractible loops exist → the system has unreachable states"
87
+ - "$X$ is connected → paths exist → transitions are always possible"
88
+ - "$\beta_1=3$ → the data has 3 significant ring structures"
89
+ - "$H^1\neq 0$ → local fragments are globally inconsistent → hallucination / inconsistency signal"
90
+
91
+ ## Common Errors
92
+
93
+ | Error | Critique | Correct Approach |
94
+ |---|---|---|
95
+ | Confusing topological equivalence with geometric similarity | Topological equivalence only requires homeomorphism, not metric proximity | Distinguish "topologically identical" from "geometrically similar" |
96
+ | Ignoring dimensional differences | $\mathbb{R}^1$ and $\mathbb{R}^2$ are not homeomorphic (invariance of domain, Brouwer) | Dimensional invariance is a mandatory check |
97
+ | 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 |
98
+ | 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 |
99
+ | Ignoring local vs. global topology | Local connectivity does not guarantee global connectivity; local homeomorphism $\neq$ global homeomorphism | Check local and global invariants separately |
100
+ | 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 |
101
+ | 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 |
102
+
103
+ ## Operating Procedure
104
+
105
+ The output must include:
106
+
107
+ 1. **Continuity requirements**: `[Homeomorphism / Homotopy / Diffeomorphism], variable: [distances / angles / sizes], invariant: [hole count / connectivity / dimension]`
108
+ 2. **Invariants**: `$\chi=$ , $\pi_1=$ , $\beta_n=$ , $H_0=$ , $H_1=$ , $H_2=$ , compactness = [yes / no]`
109
+ 3. **Classification**: `[Orientable / Non-orientable], $\chi=$ → [surface type]; $\pi_1=$ → [homotopy type]`
110
+ 4. **Topological model**: `[Simplicial complex / Filtration / Network graph / Phase space / Sheaf-Čech], construction method: [description]`
111
+ 5. **Equivalence verification**: `[Invariants all match / differences found], conclusion: [equivalent / distinct / uncertain]`
112
+ 6. **Reasoning**: `Because [topological property] → [conclusion]`
113
+ 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.
114
+
115
+ **Output must not consist of analysis alone without conclusions.**
116
+
117
+ ## Relations to Other Skills
118
+
119
+ - **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.
120
+ - **Abstraction Thinking**: Topology is the abstraction of spatial structure — remove the metric, keep only open sets and continuity.
121
+ - **Transformation Thinking**: Continuous deformation is a special class of transformations; homeomorphisms and homotopies are both transformations.
122
+ - **Modeling Thinking**: TDA is data modeling — use persistent homology to build topological models of point clouds and discover shapes that statistics misses.
123
+ - **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.
124
+ - **Modern Mathematics Activation**: `../../references/books/algebraic-geometry-rising-sea.md` (sheaves / Čech cohomology → sheaf attention and hallucination regularization), `smooth-manifolds.md`, `differential-geometry.md`.