sneed-and-feed/lean-theorems-1
A complete machine-checked Lean 4 formalization of the Frankl–Wilson theorem (1981) for modulo-p intersecting set families. Uses the polynomial linear algebra method over ZMod p to prove both the general non-uniform bound |F| <= sum_{i=0}^s choose(n, i) and the uniform cardinality bound |F| <= choose(n, s). To the maintainers' knowledge, the theorem was not found in an exact declaration name, docstring, and type signature search of the pinned Mathlib revision (Mathlib v4.34.0-rc1).
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-08-31-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-31-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-08-31-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'