pith. machine review for the scientific record. sign in
theorem

fftOps_24

proved
show as:
view math explainer →
module
IndisputableMonolith.Mathematics.NumericalAnalysisFromRS
domain
Mathematics
line
34 · github
papers citing
none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Mathematics.NumericalAnalysisFromRS on GitHub at line 34.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

  31
  32/-- FFT operations per tick: 8 × 3 = 24. -/
  33def fftOps : ℕ := 8 * 3
  34theorem fftOps_24 : fftOps = 24 := by decide
  35
  36structure NumericalAnalysisCert where
  37  five_methods : Fintype.card NumericalMethod = 5
  38  eight_modes : dft8Modes = 8
  39  fft_ops : fftOps = 24
  40
  41def numericalAnalysisCert : NumericalAnalysisCert where
  42  five_methods := numericalMethodCount
  43  eight_modes := dft8Modes_8
  44  fft_ops := fftOps_24
  45
  46end IndisputableMonolith.Mathematics.NumericalAnalysisFromRS

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.