`NumericalMethod`

definition

show as: view math explainer →

module: IndisputableMonolith.Mathematics.NumericalAnalysisFromRS
domain: Mathematics
line: 22 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Mathematics.NumericalAnalysisFromRS on GitHub at line 22.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

used by

formal source

  19
  20namespace IndisputableMonolith.Mathematics.NumericalAnalysisFromRS
  21
  22inductive NumericalMethod where
  23  | newton | eulerIntegration | rungeKutta | gaussElimination | fft
  24  deriving DecidableEq, Repr, BEq, Fintype
  25
  26theorem numericalMethodCount : Fintype.card NumericalMethod = 5 := by decide
  27
  28/-- DFT-8 modes = 2^3 = 8. -/
  29def dft8Modes : ℕ := 2 ^ 3
  30theorem dft8Modes_8 : dft8Modes = 8 := by decide
  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.