Delphi.science

fc-poisson-2

Zayn Blore

Palomar Registrypalomar/PALOMAR-2026-11-01-000002Nov 1, 2026math.RAscore 0

A machine-checked proof that the Poisson conjecture fails for two canonical pairs, and hence for every n >= 2, following the explicit counterexample of C. D. Long (2026). The statements and definitions are Formal Conjectures' (PoissonConjecture.lean, arXiv math/0608009), copied verbatim into Challenge.lean, so this entry proves Formal Conjectures' own statements.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-01-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-01-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-01-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'