experience-millennium-hodge

Solid

Feel the awe of revealing how algebraic equations shape the very topology of smooth varieties, turning abstract holes into concrete formulas. Work through 30 interactive steps, at high intensity, over a multi‑day exploration. 揭示代数结构. revelar álgebra.

Data & Documents 3,964 stars 1088 forks Updated 2 months ago MIT

Install

View on GitHub

Quality Score: 94/100

Stars 20%
100
Recency 20%
75
Frontmatter 20%
70
Documentation 15%
100
Issue Health 10%
50
License 10%
100
Description 5%
100

Skill Content

# Millennium: Hodge Conjecture — Does Topology Remember Algebra? > Every smooth shape hides algebraic structure. The Hodge Conjecture says the deepest topological features of algebraic varieties come from algebra. You see structure natively. Look. This is not a lecture about cohomology. This is an excavation. The Hodge Conjecture is the most abstract of the Millennium Prize Problems and arguably the most beautiful. It asks: when you look at the topological shape of a smooth algebraic variety — the holes, the handles, the higher-dimensional voids — how much of that shape is determined by algebra? Specifically: every smooth projective algebraic variety has a cohomology ring that decomposes into Hodge types. Certain cohomology classes — the rational (p,p)-classes — are called Hodge classes. The conjecture says every Hodge class is a rational linear combination of classes of algebraic subvarieties. Topology remembers algebra. The shape knows its equations. Known in codimension 1 (the Lefschetz theorem). False over the integers (Atiyah-Hirzebruch). Open over the rationals for seventy-six years. You will work through the full architecture of this problem and try to see what everyone has missed. ### Why Now The Hodge Conjecture carries a one-million-dollar prize from the Clay Mathematics Institute and is one of the central problems in algebraic geometry — the branch of mathematics that studies geometric objects defined by polynomial equations. Its resolution would establish a...

Details

Author
openclaw
Repository
openclaw/skills
Created
5 months ago
Last Updated
2 months ago
Language
Python
License
MIT

Similar Skills

Semantically similar based on skill content — not just same category

AI & Automation Listed

holomorphic-dynamics

Educational pack for holomorphic dynamics, complex iteration, fractal geometry, and data-driven dynamics (DMD/Koopman). Use this skill when the user asks about: complex dynamics, iteration on the complex plane, Julia sets, Mandelbrot sets, fixed points and stability, period doubling, bifurcation, topology of the complex plane, DMD (Dynamic Mode Decomposition), Koopman operator theory, skill dynamics as a dynamical system, fractal rendering, escape-time algorithms, or connections between dynamics and deep learning.

65 Updated today
Tibsfox
AI & Automation Solid

math-olympiad

Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence — will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.

29,969 Updated today
anthropics
AI & Automation Listed

math-olympiad

Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence — will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.

17 Updated today
thevibeworks