Lean 4 checks algorithm properties and candidate optimization rewrites within stated assumptions. A model proof does not establish that an optimization is enabled in this node or on any target. Performance measurements establish speed.
21 Lean 4 results: 10 proofs in their stated domains; 8 proofs in exact arithmetic; 3 counterexamples.
Move the controls to explore a theorem’s behavior and assumptions. These browser calculations use floating-point numbers to illustrate the mathematical model. They do not run Lean or the audio engine. Lean checks the general statement; a plotted example does not prove it.
S(t) = t² (3 − 2t); S(b) − S(a) ≥ (b − a)³ > 0
0 ≤ a < b ≤ 1. Moving either position beyond this domain removes the strict-increase guarantee.
Within theorem assumptions
The vertical lines mark a and b. The curve decreases beyond 1, illustrating why the theorem needs its domain restriction.