Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.eventually_zero_of_frequently_zero
∀ {f : ℝ → ℝ},
AkraBazziRecurrence.GrowsPolynomially f → (∃ᶠ (x : ℝ) in Filter.atTop, f x = 0) → ∀ᶠ (x : ℝ) in Filter.atTop, f x = 0- Cited by
- 1 results in Mathlib
- Foundations
- Depth 198 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites61
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Filter.Eventuallystatement and proof · cited by 3,134
- one_mulproof · cited by 2,841
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement and proof · cited by 2,405
- MulZeroClass.mul_zeroproof · cited by 2,091
- Nat.cast_zeroproof · cited by 1,870
- Set.Iccproof · cited by 1,702
- Filter.univ_mem'proof · cited by 1,672
- mul_assocproof · cited by 1,667
- le_rflproof · cited by 1,558
- Filter.mp_memproof · cited by 1,537
Cited by1
Results whose statement or proof uses this declaration.