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

dft8Size_8

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

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Mathematics.ComputationalComplexityFromRS on GitHub at line 30.

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

  27
  28/-- DFT-8 size = 2^D = 8. -/
  29def dft8Size : ℕ := 2 ^ 3
  30theorem dft8Size_8 : dft8Size = 8 := by decide
  31
  32structure ComputationalComplexityCert where
  33  five_classes : Fintype.card ComplexityClass = 5
  34  dft_poly : dft8Size = 8
  35
  36def computationalComplexityCert : ComputationalComplexityCert where
  37  five_classes := complexityClassCount
  38  dft_poly := dft8Size_8
  39
  40end IndisputableMonolith.Mathematics.ComputationalComplexityFromRS

papers checked against this theorem

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