task stringlengths 11 46 | path stringlengths 17 52 | title stringlengths 22 100 | source_module stringlengths 26 57 | statement_revision int64 1 1 | upstream_status stringclasses 2
values | upstream_visible bool 1
class | source stringlengths 243 362 | submitter stringclasses 10
values | upstream_notes stringlengths 0 974 | leaderboard_url stringlengths 48 83 | theorems listlengths 1 6 | definition_holes listlengths 0 10 | hole_names listlengths 1 13 | hole_kinds listlengths 1 13 | hole_count int64 1 13 | has_challenge_deps bool 2
classes | grade_timeout_sec int64 10.8k 10.8k | source_sha256 stringlengths 518 608 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
annals_absolute_profinite_rigidity | tasks/annals_absolute_profinite_rigidity | Absolute profinite rigidity and hyperbolic geometry | LeanEval.GroupTheory.AbsoluteProfiniteRigidity | 1 | active | true | M. R. Bridson, D. B. McReynolds, A. W. Reid, and R. Spitler, `Absolute profinite rigidity and hyperbolic geometry`, Annals of Math, 192 (3) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-3-AbsoluteProfiniteRigidity.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_absolute_profinite_rigidity/ | [
"theorem_7_1"
] | [] | [
"AbsoluteProfiniteRigidity.theorem_7_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "3a59f64238765e2aff534d4fddb226ee8a4958dd545153bb5f4817e738968056", "ChallengeDeps.lean": "7fff7cc8dbdfd13e67c37805830f70249b33272c63b1d2fe10fe259272dfa87c", "Solution.lean": "9648882d5fbf864c7206fa72acd4d2da6800a303223066891cd2dfaa8a8eb187", "Submission.lean": "ce3b6a38f5b8953d6ed565369394c16a9b7e64... | |
annals_algebraic_integers | tasks/annals_algebraic_integers | Algebraic integers with conjugates in a prescribed distribution | LeanEval.NumberTheory.AlgebraicIntegers | 1 | active | true | A. Smith, `Algebraic integers with conjugates in a prescribed distribution`, Annals of Math, 200 (1) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-200-1-AlgebraicIntegers.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_algebraic_integers/ | [
"theorem_1_1"
] | [] | [
"AlgebraicIntegers.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "26d99d440f6111235095b207927fb3b6da8914b88386b2288fa065e438d4d11e", "ChallengeDeps.lean": "db8af5c443431a1b1b3f1795e9d2e49daf973b7100920f0a24cb29d5a0cfc9a2", "Solution.lean": "73c378e664bef9b2e3e5ce7311fca1268b0180a884caed229f18d6f23f73c3c4", "Submission.lean": "8a6ee53286d3af27fd84ec204cdaeb238dd8e9... | |
annals_bose_gases | tasks/annals_bose_gases | The energy of dilute Bose gases | LeanEval.Physics.BoseGases | 1 | active | true | S. Fournais and J. P. Solovej, `The energy of dilute Bose gases`, Annals of Math, 192 (3) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-3-BoseGases.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_bose_gases/ | [
"BoseGases.theorem_1_2"
] | [
"BoseGases.η",
"BoseGases.𝓒"
] | [
"BoseGases.η",
"BoseGases.𝓒",
"BoseGases.theorem_1_2"
] | [
"def",
"def",
"theorem"
] | 3 | true | 10,800 | {"Challenge.lean": "caf3a5db082a52a976a91d51640b5a5e2ed2ecf03c64c996be14e1439a6767f5", "ChallengeDeps.lean": "cd8e18a04b8435db4ebbe939af85d69e692a6aab48934bf3e09b34baa8a22a10", "Solution.lean": "eeacc455255f404f3748273812dc635da6e85f5045e7a9ca61ffa98c405e5e5a", "Submission.lean": "36d1587618baf7338088b21c04b7c38400b681... | |
annals_bounded_multiplicative_functions | tasks/annals_bounded_multiplicative_functions | Higher uniformity of bounded multiplicative functions in short intervals on average | LeanEval.NumberTheory.BoundedMultiplicativeFunctions | 1 | active | true | K. Matomäki, M. Radziwiłł, T. Tao, J. Teräväinen, and T. Ziegler, `Higher uniformity of bounded multiplicative functions in short intervals on average`, Annals of Math, 197 (2) 2023. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2023... | David Ledvinka | The proof binders `hQ`, `hC`, `hf`, `hf'`, `hX`, `hXH`, and `hHX` in `theorem_1_3` are prefixed with `_` here. This is alpha-equivalent and suppresses unused-variable warnings in the generated `Solution.lean`, whose delegation supplies the enclosing proof at once. | https://lean-lang.org/eval/problems/annals_bounded_multiplicative_functions/ | [
"BoundedMultiplicativeFunctions.theorem_1_3",
"BoundedMultiplicativeFunctions.corollary_1_1"
] | [] | [
"BoundedMultiplicativeFunctions.theorem_1_3",
"BoundedMultiplicativeFunctions.corollary_1_1"
] | [
"theorem",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "0631a2ed4fccc9c1dcdfdd99326414a1e432c9a93ef16901ec186441e737cf53", "ChallengeDeps.lean": "66c24b0c63d783bed8bbf9ac47138f5b9251e06907d8c91ff7f5b8ff93167f81", "Solution.lean": "f5ac9d471321f75b5dd2b55c635addbd95e44d2a169b28760a4feb3f5d9356f7", "Submission.lean": "0a91069f92595b7460521d0044589cc240f836... |
annals_chowla_and_twin_prime_over_fq_t | tasks/annals_chowla_and_twin_prime_over_fq_t | On the Chowla and twin primes conjectures over 𝔽_q[T] | LeanEval.NumberTheory.ChowlaAndTwinPrimeOverFqT | 1 | active | true | W. Sawin and M. Shusterman, `On the Chowla and twin primes conjectures over 𝔽_q[T]`, Annals of Math, 196 (2) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2022-196-2-ChowlaAndTwinPrimeOverFqT.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_chowla_and_twin_prime_over_fq_t/ | [
"ChowlaAndTwinPrimeOverFqT.theorem_1_1",
"ChowlaAndTwinPrimeOverFqT.theorem_1_3"
] | [] | [
"ChowlaAndTwinPrimeOverFqT.theorem_1_1",
"ChowlaAndTwinPrimeOverFqT.theorem_1_3"
] | [
"theorem",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "7d304cf25a606e5b3efbeff284f1189a31082a3848a9dd34730198fae964cab4", "ChallengeDeps.lean": "6bb7da90017fca383ec95cbd0e02fdea885cb3dda45dc9dceca3f90306be52d8", "Solution.lean": "8af93224def5163ea0ba46154f15ac0b37dac2396ece4245aa5704bcec609b80", "Submission.lean": "345d7367c617d5082dfec7470b6dcf5a02c0d6... | |
annals_conjecture_of_marton | tasks/annals_conjecture_of_marton | On a conjecture of Marton | LeanEval.Combinatorics.ConjectureOfMarton | 1 | archived | true | W. T. Gowers, B. Green, F. Manners, and T. Tao, `On a conjecture of Marton`, Annals of Math, 201 (2) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-201-2-ConjectureOfMarton.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_conjecture_of_marton/ | [
"theorem_1_2"
] | [] | [
"ConjectureOfMarton.theorem_1_2"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "b2256e1edbd91e67801a72c50c194adf6997491e25c8c2fdcb01159f83cceff7", "ChallengeDeps.lean": "bb6a0b922666579ea2732a3cceacdd44296c39238b34ae19b480a04d32704fe2", "Solution.lean": "fe5af2af4a0968131de783c498e351c7c2073d3cc4708254a73e2b4afd1ba014", "Submission.lean": "90f5e68d8af33d261e1e88e7763cdca2236b7f... | |
annals_dirichlet_weyl_bound | tasks/annals_dirichlet_weyl_bound | The Weyl bound for Dirichlet L-functions of cube-free conductor | LeanEval.NumberTheory.DirichletWeylBound | 1 | active | true | I. Petrow and M. P. Young, `The Weyl bound for Dirichlet L-functions of cube-free conductor`, Annals of Math, 192 (2) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-2-DirichletWeylBound.lean | Thomas Browning | The proof binders `hq` and `hχ` are named `_hq` and `_hχ` here. This is alpha-equivalent and suppresses unused-variable warnings in the generated `Solution.lean` delegation. | https://lean-lang.org/eval/problems/annals_dirichlet_weyl_bound/ | [
"corollary_1_3"
] | [] | [
"DirichletWeylBound.corollary_1_3"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "87326d54c642a478f503b754653763d18c64a91eb30c518fdf07739677f61cea", "ChallengeDeps.lean": "26dcd81d3b6e40454fe6e71b3edeb83e41e4c7568bbab8aa8239e1a7b89330ed", "Solution.lean": "3599b8a1af97d873787960a3a6f3477b06ba6e70ac0337228547c5411cd2fcf8", "Submission.lean": "5ae58d3a8fd052f9d4526a1a0c0f8fe52f0342... |
annals_duffin_schaeffer_conjecture | tasks/annals_duffin_schaeffer_conjecture | On the Duffin-Schaeffer conjecture | LeanEval.NumberTheory.DuffinSchaefferConjecture | 1 | active | true | D. Koukoulopoulos and J. Maynard, `On the Duffin-Schaeffer conjecture`, Annals of Math, 192 (1) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-1-DuffinSchaefferConjecture.lean | Katerina Hristova, Kevin Buzzard | In the paper, `ℕ` denotes the positive integers, which are denoted `ℕ+` in Lean. Hence, no changes to the domains of the functions `ψ` and `ψ⋆` have been made in the formalisation. LeanEval changes `lemma corollary_3` to `theorem corollary_3` because the workspace generator addresses theorem holes by that keyword; this... | https://lean-lang.org/eval/problems/annals_duffin_schaeffer_conjecture/ | [
"DuffinSchaefferConjecture.theorem_1",
"DuffinSchaefferConjecture.theorem_2_a",
"DuffinSchaefferConjecture.theorem_2_b",
"DuffinSchaefferConjecture.corollary_3"
] | [] | [
"DuffinSchaefferConjecture.theorem_1",
"DuffinSchaefferConjecture.theorem_2_a",
"DuffinSchaefferConjecture.theorem_2_b",
"DuffinSchaefferConjecture.corollary_3"
] | [
"theorem",
"theorem",
"theorem",
"theorem"
] | 4 | true | 10,800 | {"Challenge.lean": "59ca30a36a06f31d1d46d4cb7aaf99dffd476d9306b4d9522b4fc9a8df917693", "ChallengeDeps.lean": "e39c2455173b1e1e45b1fdc681ec29c161183523d9fb91383b50e04c8388443c", "Solution.lean": "6192c3fa8f1b2378b38a678b4eaa41993780b30089f48e43b10cf57c67b17da7", "Submission.lean": "9c6ab330940eecafe469c9277a4a5a645173cd... |
annals_enumerating_number_fields | tasks/annals_enumerating_number_fields | Enumerating number fields | LeanEval.NumberTheory.EnumeratingNumberFields | 1 | active | true | J.-M. Couveignes, `Enumerating number fields`, Annals of Math, 192 (2) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-2-EnumeratingNumberFields.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_enumerating_number_fields/ | [
"EnumeratingNumberFields.theorem_1",
"EnumeratingNumberFields.theorem_2"
] | [] | [
"EnumeratingNumberFields.theorem_1",
"EnumeratingNumberFields.theorem_2"
] | [
"theorem",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "a38df98ed8f0fd2d703da9751bc64dab4201d94b3c186d40568c5330679d24de", "ChallengeDeps.lean": "f32e7353bf37a346580882965b169e826b94de55e298935d4638036ccad21bbf", "Solution.lean": "e1a5306d9f838c06672788fcffcbda01b6a9cba54463c0f61686c5d6a4443bc6", "Submission.lean": "15e043949942f4567d3bee7af521a57f2ea274... | |
annals_equiangular_lines_fixed_angle | tasks/annals_equiangular_lines_fixed_angle | Equiangular lines with a fixed angle | LeanEval.Combinatorics.EquiangularLinesFixedAngle | 1 | active | true | Z. Jiang, J. Tidor, Y. Yao, S. Zhang, and Y. Zhao, `Equiangular lines with a fixed angle`, Annals of Math, 194 (3) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-3-EquiangularLinesFixedAngle.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_equiangular_lines_fixed_angle/ | [
"theorem_1_2"
] | [] | [
"EquiangularLinesFixedAngle.theorem_1_2"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "a8a847a2ab5de672e87c5d0acd9892d1d69533afc14daf1efdf35b472b854c82", "ChallengeDeps.lean": "988e3088d876d2498a23dce62284fde6a34c0693f339d7ad83382578ad4624e0", "Solution.lean": "8592ece1d4bcc15eee9641cad7be20d550da4dd2ae616055240ebab7edcdafa1", "Submission.lean": "b72288e34edc983bdd2d07a24aa5d804cbf277... | |
annals_erdos_faber_lovasz_conjecture | tasks/annals_erdos_faber_lovasz_conjecture | A proof of the Erdős–Faber–Lovász conjecture | LeanEval.Combinatorics.ErdosFaberLovaszConjecture | 1 | active | true | D. Y. Kang, T. Kelly, D. Kühn, A. Methuku, and D. Osthus, `A proof of the Erdős–Faber–Lovász conjecture`, Annals of Math, 198 (2) 2023. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2023-198-2-ErdosFaberLovaszConjecture.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_erdos_faber_lovasz_conjecture/ | [
"theorem_1_1"
] | [] | [
"ErdosFaberLovaszConjecture.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "722f77ed4bc3001d4e6b2a32cc3be0e2d8d1c525a2659fe77b74d9939a8a17a3", "ChallengeDeps.lean": "de3538c197dedff1684ce506a062446df882d10bc4660931d11ac0d10fea034d", "Solution.lean": "744ec86c8b13a160a99b6af5e3fc398d15f90a7a2899bd2cd99d54a6e95aef64", "Submission.lean": "8d0d170d73eb20c5f4101d08c3b30a5a232ff9... | |
annals_erdos_supersingular_primes | tasks/annals_erdos_supersingular_primes | A conjecture of Erdős, supersingular primes and short character sums | LeanEval.NumberTheory.ErdosSupersingularPrimes | 1 | active | true | M. Bennett and S. Siksek, `A conjecture of Erdős, supersingular primes and short character sums`, Annals of Math, 191 (2) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-191-2-ErdosSupersingularPrimes.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_erdos_supersingular_primes/ | [
"ErdosSupersingularPrimes.theorem_2"
] | [
"ErdosSupersingularPrimes.k₀"
] | [
"ErdosSupersingularPrimes.k₀",
"ErdosSupersingularPrimes.theorem_2"
] | [
"def",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "34e4d8b03825918e85d32d6226f10e4369afcf9ebea2a2bbc2f592a18d5ec7d2", "ChallengeDeps.lean": "d5e647ca4cfb6dfc819ae97e95164cb529ddd420db64433608fb339b9ea98935", "Solution.lean": "7ad9ba44923ecfd125bacd8821becfecbd575f88083c07baafd6a9b062dcd359", "Submission.lean": "f00d9223d19b4050c4f39e66d9197a62f17292... | |
annals_finite_time_singularity | tasks/annals_finite_time_singularity | Finite-time singularity formation for C^{1,α} solutions to the incompressible Euler equations on ℝ³ | LeanEval.Analysis.FiniteTimeSingularity | 1 | active | true | T. M. Elgindi, `Finite-time singularity formation for C^{1,α} solutions to the incompressible Euler equations on ℝ³`, Annals of Math, 194 (3) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-3-FiniteTimeSingularity.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_finite_time_singularity/ | [
"theorem_1"
] | [] | [
"FiniteTimeSingularity.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "41a60bbf830b3d087dd5761c7a5ce605eaa779c012ccd98686b6e2a312d41400", "ChallengeDeps.lean": "6ec6f3e811a75c4f745e7c8ce107c46637ec4992b70a6d61130258ef7bd2e5be", "Solution.lean": "866431ecfa1028714aac1b526aa0e3f7d46912429588b804ebdb3a83dbc6495e", "Submission.lean": "1c4146252e5019547eab574ef0b7bd347f83c0... | |
annals_flat_littlewood_poly | tasks/annals_flat_littlewood_poly | Flat Littlewood polynomials exist | LeanEval.Analysis.FlatLittlewoodPoly | 1 | active | true | P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe, and M. Tiba, `Flat Littlewood polynomials exist`, Annals of Math, 192 (3) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-3-FlatLittlewoodPoly.lean | Katerina Hristova, Kevin Buzzard, Bhavik Mehta | https://lean-lang.org/eval/problems/annals_flat_littlewood_poly/ | [
"theorem_1_1"
] | [] | [
"FlatLittlewoodPoly.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "ed1ddc0871bb5fbb8b79a581ad659bff1848f30ff68d8194802ac6165a76f24e", "ChallengeDeps.lean": "faaea70578615befcf79cccfe485c5b19a73e53755ebce98fe32861bf83fb2d1", "Solution.lean": "4c828f57545954f47559da6cc4d1a66bfbe00a5474c9062e09b213603e151d02", "Submission.lean": "67ac5c5a26f91b9a7e8790814ea08fc016e32e... | |
annals_fractal_uncertainty | tasks/annals_fractal_uncertainty | Fractal uncertainty in higher dimensions | LeanEval.Analysis.FractalUncertainty | 1 | active | true | A. Cohen, `Fractal uncertainty in higher dimensions`, Annals of Math, 202 (1) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-202-1-FractalUncertainty.lean | Justus Springer, Katerina Hristova | https://lean-lang.org/eval/problems/annals_fractal_uncertainty/ | [
"theorem_1_1"
] | [] | [
"FractalUncertainty.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "bb4d1479fc92038879eb704b4d9111e83dae3300bbbe642aad46b4c8af823cf3", "ChallengeDeps.lean": "13f3bf222f55534a0dcc3ddfc96abf836b7e5338c9a3dcdf6cf6bf1e1f62dd78", "Solution.lean": "6f36cc3ba9d587930b700a70d04b98de9e1d2ed41dc3f9d5edfe8f447a0299a6", "Submission.lean": "47accec2b646dfb957fb9d793cee98ee64d05a... | |
annals_fractional_expectation_thresholds | tasks/annals_fractional_expectation_thresholds | Thresholds versus fractional expectation-thresholds | LeanEval.Combinatorics.FractionalExpectationThresholds | 1 | active | true | K. Frankston, J. Kahn, B. Narayanan, and J. Park, `Thresholds versus fractional expectation-thresholds`, Annals of Math, 194 (2) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-2-FractionalExpectationThresholds.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_fractional_expectation_thresholds/ | [
"FractionalExpectationThresholds.theorem_1_1"
] | [
"FractionalExpectationThresholds.K"
] | [
"FractionalExpectationThresholds.K",
"FractionalExpectationThresholds.theorem_1_1"
] | [
"def",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "0103e21ee917f083b9860f7f19472fa36e4eed6275c42492d3a78e789eabbb08", "ChallengeDeps.lean": "220c041d451839f891b9be2d7e738ba3aaed921f790c30c873681c6f57dc8ce5", "Solution.lean": "79ed6c8354a7dcc4ec57e602471f828c49589bfd05cfa40d0a088a73848aaa96", "Submission.lean": "ff181f5d8f3fbfcf8b784bdc0b08c6b2be82d4... | |
annals_good_lt_codes | tasks/annals_good_lt_codes | Good Locally Testable Codes | LeanEval.Combinatorics.GoodLTCodes | 1 | active | true | I. Dinur, S. Evra, R. Livne, A. Lubotzky, and S. Mozes, `Good Locally Testable Codes`, Annals of Math, 203 (2) 2026. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2026-203-2-GoodLTCodes.lean | Thomas Browning, Katerina Hristova | https://lean-lang.org/eval/problems/annals_good_lt_codes/ | [
"theorem_1_2"
] | [] | [
"GoodLTC.theorem_1_2"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "301e826306482c350efc14532871ec116e58c9be3afb29d8be7840b370d19e59", "ChallengeDeps.lean": "a32ea9fb1a6c3c3b431dfe8300b8c01d7101a642b46bc719cab5a2ff21d0a0ca", "Solution.lean": "89f3df49a28719400db0243c9ba6e0b48e97643968ce8fa026432f681b8efb2a", "Submission.lean": "b8fbb4cfdc6841afb15eb0dc35fef0365c7f96... | |
annals_hasse_principle_random_fano | tasks/annals_hasse_principle_random_fano | The Hasse principle for random Fano hypersurfaces | LeanEval.NumberTheory.HassePrincipleRandomFano | 1 | active | true | T. Browning, P. L. Boudec, and W. Sawin, `The Hasse principle for random Fano hypersurfaces`, Annals of Math, 197 (3) 2023. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2023-197-3-HassePrincipleRandomFano.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_hasse_principle_random_fano/ | [
"theorem_1_1"
] | [] | [
"HassePrincipleRandomFano.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "a6ad0d452b4c5ceba43b4fe8113792f0791fa92b4a28ec8a78a620ba05898134", "ChallengeDeps.lean": "ef4e342e40a9f2492e5465a2ed73680a2eb19553c4e0eb53d1ee64aa2fb9b3d5", "Solution.lean": "c852b4ab27a9a5b99ff28709126ee2b245676ca6db4351d8fbbf7941a9213370", "Submission.lean": "2796ce3df8c7a5dac8c129532c16a7b3772e48... | |
annals_hessian_estimates | tasks/annals_hessian_estimates | Hessian estimates for the sigma-2 equation in dimension four | LeanEval.Analysis.HessianEstimates | 1 | active | true | R. Shankar and Y. Yuan, `Hessian estimates for the sigma-2 equation in dimension four`, Annals of Math, 201 (2) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-201-2-HessianEstimates.lean | David Ledvinka | The proof binders `smooth`, `bounded`, `positive_branch`, and `solution` are prefixed with `_` here. This is alpha-equivalent and suppresses unused-variable warnings in the generated `Solution.lean` delegation. | https://lean-lang.org/eval/problems/annals_hessian_estimates/ | [
"theorem_1_1"
] | [] | [
"HessianEstimates.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "b8ff4f17f3b3c6691c12ccba303b7a2d420e995b876c2f7100f341a09a35e827", "ChallengeDeps.lean": "f3d3f925cfb48fedc239fa85cdde429602ec890b91e373453baa3bca9afa3e12", "Solution.lean": "b29df928ed3f7374080473dc0572c34e27d65e066d67a6145b9d5bc04ccf719c", "Submission.lean": "5e26b3bcd84b04a55decb043afa4e265d939a0... |
annals_improved_bounds_sunflower_lemma | tasks/annals_improved_bounds_sunflower_lemma | Improved bounds for the sunflower lemma | LeanEval.Combinatorics.ImprovedBoundsSunflowerLemma | 1 | active | true | R. Alweiss, S. Lovett, K. Wu, and J. Zhang, `Improved bounds for the sunflower lemma`, Annals of Math, 194 (3) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-3-ImprovedBoundsSunflowerLemma.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_improved_bounds_sunflower_lemma/ | [
"ImprovedBoundsSunflowerLemma.theorem_1_4"
] | [
"ImprovedBoundsSunflowerLemma.C"
] | [
"ImprovedBoundsSunflowerLemma.C",
"ImprovedBoundsSunflowerLemma.theorem_1_4"
] | [
"def",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "6b72646a269a2883a57f8e91dc86c1c17ec24593c351f031a21c08a514b6fc92", "ChallengeDeps.lean": "05e466809fb68efe4bc68e402224ef9d9f84a5dbcf2eb786f4af96134f5d92a1", "Solution.lean": "3293960c6565e9ad009011c8a1172b55f9fa99e02d2e8f51f04f62b264c92728", "Submission.lean": "b8a7f80feff49e14df3299b1d77b97811807ed... | |
annals_inscribed_rectangles | tasks/annals_inscribed_rectangles | Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios | LeanEval.Geometry.InscribedRectangles | 1 | active | true | C. Hugelmeyer, `Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios`, Annals of Math, 194 (2) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-2-InscribedRectangles.lean | Katerina Hristova | https://lean-lang.org/eval/problems/annals_inscribed_rectangles/ | [
"theorem_1"
] | [] | [
"InscribedRectangles.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "562cfc2628f7a4c48f06dbbe9e07641c6a8049636408ac747b7c3745aba2de44", "ChallengeDeps.lean": "75740dd982095f5876f7c67885e09f63bc53e7c11d9e8b10aac88fe90518f631", "Solution.lean": "ab5ed072cd914fb66ca35d2244bfe5d2de83eca4e5e6b7d2f2e10c403d5c1625", "Submission.lean": "992556219c882f96bfdf3bffda920459e4835c... | |
annals_integer_multiplication | tasks/annals_integer_multiplication | Integer multiplication in time O(n log n) | LeanEval.ModelTheory.IntegerMultiplication | 1 | active | true | D. Harvey and J. van der Hoeven, `Integer multiplication in time O(n log n)`, Annals of Math, 193 (2) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-193-2-IntegerMultiplication.lean | Justus Springer | The paper works in the "multitape Turing model, in which the time complexity of an algorithm refers to the number of steps performed by a deterministic Turing machine with a fixed, finite number of linear tapes". In this formalisation, we use mathlib's multi-stack machines (TM2), which are equivalent to multitape machi... | https://lean-lang.org/eval/problems/annals_integer_multiplication/ | [
"theorem_1_1"
] | [] | [
"IntegerMultiplication.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "94b0ff1c23289c7e9e933b11690126fe06f03af83b33ec10f4b9f9a93182b9b4", "ChallengeDeps.lean": "cb16229fc2909cbd327036e665cd0cb448533b9829a269d3e9789b2785178e79", "Solution.lean": "2b3ef4cda684a967babe3e287c00550334ed302eea645bd6b2404b9ab8924910", "Submission.lean": "f3c55e0875970c9c5d87ab1340eb9c335310b3... |
annals_large_value_estimates | tasks/annals_large_value_estimates | New large value estimates for Dirichlet polynomials | LeanEval.NumberTheory.LargeValueEstimates | 1 | active | true | L. Guth and J. Maynard, `New large value estimates for Dirichlet polynomials`, Annals of Math, 203 (2) 2026. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2026-203-2-LargeValueEstimates.lean | Thomas Browning | The proof binder `hb` is named `_hb` here. This is alpha-equivalent and suppresses an unused-variable warning in the generated `Solution.lean` delegation. | https://lean-lang.org/eval/problems/annals_large_value_estimates/ | [
"theorem_1_1"
] | [] | [
"LargeValueEstimates.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "19718cc4de4cd85acdcc51a2f7064999810a8828f00aad723f0d08eb7df130d7", "ChallengeDeps.lean": "547cf5d5397598d6c9bd932d3841c41d76e45639ce086cb61e715eab8cfac8ff", "Solution.lean": "c3eb57f560a036b33b58707b7ff0cce17d2c5d3ca0eff281497bd88fefa0c25c", "Submission.lean": "fb55c03e44b1834b3f0b691c61aa63bd24d1e7... |
annals_linear_subspaces | tasks/annals_linear_subspaces | Rational approximations to linear subspaces | LeanEval.NumberTheory.LinearSubspaces | 1 | active | true | N. de Saxcé, `Rational approximations to linear subspaces`, Annals of Math, 203 (3) 2026. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2026-203-3-LinearSubspaces.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_linear_subspaces/ | [
"theorem_1"
] | [] | [
"LinearSubspaces.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "7f8ca0f63497a465b58d5b2a8e4244ab79a448a2a0c0cbd24f4c77c31d3d4d92", "ChallengeDeps.lean": "319dad5e674764f0d9d94c52667a80043a219207fa5c8cbe1d983fbef5db16a7", "Solution.lean": "8072f0d364e996a87618344de86cf37d8d0dafcce11d2667116e1ed415e49d7b", "Submission.lean": "45f2112e96e9078fb6ed5bd40921877359affb... | |
annals_local_global_apollonian_circle_packings | tasks/annals_local_global_apollonian_circle_packings | The local-global conjecture for Apollonian circle packings is false | LeanEval.NumberTheory.LocalGlobalApollonianCirclePackings | 1 | active | true | S. Haag, C. Kertzer, J. Rickards, and K. E. Stange, `The local-global conjecture for Apollonian circle packings is false`, Annals of Math, 200 (2) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-200-2-LocalGlobalApollonianCi... | Thomas Browning | https://lean-lang.org/eval/problems/annals_local_global_apollonian_circle_packings/ | [
"LocalGlobalApollonianCirclePackings.theorem_1_6",
"LocalGlobalApollonianCirclePackings.theorem_1_3"
] | [] | [
"LocalGlobalApollonianCirclePackings.theorem_1_6",
"LocalGlobalApollonianCirclePackings.theorem_1_3"
] | [
"theorem",
"theorem"
] | 2 | true | 10,800 | {"Challenge.lean": "fe132522a0fc29282df5733c8a1e6b5bb7bf687a89085cdacf960801d5823816", "ChallengeDeps.lean": "e73ad7b849665c22af2572f87f69f72358199f7f5bd12a98bc069bae0e50149d", "Solution.lean": "f023d1471b97db07e201a47f395a481797aabfb44509a432b0d39d5501c8238e", "Submission.lean": "88cd82556615532af067acf899263345f29857... | |
annals_lorentzian_polynomials | tasks/annals_lorentzian_polynomials | Lorentzian polynomials | LeanEval.Combinatorics.LorentzianPolynomials | 1 | active | true | P. Brändén and J. Huh, `Lorentzian polynomials`, Annals of Math, 192 (3) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-3-LorentzianPolynomials.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_lorentzian_polynomials/ | [
"theorem_2_25"
] | [] | [
"LorentzianPolynomials.theorem_2_25"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "5fc415e88e8524eb4ab9d658acf1b6dccdcba05562d9a219b03c77df1e8a0b63", "ChallengeDeps.lean": "27821dbaa878e4ca6c88448a6aa6c848c873dcd90fdfc8fb473758c6fc55ecf4", "Solution.lean": "b3d6afeb4d619bea5ebc9bcef486f07cd67d007bc07e1193ab64bd7bd802e24d", "Submission.lean": "e22e4836498a3eb5a5d1825e4ca59be1589ef6... | |
annals_mckay_conjecture | tasks/annals_mckay_conjecture | The McKay Conjecture on character degrees | LeanEval.RepresentationTheory.McKayConjecture | 1 | active | true | M. Cabanes and B. Späth, `The McKay Conjecture on character degrees`, Annals of Math, 203 (3) 2026. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2026-203-3-McKayConjecture.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_mckay_conjecture/ | [
"theorem_1_1"
] | [] | [
"McKayConjecture.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "82cb0b301fb674b25267e757528164ccd86d557ef9ae6eac64470283f26fa481", "ChallengeDeps.lean": "2219c656374de610908fba67c202d1ddd088b323bd179e19addfef8869d3dee8", "Solution.lean": "f8bdbc4f58a0ea7ef45209e620f729f985f9f36902bdca31b820c16b8cf242a9", "Submission.lean": "a90650c4b9f6f26cbc2a823d1b313b03e20537... | |
annals_motivic_invariants | tasks/annals_motivic_invariants | Motivic invariants of birational maps | LeanEval.AlgebraicGeometry.MotivicInvariants | 1 | active | true | H.-Y. Lin and E. Shinder, `Motivic invariants of birational maps`, Annals of Math, 199 (1) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-199-1-MotivicInvariants.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_motivic_invariants/ | [
"MotivicInvariants.theorem_1_2_1_a",
"MotivicInvariants.theorem_1_2_1_b",
"MotivicInvariants.theorem_1_2_1_c",
"MotivicInvariants.theorem_1_2_1_d",
"MotivicInvariants.theorem_1_2_2",
"MotivicInvariants.theorem_1_2_3"
] | [] | [
"MotivicInvariants.theorem_1_2_1_a",
"MotivicInvariants.theorem_1_2_1_b",
"MotivicInvariants.theorem_1_2_1_c",
"MotivicInvariants.theorem_1_2_1_d",
"MotivicInvariants.theorem_1_2_2",
"MotivicInvariants.theorem_1_2_3"
] | [
"theorem",
"theorem",
"theorem",
"theorem",
"theorem",
"theorem"
] | 6 | true | 10,800 | {"Challenge.lean": "7bb71e376baa9db4d1669ef58cdd4ea6cc5a5e6f15d942e5e36e4d5d40ab2290", "ChallengeDeps.lean": "673262d775760504b8e0f1b32e0d392683185897ad985c159e0e5c80165f56e5", "Solution.lean": "a63fbd0dce1a7b478cafb55dc59c42a4dc39c82a6af30882e084da514781ed66", "Submission.lean": "19f6c9e84f697a0c009b158569edeea5ab7e0c... | |
annals_on_approximation_of_reals | tasks/annals_on_approximation_of_reals | On approximation to a real number by algebraic numbers of bounded degree | LeanEval.NumberTheory.OnApproximationOfReals | 1 | active | true | A. Poëls, `On approximation to a real number by algebraic numbers of bounded degree`, Annals of Math, 201 (1) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-201-1-OnApproximationOfReals.lean | Katerina Hristova, Kevin Buzzard | https://lean-lang.org/eval/problems/annals_on_approximation_of_reals/ | [
"theorem_1_1"
] | [] | [
"OnApproximationOfReals.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "7c11c67ab6da6e071eaf452a57d63e1181d1857d7056a4217d67b6cb48e8ebc5", "ChallengeDeps.lean": "e6249b7df263b3da9d594ffaa4cecedc3f44dd1afb8c6bc6c29d673322ddc369", "Solution.lean": "bb9917273f98a55ec8c78015ff3e4df7722d5a475943ebebef02934d90f77190", "Submission.lean": "4b7e98b8e43d5232abbf00d8d7fe41eb54eb4e... | |
annals_on_coherence_of_one_relator_groups | tasks/annals_on_coherence_of_one_relator_groups | On the coherence of one-relator groups and their group algebras | LeanEval.GroupTheory.OnCoherenceOfOneRelatorGroups | 1 | active | true | A. Jaikin-Zapirain and M. Linton, `On the coherence of one-relator groups and their group algebras`, Annals of Math, 201 (3) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-201-3-OnCoherenceOfOneRelatorGroups.lean | Katerina Hristova | https://lean-lang.org/eval/problems/annals_on_coherence_of_one_relator_groups/ | [
"theorem_1_1"
] | [] | [
"OnCoherenceOfOneRelatorGroups.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "ce1d02c4695e03f03446e7e9b7dbe18760ad3575ff0dc578a0e2d0fc8b44eec7", "ChallengeDeps.lean": "f4d23b346432cc0cb05b81e53c4afabea6e76625861f7280ff45b5863cdb0c2a", "Solution.lean": "2b6a494177432bd0d7bbb82feed8e4596313bbc6df47786dc4e038f2d3c02da8", "Submission.lean": "9b3d508c33639dbef79e5a1c57903ceab6e204... | |
annals_on_property_t | tasks/annals_on_property_t | On property (T) for Aut(F_n) and SL_n(Z) | LeanEval.GroupTheory.OnPropertyT | 1 | active | true | M. Kaluba, D. Kielak, and P. W. Nowak, `On property (T) for Aut(F_n) and SL_n(Z)`, Annals of Math, 193 (2) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-193-2-OnPropertyT.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_on_property_t/ | [
"theorem_1"
] | [] | [
"OnPropertyT.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "1c52e71912bbb8b486bfac8ffaf02e2cfc8894f497274ed4fc59eea1af954715", "ChallengeDeps.lean": "c6d1ac46486fc07932a01251ef39260f0cac9b964e3ec80817e3d5c811ab5d45", "Solution.lean": "634fe7ef65454306b303ecc27a96b93ce493a399038bd4227a8c6af71244da02", "Submission.lean": "fdf46692593db1cbe1464bed0f733b8c413d9a... | |
annals_optimal_moebius | tasks/annals_optimal_moebius | The optimal paper Moebius band | LeanEval.Geometry.OptimalMoebius | 1 | active | true | R. E. Schwartz, `The optimal paper Moebius band`, Annals of Math, 201 (1) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-201-1-OptimalMoebius.lean | Thomas Browning, Katerina Hristova | https://lean-lang.org/eval/problems/annals_optimal_moebius/ | [
"theorem_1_1"
] | [] | [
"OptimalMoebius.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "56ba122484fc22d94f04153a233de15d3a6ebbbfdc99f152278c14e694ea119c", "ChallengeDeps.lean": "02022b1672aabf2b0ae48ca0f4fded38ef0b785d11b5408947ed09fb9796ead0", "Solution.lean": "c46c151b7165a4446f410f1d2cd095fb213fcf0ce6f8e0d83c9be6f159c06aaf", "Submission.lean": "7ef169e7cb3062988aee91a151bf5f231614bf... | |
annals_periodic_tiling_conjecture | tasks/annals_periodic_tiling_conjecture | A counterexample to the periodic tiling conjecture | LeanEval.Combinatorics.PeriodicTilingConjecture | 1 | active | true | R. Greenfeld and T. Tao, `A counterexample to the periodic tiling conjecture`, Annals of Math, 200 (1) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-200-1-PeriodicTilingConjecture.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_periodic_tiling_conjecture/ | [
"PeriodicTilingConjecture.theorem_1_4",
"PeriodicTilingConjecture.corollary_1_6",
"PeriodicTilingConjecture.corollary_1_7"
] | [] | [
"PeriodicTilingConjecture.theorem_1_4",
"PeriodicTilingConjecture.corollary_1_6",
"PeriodicTilingConjecture.corollary_1_7"
] | [
"theorem",
"theorem",
"theorem"
] | 3 | true | 10,800 | {"Challenge.lean": "63bd89206b1810529801b1519255a766d80eff4c7bda628b0b0e530cfd51e431", "ChallengeDeps.lean": "1a76cb112c75990a4304bd9759de16b48edb145d9b8f6c918e7697292c93d3ea", "Solution.lean": "519596241a118fe351821a7545057ac4aead7b237d507ffa3996d3bafe113680", "Submission.lean": "23e0bc90f133d477cc1aec506c202d4e39b10a... | |
annals_pointwise_ergodic_theorems | tasks/annals_pointwise_ergodic_theorems | Pointwise ergodic theorems for non-conventional bilinear polynomial averages | LeanEval.Dynamics.PointwiseErgodicTheorems | 1 | active | true | B. Krause, M. Mirek, and T. Tao, `Pointwise ergodic theorems for non-conventional bilinear polynomial averages`, Annals of Math, 195 (3) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2022-195-3-PointwiseErgodicTheorems.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_pointwise_ergodic_theorems/ | [
"PointwiseErgodicTheorems.theorem_1_17_i",
"PointwiseErgodicTheorems.theorem_1_17_ii",
"PointwiseErgodicTheorems.theorem_1_17_iii",
"PointwiseErgodicTheorems.theorem_1_17_iv"
] | [
"PointwiseErgodicTheorems.Cᵢᵢᵢ",
"PointwiseErgodicTheorems.Cᵢᵥ"
] | [
"PointwiseErgodicTheorems.theorem_1_17_i",
"PointwiseErgodicTheorems.theorem_1_17_ii",
"PointwiseErgodicTheorems.Cᵢᵢᵢ",
"PointwiseErgodicTheorems.theorem_1_17_iii",
"PointwiseErgodicTheorems.Cᵢᵥ",
"PointwiseErgodicTheorems.theorem_1_17_iv"
] | [
"theorem",
"theorem",
"def",
"theorem",
"def",
"theorem"
] | 6 | true | 10,800 | {"Challenge.lean": "5ab0a53c4f1011c1e3eaa82c72ec42cb767bf4aab723ff72bc1dc496027c37d6", "ChallengeDeps.lean": "01aaeed9ec8619d7ed29b270462426141833602cf51687870e8fe7cbeb515fb3", "Solution.lean": "c322d1387c86d9edad6ab01f97a449414f696175d6908d868913529f1cff9faf", "Submission.lean": "8bc63db5ceb10ef6834fb551053e1acba2da38... | |
annals_pseudorandom_grassmann | tasks/annals_pseudorandom_grassmann | Pseudorandom sets in Grassmann graph have near-perfect expansion | LeanEval.Combinatorics.PseudorandomGrassmann | 1 | active | true | S. Khot, D. Minzer, and M. Safra, `Pseudorandom sets in Grassmann graph have near-perfect expansion`, Annals of Math, 198 (1) 2023. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2023-198-1-PseudorandomGrassmann.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_pseudorandom_grassmann/ | [
"theorem_1_12"
] | [] | [
"PseudorandomGrassmann.theorem_1_12"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "50758080f2ea831df60bf45ed6ada38eb48251735aa6ff03766eba5ffa281eab", "ChallengeDeps.lean": "dc0e6e9fa730ba3fa778073408baac5f0c87697058d62fa0361cbe6ec0a6b11f", "Solution.lean": "25e85b6d71f365ba5b5ad6eb3f7a897a4db0c25a0242b4922767c6994c51f79a", "Submission.lean": "92a0adc3a833aa90420f81d6349826b7249ad6... | |
annals_rademacher_enflo_type | tasks/annals_rademacher_enflo_type | Rademacher type and Enflo type coincide | LeanEval.Analysis.RademacherEnfloType | 1 | active | true | P. Ivanisvili, R. van Handel, and A. Volberg, `Rademacher type and Enflo type coincide`, Annals of Math, 192 (2) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-2-RademacherEnfloType.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_rademacher_enflo_type/ | [
"theorem_1_1"
] | [] | [
"RademacherEnfloType.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "71001aa935a658153e4d1fa6eb504b796c028f8cc0c5fe1d8a1db022a9cf4bef", "ChallengeDeps.lean": "9c8276cfe46600e9c0b2d6126dc65bb97d9907e90bf9bd2fcaf0e78a359834a0", "Solution.lean": "87bab003b99cf010053cd39b4f43e9450fae16a55a1d9f95a9dccb2ca7a73c3f", "Submission.lean": "e6609fe52d3a78a6ebef1a29efeab31fd83b56... | |
annals_random_bernoulli_matrices | tasks/annals_random_bernoulli_matrices | Singularity of random Bernoulli matrices | LeanEval.LinearAlgebra.RandomBernoulliMatrices | 1 | active | true | K. Tikhomirov, `Singularity of random Bernoulli matrices`, Annals of Math, 191 (2) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-191-2-RandomBernoulliMatrices.lean | David Ledvinka | The proof binders `mΩ`, `B_indep`, and `B_bernoulli` in `theorem_A` are prefixed with `_` here. This is alpha-equivalent and suppresses unused-variable warnings in the generated `Solution.lean` delegation. | https://lean-lang.org/eval/problems/annals_random_bernoulli_matrices/ | [
"RandomBernoulliMatrices.theorem_A",
"RandomBernoulliMatrices.corollary_1",
"RandomBernoulliMatrices.corollary_2"
] | [] | [
"RandomBernoulliMatrices.theorem_A",
"RandomBernoulliMatrices.corollary_1",
"RandomBernoulliMatrices.corollary_2"
] | [
"theorem",
"theorem",
"theorem"
] | 3 | true | 10,800 | {"Challenge.lean": "2059396b243c209e310f7d056f1760eb2622f65ab8dd383d4fc0ddd8da0078b2", "ChallengeDeps.lean": "0de51b113a4dd85fbd7f2ba24536d29c428c883b5c7d8cc639af275ce7d0096f", "Solution.lean": "103264c747a0aedc7c669c894ed02390a5baf59eb84d6b230514abb0603efb7a", "Submission.lean": "6e31e7a444d36c545fcb6bd55bb25b9b531b6d... |
annals_rectangular_peg_problem | tasks/annals_rectangular_peg_problem | The rectangular peg problem | LeanEval.Geometry.RectangularPegProblem | 1 | active | true | J. E. Greene and A. Lobb, `The rectangular peg problem`, Annals of Math, 194 (2) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-2-RectangularPegProblem.lean | Katerina Hristova | LeanEval renames upstream's declaration `theorem «theorem»` to `theorem_1` because the workspace generator cannot address a declaration whose basename is a reserved word; the statement is unchanged. | https://lean-lang.org/eval/problems/annals_rectangular_peg_problem/ | [
"theorem_1"
] | [] | [
"RectangularPegProblem.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "61734e8bdf7c335607629dc92de5017b84a39b4726fb555639d68c0dcd3a6ad6", "ChallengeDeps.lean": "a56975a9b6f1bcc5840e44cb5b0a4e90cb3264957f3f70ea8db73a11b7992c18", "Solution.lean": "464f109ac49f794b56c63a362da92b353251b64b4a9c9fa0ca0ae35a9fe16a52", "Submission.lean": "54e41caab26088d9f1b70e8252c8b63942d6c3... |
annals_reverse_minkowski | tasks/annals_reverse_minkowski | A reverse Minkowski theorem | LeanEval.NumberTheory.ReverseMinkowski | 1 | active | true | O. Regev, N. Stephens-Davidowitz, `A reverse Minkowski theorem`, Annals of Math, 199 (1) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-199-1-ReverseMinkowski.lean | Katerina Hristova | The proof binder `hℒℒ'` is named `_hℒℒ'` here. This is alpha-equivalent and suppresses an unused-variable warning in the generated `Solution.lean` delegation. | https://lean-lang.org/eval/problems/annals_reverse_minkowski/ | [
"theorem_1_2"
] | [] | [
"ReverseMinkowski.theorem_1_2"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "48e31dbdca062d33b08bdc050fd806b558d48c56773f59b5ff38fb75d92c2f30", "ChallengeDeps.lean": "505d0d3e739e9a9d30b3ad99436fdf4e026490771bc4c2c468c70a3ce14494f7", "Solution.lean": "999cde01f87a03b725fb32e5f1650dbb6e8f08496ea596fe0f818b5cc48cc4a2", "Submission.lean": "238e1c19d0cbb4e84bde19e9643bda179188c8... |
annals_simplicity_conjecture | tasks/annals_simplicity_conjecture | Proof of the simplicity conjecture | LeanEval.Dynamics.SimplicityConjecture | 1 | active | true | D. Cristofaro-Gardiner, V. Humilière, and S. Seyfaddini, `Proof of the simplicity conjecture`, Annals of Math, 199 (1) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-199-1-SimplicityConjecture.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_simplicity_conjecture/ | [
"theorem_1_2"
] | [] | [
"SimplicityConjecture.theorem_1_2"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "13d4e93e9ac7f0e477352d8f96cf822ce594dcbf14e5bbfe1e7e3e8f4a06829f", "ChallengeDeps.lean": "2eec59b0569a9a59b76184d8152844cf1b0e7e525b99820b56224b8fb2fb6508", "Solution.lean": "f69042d84726e601ca3c011c761c53113ec032471b4023c98a9425364da50dc8", "Submission.lean": "5b175ab7b24d012a8022254dfc6083cd96e30a... | |
annals_spread_of_a_finite_group | tasks/annals_spread_of_a_finite_group | The spread of a finite group | LeanEval.GroupTheory.SpreadOfAFiniteGroup | 1 | active | true | T. C. Burness, R. M. Guralnick, and S. Harper, `The spread of a finite group`, Annals of Math, 193 (2) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-193-2-SpreadOfAFiniteGroup.lean | Katerina Hristova | https://lean-lang.org/eval/problems/annals_spread_of_a_finite_group/ | [
"theorem_1"
] | [] | [
"SpreadOfAFiniteGroup.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "6d64016cf6046555866dc0e8e2780a2bd13a080d84bcc6afabb9fe17044d2cec", "ChallengeDeps.lean": "ddf78f260b2c5520d871ddbafadcd5cbb66eaf5983f4574b6805c2c612f4fb28", "Solution.lean": "9aa3d32bba7c1a98149725c6f82e9e081e4edfe0d1cc38db3e5b78e30fa1ba2a", "Submission.lean": "2ba811b7ffa0ee6c7136f9ef0f06f3106e6bd9... | |
annals_supremum_of_selector_processes | tasks/annals_supremum_of_selector_processes | On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes | LeanEval.Analysis.SupremumOfSelectorProcesses | 1 | active | true | J. Park and H. T. Pham, `On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes`, Annals of Math, 199 (3) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-199-3-SupremumOfSelector... | David Ledvinka | The five anonymous explicit instance binders in `theorem_1_3` are named because the generated delegation cannot forward inaccessible hygienic binder names. This is alpha-equivalent and does not change the statement. | https://lean-lang.org/eval/problems/annals_supremum_of_selector_processes/ | [
"SupremumOfSelectorProcesses.L₂_pos",
"SupremumOfSelectorProcesses.theorem_1_2",
"SupremumOfSelectorProcesses.L₃_pos",
"SupremumOfSelectorProcesses.theorem_1_3"
] | [
"SupremumOfSelectorProcesses.L₂",
"SupremumOfSelectorProcesses.L₃"
] | [
"SupremumOfSelectorProcesses.L₂",
"SupremumOfSelectorProcesses.L₂_pos",
"SupremumOfSelectorProcesses.theorem_1_2",
"SupremumOfSelectorProcesses.L₃",
"SupremumOfSelectorProcesses.L₃_pos",
"SupremumOfSelectorProcesses.theorem_1_3"
] | [
"def",
"theorem",
"theorem",
"def",
"theorem",
"theorem"
] | 6 | true | 10,800 | {"Challenge.lean": "0ed49af81fb1b5c607de7b7ce15d01eb3f14c249a62b12e5c202323a07678cc6", "ChallengeDeps.lean": "0cd218c759acf28628cbaccd65a613f851aa1500c255fd4f787dae3386b39019", "Solution.lean": "c13c270282699039c446f79df1d0189344ae7c75eb7ec1ba280f2519ab6987cb", "Submission.lean": "a20207501aa57360ffbae5a5711599fd28476a... |
annals_symplectic_monodromy | tasks/annals_symplectic_monodromy | Symplectic monodromy at radius zero and equimultiplicity of μ-constant families | LeanEval.Geometry.SymplecticMonodromy | 1 | active | true | J. Fernández de Bobadilla and T. Pełka, `Symplectic monodromy at radius zero and equimultiplicity of μ-constant families`, Annals of Math, 200 (1) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-200-1-SymplecticMonodromy.lea... | Justus Springer | https://lean-lang.org/eval/problems/annals_symplectic_monodromy/ | [
"theorem_1_1"
] | [] | [
"SymplecticMonodromy.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "7b1dca6f8b0d61f81864455305c98077eeabd253418db7103b7a32123507b221", "ChallengeDeps.lean": "37d3d8c7c8456db36f7bd8525dbe241f046151c719157e6041637d47fb2c184c", "Solution.lean": "28876c999dda377894c132076d04c80b7884a3cf4055e8764bb3914a6a9c01d3", "Submission.lean": "9412b713199f7429d87dfb3df76581398aad00... | |
annals_ulam | tasks/annals_ulam | A negative answer to Ulam's Problem 19 from the Scottish Book | LeanEval.ConvexGeometry.Ulam | 1 | active | true | D. Ryabogin, `A negative answer to Ulam's Problem 19 from the Scottish Book`, Annals of Math, 195 (3) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2022-195-3-Ulam.lean | Justus Springer | https://lean-lang.org/eval/problems/annals_ulam/ | [
"theorem_1"
] | [] | [
"Ulam.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "5179174860f38123496a9f1d3f8123707935b9a12a70eeac5a38d415ea8c113c", "ChallengeDeps.lean": "4c9aa232458cdea611a34b4b31f954a218e911e28796778272d8544b582d8fa9", "Solution.lean": "f3c493d79fcd151cb30ecb14d399fb3eebdfbfcae049bebaf12633c2a230dbb3", "Submission.lean": "615b9e046adebf46330a0511368e601a7a4969... | |
annals_uniform_mordell_lang | tasks/annals_uniform_mordell_lang | Uniformity in Mordell–Lang for curves | LeanEval.AlgebraicGeometry.UniformMordellLang | 1 | active | true | V. Dimitrov, Z. Gao, and P. Habegger, `Uniformity in Mordell–Lang for curves`, Annals of Math, 194 (1) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-1-UniformMordellLang.lean | Thomas Browning, Christian Merten | AnnalsChallenge states this theorem on top of Christian Merten's Jacobian challenge (`AnnalsChallenge/Definitions/AlgebraicJacobian.lean`). LeanEval's existing port of that file, problem `jacobian_challenge_alggeo`, omits the four declarations at its end, including the instances that supply the `CommGroup` and `Group.F... | https://lean-lang.org/eval/problems/annals_uniform_mordell_lang/ | [
"UniformMordellLang.JacobianChallenge.Jacobian.comp_ofCurve",
"UniformMordellLang.JacobianChallenge.Jacobian.exists_unique_ofCurve_comp",
"UniformMordellLang.theorem_1_1"
] | [
"UniformMordellLang.JacobianChallenge.genus",
"UniformMordellLang.JacobianChallenge.Jacobian",
"UniformMordellLang.JacobianChallenge.Jacobian.instGrpObj",
"UniformMordellLang.JacobianChallenge.Jacobian.smoothOfRelativeDimension_genus",
"UniformMordellLang.JacobianChallenge.Jacobian.instIsProper",
"Uniform... | [
"UniformMordellLang.JacobianChallenge.genus",
"UniformMordellLang.JacobianChallenge.Jacobian",
"UniformMordellLang.JacobianChallenge.Jacobian.instGrpObj",
"UniformMordellLang.JacobianChallenge.Jacobian.smoothOfRelativeDimension_genus",
"UniformMordellLang.JacobianChallenge.Jacobian.instIsProper",
"Uniform... | [
"def",
"def",
"def",
"def",
"def",
"def",
"def",
"theorem",
"theorem",
"def",
"def",
"def",
"theorem"
] | 13 | false | 10,800 | {"Challenge.lean": "92b4540f5edd52df9de471dd2510abdcc173e07637672a87f16ad79fcd5d453d", "Solution.lean": "962ad7d756177487fe0158c6769d9152dcfd8ce45e0f2ca52ed3ae98307408aa", "Submission.lean": "505e5a37a4c74416848ba47cc8fb647e8e639abd392547718ee277a8ac3e187c", "Submission/Helpers.lean": "b5b5c31e59632f5c10241037df5e8d8d3... |
annals_unit_conjecture | tasks/annals_unit_conjecture | A counterexample to the unit conjecture for group rings | LeanEval.GroupTheory.UnitConjecture | 1 | active | true | G. Gardam, `A counterexample to the unit conjecture for group rings`, Annals of Math, 194 (3) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-3-UnitConjecture.lean | Thomas Browning | https://lean-lang.org/eval/problems/annals_unit_conjecture/ | [
"theorem_A"
] | [] | [
"UnitConjecture.theorem_A"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "5ca5cf9bb144013703c8159f024f23bec2fa26117b153ee91c982a914ddc110c", "ChallengeDeps.lean": "20b81e8b8c8f5542349bf8edc6ad788c1383bc11cf1b6f598e37f7b35728a6c7", "Solution.lean": "bdf6f8266c61ac350232746b845d4323a84d42025ffe8f24e8aebb54d3b2a7c2", "Submission.lean": "07750c6d99e714a564e75195d63d3ff973a4ba... | |
annals_van_der_waerden_conjecture | tasks/annals_van_der_waerden_conjecture | Galois groups of random integer polynomials and van der Waerden's Conjecture | LeanEval.NumberTheory.VanDerWaerdenConjecture | 1 | active | true | M. Bhargava, `Galois groups of random integer polynomials and van der Waerden's Conjecture`, Annals of Math, 201 (2) 2025. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2025-201-2-vanDerWaerdenConjecture.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_van_der_waerden_conjecture/ | [
"theorem_1"
] | [] | [
"vanDerWaerdenConjecture.theorem_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "d15506e23acb378127caeda1915dc5327459e95537a140e2fa7a7b5060c9ee58", "ChallengeDeps.lean": "4927132f1dad11bfa3bac7be59832fcabd7cda11fa87a404b6b596ea02c1d17f", "Solution.lean": "d2a5bf620dd2fbcb652a0377f5f6afb86f43e646b9d1bb18c2d786bcc2fc4a89", "Submission.lean": "2f9b5c274b12bfc475bdea2430d4dc2c5acee1... | |
annals_viscosity_solutions | tasks/annals_viscosity_solutions | Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem | LeanEval.Analysis.ViscositySolutions | 1 | active | true | E. Maderna and A. Venturelli, `Viscosity solutions and hyperbolic motions: a new PDE method for the N-body problem`, Annals of Math, 192 (2) 2020. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2020-192-2-ViscositySolutions.lean | David Ledvinka | https://lean-lang.org/eval/problems/annals_viscosity_solutions/ | [
"theorem_1_1"
] | [] | [
"ViscositySolutions.theorem_1_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "0545092b2e0d7fc7e54c44abed16ec0efb45cff3f9589b0079185f4bc760a3e9", "ChallengeDeps.lean": "e16bb7aca23181d50a6b55ce939a5c0173131688152ed84ecd9a63c62fea84da", "Solution.lean": "ad9fce0271326e4265c5f09a6a619dd129c218b719023b141674bf8ffb69b255", "Submission.lean": "5019b499bfc2b66f23ac9d07955fbb742c672b... | |
annals_wilkies_conjecture | tasks/annals_wilkies_conjecture | Wilkie's conjecture for Pfaffian structures | LeanEval.ModelTheory.WilkiesConjecture | 1 | active | true | G. Binyamini, D. Novikov, and B. Zak, `Wilkie's conjecture for Pfaffian structures`, Annals of Math, 199 (2) 2024. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2024-199-2-WilkiesConjecture.lean | Justus Springer, Mathias Stout | https://lean-lang.org/eval/problems/annals_wilkies_conjecture/ | [
"corollary_1"
] | [] | [
"WilkiesConjecture.corollary_1"
] | [
"theorem"
] | 1 | true | 10,800 | {"Challenge.lean": "a5060ed0b98c9c1614da0a176d5f13b8b80c625af36b042b2efc6d53942b1b8c", "ChallengeDeps.lean": "206307a36059284411c4d4b430f0fda629620d270356016780ed9067f230eeae", "Solution.lean": "9a6fef13d02b3fe37f08a974e5331dea1579a5df179b90b5b48051f567780a73", "Submission.lean": "77a9f54c7b96d5e27274c52cba7ef3c3606377... | |
annals_zagier_hoffman_positive_char | tasks/annals_zagier_hoffman_positive_char | On Zagier-Hoffman's conjectures in positive characteristic | LeanEval.NumberTheory.ZagierHoffmanPositiveChar | 1 | active | true | T. N. Dac, `On Zagier-Hoffman's conjectures in positive characteristic`, Annals of Math, 194 (1) 2021. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge (v1.0.0, e32eb14), AnnalsChallenge/AnnalsOfMathematics/2021-194-1-ZagierHoffmanPositiveChar.lean | Katerina Hristova | Throughout the definitions and statements, we reindex the `i`'s so that they run from `0` to `r - 1` rather than from `1` to `r`. | https://lean-lang.org/eval/problems/annals_zagier_hoffman_positive_char/ | [
"ZagierHoffmanPositiveChar.theorem_A",
"ZagierHoffmanPositiveChar.theorem_B",
"ZagierHoffmanPositiveChar.theorem_D"
] | [] | [
"ZagierHoffmanPositiveChar.theorem_A",
"ZagierHoffmanPositiveChar.theorem_B",
"ZagierHoffmanPositiveChar.theorem_D"
] | [
"theorem",
"theorem",
"theorem"
] | 3 | true | 10,800 | {"Challenge.lean": "7d3d690fc19a74769178de8b6e7b32dd44755f272e9352158b6141d15e7b9b8d", "ChallengeDeps.lean": "69ed2aeb651b672f0a70c6b2c91eecb009951d71a16b79a1d2ac419043e4b940", "Solution.lean": "949726223eea16a2eee967db30edde595e87a028547251e6d2629ca7fa98de30", "Submission.lean": "f60ce5fcc12515298462b756655732a7509039... |
AnnalsChallenge RL
Lean theorem-proving tasks from 50 Annals of Mathematics papers, packaged as RL environments for Harbor.
We at Desargues adapted AnnalsChallenge into Harbor environments for experiments with theorem-proving agents.
The Annals of Mathematics is one of the leading journals in mathematics. AnnalsChallenge formalizes statements of main results from 50 papers published there since 2020, using Lean 4 and Mathlib. The statements are provided without formalized proofs: completing those proofs is the challenge.
Why statement quality matters
Lean checks whether a proof establishes the supplied formal statement. If translating a paper into Lean accidentally weakens the conclusion or changes a definition, a correct proof can still miss the intended mathematics.
AnnalsChallenge's statements were formalized by hand, using Mathlib's community-reviewed definitions wherever possible. Each formalization underwent detailed human review and additional AI audits to check its correspondence with the paper. When the intended meaning was unclear, the team consulted the original authors. This gives greater confidence that agents are working on faithful formalizations of the published results. Methodology
This release packages the tasks with agent instructions, a Lean environment, and a separate submission verifier. Each paper becomes one task, with 95 missing proofs, definitions, and instances across the collection. A task earns reward 1 only when every designated target passes verification.
We were inspired by FineEnvs/openai-math and adapted its Harbor packaging and verifier infrastructure.
How a task works
The agent runs in an offline Linux sandbox with Lean and prebuilt Mathlib. The task instruction initializes /workspace from a bundled starter package. The agent edits Submission.lean and may add Lean helpers under Submission/.
Harbor collects those files and grades them in a separate fresh sandbox using trusted copies of Challenge.lean, optional ChallengeDeps.lean, and Solution.lean. The last file is a fixed bridge to the solver's declarations; it is not a reference proof. Comparator checks the original theorem and definition-hole contract with the permitted axioms propext, Quot.sound, and Classical.choice.
- Reward 1: every designated declaration is accepted by Comparator.
- Reward 0: the submitted formalization fails the check or runs out of its grading budget.
The evaluator uses FineEnvs's direct Comparator approach. Partial progress has no separate reward.
The runtime library policy is Mathlib only. The generated upstream lakefiles also allow Lean Pool for solutions; this optional dependency is omitted here. The original lakefiles remain unchanged under sources/lean-eval for provenance. Supplied task statements and starter modules do not import Lean Pool.
What's included
This release contains 50 Harbor environments with 95 proof, definition, and instance targets. Each environment includes agent instructions, a bundled Lean workspace, and a verifier that checks submissions in a separate sandbox.
The shared Docker image builds successfully, and all 50 starter packages compile. Instructions for building and running the environments are below; detailed test results are in the generator documentation.
tasks/: 50 Harbor task directories, each with instructions, identical environment inputs, trusted task data and the verifier.registry.json: dataset registry entryannals-math-rl@1.0.manifest.jsonandmanifest.parquet: one record per paper, including holes, upstream status, source identifiers and hashes.generator/: offline generator, shared image recipe, snapshot helper and packaging tests.sources/lean-eval/: selected upstream manifests and generated packages, copied byte for byte with a SHA-256 provenance manifest.sources.lock.json: pinned upstream and runtime revisions.LICENSE,NOTICEandLICENSE-*: licensing and attribution.
No solution/ or oracle implementation is included. This release does not assess proof availability or task solvability.
Run with Harbor
Use Python 3.12+ and Harbor 0.24 with support for schema 1.4 and separate verifier environments. Download this package with hf download desargues-hf/annals-math-rl --repo-type dataset --local-dir annals-math-rl, then change into that directory. The Daytona example requires DAYTONA_API_KEY, DAYTONA_API_URL, and credentials for the chosen agent:
python3 -m venv .venv
source .venv/bin/activate
python -m pip install -e './generator[run]'
python3 -m annals_challenge_harbor.snapshot
SNAP=$(python3 -m annals_challenge_harbor.snapshot --print-name)
harbor run -p tasks -e daytona --ek snapshot_template_name="$SNAP" \
-a AGENT_NAME -m MODEL_NAME -i annals_random_bernoulli_matrices -n 1
The image needs Linux with Landlock support. It builds pinned Lean, Mathlib, Comparator, lean4export and landrun. Build-time downloads are required; task execution and grading run without network access. Every task's environment directory is identical, so the snapshot is shared.
Each task requests 4 CPUs, 8 GiB memory and 10 GiB storage. The agent budget is four hours. Comparator has three hours, within a verifier budget of three hours and fifteen minutes. These fixed limits describe resources, not expected proof difficulty.
Regenerate offline
python3 -m pip install -e ./generator
python3 -m annals_challenge_harbor.adapter
The default source is the vendored snapshot. Its complete file inventory and hashes are verified before generation. To initially populate the source subset from the pinned upstream checkout/archive:
python3 -m annals_challenge_harbor.adapter --source /path/to/pinned/lean-eval --out .
Generation includes exactly 50 tasks and 95 holes. It stages all starters in the shared image before copying that image into the tasks. It does not download proofs or run an oracle.
Runtime Lean is leanprover/lean4:v4.35.0-rc3; Mathlib is 5e0c4e5239cb0a2d86d68a884bf52cfd963fce22. Comparator and exporter have their own explicit build setup; consult sources.lock.json and generator/README.md for the complete pins and architecture.
Sources and task coverage
The mathematical statements originate from AnnalsChallenge at e32eb1411db0d700ca874dd695aea92f78699db8. This release preserves the supplied Lean declarations, their dependencies and their designated holes. Complete source revisions and hashes are recorded in sources.lock.json and the vendored source inventory.
All 50 Annals-tagged upstream manifests are included regardless of upstream status. Status and statement revision are preserved in task metadata; the live leaderboard's default view may show fewer tasks.
Attribution
The mathematical statements were formalized by the AnnalsChallenge team. This release was inspired by FineEnvs/openai-math and adapts its Harbor packaging and verifier infrastructure.
The source materials and adapted infrastructure are licensed under Apache-2.0. Preserve the source copyright notices and accompanying license files.
For the mathematical dataset, cite A dataset of formalised theorem statements from the Annals of Mathematics. This package is an independent environment adaptation and does not claim endorsement by those projects.
- Downloads last month
- 182