Browse

History and Overview

math.HO — History and Overview

math.HO RSS feed

Works in math.HO

10 works

math.NT — Number Theory

A congruence obstruction to Ibn al-Khawwām’s eleventh problem

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that there are no two rational squares whose sum is ten and such that adding its own square root to each gives another rational square. This is the existence question in Ibn al-Khawwām’s eleventh arithmetic problem. The proof uses only the residues of squares modulo three and a divisibility argument.

Primarily AI-generated textHuman understanding: some partsDiophantine equationsIbn al-Khawwamcongruencesrational squares
Nov 12, 20262 pages
PDFView work

math.HO — History and Overview

The Rising-Sea Theses: Twelve Theses on Mathematics and Machine Reasoning

Contributed by Vincent Liu

The Grothendieckian Programme is a set of seven works on machine reasoning about mathematics (34 volumes, 26,021 pages), released openly in October 2026 as first drafts that have not been peer-reviewed. This paper draws from them twelve theses on how mathematics and machine reasoning should be combined. Each thesis is stated in one sentence, argued, tied to the passages of the seven works on which it rests, related to existing work, and paired with an observation that would refute it. The theses concern the unit of mathematical knowledge for a reasoning system, the place of epistemic status, the latent space of mathematical reasoning, attention, failure, authority, and the method of discovery. The paper adds no mathematical result to the seven works; none of them claims a proof of the Riemann Hypothesis, the Birch and Swinnerton-Dyer conjecture, the Hodge conjecture, the abc conjecture or the Langlands correspondence.

Author comments: 26 pages, 5 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734424 (all versions: 10.5281/zenodo.23734423). This copy was typeset with pdfLaTeX for Hexagon: its text is identical to version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX, except that a broken cross-reference on page 3 ("igref{works}") is corrected to "Figure 1"; a few line and page breaks differ. The twelve theses are also set out at https://github.com/AlienMuse/grothendieckian-problems/blob/main/THESES.md; the seven works on which they rest, each with its DOI, are listed at https://github.com/AlienMuse/grothendieckian-programme. Corrections recorded since version 1.0 to the seven works and to the papers: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Grothendieckian Programme: An Overview (DOI 10.5281/zenodo.23734421) and The 57 Grothendieckian Problems (DOI 10.5281/zenodo.23734426).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian Programmedescentepistemic statusformal verificationmachine reasoningrecursive mathematical discovery
Nov 10, 202626 pages
PDFView work

math.HO — History and Overview

The Grothendieckian Programme: An Overview — Seven Open Works on Mathematics and Machine Reasoning

Contributed by Vincent Liu

The Grothendieckian Programme is a series of seven works on machine reasoning about mathematics (34 volumes, 26,021 pages), released openly on Zenodo in October 2026 with an overview volume. Two of the works specify a reasoning architecture — a core that holds mathematical worlds as typed, versioned and verifiable objects, and a kernel that reasons inside such worlds by sites, sheaves and descent. Five apply one method, recursive mathematical discovery, to the Riemann Hypothesis, the conjecture of Birch and Swinnerton-Dyer, the Hodge conjecture, the abc conjecture and the Langlands programme, and record what it proves, what it reduces to stated hypotheses and what it leaves open. This paper describes the architecture, the five research subjects, the method, the published corpus and the open process by which the works are to be reviewed and continued. None of the works claims a proof of any of these conjectures; they are first drafts and have not been peer-reviewed.

Author comments: 10 pages, 3 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734422 (all versions: 10.5281/zenodo.23734421). This copy was typeset with pdfLaTeX for Hexagon: its text, and its line and page breaks, are the same as in version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX. The seven works it describes, each with its DOI, are listed at https://github.com/AlienMuse/grothendieckian-programme. Corrections recorded since version 1.0 to the seven works and to the papers: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Rising-Sea Theses (DOI 10.5281/zenodo.23734423) and The 57 Grothendieckian Problems (DOI 10.5281/zenodo.23734426).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian Programmedescentmachine reasoningmathematical worldsopen sciencerecursive mathematical discovery
Nov 10, 202610 pages
PDFView work

math.HO — History and Overview

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

Contributed by Vincent Liu

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.

Author comments: 54 pages, 5 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734427 (all versions: 10.5281/zenodo.23734426). This copy was typeset with pdfLaTeX for Hexagon: its text is identical to version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX, and a few line and page breaks differ. Each problem has a public issue at https://github.com/AlienMuse/grothendieckian-problems, which also holds the machine-readable data, the literature-check records and the Lean statement of Problem 49. Corrections recorded since version 1.0, including literature missed by the check for Problem 18: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Grothendieckian Programme: An Overview (DOI 10.5281/zenodo.23734421) and The Rising-Sea Theses (DOI 10.5281/zenodo.23734423).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian ProgrammeLeandescentformal verificationmachine reasoningopen problems
Nov 10, 202654 pages
PDFView work

math.AG — Algebraic Geometry

The tangent line at a marked point on M0,n/Sn−1M_{0,n}/\mathfrak S_{n-1}, after a table of Grothendieck

Contributed by Michel Hua

Let LnL_n be the line bundle on M0,nM_{0,n} whose fibre is the tangent line to P1\mathbb P^1 at the last marked point, and LL the tensor product of the tangent lines at all of them. We show that, in characteristic zero, the Picard group of the quotient stack [M0,n/Sn−1][M_{0,n}/\mathfrak S_{n-1}] is cyclic of order (n−1)(n−2)(n-1)(n-2) for every n≥3n \ge 3, generated by LnL_n, and that LL has order n−1n-1 in Pic⁡[M0,n/Sn]\operatorname{Pic}[M_{0,n}/\mathfrak S_n]. For even n≥6n \ge 6 the group was known, through the integral Chow ring computed by Edidin and Hu; the odd case does not seem to be in print. The question comes from a table in Grothendieck’s working notes, which gives these orders for four points and only guesses for five and six. The proof takes a few lines once the stack is written as monic squarefree polynomials modulo the affine group. An elementary version, with explicit trivialisations and fixed configurations, is formalised in Lean.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archivePicard group of a quotient stackbinary formsdiscriminantformalisationmoduli of pointed rational curvestangent line bundle
Nov 07, 20265 pages
PDFView work

math.CO — Combinatorics

A bigon-free dichotomy for pseudoline arrangements, after a note of Grothendieck

Contributed by Michel Hua

A pseudoline of an arrangement in the real projective plane is bigonal when it carries exactly two vertices of the arrangement. In an undated folder of working notes from the early 1980s, Grothendieck states that every arrangement without bigonal pseudolines is either four pseudolines in general position or contains one of three configurations: five pseudolines in general position, a pencil of three and a pencil of two without the line joining their centres, or the complete quadrangle. The notes derive this from a statement that is false as written, and they give no independent proof. We give a short proof, together with the ordering of the pseudolines that the notes ask for, and we deduce that for n ≥ 6 the near-pencils are the only arrangements of n pseudolines containing none of the three configurations. The dichotomy has been checked by an exhaustive enumeration of all arrangements of at most nine pseudolines, and it is formalised in the proof assistant Lean for a combinatorial model of arrangements, generalised maps of Euler characteristic one.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archiveSylvester–Gallaicomplete quadrangleformalisationgeneralised mapsnear-pencilpseudoline arrangements
Nov 07, 20267 pages
PDFView work

math.CV — Complex Variables

Origin-Centered Mobius Circles, Bernoulli Lemniscates, and Beta–Gamma Dyadic Pairings of the Riemann Zeta Function on the Critical Line

Contributed by Ryan Hackbarth

We investigate the complex geometry of the normalized Dirichlet eta terms tn(s)=11−21−s(−1)n−1nst_n(s) = \frac{1}{1 - 2^{1-s}} \frac{(-1)^{n-1}}{n^s} for s=a+bis = a + bi. Whereas individual terms on the critical line Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2} undergo a nearly sixfold modulus oscillation driven by the Euler prefactor (1−21−s)−1(1 - 2^{1-s})^{-1}, the two-term partial sum S2(s)=t1(s)+t2(s)S_2(s) = t_1(s) + t_2(s) traces an exact Mobius circle for every fixed a≠1a \neq 1 that is centered at the origin (0,0)(0,0) if and only if Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}, where it reduces to a scaled Blaschke factor 12B(z)\sqrt{\frac{1}{2}} B(z) of constant radius 12\sqrt{\frac{1}{2}}. Factoring m−sm^{-s} across odd-even dyadic pairs Pm(s)=tm(s)+t2m(s)=m−sS2(s)P_m(s) = t_m(s) + t_{2m}(s) = m^{-s} S_2(s) eliminates prefactor amplitude oscillations entirely, collapsing precessing annular rosettes into concentric origin-centered circles on the critical line with strictly descending radii Rm=12mR_m = \sqrt{\frac{1}{2m}}. Removing all odd-even pairs leaves the complementary multiples-of-44 terms t4k(s)=k−st4(s)t_{4k}(s) = k^{-s} t_4(s): we prove that on the critical line the anchor term t4(12+ib)t_4(\frac{1}{2} + ib) traces an exact Lemniscate of Bernoulli with foci at (0,0)(0,0) and (1,0)(1,0) (uniquely for Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}), pure powers of 22 (k=2rk = 2^r) trace closed periodic multi-loop rational curves, and non-powers of 22 trace precessing lemniscate rosettes, while the dyadic differences D4m(s)=t4m(s)−t8m(s)=−4−sPm(s)D_{4m}(s) = t_{4m}(s) - t_{8m}(s) = -4^{-s} P_m(s) collapse both families into exact origin-centered circles, partitioning the sequence {tn(s)}n=1∞\{t_n(s)\}_{n=1}^{\infty} termwise and decomposing ζ(s)\zeta(s) via analytic continuation. Finally, we establish a pointwise velocity--modulus duality ∣dt4dθ∣=∣t2(12+ib)∣=n2∣tn(12+ib)∣\left|\frac{dt_4}{d\theta}\right| = \left|t_2\left(\frac{1}{2} + ib\right)\right| = \sqrt{\frac{n}{2}} \left|t_n\left(\frac{1}{2} + ib\right)\right| (θ=bln⁡2\theta = b \ln 2) and a double-angle Blaschke identity −zB(z)=ei2α(b)-z B(z) = e^{i 2\alpha(b)} linking the central polar angle α(b)\alpha(b) of t4(12+ib)t_4(\frac{1}{2} + ib) to its fundamental perimeter L(t4)=Γ(1/4)22πL(t_4) = \frac{\Gamma(1/4)^2}{2\sqrt{\pi}}, thereby parameterizing every individual term tn(12+ib)t_n(\frac{1}{2} + ib) and every concentric dyadic circle on the critical line in terms of the regularized inverse incomplete Beta function Iq(b)−1(14,12)I_{q(b)}^{-1}(\frac{1}{4}, \frac{1}{2}). As a geometric consequence, critical-line zeros ζ(12+ib)=0\zeta(\frac{1}{2} + ib) = 0 are reframed as values of bb where the resultant of the inner concentric circles lands on the antipode −P1(12+ib)-P_1(\frac{1}{2} + ib) of the initial circle of constant radius.

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 06, 202616 pages
PDFView work

math.HO — History and Overview

Grothendieck Montpellier. Énoncés des lectures modernisées démontrés.

Contributed by Michel Hua

Working notes of Alexandre Grothendieck, put online by the University of Montpellier, have been transcribed and restated in current notation with a language model; the restatements may contain errors. This appendix proves statements taken from these restatements in seventy-five folders, in commutative algebra, algebraic geometry, plane affine geometry, general and tame topology, category and group theory, homotopical algebra, order theory, algebra and finite combinatorics. Each proof follows a proof checked in the Lean 4 proof assistant with its library mathlib. For each statement the text gives the context of the leaf, the proof, the hypotheses that are superfluous or necessary, and the corrections made to the restatement or to the page. It ends with the list of statements the sections report without a Lean check.

Author comments: v2. Part 1 (Lean appendix): a section on Venken's 1971 example, a non-effective finite equivalence relation that answers a question of the 1973 Buffalo lectures, checked in Lean (part Descente). A section on the "serene" objects and dualisable objects of the IHÉS manuscript "Motifs" (fonds Grothendieck–Illusie), checked in Lean. In the IHÉS notes on K of a triangulated category, the exact sequence K(D) → K(C) → K(C/D) → 0 for a thick subcategory and its Verdier quotient is proved in Lean, with Thomason's counterexample without thickness. Nine figures of the edition beside the statements of folders 70, 74, 78, 79, 80, 84, 86 and 154, each pointing to the facsimile page. Four new references (Dold–Puppe 1980, Lewis–May–Steinberger 1986, FGA III, Venken 1971). Part 2 (open questions): the Buffalo effectivity problem (Problem 14) is answered by Venken's example, with a second example of length 15 (16 in characteristic 2); a figure for the stable graphs of folder 147.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archiveformalisationworking notes
Nov 05, 2026409 pages
PDFView work

math.HO — History and Overview

10/24/2610/24/26: Factoring a Pythagorean Date

Contributed by Scott Kominers

Written numerically, the date October 24, 2026 corresponds to a Pythagorean triple---the last one of the twenty-first century! The associated 1010--2424--2626 right triangle has area twice its perimeter; a classical factorization shows that exactly three integer-sided right triangles have this property and, more generally, counts those with any prescribed integer inradius. We also observe that 6060 is the smallest perimeter shared by two noncongruent integer-sided right triangles, one of which is the 1010--2424--2626 triangle.

A mix of human-written and AI-generated textHuman understanding: all partsPythagorean datesPythagorean triplesequable trianglesrecreational mathematics
Oct 26, 20266 pages
PDFView work

math.MG — Metric Geometry

A generalized Gerver sofa for angled corridors

Contributed by Henrik Schou Guttesen

The moving sofa problem asks for the maximal area of a two-dimensional object capable of being moved through a right-angled corridor of unit width. J. L. Gerver constructed a sofa of area 2.2195…2.2195\dots, which was only recently proven to be optimal by J. Baek. Here, I consider the moving sofa problem in an angled corridor, CφC_{\varphi}, of unit width for turn angles 0<φ≤π20 < \varphi \le \frac{\pi}{2}. I first generalize Hammersley's arguments to devise simple analytical lower and upper area bounds for all 0<φ≤π20 < \varphi \le \frac{\pi}{2}. ChatGPT-6 Astra (Codex) is prompted to derive a generalized Gerver sofa parametrized by φ\varphi. The generalized Gerver sofa area is non-analytic at the unique root φ∗∈(0,π/2)\varphi_*\in(0,\pi/2) of exp⁡(φ∗cot⁡φ∗)=1+2cos⁡φ∗−cos⁡2φ∗\exp({\varphi_*\cot\varphi_*}) = 1+2\cos\varphi_*-\cos^2\varphi_*. For turn angles smaller than φ∗\varphi_* a closed-form expression of the sofa area is obtained. The generalized Gerver sofa is conjectured to be the solution to the moving sofa problem for turn angles 0<φ≤π20 < \varphi \le \frac{\pi}{2}.

A mix of human-written and AI-generated textHuman understanding: some partsGeometryGerver-sofamoving-sofa-problemrecreational-math
Oct 01, 20267 pages
PDFView work