Tverberg's Partition Theorem, 1D Theorem, and Colorful 1D Theorem
A complete, machine-checked Lean 4 formalization of Tverberg's Theorem (Helge Tverberg, 1966) in the distinct-point set formulation across dimensions d >= 1 (with d = 0, r > 1 cases vacuously satisfied due to Finset carrier capacity limits on Fin 0 -> ℝ) via the Sarkaria–Bárány Colorful Carathéodory reduction, the full 1D Tverberg theorem for arbitrary r via symmetric-rank pairing following Mulzer–Werner, and the 1-dimensional Colorful Tverberg Theorem for arbitrary r (Bárány–Larman–Pach 1992). Proves that any (r - 1)(d + 1) + 1 points in ℝ^d can be partitioned into r parts whose convex…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-03-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-03-000003/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-09-03-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'