Theorems · Theorem · number theory
Liouville.frequently_exists_num
∀ {x : ℝ}, Liouville x → ∀ (n : ℕ), ∃ᶠ (b : ℕ) in Filter.atTop, ∃ a, x ≠ ↑a / ↑b ∧ |x - ↑a / ↑b| < 1 / ↑b ^ nIf x is a Liouville number, then for any n, for infinitely many denominators b there
exists a numerator a such that x ≠ a / b and |x - a / b| < 1 / b ^ n.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 155 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites40
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
- Set.ofPredproof · cited by 6,101
- nhdsproof · cited by 5,554
- Filter.Tendstoproof · cited by 3,814
- LE.le.transproof · cited by 3,151
- Filter.Eventuallyproof · cited by 3,134
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement and proof · cited by 2,405
- LT.lt.leproof · cited by 2,189
- le_reflproof · cited by 2,061
- absstatement and proof · cited by 1,814
- Dist.distproof · cited by 1,539
Cited by1
Results whose statement or proof uses this declaration.
- Liouville.liouvilleWithproof · cited by 2