Open Research Index

sneed-and-feed/lean-theorems-1

Sneed & Feed Formalization Team

Palomar Registrypalomar/PALOMAR-2026-08-26-000008Aug 26, 2026math.COscore 0

A complete machine-checked Lean 4 formalization of Béla Bollobás's 1965 Two Families Theorem (Set Pairs Inequality) in extremal set theory. Proves the skew LYM-type inequality for pairs of disjoint subsets (A_i, B_i) satisfying cross-intersection conditions A_i ∩ B_j ≠ ∅ for i ≠ j, and deduces the uniform bound m ≤ C(a+b, a) for uniform families of sizes a and b. 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).

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