OAI/Computability/FourierCircuit/Main.lean
20 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.ExactFourier.PrimeInventory.count_fourthline 10 - def
OAI.ExactFourier.PrimeInventory.upperline 39 - theorem
OAI.ExactFourier.PrimeInventory.familyline 41 - theorem
OAI.ExactFourier.PrimeInventory.family_coprimeline 64 - def
OAI.ExactFourier.FourierTransfer.depthline 78 - theorem
OAI.ExactFourier.FourierTransfer.depth_boundline 80 - theorem
OAI.ExactFourier.FourierTransfer.family_costline 102 - theorem
OAI.ExactFourier.FourierTransfer.log_square_littleOline 152 - theorem
OAI.ExactFourier.FourierTransfer.log_power_ratioline 164 - theorem
OAI.ExactFourier.FourierTransfer.shifted_log_power_ratioline 172 - theorem
OAI.ExactFourier.CircuitCost.exists_circuitline 196 - theorem
OAI.ExactFourier.win_to_fourierline 224Source documentation
An actual finite win transfers to arbitrarily large exact Fourier DAGs, with every scalar multiplication charged.
theorem win_to_fourier (win : FiniteWinStatement) : MainStatement := by …
Mentions: OAI.ExactFourier.FiniteWinStatement, OAI.ExactFourier.MainStatement
- theorem
OAI.ExactFourier.main_theoremline 277Distinct definitions of this name: ComparatorChallenges/ExactFourier.lean:57 (same statement text; different proof or body). Qualify references as OAI.ExactFourier.main_theorem@path.
- theorem
OAI.ExactFourier.finite_win_existsline 279 - theorem
OAI.ExactFourier.exists_fourier_circuitline 291Source documentation
Existence of an exact circuit in every width, used only to define the minimum.
theorem exists_fourier_circuit (n : ℕ) : ∃ k : ℕ,∃ C : Circuit n, C.size=k ∧ C.Computes (fourierMatrix n) := by …
Mentions: OAI.ExactFourier.Circuit, OAI.ExactFourier.fourierMatrix
- def
OAI.ExactFourier.Lline 296 - theorem
OAI.ExactFourier.L_attainedline 300 - theorem
OAI.ExactFourier.L_leline 304 - theorem
OAI.ExactFourier.fourier_denominator_posline 308 - theorem
OAI.ExactFourier.main_liminfline 314Source documentation
The liminf formulation of the same main theorem, for the literal minimum L.
theorem main_liminf : Filter.liminf (fun n : ℕ=>(L n : ℝ)/((n:ℝ)*Real.logb 2 (n:ℝ))) atTop=0 := by …
Mentions: OAI.ExactFourier.L