Id: palomar/PALOMAR-2026-11-06-000003 Url: https://github.com/jtraverso/baranyai-theorem/tree/0ff6d6f4005b0b68114e0b99e6d342742918b629 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-06-000003-v1.json Repo: https://github.com/jtraverso/baranyai-theorem Tags: math.CO, msc:05C65, msc:05C70, msc:90C35 Score: 0 Title: Baranyai's theorem Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-06 Formalized: true Formalizes: title=On the factorization of the complete uniform hypergraph identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-06-000003 A Lean 4 / Mathlib formalization of Baranyai's theorem: if k divides n, the k-subsets of an n-set can be partitioned into (n−1 choose k−1) parallel classes, each a partition of the set into n/k blocks of size k (a 1-factorization of the complete k-uniform hypergraph); and of Baranyai's rounding lemma: every real matrix can be rounded entrywise to floors or ceilings so that all row sums, column sums and the total are also rounded. The proof includes the integral max-flow theorem for integer capacities. Mathlib has neither result.