Milton Lin
Why?
Why do I care?
Because I want to participate in the production of knowledge.
Production of knowledge looks a little different.
Has something similar happened in the past?
Has information management been a problem in the past?


A papyrus roll, ca. 75â125 CE: Euclid, Elements II.5, statement and diagram, no proof.
Two responses to abundance, a canon or tools to master the mass, are already in place.


A new tool: the note closet, slips on hooks under 3,000+ headings (Placcius, 1689).
6 Oct 2026: 722 AI papers in one release â open problems âharvested ⊠in an unsustainable fashionâ (Tao) â new tools for understanding?
history.htmlâRequired, read first after the hub: it explains why the target is shaped the way it is. A timeline with as many events as the story needs, in order. Each event: the obstacle, the advance, what stayed open, its key examples, the pictures people used, sources (linked to references.html), and links to the pages that develop it. Later pages link back to the event where their idea first arose [âŠ]â
.agents/skills/explain-math-html/SKILL.md, lines 81â89 (this repository)

explain-math-html skill. German: âEinrĂŒcken in ein Ăberlieferungsgeschehenâ, Wahrheit und Methode, Part II.
Turtle: REPEAT 36 [FORWARD 10 RIGHT 10] â a circle you can debug by walking it.
Why do we want to know the orbits?
Here the nonzero orbits are shells
One hook per order.
Blue horizontal: last \(=2\). Orange vertical: last \(=1\).
Take \(y\) as a formal variable and store the values of \(f\) as coefficients:
Where \(F_f\) lives
\(\mathbb C((y))\): formal Laurent series with only finitely many negative powers.
The basic function gives a geometric series
As an analytic series, \(F_f(y)\) converges on \(0<|y|<1\).
Tateâs thesis (1950; published 1967): the case \(n=1\)
\(\chi:F^\times\to\mathbb C^\times\) unramified, \(q=|\mathcal O/\varpi\mathcal O|\), \(\operatorname{vol}(\mathcal O^\times)=1\).
The orbit decomposition turns the integral into the shell sum, initially for \(|y|<1\).
Sakellaridis (2012), §1.3 and §3.3.3: basic functions on spherical varieties
For smooth \(X\), the basic function is \(\mathbf1_{X(\mathcal O)}\); Tateâs \(X=\mathbb A^1\) is the simplest example.
The broader continuation conjecture is Conjecture 3.2.2.
Level 3 · contribute: pose the next question; judge what is interesting. This takes other people.
| who took part | who checked | what machines did | |
|---|---|---|---|
| Polymath1 2009 · Gowersâs blog | 27 people, â 800 comments in 37 days | participants, then referees (Annals 2012) | blog and wiki only |
| Equational Theories Project Sep 2024 â Apr 2025 · Tao et al. | over fifty contributors, âdiverse academic and professional backgroundsâ | Lean: all 22 028 942 implications | automated provers: the bulk; LLMs: little; â two dozen cases by hand |
A readerâs question leads to a review, then a concrete invitation to continue the discussion.
1. I showed you the tools. Did they help me understand better?
2. We benchmark AI all the time;
we should benchmark humanâAI interaction.
3. I should have shown you the process of how this all came to be.
How do I demonstrate this?
How would you want to participate?
The documents are what became cheap. The talk is about the two boxes on the left.
| result | who found the proof? | who checked it? | who understands it? | what is new? |
|---|---|---|---|---|
| FLT in Lean Sep 2026 | Claude agents, 11 days, following the 1990s human proof | Lean kernel; build checked by Buzzard | experts, since 1995; the 13M lines, no one | nothing mathematical: a known theorem, machine-checked |
| ErdĆs #1196 May 2026 | first proof from a GPT-5.4 Pro run | humans eight authors rewrote and reviewed; not yet refereed | the eight authors | a new theorem |
| Unstable singularities 2025 | no proof: neural solvers designed by the authors | numerics proofs âin preparationâ | the authors | evidence, not a theorem |
OpenAI math6 Oct 2026 · 722 papers | an unreleased OpenAI model, ~4,000 problems posed; selection by significance (process not described) | Lean main result for 162/722, statements âuncheckedâ; the rest none yet | not stated | claimed new: conjectures, bounds, counterexamples |
| Hexagon since Sep 2026 · 80 deposits | declared per deposit: text primarily AI in 44/80, mixed 27, human 9 | none no peer review; acceptance ânot a judgment about its correctnessâ | declared: all 31 · some 39 · none 9 | not judged: depositors vouch âin good faithâ |
review: status: unchecked) · hexagonmath.org/about; counts from the works API, 7 Oct 2026 (snapshot; one deposit left understanding blank).128 undergraduates, 2 à 2 between-subjects (condition à principle), 32 per cell.
share who used the trained principle in the new case
(fell back on a plain compromise: 61% vs 83%)
3(x + 1) = 15
3x + 3 = 15
3x = 12
x = 4
3(x + 1) = 15
x + 1 = 5
x = 4
70 seventh-graders, randomly assigned, working in pairs on worked-example packets. Both groups saw the same problems and the same solutions.
| compare | two methods side by side, with prompts to compare them and judge which is more efficient |
| sequential | the same methods one at a time, reflecting on each |
| gain at posttest | compare vs. sequential |
|---|---|
| procedural knowledge | greater |
| procedural flexibility | greater |
| conceptual knowledge | comparable |
Follow-up (2009, N = 162): comparing methods beat comparing problems, now also on conceptual knowledge.