Radix-2 multiplication count:
ProvedFastFourierTransform.fftMulCount_eqComplex multiplication count of the radix-2 algorithm. Let be the multiplication counter of the butterfly cost model, and . Then for every
The statement is given in the doubled form to stay inside natural-number arithmetic (no division, no subtraction), and the case is included. This is the exact count of twiddle-factor multiplications, not an asymptotic bound.
import Mathlib import Definitions.Def_FastFourierTransform_opCount
namespace FastFourierTransform theorem fftMulCount_eq (p : ℕ) : 2 * fftMulCount p = p * 2 ^ p := by sorry end FastFourierTransform
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Provenance note (please read first). This read-back is not blind and is not independent testimony. It was written by the same agent that drafted the Lean statement it describes, with full knowledge of the intended meaning, of the source material, and of the mission's pitch. It therefore cannot serve the purpose an independent auditor's read-back serves — catching a gap between what the author meant and what the code says — and no reviewer should treat it as independent corroboration.
The statement asserts: for every natural number ,
where is the natural-number recursion , .
All quantities are natural numbers and all operations are natural-number arithmetic; is the natural-number power. The identity is stated in the doubled form rather than as , so no subtraction and no division occurs and the case — where the claim reads — needs no separate treatment. There is no hypothesis on . The statement is purely about this numerical recursion: it says nothing about any transform, algorithm, or complex arithmetic, and it asserts an exact identity rather than an asymptotic bound.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.