Mathematics and machine reasoning. I am the author of The Grothendieckian Programme, a programme for machine reasoning about mathematics, set out in seven works of the WiseMotif Monograph of Mathematical Intelligence (Series 01–07), with their overview (Series 00). WiseMotif.ai · Palo Alto, California.
![]() SERIES 00 The Grothendieckian Programme the Programme's overview one book · 53 pages doi:10.5281/zenodo.23669107 |
![]() SERIES 01 GAI-MUA: The Grothendieckian Machine the core 6 volumes · 14,905 pages doi:10.5281/zenodo.23480696 |
![]() SERIES 02 GM-Omega-Infinity: Topos-Native Intelligence the meta-reasoning kernel 5 volumes · 4,020 pages doi:10.5281/zenodo.23538544 |
![]() SERIES 03 Arithmetic Spectral Descent research subject 1 · RH and GRH 4 volumes · 1,549 pages doi:10.5281/zenodo.23564898 |
![]() SERIES 04 Fractured Adelic Geometry research subject 2 · BSD 4 volumes · 571 pages doi:10.5281/zenodo.23585887 |
![]() SERIES 05 The Archimedean Prism research subject 3 · Hodge 5 volumes · 1,309 pages doi:10.5281/zenodo.23597954 |
![]() SERIES 06 Strained Prismatic Geometry research subject 4 · abc 5 volumes · 1,666 pages doi:10.5281/zenodo.23610034 |
![]() SERIES 07 The Arithmetic Topos research subject 5 · Langlands 5 volumes · 2,001 pages doi:10.5281/zenodo.23629681 |
7 works · 34 volumes · 26,021 pages · 995 chapters · 349,000+ formulas · 714 algorithms — each count taken by two independent methods from the sealed editions (STATISTICS.md). Each work has its own repository, its own DOI and its own boundary in its own words; the overview, Series 00, adds no mathematical result to them.
- Worlds. At its centre, The Grothendieckian Machine (Series 01) holds mathematical worlds as typed, versioned and verifiable objects, with the status of every claim part of its type.
- Descent. Over it, Topos-Native Intelligence (Series 02) reasons inside a world as inside a topos: a context is a site, the evidence a sheaf, a conclusion a global section that exists only where the local data glue, and a failure to glue an obstruction that can be located.
- Recursive discovery. Around them, five research subjects (Series 03–07) — the Riemann Hypothesis and its generalisation, the conjecture of Birch and Swinnerton-Dyer, the Hodge conjecture, the abc conjecture and the Langlands programme — carry the method of recursive mathematical discovery through in full: a structure is proposed, tested against the cases in which the answer is known and abstracted where it survives, and the question is posed again; what fails is kept, as an obstruction, a gap or a test.
None of the seven works claims a proof of the problems it studies. Each says what it proves, what it reduces to stated hypotheses, and where it stops.
ORCID 0009-0000-8718-222X · Google Scholar · alienmuse.github.io (中文) · Zenodo community · vincent.liu@wisemotif.ai








