sneed-and-feed/lean-theorems-1
A complete machine-checked Lean 4 formalization of J. A. Bondy's 1972 theorem on induced subsets. Proves that for any family F of n distinct subsets of an arbitrary finite ground set X, there exists a distinguishing subset S ⊆ X of cardinality at most n - 1 such that the restriction map s ↦ s ∩ S is injective on F. To the maintainers' knowledge, the theorem was not found in an exact declaration, 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-26-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-26-000007/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-26-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'