Id: palomar/PALOMAR-2026-08-22-000005 Url: https://github.com/mbaccaro-dev/mathematical-proofs/tree/11d59ae23fb0fe3d8591a00069bec47a868ac93f/MathematicalProofs/MobiusResidualComplexity/Lean Json: https://data.palomar-registry.org/entries/PALOMAR-2026-08-22-000005-v1.json Repo: https://github.com/mbaccaro-dev/mathematical-proofs Tags: math.NT, msc:11N37, msc:11A25, number-theory, mobius-function, lean-formalization Score: 0 Title: mbaccaro-dev/mathematical-proofs Trust: high Domain: math.NT Source: palomar Authors: Mayk Loide Baccaro Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-08-22 Formalized: true Formalizes: title=Logarithmic Residual-Complexity Barriers for Local Möbius Cancellation identifier=10.5281/zenodo.22006119 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-08-22-000005 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.