Loogle!
Result
Found 150 declarations mentioning Nat.floor.
- Nat.floor_nat π Mathlib.Algebra.Order.Floor.Defs
: Nat.floor = id - Nat.floor π Mathlib.Algebra.Order.Floor.Defs
{Ξ± : Type u_1} [Semiring Ξ±] [PartialOrder Ξ±] [FloorSemiring Ξ±] : Ξ± β β - Nat.floor_int π Mathlib.Algebra.Order.Floor.Defs
: Nat.floor = Int.toNat - Int.floor_toNat π Mathlib.Algebra.Order.Floor.Defs
{Ξ± : Type u_1} [Ring Ξ±] [LinearOrder Ξ±] [FloorRing Ξ±] (a : Ξ±) : βaβ.toNat = βaββ - Nat.le_floor π Mathlib.Algebra.Order.Floor.Defs
{Ξ± : Type u_1} [Semiring Ξ±] [PartialOrder Ξ±] [FloorSemiring Ξ±] {a : Ξ±} {n : β} (h : βn β€ a) : n β€ βaββ - Nat.le_floor_iff π Mathlib.Algebra.Order.Floor.Defs
{Ξ± : Type u_1} [Semiring Ξ±] [PartialOrder Ξ±] [FloorSemiring Ξ±] {a : Ξ±} {n : β} (ha : 0 β€ a) : n β€ βaββ β βn β€ a - Nat.floor_mono π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] : Monotone Nat.floor - Nat.floor_natCast π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] (n : β) : ββnββ = n - Nat.floor_zero π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] : β0ββ = 0 - Nat.lt_succ_floor π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] (a : R) : a < ββaββ.succ - Nat.ceil_le_floor_add_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] (a : R) : βaββ β€ βaββ + 1 - Nat.floor_le_ceil π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] (a : R) : βaββ β€ βaββ - Nat.floor_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] : β1ββ = 1 - Nat.lt_of_floor_lt π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} (h : βaββ < n) : a < βn - Nat.floor_ofNat π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] (n : β) [n.AtLeastTwo] : βOfNat.ofNat nββ = OfNat.ofNat n - Nat.lt_one_of_floor_lt_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} (h : βaββ < 1) : a < 1 - Nat.floor_le_of_le π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} [IsStrictOrderedRing R] (h : a β€ βn) : βaββ β€ n - Nat.floor_of_nonpos π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] (ha : a β€ 0) : βaββ = 0 - Nat.lt_of_lt_floor π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} [IsStrictOrderedRing R] (h : n < βaββ) : βn < a - Nat.pos_of_floor_pos π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] (h : 0 < βaββ) : 0 < a - Nat.floor_le_floor π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a b : R} [IsStrictOrderedRing R] (hab : a β€ b) : βaββ β€ βbββ - Nat.floor_eq_zero π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] : βaββ = 0 β a < 1 - Nat.floor_le_one_of_le_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] (h : a β€ 1) : βaββ β€ 1 - Nat.floor_pos π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] : 0 < βaββ β 1 β€ a - Nat.one_le_floor_iff π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] (x : R) : 1 β€ βxββ β 1 β€ x - Nat.lt_floor_add_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] (a : R) : a < ββaββ + 1 - Nat.floor_le π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : ββaββ β€ a - Nat.floor_lt' π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} [IsStrictOrderedRing R] (hn : n β 0) : βaββ < n β a < βn - Nat.le_floor_iff' π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} [IsStrictOrderedRing R] (hn : n β 0) : n β€ βaββ β βn β€ a - Nat.preimage_floor_zero π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] : Nat.floor β»ΒΉ' {0} = Set.Iio 1 - Nat.floor_lt π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} (ha : 0 β€ a) : βaββ < n β a < βn - Nat.preimage_Iic π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : Nat.cast β»ΒΉ' Set.Iic a = Set.Iic βaββ - Nat.preimage_Ioi π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : Nat.cast β»ΒΉ' Set.Ioi a = Set.Ioi βaββ - Nat.floor_lt_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : βaββ < 1 β a < 1 - Nat.cast_mul_floor_div_cancel π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] {n : β} (hn : n β 0) (a : R) : ββn * aββ / n = βaββ - Nat.mul_cast_floor_div_cancel π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] {n : β} (hn : n β 0) (a : R) : βa * βnββ / n = βaββ - Nat.self_sub_floor_lt_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (a : R) : a - ββaββ < 1 - Nat.sub_one_lt_floor π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (a : R) : a - 1 < ββaββ - Nat.floor_lt_ceil_of_lt_of_pos π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] {a b : R} (h : a < b) (h' : 0 < b) : βaββ < βbββ - Nat.preimage_Icc π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a b : R} (hb : 0 β€ b) : Nat.cast β»ΒΉ' Set.Icc a b = Set.Icc βaββ βbββ - Nat.preimage_Ioo π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a b : R} (ha : 0 β€ a) : Nat.cast β»ΒΉ' Set.Ioo a b = Set.Ioo βaββ βbββ - Nat.floor_eq_on_Ico π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] (n : β) (a : R) : a β Set.Ico (βn) (βn + 1) β βaββ = n - Nat.floor_add_natCast π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] (ha : 0 β€ a) (n : β) : βa + βnββ = βaββ + n - Nat.floor_add_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] (ha : 0 β€ a) : βa + 1ββ = βaββ + 1 - Nat.preimage_floor_of_ne_zero π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] {n : β} (hn : n β 0) : Nat.floor β»ΒΉ' {n} = Set.Ico (βn) (βn + 1) - Nat.floor_add_ofNat π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} [IsStrictOrderedRing R] (ha : 0 β€ a) (n : β) [n.AtLeastTwo] : βa + OfNat.ofNat nββ = βaββ + OfNat.ofNat n - Nat.zero_le_self_sub_floor π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : 0 β€ a - ββaββ - Nat.floor_sub_natCast π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] [Sub R] [OrderedSub R] [ExistsAddOfLE R] (a : R) (n : β) : βa - βnββ = βaββ - n - Nat.preimage_Ioc π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a b : R} (ha : 0 β€ a) (hb : 0 β€ b) : Nat.cast β»ΒΉ' Set.Ioc a b = Set.Ioc βaββ βbββ - Nat.floor_sub_one π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] [Sub R] [OrderedSub R] [ExistsAddOfLE R] (a : R) : βa - 1ββ = βaββ - 1 - Nat.floor_eq_iff' π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} [IsStrictOrderedRing R] (hn : n β 0) : βaββ = n β βn β€ a β§ a < βn + 1 - Nat.floor_eq_on_Ico' π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] (n : β) (a : R) : a β Set.Ico (βn) (βn + 1) β ββaββ = βn - Nat.abs_floor_sub_le π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : |ββaββ - a| β€ 1 - Nat.abs_sub_floor_le π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] {a : R} (ha : 0 β€ a) : |a - ββaββ| β€ 1 - Nat.floor_sub_ofNat π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] [IsStrictOrderedRing R] [Sub R] [OrderedSub R] [ExistsAddOfLE R] (a : R) (n : β) [n.AtLeastTwo] : βa - OfNat.ofNat nββ = βaββ - OfNat.ofNat n - Nat.floor_eq_iff π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {n : β} (ha : 0 β€ a) : βaββ = n β βn β€ a β§ a < βn + 1 - Nat.map_floor π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {S : Type u_2} [Semiring S] [LinearOrder S] [FloorSemiring S] {F : Type u_3} [FunLike F R S] [RingHomClass F R S] [IsStrictOrderedRing R] [IsStrictOrderedRing S] (f : F) (hf : StrictMono βf) (a : R) : βf aββ = βaββ - Nat.floor_congr π Mathlib.Algebra.Order.Floor.Semiring
{R : Type u_1} [Semiring R] [LinearOrder R] [FloorSemiring R] {a : R} {S : Type u_2} [Semiring S] [LinearOrder S] [FloorSemiring S] {b : S} [IsStrictOrderedRing R] [IsStrictOrderedRing S] (h : β (n : β), βn β€ a β βn β€ b) : βaββ = βbββ - Int.natCast_floor_eq_floor π Mathlib.Algebra.Order.Floor.Ring
{R : Type u_2} [Ring R] [LinearOrder R] [FloorRing R] {a : R} (ha : 0 β€ a) : ββaββ = βaβ - natCast_floor_eq_intCast_floor π Mathlib.Algebra.Order.Floor.Ring
{R : Type u_2} [Ring R] [LinearOrder R] [FloorRing R] {a : R} (ha : 0 β€ a) : ββaββ = ββaβ - Rat.natFloor_natCast_div_natCast π Mathlib.Data.Rat.Floor
(n d : β) : ββn / βdββ = n / d - Nonneg.nat_floor_coe π Mathlib.Algebra.Order.Nonneg.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [PartialOrder Ξ±] [IsOrderedRing Ξ±] [FloorSemiring Ξ±] (a : Nonneg Ξ±) : ββaββ = βaββ - Int.abs_le_floor_nnreal_iff π Mathlib.Analysis.Normed.Group.Int
(z : β€) (c : NNReal) : |z| β€ ββcββ β βzββ β€ c - Nat.closedBall_eq_Icc π Mathlib.Topology.Instances.Nat
(x : β) (r : β) : Metric.closedBall x r = Set.Icc ββx - rββ ββx + rββ - tendsto_nat_floor_atTop π Mathlib.Analysis.SpecificLimits.Basic
{Ξ± : Type u_4} [Semiring Ξ±] [LinearOrder Ξ±] [IsStrictOrderedRing Ξ±] [FloorSemiring Ξ±] : Filter.Tendsto (fun x => βxββ) Filter.atTop Filter.atTop - tendsto_nat_floor_div_atTop π Mathlib.Analysis.SpecificLimits.Basic
{R : Type u_4} [TopologicalSpace R] [Field R] [LinearOrder R] [IsStrictOrderedRing R] [OrderTopology R] [FloorRing R] : Filter.Tendsto (fun x => ββxββ / x) Filter.atTop (nhds 1) - tendsto_nat_floor_mul_atTop π Mathlib.Analysis.SpecificLimits.Basic
{Ξ± : Type u_4} [Semifield Ξ±] [LinearOrder Ξ±] [IsStrictOrderedRing Ξ±] [FloorSemiring Ξ±] [Archimedean Ξ±] (a : Ξ±) (ha : 0 < a) : Filter.Tendsto (fun x => βa * βxββ) Filter.atTop Filter.atTop - tendsto_nat_floor_mul_div_atTop π Mathlib.Analysis.SpecificLimits.Basic
{R : Type u_4} [TopologicalSpace R] [Field R] [LinearOrder R] [IsStrictOrderedRing R] [OrderTopology R] [FloorRing R] {a : R} (ha : 0 β€ a) : Filter.Tendsto (fun x => ββa * xββ / x) Filter.atTop (nhds a) - Real.nat_floor_real_sqrt_eq_nat_sqrt π Mathlib.Analysis.Real.Sqrt
{a : β} : βββaββ = a.sqrt - tendsto_smul_comp_nat_floor_of_tendsto_nsmul π Mathlib.Analysis.SpecificLimits.Normed
{R : Type u_4} {K : Type u_5} [NormedRing K] [IsDomain K] [NormedAddCommGroup R] [Module K R] [Module.IsTorsionFree K R] [NormSMulClass K R] [NormSMulClass β€ K] [LinearOrder K] [IsStrictOrderedRing K] [FloorSemiring K] [HasSolidNorm K] {g : β β R} {t : R} (hg : Filter.Tendsto (fun n => n β’ g n) Filter.atTop (nhds t)) : Filter.Tendsto (fun x => x β’ g βxββ) Filter.atTop (nhds t) - tendsto_smul_comp_nat_floor_of_tendsto_mul π Mathlib.Analysis.SpecificLimits.Normed
{R : Type u_4} {K : Type u_5} [NormedRing K] [NormedRing R] [Module K R] [Module.IsTorsionFree K R] [NormSMulClass K R] [NormSMulClass β€ K] [LinearOrder K] [IsStrictOrderedRing K] [FloorSemiring K] [HasSolidNorm K] {g : β β R} {t : R} (hg : Filter.Tendsto (fun n => βn * g n) Filter.atTop (nhds t)) : Filter.Tendsto (fun x => x β’ g βxββ) Filter.atTop (nhds t) - Asymptotics.isEquivalent_nat_floor π Mathlib.Analysis.Asymptotics.SpecificAsymptotics
{R : Type u_1} [NormedField R] [LinearOrder R] [IsStrictOrderedRing R] [OrderTopology R] [FloorRing R] : Asymptotics.IsEquivalent Filter.atTop (fun x => ββxββ) fun x => x - ENat.floor_coe π Mathlib.Algebra.Order.Floor.Extended
(r : NNReal) : ββrββ = ββrββ - Mathlib.Meta.NormNum.IsNat.natFloor π Mathlib.Algebra.Order.Floor.Semifield
{R : Type u_3} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (r : R) (m : β) : Mathlib.Meta.NormNum.IsNat r m β Mathlib.Meta.NormNum.IsNat βrββ m - Mathlib.Meta.NormNum.IsInt.natFloor π Mathlib.Algebra.Order.Floor.Semifield
{R : Type u_3} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (r : R) (m : β) : Mathlib.Meta.NormNum.IsInt r (Int.negOfNat m) β Mathlib.Meta.NormNum.IsNat βrββ 0 - Mathlib.Meta.NormNum.IsRat.natFloor π Mathlib.Algebra.Order.Floor.Semifield
{R : Type u_3} [Field R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (r : R) (n d : β) (h : Mathlib.Meta.NormNum.IsRat r (Int.negOfNat n) d) : Mathlib.Meta.NormNum.IsNat βrββ 0 - Mathlib.Meta.NormNum.IsNNRat.natFloor π Mathlib.Algebra.Order.Floor.Semifield
{R : Type u_3} [Semifield R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (r : R) (n d : β) (h : Mathlib.Meta.NormNum.IsNNRat r n d) (res : β) (hres : n / d = res) : Mathlib.Meta.NormNum.IsNat βrββ res - Nat.floor_div_eq_div π Mathlib.Algebra.Order.Floor.Semifield
{K : Type u_2} [Semifield K] [LinearOrder K] [IsStrictOrderedRing K] [FloorSemiring K] (m n : β) : ββm / βnββ = m / n - Nat.floor_div_natCast π Mathlib.Algebra.Order.Floor.Semifield
{K : Type u_2} [Semifield K] [LinearOrder K] [IsStrictOrderedRing K] [FloorSemiring K] (a : K) (n : β) : βa / βnββ = βaββ / n - Nat.floor_div_ofNat π Mathlib.Algebra.Order.Floor.Semifield
{K : Type u_2} [Semifield K] [LinearOrder K] [IsStrictOrderedRing K] [FloorSemiring K] (a : K) (n : β) [n.AtLeastTwo] : βa / OfNat.ofNat nββ = βaββ / OfNat.ofNat n - Nat.div_two_lt_floor π Mathlib.Algebra.Order.Floor.Semifield
{K : Type u_2} [Field K] [LinearOrder K] [IsOrderedRing K] [FloorSemiring K] {a : K} (ha : 1 β€ a) : a / 2 < ββaββ - Nat.mul_lt_floor π Mathlib.Algebra.Order.Floor.Semifield
{K : Type u_2} [Field K] [LinearOrder K] [IsOrderedRing K] [FloorSemiring K] {a b : K} (hbβ : 0 < b) (hb : b < 1) (hba : ββb / (1 - b)ββ β€ a) : b * a < ββaββ - Real.ofDigits_digits_sum_eq π Mathlib.Analysis.Real.OfDigits
{x : β} {b : β} [NeZero b] (hx : x β Set.Ico 0 1) (n : β) : βb ^ n * β i β Finset.range n, Real.ofDigitsTerm (x.digits b) i = βββb ^ n * xββ - Int.log_of_one_le_right π Mathlib.Data.Int.Log
{R : Type u_1} [Semifield R] [LinearOrder R] [FloorSemiring R] (b : β) {r : R} (hr : 1 β€ r) : Int.log b r = β(Nat.log b βrββ) - Int.clog_of_right_le_one π Mathlib.Data.Int.Log
{R : Type u_1} [Semifield R] [LinearOrder R] [IsStrictOrderedRing R] [FloorSemiring R] (b : β) {r : R} (hr : r β€ 1) : Int.clog b r = -β(Nat.log b βrβ»ΒΉββ) - Real.natFloor_logb_natCast π Mathlib.Analysis.SpecialFunctions.Log.Base
(b n : β) : βReal.logb βb βnββ = Nat.log b n - mul_pow_le_nat_floor_pow π Mathlib.Analysis.SpecificLimits.FloorPow
{c : β} (hc : 1 < c) (i : β) : (1 - cβ»ΒΉ) * c ^ i β€ ββc ^ iββ - tendsto_div_of_monotone_of_tendsto_div_floor_pow π Mathlib.Analysis.SpecificLimits.FloorPow
(u : β β β) (l : β) (hmono : Monotone u) (c : β β β) (cone : β (k : β), 1 < c k) (clim : Filter.Tendsto c Filter.atTop (nhds 1)) (hc : β (k : β), Filter.Tendsto (fun n => u βc k ^ nββ / ββc k ^ nββ) Filter.atTop (nhds l)) : Filter.Tendsto (fun n => u n / βn) Filter.atTop (nhds l) - sum_div_nat_floor_pow_sq_le_div_sq π Mathlib.Analysis.SpecificLimits.FloorPow
(N : β) {j : β} (hj : 0 < j) {c : β} (hc : 1 < c) : β i β Finset.range N with j < ββc ^ iββ, 1 / ββc ^ iββ ^ 2 β€ c ^ 5 * (c - 1)β»ΒΉ ^ 3 / j ^ 2 - Behrend.div_lt_floor π Mathlib.Combinatorics.Additive.AP.Three.Behrend
{x : β} (hx : 2 / (1 - 2 / Real.exp 1) β€ x) : x / Real.exp 1 < ββx / 2ββ - NNRat.floor_def π Mathlib.Data.NNRat.Floor
(q : ββ₯0) : βqββ = q.num / q.den - NNRat.coe_floor π Mathlib.Data.NNRat.Floor
(q : ββ₯0) : ββqββ = ββqβ - NNRat.floor_coe π Mathlib.Data.NNRat.Floor
(q : ββ₯0) : ββqββ = βqββ - NNRat.floor_natCast_div_natCast π Mathlib.Data.NNRat.Floor
(n d : β) : ββn / βdββ = n / d - NNRat.floor_cast π Mathlib.Data.NNRat.Floor
{K : Type u_1} [Semifield K] [LinearOrder K] [IsStrictOrderedRing K] [FloorSemiring K] (x : ββ₯0) : ββxββ = βxββ - Nat.measurable_floor π Mathlib.MeasureTheory.Function.Floor
{R : Type u_2} [Semiring R] [LinearOrder R] [FloorSemiring R] [TopologicalSpace R] [OrderTopology R] [MeasurableSpace R] [OpensMeasurableSpace R] [IsStrictOrderedRing R] : Measurable Nat.floor - Measurable.nat_floor π Mathlib.MeasureTheory.Function.Floor
{Ξ± : Type u_1} {R : Type u_2} [MeasurableSpace Ξ±] [Semiring R] [LinearOrder R] [FloorSemiring R] [TopologicalSpace R] [OrderTopology R] [MeasurableSpace R] [OpensMeasurableSpace R] {f : Ξ± β R} [IsStrictOrderedRing R] (hf : Measurable f) : Measurable fun x => βf xββ - integrableOn_mul_sum_Icc π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {a b : β} {m : β} (ha : 0 β€ a) {g : β β π} (hg_int : MeasureTheory.IntegrableOn g (Set.Icc a b) MeasureTheory.volume) : MeasureTheory.IntegrableOn (fun t => g t * β k β Finset.Icc m βtββ, c k) (Set.Icc a b) MeasureTheory.volume - locallyIntegrableOn_mul_sum_Icc π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {a : β} {m : β} (ha : 0 β€ a) {g : β β π} (hg : MeasureTheory.LocallyIntegrableOn g (Set.Ici a) MeasureTheory.volume) : MeasureTheory.LocallyIntegrableOn (fun t => g t * β k β Finset.Icc m βtββ, c k) (Set.Ici a) MeasureTheory.volume - summable_mul_of_bigO_atTop π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hf_diff : β t β Set.Ici 0, DifferentiableAt β (fun x => βf xβ) t) (hf_int : MeasureTheory.LocallyIntegrableOn (deriv fun t => βf tβ) (Set.Ici 0) MeasureTheory.volume) (h_bdd : (fun n => βf βnβ * β k β Finset.Icc 0 n, βc kβ) =O[Filter.atTop] fun x => 1) {g : β β β} (hgβ : (fun t => deriv (fun t => βf tβ) t * β k β Finset.Icc 0 βtββ, βc kβ) =O[Filter.atTop] g) (hgβ : MeasureTheory.IntegrableAtFilter g Filter.atTop MeasureTheory.volume) : Summable fun n => f βn * c n - summable_mul_of_bigO_atTop' π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hf_diff : β t β Set.Ici 1, DifferentiableAt β (fun x => βf xβ) t) (hf_int : MeasureTheory.LocallyIntegrableOn (deriv fun t => βf tβ) (Set.Ici 1) MeasureTheory.volume) (h_bdd : (fun n => βf βnβ * β k β Finset.Icc 1 n, βc kβ) =O[Filter.atTop] fun x => 1) {g : β β β} (hgβ : (fun t => deriv (fun t => βf tβ) t * β k β Finset.Icc 1 βtββ, βc kβ) =O[Filter.atTop] g) (hgβ : MeasureTheory.IntegrableAtFilter g Filter.atTop MeasureTheory.volume) : Summable fun n => f βn * c n - sum_mul_eq_sub_integral_mul' π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (m : β) (hf_diff : β t β Set.Icc 0 βm, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc 0 βm) MeasureTheory.volume) : β k β Finset.Icc 0 m, f βk * c k = f βm * β k β Finset.Icc 0 m, c k - β« (t : β) in Set.Ioc 0 βm, deriv f t * β k β Finset.Icc 0 βtββ, c k - sum_mul_eq_sub_integral_mul π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} {b : β} (hb : 0 β€ b) (hf_diff : β t β Set.Icc 0 b, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc 0 b) MeasureTheory.volume) : β k β Finset.Icc 0 βbββ, f βk * c k = f b * β k β Finset.Icc 0 βbββ, c k - β« (t : β) in Set.Ioc 0 b, deriv f t * β k β Finset.Icc 0 βtββ, c k - sum_mul_eq_sub_integral_mulβ' π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hc : c 0 = 0) (m : β) (hf_diff : β t β Set.Icc 1 βm, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc 1 βm) MeasureTheory.volume) : β k β Finset.Icc 0 m, f βk * c k = f βm * β k β Finset.Icc 0 m, c k - β« (t : β) in Set.Ioc 1 βm, deriv f t * β k β Finset.Icc 0 βtββ, c k - sum_mul_eq_sub_integral_mulβ π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hc : c 0 = 0) (b : β) (hf_diff : β t β Set.Icc 1 b, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc 1 b) MeasureTheory.volume) : β k β Finset.Icc 0 βbββ, f βk * c k = f b * β k β Finset.Icc 0 βbββ, c k - β« (t : β) in Set.Ioc 1 b, deriv f t * β k β Finset.Icc 0 βtββ, c k - sum_mul_eq_sub_sub_integral_mul' π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} {n m : β} (h : n β€ m) (hf_diff : β t β Set.Icc βn βm, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc βn βm) MeasureTheory.volume) : β k β Finset.Ioc n m, f βk * c k = f βm * β k β Finset.Icc 0 m, c k - f βn * β k β Finset.Icc 0 n, c k - β« (t : β) in Set.Ioc βn βm, deriv f t * β k β Finset.Icc 0 βtββ, c k - sum_mul_eq_sub_sub_integral_mul π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} {a b : β} (ha : 0 β€ a) (hab : a β€ b) (hf_diff : β t β Set.Icc a b, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc a b) MeasureTheory.volume) : β k β Finset.Ioc βaββ βbββ, f βk * c k = f b * β k β Finset.Icc 0 βbββ, c k - f a * β k β Finset.Icc 0 βaββ, c k - β« (t : β) in Set.Ioc a b, deriv f t * β k β Finset.Icc 0 βtββ, c k - sum_mul_eq_sub_integral_mulβ π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hc : c 0 = 0) (hc1 : c 1 = 0) (b : β) (hf_diff : β t β Set.Icc 2 b, DifferentiableAt β f t) (hf_int : MeasureTheory.IntegrableOn (deriv f) (Set.Icc 2 b) MeasureTheory.volume) : β k β Finset.Icc 0 βbββ, f βk * c k = f b * β k β Finset.Icc 0 βbββ, c k - β« (t : β) in Set.Ioc 2 b, deriv f t * β k β Finset.Icc 0 βtββ, c k - tendsto_sum_mul_atTop_nhds_one_sub_integral π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hf_diff : β t β Set.Ici 0, DifferentiableAt β f t) (hf_int : MeasureTheory.LocallyIntegrableOn (deriv f) (Set.Ici 0) MeasureTheory.volume) {l : π} (h_lim : Filter.Tendsto (fun n => f βn * β k β Finset.Icc 0 n, c k) Filter.atTop (nhds l)) {g : β β π} (hg_dom : (fun t => deriv f t * β k β Finset.Icc 0 βtββ, c k) =O[Filter.atTop] g) (hg_int : MeasureTheory.IntegrableAtFilter g Filter.atTop MeasureTheory.volume) : Filter.Tendsto (fun n => β k β Finset.Icc 0 n, f βk * c k) Filter.atTop (nhds (l - β« (t : β) in Set.Ioi 0, deriv f t * β k β Finset.Icc 0 βtββ, c k)) - tendsto_sum_mul_atTop_nhds_one_sub_integralβ π Mathlib.NumberTheory.AbelSummation
{π : Type u_1} [RCLike π] (c : β β π) {f : β β π} (hc : c 0 = 0) (hf_diff : β t β Set.Ici 1, DifferentiableAt β f t) (hf_int : MeasureTheory.LocallyIntegrableOn (deriv f) (Set.Ici 1) MeasureTheory.volume) {l : π} (h_lim : Filter.Tendsto (fun n => f βn * β k β Finset.Icc 0 n, c k) Filter.atTop (nhds l)) {g : β β β} (hg_dom : (fun t => deriv f t * β k β Finset.Icc 0 βtββ, c k) =O[Filter.atTop] g) (hg_int : MeasureTheory.IntegrableAtFilter g Filter.atTop MeasureTheory.volume) : Filter.Tendsto (fun n => β k β Finset.Icc 0 n, f βk * c k) Filter.atTop (nhds (l - β« (t : β) in Set.Ioi 1, deriv f t * β k β Finset.Icc 0 βtββ, c k)) - Chebyshev.psi_eq_psi_coe_floor π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.psi x = Chebyshev.psi ββxββ - Chebyshev.theta_eq_theta_coe_floor π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.theta x = Chebyshev.theta ββxββ - Chebyshev.theta_eq_log_primorial π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.theta x = Real.log β(primorial βxββ) - Chebyshev.theta_eq_sum_primesLE π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.theta x = β p β βxββ.primesLE, Real.log βp - Chebyshev.psi_le_primeCounting_mul_log' π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.psi x β€ ββxββ.primeCounting * Real.log x - Chebyshev.theta_le_pi_mul_log' π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.theta x β€ ββxββ.primeCounting * Real.log x - Chebyshev.theta_eq_sum_Icc π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.theta x = β p β Finset.Icc 0 βxββ with Nat.Prime p, Real.log βp - Chebyshev.psi_eq_sum_Icc π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.psi x = β n β Finset.Icc 0 βxββ, ArithmeticFunction.vonMangoldt n - Nat.lcmUpto_eq_prod_pow_floor π Mathlib.NumberTheory.Chebyshev
(n : β) : n.lcmUpto = β p β n.primesLE, p ^ βReal.log βn / Real.log βpββ - Chebyshev.psi_sub_theta_eq_sum_not_prime π Mathlib.NumberTheory.Chebyshev
(x : β) : Chebyshev.psi x - Chebyshev.theta x = β n β Finset.Ioc 0 βxββ with Β¬Nat.Prime n, ArithmeticFunction.vonMangoldt n - Chebyshev.primeCounting_sub_theta_div_log_isBigO π Mathlib.NumberTheory.Chebyshev
: (fun x => ββxββ.primeCounting - Chebyshev.theta x / Real.log x) =O[Filter.atTop] fun x => x / Real.log x ^ 2 - Chebyshev.pi_le_log4_mul_div π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 1 < x) : ββxββ.primeCounting β€ Real.log 4 * x / Real.log βx + βx - Chebyshev.eventually_primeCounting_le π Mathlib.NumberTheory.Chebyshev
{Ξ΅ : β} (Ξ΅pos : 0 < Ξ΅) : βαΆ (x : β) in Filter.atTop, ββxββ.primeCounting β€ (Real.log 4 + Ξ΅) * x / Real.log x - Chebyshev.psi_eq_sum_theta π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 0 β€ x) : Chebyshev.psi x = β n β Finset.Icc 1 βReal.log x / Real.log 2ββ, Chebyshev.theta (x ^ (1 / βn)) - Chebyshev.psi_eq_sum_theta' π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 0 β€ x) {N : β} (hN : βReal.log x / Real.log 2ββ β€ N) : Chebyshev.psi x = β n β Finset.Icc 1 N, Chebyshev.theta (x ^ (1 / βn)) - Chebyshev.pi_ge' π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 1 < x) : ((x - 1) * Real.log 2 - Real.log (x + 2)) / Real.log x β€ ββxββ.primeCounting - Chebyshev.theta_eq_primeCounting_mul_log_sub_integral π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 2 β€ x) : Chebyshev.theta x = ββxββ.primeCounting * Real.log x - β« (t : β) in 2..x, ββtββ.primeCounting / t - Chebyshev.psi_eq_theta_add_sum_theta π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 2 β€ x) : Chebyshev.psi x = Chebyshev.theta x + β n β Finset.Icc 2 βReal.log x / Real.log 2ββ, Chebyshev.theta (x ^ (1 / βn)) - Chebyshev.psi_eq_theta_add_sum_theta' π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 2 β€ x) {N : β} (hN : βReal.log x / Real.log 2ββ β€ N) : Chebyshev.psi x = Chebyshev.theta x + β n β Finset.Icc 2 N, Chebyshev.theta (x ^ (1 / βn)) - Chebyshev.primeCounting_eq_theta_div_log_add_integral π Mathlib.NumberTheory.Chebyshev
{x : β} (hx : 2 β€ x) : ββxββ.primeCounting = Chebyshev.theta x / Real.log x + β« (t : β) in 2..x, Chebyshev.theta t / (t * Real.log t ^ 2) - Chebyshev.sum_PrimePow_eq_sum_sum π Mathlib.NumberTheory.Chebyshev
{R : Type u_1} [AddCommMonoid R] (f : β β R) {x : β} (hx : 0 β€ x) : β n β Finset.Ioc 0 βxββ with IsPrimePow n, f n = β k β Finset.Icc 1 βReal.log x / Real.log 2ββ, β p β Finset.Ioc 0 βx ^ (1 / βk)ββ with Nat.Prime p, f (p ^ k) - Chebyshev.sum_PrimePow_eq_sum_sum' π Mathlib.NumberTheory.Chebyshev
{R : Type u_1} [AddCommMonoid R] (f : β β R) {x : β} (hx : 0 β€ x) {N : β} (hN : βReal.log x / Real.log 2ββ β€ N) : β n β Finset.Ioc 0 βxββ with IsPrimePow n, f n = β k β Finset.Icc 1 N, β p β Finset.Ioc 0 βx ^ (1 / βk)ββ with Nat.Prime p, f (p ^ k) - RingOfIntegers.isPrincipalIdealRing_of_isPrincipal_of_pow_le_of_mem_primesOver_of_mem_Icc π Mathlib.NumberTheory.NumberField.ClassNumber
{K : Type u_1} [Field K] [NumberField K] (h : β p β Finset.Icc 1 β(4 / Real.pi) ^ NumberField.InfinitePlace.nrComplexPlaces K * (β(Module.finrank β K).factorial / β(Module.finrank β K) ^ Module.finrank β K * β|β(NumberField.discr K)|)ββ, Nat.Prime p β β P β (Ideal.span {βp}).primesOver (NumberField.RingOfIntegers K), p ^ P.inertiaDeg β€ β€ β(4 / Real.pi) ^ NumberField.InfinitePlace.nrComplexPlaces K * (β(Module.finrank β K).factorial / β(Module.finrank β K) ^ Module.finrank β K * β|β(NumberField.discr K)|)ββ β Submodule.IsPrincipal P) : IsPrincipalIdealRing (NumberField.RingOfIntegers K) - RingOfIntegers.isPrincipalIdealRing_of_isPrincipal_of_lt_or_isPrincipal_of_mem_primesOver_of_mem_Icc π Mathlib.NumberTheory.NumberField.ClassNumber
{K : Type u_1} [Field K] [NumberField K] [IsGalois β K] (h : β p β Finset.Icc 1 β(4 / Real.pi) ^ NumberField.InfinitePlace.nrComplexPlaces K * (β(Module.finrank β K).factorial / β(Module.finrank β K) ^ Module.finrank β K * β|β(NumberField.discr K)|)ββ, Nat.Prime p β β P β (Ideal.span {βp}).primesOver (NumberField.RingOfIntegers K), β(4 / Real.pi) ^ NumberField.InfinitePlace.nrComplexPlaces K * (β(Module.finrank β K).factorial / β(Module.finrank β K) ^ Module.finrank β K * β|β(NumberField.discr K)|)ββ < p ^ P.inertiaDeg β€ β¨ Submodule.IsPrincipal P) : IsPrincipalIdealRing (NumberField.RingOfIntegers K) - log_le_harmonic_floor π Mathlib.NumberTheory.Harmonic.Bounds
(y : β) (hy : 0 β€ y) : Real.log y β€ β(harmonic βyββ) - harmonic_floor_le_one_add_log π Mathlib.NumberTheory.Harmonic.Bounds
(y : β) (hy : 1 β€ y) : β(harmonic βyββ) β€ 1 + Real.log y - LSeries_eq_mul_integral π Mathlib.NumberTheory.LSeries.SumCoeff
(f : β β β) {r : β} (hr : 0 β€ r) {s : β} (hs : r < s.re) (hS : LSeriesSummable f s) (hO : (fun n => β k β Finset.Icc 1 n, f k) =O[Filter.atTop] fun n => βn ^ r) : LSeries f s = s * β« (t : β) in Set.Ioi 1, (β k β Finset.Icc 1 βtββ, f k) * βt ^ (-(s + 1)) - LSeries_eq_mul_integral' π Mathlib.NumberTheory.LSeries.SumCoeff
(f : β β β) {r : β} (hr : 0 β€ r) {s : β} (hs : r < s.re) (hO : (fun n => β k β Finset.Icc 1 n, βf kβ) =O[Filter.atTop] fun n => βn ^ r) : LSeries f s = s * β« (t : β) in Set.Ioi 1, (β k β Finset.Icc 1 βtββ, f k) * βt ^ (-(s + 1)) - LSeries_eq_mul_integral_of_nonneg π Mathlib.NumberTheory.LSeries.SumCoeff
(f : β β β) {r : β} (hr : 0 β€ r) {s : β} (hs : r < s.re) (hO : (fun n => β k β Finset.Icc 1 n, f k) =O[Filter.atTop] fun n => βn ^ r) (hf : β (n : β), 0 β€ f n) : LSeries (fun n => β(f n)) s = s * β« (t : β) in Set.Ioi 1, (β k β Finset.Icc 1 βtββ, β(f k)) * βt ^ (-(s + 1)) - Polynomial.card_mahlerMeasure_le_prod π Mathlib.NumberTheory.MahlerMeasure
(n : β) (B : NNReal) : {p | p.natDegree β€ n β§ (Polynomial.map (Int.castRingHom β) p).mahlerMeasure β€ βB}.ncard β€ β i, (2 * ββ(n.choose βi) * Bββ + 1) - Nat.cast_mem_Ioi_iff π Mathlib.Order.Interval.Finset.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [LinearOrder Ξ±] [FloorSemiring Ξ±] {a : Ξ±} {n : β} (ha : 0 β€ a) : βn β Set.Ioi a β n β Set.Ioi βaββ - Nat.cast_mem_Iic_iff π Mathlib.Order.Interval.Finset.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [LinearOrder Ξ±] [FloorSemiring Ξ±] {b : Ξ±} {n : β} (hb : 0 β€ b) : βn β Set.Iic b β n β Finset.Iic βbββ - Nat.cast_mem_Icc_iff π Mathlib.Order.Interval.Finset.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [LinearOrder Ξ±] [FloorSemiring Ξ±] {a b : Ξ±} {n : β} (hb : 0 β€ b) : βn β Set.Icc a b β n β Finset.Icc βaββ βbββ - Nat.cast_mem_Ioo_iff π Mathlib.Order.Interval.Finset.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [LinearOrder Ξ±] [FloorSemiring Ξ±] {a b : Ξ±} {n : β} (ha : 0 β€ a) : βn β Set.Ioo a b β n β Finset.Ioo βaββ βbββ - Nat.cast_mem_Ioc_iff' π Mathlib.Order.Interval.Finset.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [LinearOrder Ξ±] [FloorSemiring Ξ±] {a b : Ξ±} {n : β} [IsStrictOrderedRing Ξ±] (ha : 0 β€ a) : βn β Set.Ioc a b β n β Finset.Ioc βaββ βbββ - Nat.cast_mem_Ioc_iff π Mathlib.Order.Interval.Finset.Floor
{Ξ± : Type u_1} [Semiring Ξ±] [LinearOrder Ξ±] [FloorSemiring Ξ±] {a b : Ξ±} {n : β} (ha : 0 β€ a) (hb : 0 β€ b) : βn β Set.Ioc a b β n β Finset.Ioc βaββ βbββ - ProbabilityTheory.strong_law_aux6 π Mathlib.Probability.StrongLaw
{Ξ© : Type u_1} [MeasureTheory.MeasureSpace Ξ©] [MeasureTheory.IsProbabilityMeasure MeasureTheory.volume] (X : β β Ξ© β β) (hint : MeasureTheory.Integrable (X 0) MeasureTheory.volume) (hindep : Pairwise (Function.onFun (fun f g => ProbabilityTheory.IndepFun f g MeasureTheory.volume) X)) (hident : β (i : β), ProbabilityTheory.IdentDistrib (X i) (X 0) MeasureTheory.volume MeasureTheory.volume) (hnonneg : β (i : β) (Ο : Ξ©), 0 β€ X i Ο) {c : β} (c_one : 1 < c) : βα΅ (Ο : Ξ©), Filter.Tendsto (fun n => (β i β Finset.range βc ^ nββ, X i Ο) / ββc ^ nββ) Filter.atTop (nhds (β« (a : Ξ©), X 0 a)) - ProbabilityTheory.strong_law_aux4 π Mathlib.Probability.StrongLaw
{Ξ© : Type u_1} [MeasureTheory.MeasureSpace Ξ©] [MeasureTheory.IsProbabilityMeasure MeasureTheory.volume] (X : β β Ξ© β β) (hint : MeasureTheory.Integrable (X 0) MeasureTheory.volume) (hindep : Pairwise (Function.onFun (fun f g => ProbabilityTheory.IndepFun f g MeasureTheory.volume) X)) (hident : β (i : β), ProbabilityTheory.IdentDistrib (X i) (X 0) MeasureTheory.volume MeasureTheory.volume) (hnonneg : β (i : β) (Ο : Ξ©), 0 β€ X i Ο) {c : β} (c_one : 1 < c) : βα΅ (Ο : Ξ©), (fun n => β i β Finset.range βc ^ nββ, ProbabilityTheory.truncation (X i) (βi) Ο - ββc ^ nββ * β« (a : Ξ©), X 0 a) =o[Filter.atTop] fun n => ββc ^ nββ - ProbabilityTheory.strong_law_aux2 π Mathlib.Probability.StrongLaw
{Ξ© : Type u_1} [MeasureTheory.MeasureSpace Ξ©] [MeasureTheory.IsProbabilityMeasure MeasureTheory.volume] (X : β β Ξ© β β) (hint : MeasureTheory.Integrable (X 0) MeasureTheory.volume) (hindep : Pairwise (Function.onFun (fun f g => ProbabilityTheory.IndepFun f g MeasureTheory.volume) X)) (hident : β (i : β), ProbabilityTheory.IdentDistrib (X i) (X 0) MeasureTheory.volume MeasureTheory.volume) (hnonneg : β (i : β) (Ο : Ξ©), 0 β€ X i Ο) {c : β} (c_one : 1 < c) : βα΅ (Ο : Ξ©), (fun n => β i β Finset.range βc ^ nββ, ProbabilityTheory.truncation (X i) (βi) Ο - β« (a : Ξ©), (β i β Finset.range βc ^ nββ, ProbabilityTheory.truncation (X i) βi) a) =o[Filter.atTop] fun n => ββc ^ nββ - ProbabilityTheory.strong_law_aux1 π Mathlib.Probability.StrongLaw
{Ξ© : Type u_1} [MeasureTheory.MeasureSpace Ξ©] [MeasureTheory.IsProbabilityMeasure MeasureTheory.volume] (X : β β Ξ© β β) (hint : MeasureTheory.Integrable (X 0) MeasureTheory.volume) (hindep : Pairwise (Function.onFun (fun f g => ProbabilityTheory.IndepFun f g MeasureTheory.volume) X)) (hident : β (i : β), ProbabilityTheory.IdentDistrib (X i) (X 0) MeasureTheory.volume MeasureTheory.volume) (hnonneg : β (i : β) (Ο : Ξ©), 0 β€ X i Ο) {c : β} (c_one : 1 < c) {Ξ΅ : β} (Ξ΅pos : 0 < Ξ΅) : βα΅ (Ο : Ξ©), βαΆ (n : β) in Filter.atTop, |β i β Finset.range βc ^ nββ, ProbabilityTheory.truncation (X i) (βi) Ο - β« (a : Ξ©), (β i β Finset.range βc ^ nββ, ProbabilityTheory.truncation (X i) βi) a| < Ξ΅ * ββc ^ nββ
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c