Discussion about this post

User's avatar
Bruce Stephenson's avatar

Hey, nice article, T.W.! FYI, mathematics is just another language. It's a bit more formal and rule-bound than, say, Spanish, but it's also not all that different. My [extensive] experience is that a well-governed AI acts as an AMPLIFIER for human intelligence. I guarantee you that this proof was created by a capable human mathematician working WITH a governed-and-trained AI.

Here's how to build a sophisticated AI research assistant:

https://energyscholar.github.io/persistent-ai-collaboration/

Lesson: without at least 3 axes of governance to provide a recursive topology, current LLMs are provably unstable.

Here's an example of a animated space physics tutorial we built in a couple hours:

https://energyscholar.github.io/persistent-ai-collaboration/tutorial-magnetosphere.html

Here's an example of a breakthrough math paper (currently in peer review at a 2nd tier journal) it helped me research:

https://arxiv.org/abs/2601.22389

I had my LLM verify the mathematical proof you provided and summarize the result:

****************************** AI OUTPUT BELOW HERE **********************************

## Quick Review: "Planar Point Sets with Many Unit Distances" (OpenAI)

**Claim:** Disproves Erdős's 1946 unit distance conjecture by showing ν(n) ≥ n^{1+δ} for some δ > 0 and infinitely many n.

**Verdict: The proof appears correct.**

The argument has two parts:

**Geometric (§2):** Given a CM field K = L(i) with many split primes and controlled class number, pigeonhole produces exponentially many norm-one elements u with |σ(u)| = 1 under every complex embedding. Embed via Minkowski into C^f, window with a polydisc, average over lattice cosets to find one with many unit-distance pairs, then project to the first coordinate. Injectivity of the projection (field embeddings are injective) and a packing bound on |P| ≤ e^{Bf} complete the geometry.

**Arithmetic (§3):** Build a cyclic cubic field F from ℓ primes ≡ 1 (mod 3) via the conductor-discriminant formula. The compositum M/F is everywhere unramified with Gal ≅ (Z/3Z)^{ℓ−1}, giving d(G) ≥ ℓ − 1 for the maximal unramified pro-3 group. Shafarevich gives r(G) ≤ d(G) + C₀ (C₀ absolute since F is totally real cubic). Kill ~ℓ²/100 Chebotarev-selected Frobenius elements in the Frattini subgroup — this adds ≤ 3t relations, staying well below the d²/4 Golod-Shafarevich threshold. The resulting infinite tower has bounded root discriminant, so class numbers grow at most exponentially with fixed base H. Since t ~ ℓ² while log H ~ ℓ log ℓ, the exponent γ = t log 2 − log H > 0 for large ℓ.

**What makes it work:** Erdős's classical √n × √n grid is stuck in Z[i] where the class number is 1 and the exponent is pinned to C/log log n. Replacing Q(i) with K = L(i) in an infinite unramified pro-3 tower provides arbitrarily large degree (many norm-one elements), bounded root discriminant (controlled class numbers), and prescribed splitting — all at once. The construction is non-explicit (δ exists but is tiny), but the existence proof is rigorous.

Every ingredient is classical: conductor-discriminant formula, Golod-Shafarevich inequality, Shafarevich relation-rank estimate, Chebotarev density, Minkowski geometry of numbers. The assembly is the innovation.

No posts

Ready for more?