☁️ Dream: Sky's the Limit

For a more powerful interaction try:Lean 4 Web (external)
ODE TO AUGUST FERDINAND MÖBIUS (1832) • TRI-STATE PRIME PARITY & ZETA INVERSE

💎 The First 50 Values of μ(n) ∈ {+1, 0, −1}, Euler's Sieve Product & Mertens Random Walk M(N)

◆ +1: Even distinct primes◇ 0: Square p² | n◆ −1: Odd distinct primes
∑n=1∞μ(n)ns=1ζ(s)=∏p prime(1−1ps)=(1−12s)(1−13s)(1−15s)⋯\sum_{n=1}^{\infty} \frac{\mu(n)}{n^s} = \frac{1}{\zeta(s)} = \prod_{p\text{ prime}} \left(1 - \frac{1}{p^s}\right) = \left(1 - \frac{1}{2^s}\right)\left(1 - \frac{1}{3^s}\right)\left(1 - \frac{1}{5^s}\right)\cdots
+10-1μ(n) Tri-State Diamond Lattice (n = 1 … 50 — hover or click any diamond)n=1n=10n=20n=30n=40n=50Mertens Walk M(N) = ∑ₙ≤N μ(n) inside ±√N Riemann Hypothesis Bound
n = 30 = 2 · 3 · 5⇒ 3 distinct primes (odd parity) ⇒ μ(30) = (-1)^3 = -1
Cumulative Mertens Sum: M(30) = -3 (|M| ≤ √30 ≈ 5.48)

🔬 Weierstrass (ε, δ) Lens & Lean 4 Punctured Filter nhdsWithin 0 {0}ᶜ

In Lean 4, total division sets 0 / 0 = 0, so f(0) = 0 (red dot). An unpunctured filter nhds 0 fails whenever s·k·y ≠ 0! Puncturing 0 via 0 < |x - a| < δ (or nhdsWithin 0 {0}ᶜ) makes the limit provable.

L = s·k·y = 3.00 | ε = 0.25 ⇒ δ(ε) = 0.354
f(0.35) = 2.7609 | |f(x) - L| = 0.2391 < ε (Inside ε-tube!)
Lean x=0: 0/0 = 0L = s·k·y (punctured 0)
Loading Editor...
Note: Large Mathlib imports can take forever on the main EC2. If you are confident in your proof and want it in the Hall of Fame, click the green GCloud button, which will queue it at a compiler service that will submit it, if correct, in reasonable time.
Lean InfoView
Run Check Proof to see output (wait time approx 30 seconds)