Eve library

phase-100.md

Tracker

Revision 1

On this page

Historical task source. The Eve task board holds current task state.

Phase 100: Kalika Pure Mathematics — Abstract Algebra, Analysis, Number Theory, Topology & Category Theory#

Builds on the CAS engine from Phase 99 to implement the core pure mathematics libraries. Each library provides both symbolic computation and formal-reasoning integration. Every algorithm targets parity with or exceeds the best existing specialized system (GAP for groups, Magma for number theory and representation theory, SINGULAR for commutative algebra, Macaulay2 for algebraic geometry, PARI/GP for number fields, OSCAR for mixed-domain computation).


100.1 Abstract Algebra (@kalika/algebra)#

100.1.1 Group Theory (matching/exceeding GAP)#

  • 100.1.1.1 Implement finite group representations: permutation groups (Schreier-Sims algorithm for base/strong generating set, membership testing, order computation, coset enumeration), matrix groups over finite fields (Meataxe algorithm for irreducibility testing, matching Magma), finitely presented groups (Todd-Coxeter coset enumeration, Reidemeister-Schreier for subgroup presentations), polycyclic groups (collection algorithm), and abelian groups (Smith normal form for structure theorem)
  • 100.1.1.2 Implement group operations: normal subgroup test, quotient group construction, center, centralizer, normalizer, derived series, lower/upper central series, Fitting subgroup, Frattini subgroup, Sylow subgroups (Sylow's theorems + randomized search for large groups), conjugacy classes, class equation
  • 100.1.1.3 Implement character theory: ordinary character table computation (Burnside-Dixon-Schneider algorithm for small groups, Unger's algorithm for larger groups matching GAP's InduceReduce package), character induction/restriction, tensor product decomposition, Schur indicators, Brauer characters for modular representation theory
  • 100.1.1.4 Implement group homomorphism infrastructure: kernel, image, cokernel, isomorphism testing (for small groups: canonical form; for permutation groups: partition backtracking matching nauty/bliss), automorphism group computation
  • 100.1.1.5 Implement Atlas of Finite Groups integration: database of character tables, maximal subgroups, and representations for sporadic groups, alternating groups A_n, symmetric groups S_n, and groups of Lie type — matching GAP's AtlasRep package

100.1.2 Ring & Field Theory#

  • 100.1.2.1 Implement ring constructions: polynomial rings (univariate/multivariate over Z, Q, F_p, number fields, function fields), quotient rings R/I, localization, power series rings, Laurent polynomial rings, differential rings, and Weyl algebras (non-commutative polynomial rings with [d/dx, x] = 1)
  • 100.1.2.2 Implement field extensions: algebraic extensions Q(alpha)/Q (via minimal polynomial), splitting fields, algebraic closure (as a direct limit), finite field construction F_{p^k} via irreducible polynomials (Conway polynomials for canonical choice), field tower management with automatic coercion between extension levels — matching FriCAS/Axiom's type-theoretic approach
  • 100.1.2.3 Implement Galois theory: Galois group computation for polynomials over Q (resolvent method for degree <= 15, matching Magma), fixed field computation, Galois correspondence (subgroups <-> intermediate fields), radical solvability test (is the Galois group solvable?)
  • 100.1.2.4 Implement module theory: free modules, submodule operations, quotient modules, tensor products, Hom, Ext, Tor (via free resolutions), Smith normal form / Hermite normal form for modules over PIDs, structure theorem for finitely generated modules over PIDs

100.1.3 Linear Algebra (Symbolic)#

  • 100.1.3.1 Implement symbolic matrix operations: determinant (Bareiss algorithm for exact division, cofactor expansion for small matrices, modular algorithm for large matrices over Z), inverse, rank, nullspace, row echelon form (fraction-free), reduced row echelon form, kernel, image
  • 100.1.3.2 Implement eigenvalue/eigenvector computation: characteristic polynomial (Berkowitz algorithm for commutative rings, Faddeev-LeVerrier), minimal polynomial, Jordan normal form (over algebraic closure), rational canonical form (Frobenius), Smith normal form (for matrices over Z or k[x]), simultaneous diagonalization / triangularization
  • 100.1.3.3 Implement matrix decompositions: LU (with partial/complete pivoting), QR (Gram-Schmidt, Householder), Cholesky (for positive definite), Schur decomposition, singular value decomposition (symbolic for small matrices), polar decomposition
  • 100.1.3.4 Implement matrix functions: matrix exponential (scaling and squaring + Padé, Jordan form method for exact), matrix logarithm, matrix power (arbitrary real/complex), matrix square root, and general f(A) via Cauchy integral formula for diagonalizable matrices

100.2 Real & Complex Analysis (@kalika/analysis)#

100.2.1 Real Analysis#

  • 100.2.1.1 Implement sequence and series analysis: convergence tests (ratio, root, comparison, limit comparison, integral, Dirichlet, Abel, condensation, Kummer, Raabe, Bertrand, Gauss), radius of convergence for power series, uniform convergence tests (Weierstrass M-test), Cesàro summation, Abel summation, Borel summation for divergent series
  • 100.2.1.2 Implement Fourier analysis: symbolic Fourier transform, inverse Fourier transform, Fourier series coefficients (symbolic computation of a_n, b_n), Parseval's theorem verification, convolution theorem, Plancherel theorem, windowed Fourier transform, discrete Fourier transform (symbolic and numerical via FFT)
  • 100.2.1.3 Implement Laplace transform: symbolic Laplace transform and inverse (Bromwich integral, partial fractions, residue method), transfer function analysis, convolution via Laplace, and a table of 200+ standard Laplace transform pairs — matching Mathematica's LaplaceTransform
  • 100.2.1.4 Implement integral transforms: Mellin transform, Hankel transform, Hilbert transform (matching Mathematica 14.3's new HilbertTransform), Abel transform, Radon transform, wavelet transform (continuous and discrete with standard wavelets: Haar, Daubechies, Morlet, Mexican hat) — all in symbolic and numerical modes
  • 100.2.1.5 Implement asymptotic analysis: big-O, little-o, Theta, asymptotic expansion computation, Watson's lemma, method of steepest descent / saddle point approximation, Laplace's method for integrals, stationary phase approximation — essential for physics calculations

100.2.2 Complex Analysis#

  • 100.2.2.1 Implement analytic function operations: Laurent series expansion at a point, residue computation (automatic pole detection, residue at poles of arbitrary order), contour integration via residue theorem, argument principle (zero/pole counting), winding number computation
  • 100.2.2.2 Implement conformal mapping: Schwarz-Christoffel transformation for polygon domains, Joukowski transformation, Möbius transformations (composition, inverse, fixed points, classification: elliptic/parabolic/hyperbolic/loxodromic), Riemann mapping theorem (numerical via Zipper algorithm or Schwarz-Christoffel toolbox)
  • 100.2.2.3 Implement Riemann surface computation: branch point detection, sheet structure, analytic continuation along paths, monodromy group computation — required for multi-valued functions (sqrt, log, algebraic functions)

100.2.3 Functional Analysis#

  • 100.2.3.1 Implement Hilbert space framework: abstract Hilbert spaces with named basis vectors, inner product computation, orthogonal projection, Gram-Schmidt orthogonalization (symbolic), orthonormal basis construction, direct sum and tensor product of Hilbert spaces — foundational for quantum mechanics
  • 100.2.3.2 Implement operator theory: bounded and unbounded linear operators, adjoint, spectrum computation (point spectrum, continuous spectrum, residual spectrum), spectral decomposition for self-adjoint operators, compact operators (singular value decomposition), trace-class operators (trace computation), operator norm estimation
  • 100.2.3.3 Implement distribution theory: Dirac delta, Heaviside step function, principal value, distributional derivatives, convolution with distributions, tempered distributions, Fourier transform of distributions — used throughout physics

100.3 Number Theory (@kalika/number-theory)#

100.3.1 Elementary & Computational Number Theory#

  • 100.3.1.1 Implement primality testing: Miller-Rabin (probabilistic, configurable rounds), Baillie-PSW (deterministic for all known composites up to 2^64), AKS (polynomial-time deterministic), ECPP (Atkin-Goldwasser-Kilian elliptic curve primality proving for certified proofs) — matching PARI/GP and FLINT
  • 100.3.1.2 Implement integer factorization: trial division (primes to 10^6), Pollard's rho (with Brent's improvement), Pollard's p-1, Williams' p+1, elliptic curve method (ECM — Lenstra, with stage 1 and stage 2 matching GMP-ECM performance), quadratic sieve (for numbers up to ~100 digits), general number field sieve (GNFS for larger numbers, matching Magma/CADO-NFS) — adaptive algorithm selection by number size
  • 100.3.1.3 Implement arithmetic functions: Euler's totient phi(n), Mobius function mu(n), divisor function sigma_k(n), Liouville function lambda(n), von Mangoldt function Lambda(n), Ramanujan tau function tau(n), partition function p(n) (Rademacher series for exact computation of large values), Dedekind sum — with Dirichlet series representations

100.3.2 Algebraic Number Theory (matching Magma/PARI)#

  • 100.3.2.1 Implement number field arithmetic: Q(alpha) for algebraic alpha defined by minimal polynomial, element arithmetic (addition, multiplication, norm, trace, characteristic polynomial, minimal polynomial), field discriminant, integral basis computation (Round 2 / Round 4 algorithms), Dedekind criterion
  • 100.3.2.2 Implement ring of integers computation: Zassenhaus/Round 2 algorithm for maximal order, LLL-reduced basis, index computation, decomposition of primes (factoring pOK into prime ideals), ramification (ramification index, inertia degree), different and discriminant
  • 100.3.2.3 Implement ideal arithmetic: ideal multiplication, ideal norm, prime ideal factorization of ideals, ideal class group computation (Bach's algorithm with GRH bounds, unconditional via class group relations), class number, regulator, fundamental units (Dirichlet's unit theorem + LLL), S-unit computation — matching PARI/GP's bnfinit and Magma's ClassGroup
  • 100.3.2.4 Implement Galois module structure: Galois group action on ideals and ideal classes, Artin reciprocity (for abelian extensions), Hilbert class field computation, ray class fields, and class field theory computations — matching Magma's class field theory capabilities
  • 100.3.2.5 Implement local field computations: p-adic completions Q_p and extensions, p-adic valuation, Hensel's lemma (lifting roots), local class field theory (reciprocity map), Hilbert symbol, local-global principle (Hasse-Minkowski for quadratic forms)

100.3.3 Elliptic Curves (matching Magma — the gold standard)#

  • 100.3.3.1 Implement elliptic curve arithmetic: Weierstrass models (long and short), point addition, scalar multiplication (double-and-add, NAF, windowed), j-invariant, discriminant, conductor, torsion subgroup computation (Nagell-Lutz + Mazur's theorem for Q, Doud's algorithm for number fields)
  • 100.3.3.2 Implement Mordell-Weil group computation: 2-descent (2-Selmer group via local solubility + Cassels pairing), 3-descent and 4-descent over Q (matching Magma's FourDescent), p-descent via p-Selmer groups, Heegner point computation for analytic rank 1 (Gross-Zagier + Kolyvagin), height pairing computation, Mordell-Weil basis computation with height bounds — Magma is the gold standard here; match its capabilities
  • 100.3.3.3 Implement elliptic curve L-functions: L(E, s) via Euler product and functional equation, analytic rank estimation (number of vanishing derivatives at s=1), numerical evaluation to high precision (Dokchitser's algorithm), BSD conjecture numerical verification (compare L-function data with algebraic invariants: order of Sha, Tamagawa numbers, regulator, torsion order)
  • 100.3.3.4 Implement modular parametrization: compute the modular parametrization phi: X_0(N) -> E for elliptic curves over Q (Cremona's algorithms), modular symbols, period lattice computation, isogeny computation (Velu's formulas), isogeny graph exploration

100.3.4 Modular Forms & Automorphic Forms#

  • 100.3.4.1 Implement modular form spaces: M_k(Gamma_0(N), chi) for weight k, level N, and Nebentypus character chi — dimension formulas, basis computation via q-expansion (Sturm bound), cusp forms S_k subspace, Eisenstein series E_k, eta quotients
  • 100.3.4.2 Implement Hecke operators: T_p action on q-expansions, eigenform computation (simultaneous diagonalization of Hecke operators), newforms and oldforms decomposition, Atkin-Lehner involutions, Petersson inner product (numerical) — matching PARI/GP's mfinit/mfeigenbasis and Magma's modular forms package
  • 100.3.4.3 Implement modular symbols: Manin symbols for Gamma_0(N), boundary map, cuspidal symbols, Hecke action on modular symbols, period integrals, integration pairing — the computational workhorse for modular forms and L-functions (Cremona's approach)
  • 100.3.4.4 Implement Siegel modular forms and Hilbert modular forms (basic framework): Fourier expansion, Hecke operators, L-functions — extending beyond the classical case to match Magma's cutting-edge capabilities

100.3.5 L-functions (matching PARI/GP + LMFDB)#

  • 100.3.5.1 Implement general L-function framework: Euler product, functional equation (gamma factors, conductor, root number), analytic continuation, Dirichlet coefficients, convexity bounds, approximate functional equation for numerical evaluation — supporting Riemann zeta, Dirichlet L, Dedekind zeta, Hecke L, Artin L, and elliptic curve L-functions
  • 100.3.5.2 Implement high-precision L-function evaluation: Dokchitser's algorithm (theta function + incomplete gamma function), Rubinstein's lcalc approach, Odlyzko-Schonhage algorithm for computing many zeta zeros simultaneously — target: compute L(s) to 1000+ digits at arbitrary s, and find zeros to 50+ digits of precision
  • 100.3.5.3 Implement zero finding and zero statistics: Riemann-Siegel formula for zeta zeros, Gram point computation, zero counting via argument principle, GUE statistics verification (Montgomery-Odlyzko law), verification of RH (Riemann Hypothesis) for initial zeros — matching LMFDB's zero databases

100.4 Topology (@kalika/topology)#

100.4.1 Algebraic Topology#

  • 100.4.1.1 Implement simplicial complex framework: simplex construction, boundary operator, simplicial chain complex, simplicial homology computation (Smith normal form of boundary matrices), Betti numbers, Euler characteristic, relative homology, long exact sequence of a pair
  • 100.4.1.2 Implement CW complex framework: cell attachment, cellular chain complex, cellular homology, CW structure for standard spaces (spheres, tori, projective spaces, Grassmannians, lens spaces), Mayer-Vietoris sequence
  • 100.4.1.3 Implement cohomology: singular cohomology via cochain complex, cup product, cohomology ring computation for standard spaces, Poincaré duality verification, universal coefficient theorem, Künneth formula
  • 100.4.1.4 Implement fundamental group and higher homotopy: fundamental group computation for CW complexes (van Kampen theorem), covering space construction, homotopy groups of spheres (database of known values), Hurewicz theorem, long exact sequence of a fibration
  • 100.4.1.5 Implement knot theory: knot invariants (Alexander polynomial, Jones polynomial via Kauffman bracket, HOMFLY-PT polynomial, Khovanov homology for small knots), knot database (Rolfsen table, KnotInfo integration), Seifert matrix, knot genus, unknot detection — relevant for topological quantum field theory and string theory

100.4.2 Persistent Homology & Computational Topology#

  • 100.4.2.1 Implement persistent homology: Vietoris-Rips complex construction, filtration, persistence diagram computation (standard reduction algorithm), barcode representation, Wasserstein and bottleneck distances between persistence diagrams — for topological data analysis applications in physics (phase transitions, cosmic web topology)

100.5 Category Theory (@kalika/category-theory)#

  • 100.5.1.1 Implement category framework: objects, morphisms, composition, identity, functors (covariant/contravariant), natural transformations, functor categories, opposite category, product category, comma category
  • 100.5.1.2 Implement universal constructions: limits and colimits (product, coproduct, equalizer, coequalizer, pullback, pushout), adjunctions (unit/counit definition, Hom-set definition, equivalence proof), Yoneda lemma (representable functors, Yoneda embedding), Kan extensions
  • 100.5.1.3 Implement monoidal categories: tensor product, unit object, associator, unitor, braiding (symmetric/non-symmetric), rigid/pivotal/ribbon categories — foundational for TQFT, quantum groups, and knot invariants
  • 100.5.1.4 Implement abelian categories: kernels, cokernels, exact sequences, five lemma, snake lemma, derived functors (Ext, Tor as abstract constructions), spectral sequences (Leray-Serre, Grothendieck) — matching the level needed for homological algebra in algebraic geometry and string theory
  • 100.5.1.5 Implement topos theory basics: subobject classifier, power objects, internal logic, sheaves on a site, Grothendieck topoi — for advanced mathematical physics applications (synthetic differential geometry)

100.6 Combinatorics (@kalika/combinatorics)#

  • 100.6.1.1 Implement enumerative combinatorics: permutations, combinations, partitions (integer and set), compositions, Bell numbers, Stirling numbers (first/second kind), Catalan numbers, derangements, multinomial coefficients, q-analogs (q-binomial, q-factorial, q-Pochhammer), and generating function manipulation (OGF, EGF, Dirichlet series) — with OEIS lookup integration
  • 100.6.1.2 Implement graph theory: graph construction (adjacency matrix/list, directed/undirected/weighted), standard algorithms (BFS, DFS, shortest paths, minimum spanning tree, max flow, matching), graph invariants (chromatic polynomial, Tutte polynomial, independence number, clique number), spectral graph theory (adjacency/Laplacian eigenvalues, Cheeger inequality)
  • 100.6.1.3 Implement combinatorial species and Polya enumeration: cycle index polynomial, Burnside's lemma, Polya enumeration theorem, species algebra (sum, product, composition, derivative) — for counting structures up to symmetry
  • 100.6.1.4 Implement Young tableaux and symmetric functions: standard/semistandard Young tableaux, Robinson-Schensted correspondence, Littlewood-Richardson rule, Schur functions, power sum/monomial/elementary/homogeneous symmetric functions, Kostka numbers, plethysm — essential for representation theory and particle physics

100.7 Probability & Stochastic Processes (@kalika/probability)#

  • 100.7.1.1 Implement probability distributions: all standard distributions (normal, exponential, Poisson, binomial, geometric, hypergeometric, chi-squared, Student's t, F, beta, gamma, Weibull, log-normal, Cauchy, Levy, Pareto, etc.) with symbolic PDF, CDF, MGF, characteristic function, and exact moments — plus physics-relevant distributions (Bose-Einstein, Fermi-Dirac, Planck, Maxwell-Boltzmann, Wigner semicircle, Tracy-Widom)
  • 100.7.1.2 Implement random matrix theory: Gaussian ensembles (GOE, GUE, GSE), Wishart ensemble, eigenvalue density (Wigner semicircle law, Marchenko-Pastur), Tracy-Widom distribution (all three: TW_1, TW_2, TW_4), spacing distributions, determinantal point processes, Dyson Brownian motion — critical for quantum chaos, quantum gravity, and number theory (Montgomery-Odlyzko)
  • 100.7.1.3 Implement stochastic processes: Brownian motion/Wiener process, Ornstein-Uhlenbeck process, geometric Brownian motion, Poisson process, Ito calculus (Ito's lemma, stochastic integrals), stochastic differential equations (Euler-Maruyama, Milstein schemes), Fokker-Planck equation derivation from SDEs — used in statistical mechanics and quantum field theory
  • 100.7.1.4 Implement Markov chains: transition matrix, stationary distribution, mixing time, spectral gap, hitting times, coupling arguments — plus continuous-time Markov chains, birth-death processes, and MCMC theory (detailed balance, ergodicity)

100.8 Tests#

  • 100.8.1.1 Write group theory tests: verify Sylow theorem computations, character table correctness for known groups (S_3, S_4, A_4, A_5, dihedral D_n, cyclic Z_n, quaternion Q_8), isomorphism detection — minimum 200 test cases comparing against GAP output
  • 100.8.1.2 Write number theory tests: primality testing against known primes/composites, factorization correctness, class group computation for known number fields (quadratic, cyclotomic), elliptic curve rank computation for Cremona database entries — minimum 300 test cases comparing against PARI/GP and LMFDB
  • 100.8.1.3 Write topology tests: homology computation for known spaces (sphere, torus, Klein bottle, RP^n), knot polynomial computation against KnotInfo database, persistent homology against Ripser output — minimum 100 test cases