The Grothendieckian Programme
Published October 28, 2026 | Version 1.0
Preprint Open

The 57 Grothendieckian Problems: Open Problems for Mathematics and Machine Reasoning from the Grothendieckian Programme

Authors/Creators

  • 1. WiseMotif.ai

Description

The 57 Grothendieckian Problems
Open Problems for Mathematics and Machine Reasoning from the Grothendieckian Programme
Preprint, version 1.0. The third of three papers released together.

We state fifty-seven open problems drawn from the seven works of the Grothendieckian Programme (34 volumes, 26,021 pages, released openly in October 2026 as first drafts that have not been peer-reviewed). Thirty-five come from the two works on the architecture of a reasoning system and twenty-two from the five works that each take a named conjecture or programme as research subject; no problem is one of those conjectures. Each problem is stated in the words of its source, located by work, chapter and page, given the status the source assigns it, and paired with a criterion that decides when it is solved, a note on existing work and the date of a literature check. The problems are of three kinds: twenty-five mathematical problems, nineteen machine problems with success criteria fixed in advance, and thirteen formalization problems for Lean 4 and Mathlib. Every quotation from the sources has been checked against the published PDFs, and each problem has been checked against the literature as of 28 October 2026; a machine-readable version accompanies the paper.

The three papers:

  • 1. The Grothendieckian Programme: An Overview — Seven Open Works on Mathematics and Machine Reasoning — doi:10.5281/zenodo.23734421
  • 2. The Rising-Sea Theses — Twelve Theses on Mathematics and Machine Reasoning — doi:10.5281/zenodo.23734423
  • 3. The 57 Grothendieckian Problems — Open Problems for Mathematics and Machine Reasoning from the Grothendieckian Programme — doi:10.5281/zenodo.23734426 (this record)

The works of the Grothendieckian Programme (the overview volume and Series 01–07), cited by this paper:

Files. The-57-Grothendieckian-Problems.pdf (the paper); SHA256SUMS lists the SHA-256 digests of the three papers, SHA256SUMS.asc is its detached OpenPGP signature by the author, SHA256SUMS.tsr an RFC 3161 timestamp token and SHA256SUMS.ots an OpenTimestamps proof over it; VincentLiu-signing-key.asc is the public key. The same five files are in the records of the three papers.

Code and data. grothendieckian-problems-v1.0.0-code.zip (80.4 MiB, 311 files) is the repository of the three papers at the signed tag v1.0.0 (commit 18c755f3f521), without the three PDFs: the sources of the papers, the 57 problem cards, problems.json, the Lean statements, the scripts that produced and checked the papers, the records of the checks, and the figures with their data and source code. SHA-256 43baa0268e1233c3d63edf573490a935672cb7b43967b9c64b9817042ac8f9ad. The archive is not listed in SHA256SUMS; its integrity rests on the signed tag: every file can be compared with v1.0.0 after git verify-tag v1.0.0.

Repository. The sources of the three papers, their figures with data and source code, the scripts that checked them and the records of the checks, the 57 problem cards, problems.json and the Lean statements: https://github.com/AlienMuse/grothendieckian-problems; each problem has its own discussion thread there.

Claim boundary. None of the seven works claims a proof of the Riemann Hypothesis, the Birch and Swinnerton-Dyer conjecture, the Hodge conjecture, the abc conjecture or the Langlands correspondence; the works are first drafts and have not been peer-reviewed. This paper adds no mathematical result to them.

Use of AI tools. The main ideas and the architecture of the Grothendieckian Programme are the author's and come from the author's research at WiseMotif.ai. In the seven works, AI tools assisted with drafting and with part of the literature collation; all of the text was reviewed by the author. Lean verification of the seven works is incomplete. Because of their size, the works are first drafts (Research Architecture Edition 1) and have not been peer-reviewed; they need review by experts and further work on the programme. They are released openly for that purpose, in the hope of further contributions and of more recursive mathematical discovery in AI for mathematics. For the present paper, statements were extracted from the published works by script and checked against the PDFs; AI tools assisted with drafting and with literature collation; the author selected the theses and problems and reviewed every statement.

Funding and competing interests. No external funding. The author is affiliated with WiseMotif.ai.

Licence. The paper, its figures and its data: Creative Commons Attribution 4.0 International (CC BY 4.0). The code — the Lean files, the scripts, the typesetting files and the source code of the figures, in the repository and in the code archive grothendieckian-problems-v1.0.0-code.zip — Apache License 2.0; the archive contains both licence texts (LICENSE, LICENSE-CODE) and a NOTICE that assigns each directory. The seven works and the overview volume keep their licence, CC BY-NC-ND 4.0; the quotations from them are reproduced under it with attribution.

The adjective Grothendieckian names a mathematical method used in the seven works. It carries no attribution of design or endorsement to Alexander Grothendieck or to any other mathematician whose work is cited.

Notes

The third of three papers released together: The Grothendieckian Programme: An Overview; The Rising-Sea Theses; The 57 Grothendieckian Problems. Typeset with Pandoc 3.9 and LuaHBTeX 1.21.0 (TeX Live 2025) in TeX Gyre Pagella; figures rendered at 605 ppi; all fonts embedded.

Files

The-57-Grothendieckian-Problems.pdf

Files (116.5 MB)

Name Size
md5:e886ffcf9ff8f56ae390387422f55bcd
84.3 MB Preview Download
md5:d672f3fe0f08a5c1930cea7b2482568a
306 Bytes Download
md5:4a6942052de943a9a994d99c2df30a5c
228 Bytes Download
md5:cd44caa4c629ed9c443c8024e5e090a4
945 Bytes Download
md5:324cab74a09c34ee5a11958a8df9752b
4.6 kB Download
md5:5d50f2de5c0a380c067daa716a860ece
32.2 MB Preview Download
md5:0e32e2e86dd35ebdf330036fc693b107
839 Bytes Download

Additional details

Is identical to
Preprint: https://github.com/AlienMuse/grothendieckian-problems/releases/tag/v1.0.0 (URL)
Is supplemented by
Software: https://github.com/AlienMuse/grothendieckian-problems (URL)
References
Book: 10.5281/zenodo.23669107 (DOI)
Book: 10.5281/zenodo.23480696 (DOI)
Book: 10.5281/zenodo.23538544 (DOI)
Book: 10.5281/zenodo.23564898 (DOI)
Book: 10.5281/zenodo.23585887 (DOI)
Book: 10.5281/zenodo.23597954 (DOI)
Book: 10.5281/zenodo.23610034 (DOI)
Book: 10.5281/zenodo.23629681 (DOI)
Preprint: 10.5281/zenodo.23734421 (DOI)
Preprint: 10.5281/zenodo.23734423 (DOI)

Dates

Created
2026-10-28

References

  • [S00] Vincent Liu, The Grothendieckian Programme: Recursive Mathematical Discovery in the Age of Machine Reasoning, Zenodo, 2026, An overview of Series 01–07; WiseMotif Monograph of Mathematical Intelligence, Series 00, doi:10.5281/zenodo.23669107.
  • [S01] Vincent Liu, GAI-MUA: The Grothendieckian Machine. A Mathematical Universe Architecture for Verifiable and Self-Evolving Artificial Intelligence, Zenodo, 2026, WiseMotif Monograph of Mathematical Intelligence, Series 01; 6 volumes, doi:10.5281/zenodo.23480696.
  • [S02] Vincent Liu, GM-Omega-Infinity: Topos-Native Intelligence. A Sheaf-Theoretic Architecture for Verifiable Machine Intelligence, Zenodo, 2026, Series 02; 5 volumes, doi:10.5281/zenodo.23538544.
  • [S03] Vincent Liu, Arithmetic Spectral Descent: Obstruction Theory, Hodge–Krein Realization, and a Falsifiable Architecture for the Riemann Hypothesis, Zenodo, 2026, Series 03; 4 volumes, doi:10.5281/zenodo.23564898.
  • [S04] Vincent Liu, Fractured Adelic Geometry: A Foundational Framework for the Birch and Swinnerton-Dyer Conjecture, Zenodo, 2026, Series 04; 4 volumes, doi:10.5281/zenodo.23585887.
  • [S05] Vincent Liu, The Archimedean Prism: Tame Period Geometry and the Hodge Conjecture, Zenodo, 2026, Series 05; 5 volumes, doi:10.5281/zenodo.23597954.
  • [S06] Vincent Liu, Strained Prismatic Geometry: Deformation over the Absolute Base and the abc Conjecture, Zenodo, 2026, Series 06; 5 volumes, doi:10.5281/zenodo.23610034.
  • [S07] Vincent Liu, The Arithmetic Topos: Foundations of a Trace-Theoretic Approach to the Langlands Programme, Zenodo, 2026, Series 07; 5 volumes, doi:10.5281/zenodo.23629681.
  • [ACG+24] Arash Ahmadian, Chris Cremer, Matthias Gallé, Marzieh Fadaee, Julia Kreutzer, Olivier Pietquin, Ahmet Üstün, and Sara Hooker, Back to basics: revisiting REINFORCE-style optimization for learning from human feedback in LLMs, Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (ACL 2024), 2024, arXiv:2402.14740.
  • [AGK+20] Dima Arinkin, Dennis Gaitsgory, David Kazhdan, Sam Raskin, Nick Rozenblyum, and Yakov Varshavsky, Duality for automorphic sheaves with nilpotent singular support, preprint, 2020, arXiv:2012.07665.
  • [Alt15] S. Ali Altuğ, Beyond endoscopy via the trace formula: 1. Poisson summation and isolation of special representations, Compos. Math. 151 (2015), 1791–1820, doi:10.1112/S0010437X15007320.
  • [AMP26] Gabriel Angelini-Knoll, Mona Merling, and Maximilien Péroux, Topological ΔG-homology of rings with twisted G-action, Adv. Math. (2026), 110907, doi:10.1016/j.aim.2026.110907.
  • [AMS08] P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, 2008, doi:10.1515/9781400830244.
  • [Bar89] David A. Mix Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹, J. Comput. System Sci. 38 (1989), 150–164, doi:10.1016/0022-0000(89)90037-890037-8).
  • [BBCV21] Michael M. Bronstein, Joan Bruna, Taco Cohen, and Petar Veličković, Geometric deep learning: grids, groups, graphs, geodesics, and gauges, preprint, 2021, arXiv:2104.13478.
  • [BCD+26] Joanna Bieri, Edgar Costa, Alyson Deines, Kyu-Hwan Lee, David Lowry-Duda, Thomas Oliver, Yidi Qi, and Tamara Veenstra, Murmurations, Mestre–Nagao sums, and convolutional neural networks for elliptic curves, preprint, 2026, arXiv:2603.17681.
  • [BDCLB22] Cristian Bodnar, Francesco Di Giovanni, Benjamin Paul Chamberlain, Pietro Liò, and Michael M. Bronstein, Neural sheaf diffusion: a topological perspective on heterophily and oversmoothing in GNNs, Advances in Neural Information Processing Systems 35 (NeurIPS 2022), 2022, arXiv:2202.04579.
  • [BIS90] David A. Mix Barrington, Neil Immerman, and Howard Straubing, On uniformity within NC¹, J. Comput. System Sci. 41 (1990), 274–306, doi:10.1016/0022-0000(90)90022-D90022-D).
  • [BK90] Spencer Bloch and Kazuya Kato, L-functions and Tamagawa numbers of motives, The Grothendieck Festschrift, Vol. I, Progr. Math. 86, Birkhäuser, 1990, pp. 333–400, DOI of the 2007 Modern Birkhäuser Classics reprint, doi:10.1007/978-0-8176-4574-8_9.
  • [BKLPR15] Manjul Bhargava, Daniel M. Kane, Hendrik W. Lenstra Jr., Bjorn Poonen, and Eric Rains, Modeling the distribution of ranks, Selmer groups, and Shafarevich–Tate groups of elliptic curves, Camb. J. Math. 3 (2015), 275–321, doi:10.4310/CJM.2015.v3.n3.a1.
  • [BL22] Bhargav Bhatt and Jacob Lurie, Absolute prismatic cohomology, preprint, 2022, arXiv:2201.06120.
  • [BL95] Arnaud Beauville and Yves Laszlo, Un lemme de descente, C. R. Acad. Sci. Paris Sér. I Math. 320 (1995), 335–340.
  • [Bre11] Emmanuel Breuillard, A height gap theorem for finite subsets of GL_d(Q̄) and nonamenable subgroups, Ann. of Math. (2) 174 (2011), 1057–1110, doi:10.4007/annals.2011.174.2.7.
  • [BS22] Bhargav Bhatt and Peter Scholze, Prisms and prismatic cohomology, Ann. of Math. (2) 196 (2022), 1135–1275, doi:10.4007/annals.2022.196.3.5.
  • [Bui05] Alexandru Buium, Arithmetic Differential Equations, Mathematical Surveys and Monographs 118, Amer. Math. Soc., 2005, doi:10.1090/surv/118.
  • [BW05] Henk Barendregt and Freek Wiedijk, The challenge of computer mathematics, Philos. Trans. R. Soc. A 363 (2005), 2351–2375, doi:10.1098/rsta.2005.1650.
  • [Car24] Mario Carneiro, Lean4Lean: towards a verified typechecker for Lean, in Lean, preprint, 2024, arXiv:2403.14064.
  • [Car81] Jack Carr, Applications of Centre Manifold Theory, Applied Mathematical Sciences 35, Springer, 1981, doi:10.1007/978-1-4612-5929-9.
  • [CC21] Alain Connes and Caterina Consani, Weil positivity and trace formula, the archimedean place, Selecta Math. (N.S.) 27 (2021), 77, doi:10.1007/s00029-021-00689-4.
  • [CCHM18] Cyril Cohen, Thierry Coquand, Simon Huber, and Anders Mörtberg, Cubical type theory: a constructive interpretation of the univalence axiom, 21st International Conference on Types for Proofs and Programs (TYPES 2015), LIPIcs 69, 2018, pp. 5:1–5:34, doi:10.4230/LIPIcs.TYPES.2015.5.
  • [CDK95] Eduardo Cattani, Pierre Deligne, and Aroldo Kaplan, On the locus of Hodge classes, J. Amer. Math. Soc. 8 (1995), 483–506, doi:10.1090/S0894-0347-1995-1273413-2.
  • [CF09] Jacques Carette and William M. Farmer, A review of mathematical knowledge management, Intelligent Computer Mathematics (MKM 2009), Lecture Notes in Comput. Sci. 5625, Springer, 2009, pp. 233–246, doi:10.1007/978-3-642-02614-0_21.
  • [Cow24] Alex Cowan, Murmurations and ratios conjectures, preprint, 2024, arXiv:2408.12723.
  • [DBDL24] Leonardo Di Nino, Sergio Barbarossa, and Paolo Di Lorenzo, Learning sheaf Laplacian optimizing restriction maps, 58th Asilomar Conference on Signals, Systems, and Computers, IEEE, 2024, doi:10.1109/IEEECONF60004.2024.10942997.
  • [Del71] Pierre Deligne, Théorie de Hodge. II, Publ. Math. Inst. Hautes Études Sci. 40 (1971), 5–57, doi:10.1007/BF02684692.
  • [Del74] Pierre Deligne, La conjecture de Weil. I, Publ. Math. Inst. Hautes Études Sci. 43 (1974), 273–307, doi:10.1007/BF02684373.
  • [Den98] Christopher Deninger, Some analogies between number theory and dynamical systems on foliated spaces, Proceedings of the International Congress of Mathematicians, Vol. I (Berlin, 1998), Doc. Math. Extra Vol. ICM I, 1998, pp. 163–186.
  • [DG15] Vladimir Drinfeld and Dennis Gaitsgory, Compact generation of the category of D-modules on the stack of G-bundles on a curve, Camb. J. Math. 3 (2015), 19–125, doi:10.4310/CJM.2015.v3.n1.a2.
  • [DMPR21] Emanuele Dotto, Kristian Moi, Irakli Patchkoria, and Sune Precht Reeh, Real topological Hochschild homology, J. Eur. Math. Soc. 23 (2021), 63–152, doi:10.4171/jems/1007.
  • [Dri20] Vladimir Drinfeld, Prismatization, preprint, 2020, arXiv:2005.04746.
  • [DV66] Jack B. Dennis and Earl C. Van Horn, Programming semantics for multiprogrammed computations, Comm. ACM 9 (1966), 143–155, doi:10.1145/365230.365252.
  • [DVB+21] Alex Davies, Petar Veličković, Lars Buesing, Sam Blackwell, Daniel Zheng, Nenad Tomašev, Richard Tanburn, Peter Battaglia, Charles Blundell, András Juhász, Marc Lackenby, Geordie Williamson, Demis Hassabis, and Pushmeet Kohli, Advancing mathematics by guiding human intuition with AI, Nature 600 (2021), 70–74, doi:10.1038/s41586-021-04086-x.
  • [EEKW24] Melissa Emory, Malors Espinosa-Lara, Debanjana Kundu, and Tian An Wong, Beyond endoscopy via Poisson summation for GL(2, K), preprint, 2024, arXiv:2404.10139.
  • [Efi24] Alexander I. Efimov, K-theory and localizing invariants of large categories, preprint, 2024, arXiv:2405.12169.
  • [EW10] Ran El-Yaniv and Yair Wiener, On the foundations of noise-free selective classification, J. Mach. Learn. Res. 11 (2010), 1605–1641, https://www.jmlr.org/papers/v11/el-yaniv10a.html.
  • [Faj88] Siemion Fajtlowicz, On conjectures of Graffiti, Discrete Math. 72 (1988), 113–118, doi:10.1016/0012-365X(88)90199-990199-9).
  • [FKKG24] Sebastian Farquhar, Jannik Kossen, Lorenz Kuhn, and Yarin Gal, Detecting hallucinations in large language models using semantic entropy, Nature 630 (2024), 625–630, doi:10.1038/s41586-024-07421-0.
  • [FLM+26] Moritz Firsching, Paul Lezeau, Salvatore Mercuri, Miklós Z. Horváth, Yaël Dillies, Calle Sönne, Eric Wieser, Fred Zhang, Thomas Hubert, Blaise Agüera y Arcas, and Pushmeet Kohli, Formal Conjectures: an open and evolving benchmark for verified discovery in mathematics, preprint, 2026, arXiv:2605.13171.
  • [FS21] Laurent Fargues and Peter Scholze, Geometrization of the local Langlands correspondence, preprint, 2021, arXiv:2102.13459.
  • [FZS22] William Fedus, Barret Zoph, and Noam Shazeer, Switch transformers: scaling to trillion parameter models with simple and efficient sparsity, J. Mach. Learn. Res. 23 (2022), no. 120, 1–39, arXiv:2101.03961.
  • [Gai18] Dennis Gaitsgory, A "strange" functional equation for Eisenstein series and miraculous duality on the moduli stack of bundles, Ann. Sci. Éc. Norm. Supér. (4) 50 (2017), 1123–1162, doi:10.24033/asens.2341.
  • [Gan13] Mohan Ganesalingam, The Language of Mathematics: A Linguistic and Philosophical Investigation, Lecture Notes in Comput. Sci. 7805, Springer, 2013, doi:10.1007/978-3-642-37012-0.
  • [Gir71] Jean Giraud, Cohomologie non abélienne, Grundlehren der mathematischen Wissenschaften 179, Springer, 1971, doi:10.1007/978-3-662-62103-5.
  • [GKNB21] Daniel Gratzer, G. A. Kavvos, Andreas Nuyts, and Lars Birkedal, Multimodal dependent type theory, Log. Methods Comput. Sci. 17 (2021), no. 3, 11:1–11:67, doi:10.46298/lmcs-17(3:11)20212021).
  • [GLD+24] Bruno Gavranović, Paul Lessard, Andrew Dudzik, Tamara von Glehn, João G. M. Araújo, and Petar Veličković, Position: categorical deep learning is an algebraic theory of all architectures, Proceedings of the 41st International Conference on Machine Learning (ICML 2024), PMLR 235, 2024, arXiv:2402.15332.
  • [GM82] Joseph A. Goguen and José Meseguer, Security policies and security models, 1982 IEEE Symposium on Security and Privacy, IEEE, 1982, pp. 11–20, doi:10.1109/SP.1982.10014.
  • [Gra22] Daniel Gratzer, Normalization for multimodal type theory, Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), ACM, 2022, pp. 1–13, doi:10.1145/3531130.3532398.
  • [Gro26] Akiva Groskin, A finite Guinand-Weil dictionary and archimedean tail order for the truncated Weil quadratic form, preprint, 2026, arXiv:2607.02828.
  • [HG19] Jakob Hansen and Robert Ghrist, Toward a spectral theory of cellular sheaves, J. Appl. Comput. Topol. 3 (2019), 315–358, doi:10.1007/s41468-019-00038-7.
  • [Hig02] Nicholas J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, 2002, doi:10.1137/1.9780898718027.
  • [HLOP22] Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver, and Alexey Pozdnyakov, Murmurations of elliptic curves, preprint, 2022, arXiv:2204.10140.
  • [HRH24] Steve Huntsman, Michael Robinson, and Ludmilla Huntsman, Prospects for inconsistency detection using large language models and sheaves, preprint, 2024, arXiv:2401.16713.
  • [HW90] Maurice P. Herlihy and Jeannette M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Trans. Program. Lang. Syst. 12 (1990), 463–492, doi:10.1145/78969.78972.
  • [IEEE19] IEEE, IEEE Standard for Floating-Point Arithmetic, 2019, IEEE Std 754-2019, doi:10.1109/IEEESTD.2019.8766229.
  • [Jac04] Allyn Jackson, Comme appelé du néant — As if summoned from the void: the life of Alexandre Grothendieck, Part II, Notices Amer. Math. Soc. 51 (2004), no. 10, 1196–1212, https://www.ams.org/notices/200410/fea-grothendieck-part2.pdf.
  • [Joh17] Fredrik Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Trans. Comput. 66 (2017), 1281–1292, doi:10.1109/TC.2017.2690633.
  • [Joy85] André Joyal, δ-anneaux et vecteurs de Witt, C. R. Math. Rep. Acad. Sci. Canada 7 (1985), 177–182.
  • [Lak76] Imre Lakatos, Proofs and Refutations: The Logic of Mathematical Discovery, Cambridge University Press, 1976, doi:10.1017/CBO9781139171472.
  • [Liu26a] Vincent Liu, The Grothendieckian Programme: An Overview — Seven Open Works on Mathematics and Machine Reasoning, 2026, preprint, Zenodo; the first of three papers released together, doi:10.5281/zenodo.23734421.
  • [Liu26b] Vincent Liu, The Rising-Sea Theses: Twelve Theses on Mathematics and Machine Reasoning, 2026, preprint, Zenodo; the second of three papers released together, doi:10.5281/zenodo.23734423.
  • [Lur09] Jacob Lurie, Higher Topos Theory, Annals of Mathematics Studies 170, Princeton University Press, 2009, doi:10.1515/9781400830558.
  • [LZ22] Chris Lamb and Stefano Zacchiroli, Reproducible builds: increasing the integrity of software supply chains, IEEE Software 39 (2022), no. 2, 62–70, doi:10.1109/MS.2021.3073045.
  • [Mac78] Saunders Mac Lane, Categories for the Working Mathematician, Graduate Texts in Mathematics 5, Springer, 1978, doi:10.1007/978-1-4757-4721-8.
  • [Mah25] Sridhar Mahadevan, Topos theory for generative AI and LLMs, preprint, 2025, arXiv:2508.08293.
  • [Man16] Ciprian Manolescu, Pin(2)-equivariant Seiberg–Witten Floer homology and the triangulation conjecture, J. Amer. Math. Soc. 29 (2016), 147–176, doi:10.1090/jams829.
  • [mC20] The mathlib Community, The Lean mathematical library, Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), ACM, 2020, pp. 367–381, doi:10.1145/3372885.3373824.
  • [McL07] Colin McLarty, The rising sea: Grothendieck on simplicity and generality, Episodes in the History of Modern Algebra (1800–1950) (Jeremy J. Gray and Karen Hunger Parshall, eds.), History of Mathematics 32, Amer. Math. Soc., 2007, pp. 301–325.
  • [MM94] Saunders Mac Lane and Ieke Moerdijk, Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Universitext, Springer, 1994, corrected reprint of the 1992 edition, doi:10.1007/978-1-4612-0927-0.
  • [MU21] Leonardo de Moura and Sebastian Ullrich, The Lean 4 theorem prover and programming language, Automated Deduction – CADE 28, Lecture Notes in Comput. Sci. 12699, Springer, 2021, pp. 625–635, doi:10.1007/978-3-030-79876-5_37.
  • [MV99] Fabien Morel and Vladimir Voevodsky, A¹-homotopy theory of schemes, Publ. Math. Inst. Hautes Études Sci. 90 (1999), 45–143, doi:10.1007/BF02698831.
  • [nanoda] Chris Bailey, nanoda_lib: library implementing type inference/checking functionality based on the Lean theorem prover, 2026, software, consulted 28 October 2026, https://github.com/ammkrn/nanoda_lib.
  • [Nec97] George C. Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '97), ACM, 1997, pp. 106–119, doi:10.1145/263699.263712.
  • [NEDM18] Brian A. Nosek, Charles R. Ebersole, Alexander C. DeHaven, and David T. Mellor, The preregistration revolution, Proc. Natl. Acad. Sci. USA 115 (2018), 2600–2606, doi:10.1073/pnas.1708274114.
  • [NS18] Thomas Nikolaus and Peter Scholze, On topological cyclic homology, Acta Math. 221 (2018), 203–409, doi:10.4310/ACTA.2018.v221.n2.a1.
  • [PT21] Dave Platt and Tim Trudgian, The Riemann hypothesis is true up to 3·10¹², Bull. Lond. Math. Soc. 53 (2021), 792–797, doi:10.1112/blms.12460.
  • [RBN+24] Bernardino Romera-Paredes, Mohammadamin Barekatain, Alexander Novikov, Matej Balog, M. Pawan Kumar, Emilien Dupont, Francisco J. R. Ruiz, Jordan S. Ellenberg, Pengming Wang, Omar Fawzi, Pushmeet Kohli, and Alhussein Fawzi, Mathematical discoveries from program search with large language models, Nature 625 (2024), 468–475, doi:10.1038/s41586-023-06924-6.
  • [RGM+21] Gal Raayoni, Shahar Gottlieb, Yahel Manor, George Pisha, Yoav Harris, Uri Mendlovic, Doron Haviv, Yaron Hadad, and Ido Kaminer, Generating conjectures on fundamental constants with the Ramanujan Machine, Nature 590 (2021), 67–73, doi:10.1038/s41586-021-03229-4.
  • [RS17] Emily Riehl and Michael Shulman, A type theory for synthetic ∞-categories, Higher Structures 1 (2017), 147–224, arXiv:1705.07442.
  • [Sch19] Peter Scholze, Lectures on condensed mathematics, 2019, lecture notes, with D. Clausen, https://www.math.uni-bonn.de/people/scholze/Condensed.pdf.
  • [Sch22] Peter Scholze, Liquid tensor experiment, Exp. Math. 31 (2022), 349–354, doi:10.1080/10586458.2021.1926016.
  • [Sch73] Wilfried Schmid, Variation of Hodge structure: the singularities of the period mapping, Invent. Math. 22 (1973), 211–319, doi:10.1007/BF01389674.
  • [SGA4] Michael Artin, Alexander Grothendieck, and Jean-Louis Verdier, Théorie des topos et cohomologie étale des schémas (SGA 4), Tome 1, Lecture Notes in Math. 269, Springer, 1972, doi:10.1007/BFb0081551.
  • [SHKK22] Joar Skalse, Nikolaus H. R. Howe, Dmitrii Krasheninnikov, and David Krueger, Defining and characterizing reward hacking, Advances in Neural Information Processing Systems 35 (NeurIPS 2022), 2022, arXiv:2209.13085.
  • [SMM+17] Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton, and Jeff Dean, Outrageously large neural networks: the sparsely-gated mixture-of-experts layer, International Conference on Learning Representations (ICLR 2017), 2017, arXiv:1701.06538.
  • [SS25] Will Sawin and Andrew V. Sutherland, Murmurations for elliptic curves ordered by height, preprint, 2025, arXiv:2504.12295.
  • [SS75] Jerome H. Saltzer and Michael D. Schroeder, The protection of information in computer systems, Proc. IEEE 63 (1975), 1278–1308, doi:10.1109/PROC.1975.9939.
  • [SWZ+24] Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, Y. K. Li, Y. Wu, and Daya Guo, DeepSeekMath: pushing the limits of mathematical reasoning in open language models, preprint, 2024, arXiv:2402.03300.
  • [Tat75] John Tate, Algorithm for determining the type of a singular fiber in an elliptic pencil, Modular Functions of One Variable IV, Lecture Notes in Math. 476, Springer, 1975, pp. 33–52, doi:10.1007/BFb0097582.
  • [Tit72] Jacques Tits, Free subgroups in linear groups, J. Algebra 20 (1972), 250–270, doi:10.1016/0021-8693(72)90058-090058-0).
  • [TWL+24] Trieu H. Trinh, Yuhuai Wu, Quoc V. Le, He He, and Thang Luong, Solving olympiad geometry without human demonstrations, Nature 625 (2024), 476–482, doi:10.1038/s41586-023-06747-5.
  • [Uni13] The Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics, Institute for Advanced Study, 2013, https://homotopytypetheory.org/book/.
  • [VMA21] Andrea Vezzosi, Anders Mörtberg, and Andreas Abel, Cubical Agda: a dependently typed programming language with univalence and higher inductive types, J. Funct. Programming 31 (2021), e8, doi:10.1017/S0956796821000034.
  • [Voi02] Claire Voisin, A counterexample to the Hodge conjecture extended to Kähler varieties, Int. Math. Res. Not. (2002), 1057–1075, no. 20, doi:10.1155/S1073792802111135.
  • [Voi02b] Claire Voisin, Hodge Theory and Complex Algebraic Geometry I, Cambridge Studies in Advanced Mathematics 76, Cambridge University Press, 2002, doi:10.1017/CBO9780511615344.
  • [Wes26] Saint Wesonga, Formalizing PARITY circuit lower bounds in Lean, preprint, 2026, arXiv:2609.24188.
  • [WJL+22] Yuhuai Wu, Albert Q. Jiang, Wenda Li, Markus N. Rabe, Charles Staats, Mateja Jamnik, and Christian Szegedy, Autoformalization with large language models, Advances in Neural Information Processing Systems 35 (NeurIPS 2022), 2022, arXiv:2205.12615.
  • [ZDY+25] Ziyang Zhang, Xinheng Ding, Jiayi Yuan, Rixin Liu, Huizi Mao, Jiarong Xing, and Zirui Liu, Deterministic inference across tensor parallel sizes that eliminates training-inference mismatch, preprint, 2025, arXiv:2511.17826.
  • [ZHP22] Kunhao Zheng, Jesse Michael Han, and Stanislas Polu, miniF2F: a cross-system benchmark for formal Olympiad-level mathematics, International Conference on Learning Representations (ICLR 2022), 2022, arXiv:2109.00110.
  • [Zub23] Nina Zubrilina, Murmurations, preprint, 2023, arXiv:2310.07681.
  • [ZZA+25] Guanning Zeng, Zhaoyi Zhou, Daman Arora, and Andrea Zanette, Shrinking the variance: shrinkage baselines for reinforcement learning with verifiable rewards, preprint, 2025, arXiv:2511.03710.