Theorems · Theorem · computer science
AkraBazziRecurrence.eventually_one_add_smoothingFn_pos
∀ᶠ (n : ℕ) in Filter.atTop, 0 < 1 + AkraBazziRecurrence.smoothingFn ↑n
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 175 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
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
- Norm.normproof · cited by 5,413
- Filter.Eventuallystatement · cited by 3,134
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement and proof · cited by 2,405
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Real.logproof · cited by 939
- one_divproof · cited by 624
- Asymptotics.IsLittleOproof · cited by 375
- div_posproof · cited by 337
- Filter.eventually_gt_atTopproof · cited by 90
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.smoothingFn_mul_asympBound_isBigO_Tproof · cited by 1
- AkraBazziRecurrence.eventually_one_add_smoothingFn_nonnegproof · cited by 0
- AkraBazziRecurrence.eventually_one_add_smoothingFn_r_posproof · cited by 0