mbaccaro-dev/mathematical-proofs
A Lean 4 proof of a residual-or-unmatched barrier for local Möbius cancellation. At every sufficiently large fixed-band scale, either the permitted edge length reaches the retained-prime product or every member of an explicit squarefree prime-product family is unmatched. Chebyshev estimates give the exact binomial and factorial population bounds. The product scale also converts residual rank to its logarithmic threshold with the exact limiting constant.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-08-22-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-22-000005/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-22-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'