MI-32: Lean formalization of the parity and positive-polynomial upper bound
A Lean 4 formalization of the MI-32 upper bound, that is, of the Latała-Świątkowski conjecture that for every regularity parameter alpha >= 1 there is a constant C > 0, independent of the dimension and of the entry laws, with E||X|| = 1. Here ||.|| is the Euclidean operator norm, M(X) is the sum of the largest row and column standard deviations, and D(X) is the max-min weak moment at order log(k+1) taken over one shared deterministic deletion set on both axes. The probability space is arbitrary and the subunit order log 2 at k = 1 is kept literally. The selected theorem MI32.main_upper…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-14-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-14-000006/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-14-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'