Historical task source. The Eve task board holds current task state.
Phase 110: Kalika Advanced Mathematics — Algebraic Geometry, Geometric Analysis, Symplectic Topology, Higher Categories, Noncommutative Geometry & Vertex Algebras#
Closes the most critical gaps identified in the deep audit: entire fields of modern mathematics with zero computational tooling. A platform that provides even basic support for derived categories, Floer homology, or noncommutative geometry would be genuinely unprecedented and would attract the most serious mathematical users — researchers at the level of Scholze, Kontsevich, Huh, and Viazovska. These are the areas where current software leaves Fields Medalists writing custom code or computing by hand.
110.1 Algebraic Geometry (@kalika/algebraic-geometry)#
110.1.1 Schemes & Sheaves#
- 110.1.1.1 Implement affine scheme construction: given a commutative ring R (polynomial ring, quotient ring, localization), construct Spec(R) with its Zariski topology (prime ideals as points, distinguished opens D(f)), structure sheaf OX, and stalks O{X,p} (localizations at primes) — the foundational object of modern algebraic geometry
- 110.1.1.2 Implement projective scheme construction: Proj of a graded
ring, homogeneous coordinate ring, Serre's twisting sheaf O(n), projective
varieties as closed subschemes of P^n via homogeneous ideals — matching
Macaulay2's
Projandvarietycommands - 110.1.1.3 Implement coherent sheaf operations: sheaf of modules on a scheme, kernel/cokernel/image of sheaf morphisms, tensor product of sheaves, sheaf Hom, pullback f* and pushforward f_*, dual sheaf, determinant line bundle — the basic algebra of sheaves needed for everything else
- 110.1.1.4 Implement sheaf cohomology H^i(X, F): for coherent
sheaves on projective varieties, compute cohomology groups via Cech
cohomology (relative to standard affine cover) and Serre's computation for
O(n) on P^n, short exact sequences → long exact sequence in cohomology,
Serre duality, Riemann-Roch theorem (for curves, surfaces, and general via
Hirzebruch-Riemann-Roch) — matching Macaulay2's
HHandsheafCohomologycapabilities - 110.1.1.5 Implement intersection theory: Chow ring A*(X) for smooth
projective varieties, intersection product, Chern classes of vector
bundles (via splitting principle or Grothendieck's approach), Segre
classes, degree of a 0-cycle, Bezout's theorem, excess intersection
formula — matching Macaulay2's
Schubert2package - 110.1.1.6 Implement divisor theory: Weil divisors, Cartier divisors, divisor class group Cl(X), Picard group Pic(X), linear equivalence, complete linear systems |D|, base locus, ampleness criteria (Nakai-Moishezon, Kleiman), nef/ample/big cones
110.1.2 Derived Categories (genuinely unprecedented — no existing tool)#
- 110.1.2.1 Implement bounded derived category D^b(Coh(X)) framework: objects are bounded complexes of coherent sheaves up to quasi-isomorphism, morphisms computed via Ext groups (Ext^i(F, G) = Hom_{D^b}(F, G[i])), distinguished triangles from short exact sequences, shift functor [1], and cone construction — the core framework of modern algebraic geometry (Bondal-Orlov, Kontsevich)
- 110.1.2.2 Implement derived functors: derived pushforward Rf_, derived pullback Lf, derived tensor product ⊗^L, derived Hom RHom, and their computation via projective/injective resolutions — with spectral sequence computation for relating derived functors to ordinary cohomology
- 110.1.2.3 Implement exceptional collections: full exceptional collections on projective spaces (Beilinson's collection O, O(1), ..., O(n) on P^n), del Pezzo surfaces, and Grassmannians — strong exceptional collections generate D^b(Coh(X)), enabling decomposition of arbitrary objects
- 110.1.2.4 Implement Bridgeland stability conditions: stability function Z: K(X) → C, slicing of D^b(Coh(X)), computation of the space of stability conditions Stab(X) for curves and some surfaces, wall-crossing computations, and moduli of Bridgeland-stable objects — cutting-edge mathematics with direct physics applications (BPS states in string theory)
- 110.1.2.5 Implement Fourier-Mukai transforms: given a kernel P on X × Y, compute the integral functor Phi_P: D^b(X) → D^b(Y), verify equivalence conditions (Bondal-Orlov criterion), and compute standard Fourier-Mukai transforms (Poincaré bundle for abelian varieties, ideal sheaf of the diagonal) — the key tool for relating derived categories of different varieties
110.1.3 Moduli Spaces#
- 110.1.3.1 Implement moduli space computation: Hilbert scheme of points on surfaces (Fogarty's theorem for smoothness on surfaces, Hilbert-Chow morphism), moduli of vector bundles on curves (Narasimhan-Seshadri, Atiyah-Bott), moduli of sheaves on surfaces (Gieseker stability, Donaldson-Uhlenbeck compactification) — both symbolic (equations defining the moduli space) and numerical (point sampling via HomotopyContinuation.jl interface)
- 110.1.3.2 Implement GIT (Geometric Invariant Theory) quotients: given a group G acting on a variety X with a linearization, compute the semistable locus X^ss, the GIT quotient X//G, and the unstable stratification — matching OSCAR's nascent GIT capabilities
110.1.4 Numerical Algebraic Geometry (matching Bertini/HomotopyContinuation.jl)#
- 110.1.4.1 Implement homotopy continuation solver: given a polynomial system f(x) = 0, construct a start system g(x) = 0 with known solutions, continuously deform g → f tracking solution paths via predictor-corrector methods (Euler-Newton), with adaptive step size and path-jumping detection — matching HomotopyContinuation.jl's core algorithm
- 110.1.4.2 Implement numerical irreducible decomposition: decompose the
solution set of a polynomial system into irreducible components of
different dimensions, computing witness sets for each component via
cascading homotopies — matching Bertini's
TrackType 1capability - 110.1.4.3 Interface with msolve (via subprocess or FFI): for exact polynomial system solving, use msolve's state-of-the-art Groebner basis computation (often 10-100x faster than SINGULAR/Magma for specific problems) and real root isolation via rational univariate representation — the fastest exact solver available as of 2025
110.2 Geometric Analysis (@kalika/geometric-analysis)#
- 110.2.1.1 Implement Ricci flow numerical solver: given an initial Riemannian metric on a surface or 3-manifold (discretized on a triangulated mesh), evolve via dg/dt = -2 Ric(g) using DeTurck's trick (to break diffeomorphism gauge), with adaptive time stepping, convergence to round metrics detection, and neck-pinching singularity detection — the first general-purpose Ricci flow simulator
- 110.2.1.2 Implement Perelman's functionals: W-functional (entropy), reduced volume, and L-length computation on Ricci flow solutions — for detecting singularity formation and classifying singularity types (Type I vs Type II)
- 110.2.1.3 Implement mean curvature flow solver: evolve surfaces in R^3 by their mean curvature vector, detect singularities (neckpinch, collapse), and implement Huisken's monotonicity formula for singularity analysis — matching Surface Evolver capabilities in a modern framework with adaptive mesh refinement
- 110.2.1.4 Implement harmonic map solver: given source manifold (M,g), target manifold (N,h), and initial map f: M → N, solve the harmonic map equation τ(f) = 0 (tension field) or evolve by harmonic map heat flow df/dt = τ(f) — used in string theory (worldsheet maps), gauge theory (instantons as harmonic maps), and geometric analysis
- 110.2.1.5 Implement Yang-Mills flow solver: given a connection A on a principal G-bundle over a Riemannian manifold, evolve by dA/dt = -d_A *F_A (gradient flow of the Yang-Mills functional), detect convergence to Yang-Mills connections, compute Morse index — connecting geometric analysis to gauge theory
110.3 Symplectic Topology (@kalika/symplectic)#
- 110.3.1.1 Implement symplectic manifold framework: symplectic form ω, Darboux's theorem (canonical local coordinates), Hamiltonian vector fields XH (iota{X_H} ω = dH), Poisson bracket {f,g} = ω(X_f, X_g), Lagrangian submanifolds (ω|_L = 0), Weinstein neighborhood theorem
- 110.3.1.2 Implement Hamiltonian reduction (Marsden-Weinstein): given a symplectic manifold (M,ω) with Hamiltonian G-action and moment map μ: M → g*, compute the reduced space μ^{-1}(0)/G with its reduced symplectic form — automating a construction that is currently done by hand with CAS assistance
- 110.3.1.3 Implement Floer homology (basic framework): for a Hamiltonian H on a symplectic manifold, compute the Floer chain complex (generators = 1-periodic orbits, differential = counting pseudo-holomorphic strips), Floer homology HF*(H), and PSS (Piunikhin-Salamon-Schwarz) isomorphism to singular homology — starting with the simplest cases (Morse homology, cotangent bundles, toric manifolds)
- 110.3.1.4 Implement symplectic capacities: Gromov width (largest ball that symplectically embeds), Hofer-Zehnder capacity (from periodic orbits on hypersurfaces), and ECH (embedded contact homology) capacities — computable invariants that detect symplectic non-squeezing
- 110.3.1.5 Implement geometric integrators (matching GeometricIntegrators.jl): symplectic Runge-Kutta (Gauss-Legendre methods), variational integrators (discrete Euler-Lagrange), Poisson integrators for non-canonical Hamiltonian systems, backward error analysis (confirm long-time energy conservation) — the gold standard for Hamiltonian mechanics simulation
110.4 Higher Category Theory (@kalika/higher-categories)#
- 110.4.1.1 Implement simplicial set framework: simplicial sets (functors Delta^op → Set), face and degeneracy maps, geometric realization, singular simplicial set of a topological space, nerve of a category, Kan complexes (= ∞-groupoids), horn fillers — the combinatorial foundation for ∞-categories
- 110.4.1.2 Implement quasicategory basics: quasicategories (= weak Kan complexes = ∞-categories in Joyal-Lurie sense), mapping spaces Map(x,y), composition (defined up to contractible choice), equivalences, initial/terminal objects, limits/colimits in quasicategories — basic operations in the language Lurie's Higher Topos Theory uses
- 110.4.1.3 Implement stable ∞-categories: the ∞-categorical framework for homological algebra and stable homotopy theory, fiber/cofiber sequences, long exact sequences, t-structures, hearts of t-structures — connecting higher category theory to derived categories and spectra
- 110.4.1.4 Implement A-infinity and L-infinity algebras: A∞ algebras (homotopy associative — higher products m_n satisfying Stasheff's relations), L∞ algebras (homotopy Lie — higher brackets l_n satisfying generalized Jacobi), minimal models, formality — essential for deformation theory, string field theory, and BV-BRST formalism
110.5 Noncommutative Geometry (@kalika/noncommutative-geometry)#
- 110.5.1.1 Implement noncommutative algebra framework: associative algebras (presented by generators and relations), tensor algebra, free algebra quotients, Ore extensions (skew polynomial rings), universal enveloping algebras U(g), Weyl algebras, Clifford algebras — with noncommutative Groebner basis computation (Mora's algorithm, matching SINGULAR's Plural)
- 110.5.1.2 Implement spectral triple framework (Connes): (A, H, D) = (algebra, Hilbert space, Dirac operator) with axioms (regularity, finiteness, orientability, Poincaré duality, reality, first-order condition), KO-dimension, and the spectral distance formula d(p,q) = sup{|f(p)-f(q)| : ||[D,f]|| ≤ 1} — the foundational object of noncommutative geometry
- 110.5.1.3 Implement Connes' noncommutative Standard Model: the almost-commutative geometry (C∞(M) ⊗ A_F, L^2(S) ⊗ H_F, D_M ⊗ 1 + γ_5 ⊗ D_F) where A_F = C ⊕ H ⊕ M_3(C) encodes the gauge group, spectral action computation S = Tr(f(D/Λ)) yielding the full SM Lagrangian + gravity from pure geometry — a remarkable unification computable from the spectral triple data
- 110.5.1.4 Implement cyclic cohomology: Hochschild cohomology HH*(A), cyclic cohomology HC*(A), periodic cyclic cohomology HP*(A), Connes' long exact sequence, and the Chern character from K-theory to cyclic cohomology — the noncommutative analogue of de Rham cohomology
- 110.5.1.5 Implement K-theory for C*-algebras: K_0 (from projections/idempotents), K_1 (from unitaries), six-term exact sequence, Bott periodicity, and the Baum-Connes assembly map for group C*-algebras — connecting topology, operator algebras, and index theory
110.6 Vertex Operator Algebras & 2D CFT (@kalika/vertex-algebras)#
- 110.6.1.1 Implement VOA framework: vertex operator algebra (V, Y, 1, ω) where Y is the state-field correspondence Y(v,z) = Σ v_n z^{-n-1}, operator product expansion from vertex operator modes, Borcherds identity, and the Virasoro element ω with central charge c — the algebraic structure underlying 2D conformal field theory
- 110.6.1.2 Implement standard VOA constructions: lattice VOAs V_L (from even lattice L — includes Leech lattice for moonshine), affine VOAs V_k(g) (from affine Lie algebra at level k), Virasoro VOAs Vir_c, free field VOAs (free boson, bc-system, beta-gamma), coset/GKO construction, orbifold construction V^G
- 110.6.1.3 Implement VOA module theory: modules and intertwining operators, fusion rules (N_{ij}^k), modular tensor category structure on the module category, Verlinde formula (fusion rules from modular S-matrix), C_2-cofiniteness test — the algebraic backbone of rational CFT
- 110.6.1.4 Implement W-algebra construction: quantum Drinfeld-Sokolov reduction of affine VOAs, W_k(g, f) for nilpotent element f, W_3 algebra (Zamolodchikov), W_N algebras, and BRST cohomology construction — W-algebras appear in AGT correspondence, 4D N=2 gauge theory, and the geometric Langlands program
- 110.6.1.5 Implement moonshine computations: McKay-Thompson series for the Monster VOA V♮ (moonshine module), Hauptmodul property (each series is a genus-zero modular function), Norton's generalized moonshine, and umbral moonshine — the deep connection between the Monster group, modular forms, and physics
110.7 Quantum Groups (@kalika/quantum-groups)#
- 110.7.1.1 Implement quantum group U_q(g): Drinfeld-Jimbo quantum
enveloping algebra for any simple Lie algebra g, generators E_i, F_i, K_i
with q-deformed Serre relations, Hopf algebra structure (coproduct,
counit, antipode), and specialization at roots of unity — matching
SageMath's
QuantumGroupbut with deeper functionality - 110.7.1.2 Implement crystal bases (Kashiwara): crystal graph of a representation, crystal operators e_i, f_i, string parametrization, tensor product rule for crystals, Littelmann path model — combinatorial shadows of representations that survive the q → 0 limit
- 110.7.1.3 Implement R-matrix computation: universal R-matrix of Uq(g) (formal power series), explicit R-matrices for fundamental representations, Yang-Baxter equation verification R{12} R*{13} R*{23} = R*{23} R*{13} R_{12}, and braid group representations — essential for quantum knot invariants, quantum computing, and integrable systems
- 110.7.1.4 Implement Kazhdan-Lusztig theory: KL polynomials P_{y,w}(q) for Coxeter groups, KL basis of the Hecke algebra, Soergel bimodules (categorification of the Hecke algebra), and the KL conjecture (proven by Elias-Williamson) — connecting representation theory, combinatorics, and geometry. Use Coxeter3/Sage for fast KL polynomial computation
110.8 3-Manifold Topology (@kalika/three-manifolds)#
- 110.8.1.1 Interface with SnapPy (via Python subprocess): compute hyperbolic structures on 3-manifolds (Thurston's hyperbolization), volumes, fundamental groups, Dehn surgery descriptions, isometry groups, and canonical triangulations — SnapPy is the gold standard
- 110.8.1.2 Interface with Regina (via Python subprocess): normal surface enumeration, 3-sphere recognition (Rubinstein-Thompson algorithm), connected sum decomposition, JSJ decomposition, triangulation simplification — algorithmic 3-manifold topology
- 110.8.1.3 Implement Witten-Reshetikhin-Turaev (WRT) invariants: from a modular tensor category (e.g., quantum SU(2) at root of unity), compute 3-manifold invariants via surgery presentations and Kirby calculus — connecting quantum groups, TQFT, and 3-manifold topology
- 110.8.1.4 Implement Heegaard Floer homology (basic): HF-hat for integer surgeries on knots (using knot Floer complex from grid diagrams), d-invariant, tau-invariant — matching existing specialized codes but in a unified framework
110.9 Additional Gap Closures#
110.9.1 Matrix Models & Topological Recursion#
- 110.9.1.1 Implement matrix model solver: given a matrix integral Z = ∫ dM exp(-N Tr V(M)) with potential V, compute the planar (large N) free energy F_0 via saddle-point (spectral curve), genus expansion F_g via loop equations, and resolvent W(z) = <Tr(z-M)^{-1}> — the workhorse of random matrix theory, 2D quantum gravity, and string theory
- 110.9.1.2 Implement Eynard-Orantin topological recursion: given a spectral curve (Σ, x, y, B) where B is the Bergman kernel, recursively compute all correlation functions ω_{g,n}(z_1,...,z_n) via residues at ramification points — a universal structure appearing in matrix models, Gromov-Witten theory, Hurwitz numbers, knot invariants, and WKB quantum curves
- 110.9.1.3 Implement JT gravity / SYK model interface: partition function Z(β) of JT gravity as a matrix integral (SSS duality), SYK model Hamiltonian construction and numerical exact diagonalization for N Majorana fermions, spectral form factor, and scrambling time computation — connecting quantum gravity, random matrices, and quantum chaos
110.9.2 BV-BRST & Renormalization Hopf Algebras#
- 110.9.2.1 Implement BV (Batalin-Vilkovisky) formalism: given a gauge theory Lagrangian, automatically construct the BV complex (fields → antifields → ghosts → antighosts → auxiliary fields), compute the BV differential s = {S_BV, ·} (antibracket with BV master action), verify the classical master equation {S_BV, S_BV} = 0, and compute BRST cohomology H*(s) — matching Cadabra's partial capabilities but as a fully automated pipeline
- 110.9.2.2 Implement Connes-Kreimer Hopf algebra: Hopf algebra of rooted trees (and Feynman graphs), coproduct Δ encoding nested subdivergences, antipode S computing the counterterm map (R-operation), Birkhoff decomposition of regularized amplitudes into renormalized value and counterterm — the algebraic structure underlying perturbative renormalization
- 110.9.2.3 Implement combinatorial Dyson-Schwinger equations: express Green's functions as fixed-point equations in the Connes-Kreimer Hopf algebra, solve order-by-order in the coupling, and extract anomalous dimensions from the solution — an alternative to diagrammatic Feynman rule computation
110.9.3 EFT Matching & Running#
- 110.9.3.1 Implement automated EFT matching: given a UV theory and an IR EFT (e.g., BSM model → SMEFT), compute one-loop matching coefficients using the functional method (CDE — Covariant Derivative Expansion) or diagrammatic matching — matching matchete/matchmakerEFT capabilities
- 110.9.3.2 Implement Wilson coefficient running: given SMEFT Wilson coefficients at a high scale, run them down to the electroweak scale using the one-loop anomalous dimension matrix (matching DsixTools), then match onto WET (Weak Effective Theory) at the EW scale, and run WET coefficients to low scales — the complete EFT tower
- 110.9.3.3 Implement WCxf format support: import and export Wilson coefficients in the WCxf (Wilson Coefficient Exchange Format) for interoperability with flavio, smelli, wilson, and DsixTools — the standard exchange format for EFT phenomenology
110.9.4 Information Geometry#
- 110.9.4.1 Implement Fisher information metric: given a parametric family of probability distributions p(x|θ), compute the Fisher information matrix g_{ij}(θ) = E[∂_i log p · ∂_j log p], geodesics in the Fisher metric, and the Cramér-Rao bound — the natural Riemannian geometry on statistical models
- 110.9.4.2 Implement thermodynamic geometry: Ruppeiner metric (Hessian of entropy), Weinhold metric (Hessian of internal energy), thermodynamic curvature as a measure of interactions, and critical point detection from curvature divergence — connecting information geometry to statistical mechanics and black hole thermodynamics
110.9.5 SLE (Schramm-Loewner Evolution)#
- 110.9.5.1 Implement SLE trace simulation: solve the Loewner differential equation dg_t/dt = 2/(g_t - √κ B_t) driven by √κ times standard Brownian motion, for κ = 2 (loop-erased random walk), 3 (Ising interfaces), 4 (GFF level lines), 6 (percolation), 8/3 (SAW) — with high-precision numerical integration and trace visualization
- 110.9.5.2 Implement SLE/CFT correspondence: relate SLE partition functions to CFT correlation functions (κ ↔ central charge c = (6-κ)(3κ-8)/(2κ)), compute SLE Green's functions, and verify the restriction/locality properties — connecting rigorous probability to conformal field theory
110.10 Tests#
- 110.10.1.1 Write algebraic geometry tests: verify sheaf cohomology for O(n) on P^m against known values (Bott's theorem), intersection numbers on Grassmannians against Schubert calculus, and Hilbert polynomial computation — minimum 100 test cases comparing against Macaulay2 output
- 110.10.1.2 Write derived category tests: verify Ext computation for sheaves on P^n, Beilinson's exceptional collection, and Fourier-Mukai on elliptic curves — minimum 30 test cases (these are novel computations with no standard benchmark)
- 110.10.1.3 Write geometric analysis tests: verify Ricci flow on round S^2 converges to constant curvature, mean curvature flow of convex surface converges to round point, harmonic map from S^2 to S^2 of degree 1 — minimum 20 test cases
- 110.10.1.4 Write VOA tests: verify Virasoro central charge for lattice VOAs, fusion rules for WZW models against Verlinde formula, and moonshine series coefficients against known values — minimum 30 test cases
- 110.10.1.5 Write quantum group tests: verify R-matrix satisfies Yang-Baxter equation for U_q(sl_2), KL polynomials for S_4 against known tables, crystal graph structure for sl_3 representations — minimum 40 test cases