Recommended
Defined mathematical notation
Browse 39 linked conservative definitions and 28 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Constructed prime toggles · signed anti-invariance · the unit boundary · Constructive arithmetic
n≠0 ⇒ ∃M z. MobiusTable(n,M) ∧ DivisorSum(M,n,z) ∧ ((n=1 ∧ z=2) ∨ (n≠1 ∧ z=0))
Construct a prime-factor toggle and prove cancellation of the actual Möbius divisor sum, including the separate value at one and unrestricted input-table value at zero.
Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Recommended
Browse 39 linked conservative definitions and 28 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 1569 native tactic lines and 99 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem MC001C and follow only the lemmas and conservative definitions supporting mobius_divisor_sum_cancellation_on_positive_values.
MC001A mobius_divisor_sum_cancellation · MC001B mobius_divisor_sum_cancellation_exists · MC001C mobius_divisor_sum_cancellation_on_positive_values.f858f6bd9e09d6ec33b48689b385222153ad9d326eccb8239ac5776b39955542.