Theorems · Theorem · number theory
mem_wellApproximable_iff
∀ {A : Type u_1} [inst : SeminormedGroup A] {δ : ℕ → ℝ} {a : A},
a ∈ wellApproximable A δ ↔ a ∈ Filter.blimsup (fun n => approxOrderOf A n (δ n)) Filter.atTop fun n => 0 < n- Defined in
- Mathlib.NumberTheory.WellApproximable
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 151 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SeminormedGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Realstatement and proof · cited by 25,697
- Filter.atTopstatement · cited by 2,405
- SeminormedGroupstatement and proof · cited by 250
- Filter.blimsupstatement · cited by 40
- approxOrderOfstatement · cited by 6
- wellApproximablestatement · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.