Theorems · Theorem · computer science
AkraBazziRecurrence.tendsto_atTop_r_real
∀ {α : Type u_1} [inst : Fintype α] {T : ℕ → ℝ} {g : ℝ → ℝ} {a b : α → ℝ} {r : α → ℕ → ℕ} [inst_1 : Nonempty α]
(R : AkraBazziRecurrence T g a b r) (i : α), Filter.Tendsto (fun n => ↑(r i n)) Filter.atTop Filter.atTop- Cited by
- 1 results in Mathlib
- Foundations
- Depth 184 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Fintypestatement and proof · cited by 7,736
- Filter.Tendstostatement · cited by 3,814
- Filter.atTopstatement · cited by 2,405
- Filter.Tendsto.compproof · cited by 560
- AkraBazziRecurrencestatement and proof · cited by 55
- tendsto_natCast_atTop_atTopproof · cited by 51
- AkraBazziRecurrence.tendsto_atTop_rproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.eventually_one_sub_smoothingFn_r_posproof · cited by 0