Open Research Index

sneed-and-feed/lean-theorems-1

Sneed & Feed Formalization Team

Palomar Registrypalomar/PALOMAR-2026-08-29-000013Aug 29, 2026math.COscore 0

A comprehensive, machine-checked Lean 4 formalization of the Erdős–Szekeres Convex Polygon Theorem (1935). Formalizes orientation determinants, general position, 2D rotation transformations with finite slope avoidance (rotating any finite set to have mutually distinct x-coordinates), x-coordinate sorting, cup-cap sequences with Pascal-type binomial split recurrences, halfspace separation for convex hulls, and rotation invariance of convex polygons. Proves that any finite set of at least choose(2k - 4, k - 2) + 1 points in general position in ℝ² contains the vertices of a strictly convex…

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-08-29-000013
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-29-000013/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-08-29-000013/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'