OAI/Computability/FourierTransform/Goal.lean
23 declarations, 0 contain sorry, 0 declared as axioms
Main proof targets.
- abbrev
OAI.PowerSaving.rootline 12Source documentation
Positive-sign, canonical roots. Need only at positive order.
Also declared: ComparatorChallenges/UniformFourier.lean:278 (same declaration text).
abbrev root := ExactFourier.zeta
Mentions: OAI.ExactFourier.zeta
- abbrev
OAI.PowerSaving.Vecline 14Also declared: ComparatorChallenges/UniformFourier.lean:280 (same declaration text).
- abbrev
OAI.PowerSaving.dftMatrixline 16 - def
OAI.PowerSaving.dftline 18Also declared: ComparatorChallenges/UniformFourier.lean:282 (same declaration text).
- def
OAI.PowerSaving.convline 21Also declared: ComparatorChallenges/UniformFourier.lean:285 (same declaration text).
- def
OAI.PowerSaving.paperMline 25Source documentation
Exact exponent from the TeX (natural logarithms).
Also declared: ComparatorChallenges/UniformFourier.lean:264 (same declaration text).
def paperM : ℝ := 1000000
- def
OAI.PowerSaving.paperWline 26Also declared: ComparatorChallenges/UniformFourier.lean:265 (same declaration text).
- def
OAI.PowerSaving.paperDeltaline 27Also declared: ComparatorChallenges/UniformFourier.lean:266 (same declaration text).
- def
OAI.PowerSaving.paperMultiplierline 28Also declared: ComparatorChallenges/UniformFourier.lean:267 (same declaration text).
- def
OAI.PowerSaving.thetaline 29Also declared: ComparatorChallenges/UniformFourier.lean:268 (same declaration text).
- def
OAI.PowerSaving.decimalExponentline 30Also declared: ComparatorChallenges/UniformFourier.lean:269 (same declaration text).
- def
OAI.PowerSaving.paperTimeline 32Also declared: ComparatorChallenges/UniformFourier.lean:271 (same declaration text).
- def
OAI.PowerSaving.decimalTimeline 35Also declared: ComparatorChallenges/UniformFourier.lean:274 (same declaration text).
- def
OAI.PowerSaving.nlognline 37Also declared: ComparatorChallenges/UniformFourier.lean:276 (same declaration text).
- abbrev
OAI.PowerSaving.dftInKindline 39Also declared: ComparatorChallenges/UniformFourier.lean:288 (same declaration text).
- abbrev
OAI.PowerSaving.dftOutKindline 40Also declared: ComparatorChallenges/UniformFourier.lean:289 (same declaration text).
- abbrev
OAI.PowerSaving.convInKindline 41Also declared: ComparatorChallenges/UniformFourier.lean:290 (same declaration text).
- abbrev
OAI.PowerSaving.convOutKindline 42Also declared: ComparatorChallenges/UniformFourier.lean:291 (same declaration text).
- def
OAI.PowerSaving.DFTProgramline 48Source documentation
Include an integer and address bound polynomial in n. Constants inside this bound are immaterial (a constant number of logarithmic sized words is allowed). W n is the work allowance, including the order program, one root primitive and the transform program. The order program takes only the length, so its result specifies the root explicitly.
Also declared: ComparatorChallenges/UniformFourier.lean:293 (same declaration text).
def DFTProgram (order : Prog false w w) (solve : Prog false dftInKind dftOutKind) (W : ℕ → ℕ) : Prop := …Mentions: OAI.PowerSaving.dftInKind, OAI.PowerSaving.dftOutKind
- def
OAI.PowerSaving.ConvProgramline 62Source documentation
Convolution in the same model extended by pointwise field multiplication for two inputs. We even require the bound on the supplied root from the proof of the corollary.
Also declared: ComparatorChallenges/UniformFourier.lean:305 (same declaration text).
def ConvProgram (order : Prog false w w) (solve : Prog true convInKind convOutKind) (W : ℕ → ℕ) : Prop := …Mentions: OAI.PowerSaving.convInKind, OAI.PowerSaving.convOutKind
- def
OAI.PowerSaving.TimeBoundsline 75Source documentation
Thm 1 (intro main) and decimal corollary estimates.
Also declared: ComparatorChallenges/UniformFourier.lean:317 (same declaration text).
def TimeBounds (W : ℕ → ℕ) : Prop := …
- def
OAI.PowerSaving.DFTGoalline 79Also declared: ComparatorChallenges/UniformFourier.lean:321 (same declaration text).
- def
OAI.PowerSaving.ConvGoalline 81Also declared: ComparatorChallenges/UniformFourier.lean:323 (same declaration text).