You need to agree to share your contact information to access this dataset

This repository is publicly accessible, but you have to accept the conditions to access its files and content.

Log in or Sign Up to review the conditions and access this dataset content.

Hodge-Boundary-339: Computational Boundary of the Hodge Conjecture

Opera Numerorum | David J. Fox | ORCID: 0009-0008-1290-6105 | June 2026 Email: davidfox998@gmail.com

Machine-verified dataset of 339 abelian varieties mapping the computational edge between algebraic and transcendental Hodge classes. Zero sorries. Lean 4 + Sage certified.

What's Inside

Hodge200: 200 Obstructed Classes

Linearly independent Hodge classes ω ∈ H^{2,2}(X_g, ℚ) on generic Jacobians with End⁰(Jac(C_g)) = ℚ.

Obstruction: rank(M_ω) > C(g,2) where C(g,2) = g(g-1)/2

| Genus | Count | Rank | Bound | Status | | --- | --- | --- | | 3 | 67 | 4 | 3 | Certified | | 4 | 67 | 7 | 6 | Certified | | 5 | 66 | 15 | 10 | M8C-certified |

Result: Not algebraic by Lemma 7.6. Computational boundary of Hodge conjecture.

SHA-256: 2b56180c490603a5044e871a16316d83d7a2d5ece14a1fb0e4cc70e28d0a4449

CM139: Coming in v1.1

139 CM abelian varieties where Hodge holds. Z=1. Includes J₀(143).

Files

  • train.jsonl — 200 classes. Fields: id, genus, basis_pairs, coeffs_num, coeffs_den, rank, bound, obstructed, sha
  • sage_verify.sage — Verify all ranks in <30 sec. Run: sage sage_verify.sage
  • Consolidated_Abelian_Variety_Definitions.lean — Full Lean 4 source + computationalBoundary theorem
  • certificates/Rank_Obstructions_Replicit_v17_PDF3.pdf — PDF anchor for the 200

Source Code: https://github.com/DavidFox998

Verification

Lean 4: lake build → All green. Zero sorries.

theorem computationalBoundary : total_classes = 200 := by native_decide
Downloads last month
6