Loogle!
Result
Found 59 declarations mentioning IsComplete.
- IsComplete ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] (s : Set ฮฑ) : Prop - completeSpace_of_isComplete_univ ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] (h : IsComplete Set.univ) : CompleteSpace ฮฑ - complete_univ ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [UniformSpace ฮฑ] [CompleteSpace ฮฑ] : IsComplete Set.univ - isComplete_univ ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [UniformSpace ฮฑ] [CompleteSpace ฮฑ] : IsComplete Set.univ - completeSpace_iff_isComplete_univ ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] : CompleteSpace ฮฑ โ IsComplete Set.univ - IsCompact.isComplete ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s : Set ฮฑ} (h : IsCompact s) : IsComplete s - IsClosed.isComplete ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] [CompleteSpace ฮฑ] {s : Set ฮฑ} (h : IsClosed s) : IsComplete s - TotallyBounded.isCompact_of_isComplete ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s : Set ฮฑ} (ht : TotallyBounded s) (hc : IsComplete s) : IsCompact s - isCompact_iff_totallyBounded_isComplete ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s : Set ฮฑ} : IsCompact s โ TotallyBounded s โง IsComplete s - IsComplete.union ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s t : Set ฮฑ} (hs : IsComplete s) (ht : IsComplete t) : IsComplete (s โช t) - isComplete_iff_clusterPt ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s : Set ฮฑ} : IsComplete s โ โ (l : Filter ฮฑ), Cauchy l โ l โค Filter.principal s โ โ x โ s, ClusterPt x l - cauchySeq_tendsto_of_isComplete ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} {ฮฒ : Type v} [uniformSpace : UniformSpace ฮฑ] [Preorder ฮฒ] {K : Set ฮฑ} (hโ : IsComplete K) {u : ฮฒ โ ฮฑ} (hโ : โ (n : ฮฒ), u n โ K) (hโ : CauchySeq u) : โ v โ K, Filter.Tendsto u Filter.atTop (nhds v) - isComplete_iff_ultrafilter' ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s : Set ฮฑ} : IsComplete s โ โ (l : Ultrafilter ฮฑ), Cauchy โl โ s โ l โ โ x โ s, โl โค nhds x - isComplete_iff_ultrafilter ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {s : Set ฮฑ} : IsComplete s โ โ (l : Ultrafilter ฮฑ), Cauchy โl โ โl โค Filter.principal s โ โ x โ s, โl โค nhds x - isComplete_iUnion_separated ๐ Mathlib.Topology.UniformSpace.Cauchy
{ฮฑ : Type u} [uniformSpace : UniformSpace ฮฑ] {ฮน : Sort u_1} {s : ฮน โ Set ฮฑ} (hs : โ (i : ฮน), IsComplete (s i)) {U : SetRel ฮฑ ฮฑ} (hU : U โ uniformity ฮฑ) (hd : โ (i j : ฮน), โ x โ s i, โ y โ s j, (x, y) โ U โ i = j) : IsComplete (โ i, s i) - IsUniformInducing.completeSpace ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {f : ฮฑ โ ฮฒ} (hf : IsUniformInducing f) : IsComplete (Set.range f) โ CompleteSpace ฮฑ - IsUniformInducing.isComplete_range ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {f : ฮฑ โ ฮฒ} [CompleteSpace ฮฑ] (hf : IsUniformInducing f) : IsComplete (Set.range f) - completeSpace_iff_isComplete_range ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {f : ฮฑ โ ฮฒ} (hf : IsUniformInducing f) : CompleteSpace ฮฑ โ IsComplete (Set.range f) - IsComplete.completeSpace_coe ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} [UniformSpace ฮฑ] {s : Set ฮฑ} : IsComplete s โ CompleteSpace โs - completeSpace_coe_iff_isComplete ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} [UniformSpace ฮฑ] {s : Set ฮฑ} : CompleteSpace โs โ IsComplete s - isComplete_of_complete_image ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {m : ฮฑ โ ฮฒ} {s : Set ฮฑ} (hm : IsUniformInducing m) : IsComplete (m '' s) โ IsComplete s - isComplete_image_iff ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {m : ฮฑ โ ฮฒ} {s : Set ฮฑ} (hm : IsUniformInducing m) : IsComplete (m '' s) โ IsComplete s - IsUniformEmbedding.isComplete_iff ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {f : ฮฑ โ ฮฒ} {s : Set ฮฑ} (hf : IsUniformEmbedding f) : IsComplete (f '' s) โ IsComplete s - IsUniformInducing.isComplete_iff ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} {ฮฒ : Type v} [UniformSpace ฮฑ] [UniformSpace ฮฒ] {f : ฮฑ โ ฮฒ} {s : Set ฮฑ} (hf : IsUniformInducing f) : IsComplete (f '' s) โ IsComplete s - Subtype.isComplete_iff ๐ Mathlib.Topology.UniformSpace.UniformEmbedding
{ฮฑ : Type u} [UniformSpace ฮฑ] {p : ฮฑ โ Prop} {s : Set { x // p x }} : IsComplete s โ IsComplete (Subtype.val '' s) - IsComplete.isClosed ๐ Mathlib.Topology.UniformSpace.CompleteSeparated
{ฮฑ : Type u_1} [UniformSpace ฮฑ] [T0Space ฮฑ] {s : Set ฮฑ} (h : IsComplete s) : IsClosed s - ContinuousLinearMap.isComplete_ker ๐ Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Basic
{Rโ : Type u_1} {Rโ : Type u_2} [Semiring Rโ] [Semiring Rโ] {ฯโโ : Rโ โ+* Rโ} {Mโ : Type u_6} [TopologicalSpace Mโ] [AddCommMonoid Mโ] [Module Rโ Mโ] {M' : Type u_9} [UniformSpace M'] [CompleteSpace M'] [AddCommMonoid M'] [Module Rโ M'] [T1Space Mโ] (f : M' โSL[ฯโโ] Mโ) : IsComplete โ(โf).ker - ContinuousLinearMap.isComplete_eqLocus ๐ Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Basic
{Rโ : Type u_1} {Rโ : Type u_2} [Semiring Rโ] [Semiring Rโ] {ฯโโ : Rโ โ+* Rโ} {Mโ : Type u_6} [TopologicalSpace Mโ] [AddCommMonoid Mโ] [Module Rโ Mโ] {M' : Type u_9} [UniformSpace M'] [CompleteSpace M'] [AddCommMonoid M'] [Module Rโ M'] [T2Space Mโ] (f g : M' โSL[ฯโโ] Mโ) : IsComplete โ((โf).eqLocus โg) - IsComplete.nonempty_iInter_of_nonempty_biInter ๐ Mathlib.Topology.MetricSpace.Bounded
{ฮฑ : Type u} [PseudoMetricSpace ฮฑ] {s : โ โ Set ฮฑ} (h0 : IsComplete (s 0)) (hs : โ (n : โ), IsClosed (s n)) (h's : โ (n : โ), Bornology.IsBounded (s n)) (h : โ (N : โ), (โ n, โ (_ : n โค N), s n).Nonempty) (h' : Filter.Tendsto (fun n => Metric.diam (s n)) Filter.atTop (nhds 0)) : (โ n, s n).Nonempty - AntilipschitzWith.isComplete_range ๐ Mathlib.Topology.MetricSpace.Antilipschitz
{ฮฑ : Type u_1} {ฮฒ : Type u_2} [PseudoEMetricSpace ฮฑ] [PseudoEMetricSpace ฮฒ] {K : NNReal} {f : ฮฑ โ ฮฒ} [CompleteSpace ฮฑ] (hf : AntilipschitzWith K f) (hfc : UniformContinuous f) : IsComplete (Set.range f) - IsSeqCompact.isComplete ๐ Mathlib.Topology.Sequences
{X : Type u_1} [UniformSpace X] {s : Set X} [(uniformity X).IsCountablyGenerated] (hs : IsSeqCompact s) : IsComplete s - NormedField.completeSpace_iff_isComplete_closedBall ๐ Mathlib.Analysis.Normed.Field.Lemmas
{K : Type u_4} [NormedField K] : CompleteSpace K โ IsComplete (Metric.closedBall 0 1) - LinearIsometry.isComplete_image_iff ๐ Mathlib.Analysis.Normed.Operator.LinearIsometry
{R : Type u_1} {Rโ : Type u_2} {E : Type u_4} {Eโ : Type u_5} {๐ : Type u_8} [Semiring R] [Semiring Rโ] {ฯโโ : R โ+* Rโ} [SeminormedAddCommGroup E] [SeminormedAddCommGroup Eโ] [Module R E] [Module Rโ Eโ] [FunLike ๐ E Eโ] [SemilinearIsometryClass ๐ ฯโโ E Eโ] (f : ๐) {s : Set E} : IsComplete (โf '' s) โ IsComplete s - LinearIsometry.isComplete_map_iff ๐ Mathlib.Analysis.Normed.Operator.LinearIsometry
{R : Type u_1} {Rโ : Type u_2} {E : Type u_4} {Eโ : Type u_5} [Semiring R] [Semiring Rโ] {ฯโโ : R โ+* Rโ} [SeminormedAddCommGroup E] [SeminormedAddCommGroup Eโ] [Module R E] [Module Rโ Eโ] (f : E โโโแตข[ฯโโ] Eโ) [RingHomSurjective ฯโโ] {p : Submodule R E} : IsComplete โ(Submodule.map f.toLinearMap p) โ IsComplete โp - QuasiCompleteSpace.mk ๐ Mathlib.Analysis.LocallyConvex.Bounded
{๐ : Type u_6} {E : Type u_7} [Zero E] [UniformSpace E] [SeminormedRing ๐] [SMul ๐ E] (quasiComplete : โ โฆs : Set Eโฆ, Bornology.IsVonNBounded ๐ s โ IsClosed s โ IsComplete s) : QuasiCompleteSpace ๐ E - QuasiCompleteSpace.quasiComplete ๐ Mathlib.Analysis.LocallyConvex.Bounded
{๐ : Type u_6} {E : Type u_7} {instโ : Zero E} {instโยน : UniformSpace E} {instโยฒ : SeminormedRing ๐} {instโยณ : SMul ๐ E} [self : QuasiCompleteSpace ๐ E] โฆs : Set Eโฆ : Bornology.IsVonNBounded ๐ s โ IsClosed s โ IsComplete s - ContinuousMap.isComplete_setOfPred_eqOn ๐ Mathlib.Topology.UniformSpace.CompactConvergence
{ฮฑ : Type uโ} {ฮฒ : Type uโ} [TopologicalSpace ฮฑ] [UniformSpace ฮฒ] [CompleteSpace C(ฮฑ, ฮฒ)] (f : ฮฑ โ ฮฒ) (s : Set ฮฑ) : IsComplete {g | Set.EqOn (โg) f s} - ContinuousMap.isComplete_setOf_eqOn ๐ Mathlib.Topology.UniformSpace.CompactConvergence
{ฮฑ : Type uโ} {ฮฒ : Type uโ} [TopologicalSpace ฮฑ] [UniformSpace ฮฒ] [CompleteSpace C(ฮฑ, ฮฒ)] (f : ฮฑ โ ฮฒ) (s : Set ฮฑ) : IsComplete {g | Set.EqOn (โg) f s} - Submodule.complete_of_finiteDimensional ๐ Mathlib.Topology.Algebra.Module.FiniteDimension
{๐ : Type u_1} {E : Type u_2} [NontriviallyNormedField ๐] [CompleteSpace ๐] [AddCommGroup E] [UniformSpace E] [T2Space E] [IsUniformAddGroup E] [Module ๐ E] [ContinuousSMul ๐ E] (s : Submodule ๐ E) [FiniteDimensional ๐ โฅs] : IsComplete โs - exists_norm_eq_iInf_of_complete_convex ๐ Mathlib.Analysis.InnerProductSpace.Projection.Minimal
{F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace โ F] {K : Set F} (ne : K.Nonempty) (hโ : IsComplete K) (hโ : Convex โ K) (u : F) : โ v โ K, โu - vโ = โจ w, โu - โwโ - Submodule.exists_norm_eq_iInf_of_complete_subspace ๐ Mathlib.Analysis.InnerProductSpace.Projection.Minimal
{๐ : Type u_1} {E : Type u_2} [RCLike ๐] [NormedAddCommGroup E] [InnerProductSpace ๐ E] (K : Submodule ๐ E) (h : IsComplete โK) (u : E) : โ v โ K, โu - vโ = โจ w, โu - โwโ - OrthogonalFamily.isInternal_iff_of_isComplete ๐ Mathlib.Analysis.InnerProductSpace.Projection.FiniteDimensional
{๐ : Type u_1} {E : Type u_2} [RCLike ๐] [NormedAddCommGroup E] [InnerProductSpace ๐ E] {ฮน : Type u_4} [DecidableEq ฮน] {V : ฮน โ Submodule ๐ E} (hV : OrthogonalFamily ๐ (fun i => โฅ(V i)) fun i => (V i).subtypeโแตข) (hc : IsComplete โ(iSup V)) : DirectSum.IsInternal V โ (iSup V)แฎ = โฅ - measurableSet_of_differentiableWithinAt_Ici_of_isComplete ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
{F : Type u_1} [NormedAddCommGroup F] [NormedSpace โ F] (f : โ โ F) {K : Set F} (hK : IsComplete K) : MeasurableSet {x | DifferentiableWithinAt โ f (Set.Ici x) x โง derivWithin f (Set.Ici x) x โ K} - RightDerivMeasurableAux.differentiable_set_eq_D ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
{F : Type u_1} [NormedAddCommGroup F] [NormedSpace โ F] {f : โ โ F} (K : Set F) (hK : IsComplete K) : {x | DifferentiableWithinAt โ f (Set.Ici x) x โง derivWithin f (Set.Ici x) x โ K} = RightDerivMeasurableAux.D f K - RightDerivMeasurableAux.D_subset_differentiable_set ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
{F : Type u_1} [NormedAddCommGroup F] [NormedSpace โ F] {f : โ โ F} {K : Set F} (hK : IsComplete K) : RightDerivMeasurableAux.D f K โ {x | DifferentiableWithinAt โ f (Set.Ici x) x โง derivWithin f (Set.Ici x) x โ K} - FDerivMeasurableAux.differentiable_set_eq_D ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
{๐ : Type u_1} [NontriviallyNormedField ๐] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace ๐ E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace ๐ F] {f : E โ F} (K : Set (E โL[๐] F)) (hK : IsComplete K) : {x | DifferentiableAt ๐ f x โง fderiv ๐ f x โ K} = FDerivMeasurableAux.D f K - FDerivMeasurableAux.D_subset_differentiable_set ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
{๐ : Type u_1} [NontriviallyNormedField ๐] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace ๐ E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace ๐ F] {f : E โ F} {K : Set (E โL[๐] F)} (hK : IsComplete K) : FDerivMeasurableAux.D f K โ {x | DifferentiableAt ๐ f x โง fderiv ๐ f x โ K} - measurableSet_of_differentiableAt_of_isComplete ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
(๐ : Type u_1) [NontriviallyNormedField ๐] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace ๐ E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace ๐ F] (f : E โ F) [MeasurableSpace E] [OpensMeasurableSpace E] {K : Set (E โL[๐] F)} (hK : IsComplete K) : MeasurableSet {x | DifferentiableAt ๐ f x โง fderiv ๐ f x โ K} - measurableSet_of_differentiableAt_of_isComplete_with_param ๐ Mathlib.Analysis.Calculus.FDeriv.Measurable
{๐ : Type u_1} [NontriviallyNormedField ๐] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace ๐ E] [LocallyCompactSpace E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace ๐ F] {ฮฑ : Type u_4} [TopologicalSpace ฮฑ] {f : ฮฑ โ E โ F} [MeasurableSpace ฮฑ] [OpensMeasurableSpace ฮฑ] [MeasurableSpace E] [OpensMeasurableSpace E] (hf : Continuous (Function.uncurry f)) {K : Set (E โL[๐] F)} (hK : IsComplete K) : MeasurableSet {p | DifferentiableAt ๐ (f p.1) p.2 โง fderiv ๐ (f p.1) p.2 โ K} - ContractingWith.efixedPoint' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} (f : ฮฑ โ ฮฑ) {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) (x : ฮฑ) (hxs : x โ s) (hx : edist x (f x) โ โค) : ฮฑ - ContractingWith.efixedPoint_isFixedPt' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) : Function.IsFixedPt f (ContractingWith.efixedPoint' f hsc hsf hf x hxs hx) - ContractingWith.efixedPoint_mem' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) : ContractingWith.efixedPoint' f hsc hsf hf x hxs hx โ s - ContractingWith.tendsto_iterate_efixedPoint' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) : Filter.Tendsto (fun n => f^[n] x) Filter.atTop (nhds (ContractingWith.efixedPoint' f hsc hsf hf x hxs hx)) - ContractingWith.edist_efixedPoint_lt_top' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) : edist x (ContractingWith.efixedPoint' f hsc hsf hf x hxs hx) < โค - ContractingWith.edist_efixedPoint_le' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) : edist x (ContractingWith.efixedPoint' f hsc hsf hf x hxs hx) โค edist x (f x) / (1 - โK) - ContractingWith.apriori_edist_iterate_efixedPoint_le' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) (n : โ) : edist (f^[n] x) (ContractingWith.efixedPoint' f hsc hsf hf x hxs hx) โค edist x (f x) * โK ^ n / (1 - โK) - ContractingWith.efixedPoint_eq_of_edist_lt_top' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} (hf : ContractingWith K f) {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hfs : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) {t : Set ฮฑ} (htc : IsComplete t) (htf : Set.MapsTo f t t) (hft : ContractingWith K (Set.MapsTo.restrict f t t htf)) {y : ฮฑ} (hyt : y โ t) (hy : edist y (f y) โ โค) (hxy : edist x y โ โค) : ContractingWith.efixedPoint' f hsc hsf hfs x hxs hx = ContractingWith.efixedPoint' f htc htf hft y hyt hy - ContractingWith.exists_fixedPoint' ๐ Mathlib.Topology.MetricSpace.Contracting
{ฮฑ : Type u_1} [EMetricSpace ฮฑ] {K : NNReal} {f : ฮฑ โ ฮฑ} {s : Set ฮฑ} (hsc : IsComplete s) (hsf : Set.MapsTo f s s) (hf : ContractingWith K (Set.MapsTo.restrict f s s hsf)) {x : ฮฑ} (hxs : x โ s) (hx : edist x (f x) โ โค) : โ y โ s, Function.IsFixedPt f y โง Filter.Tendsto (fun n => f^[n] x) Filter.atTop (nhds y) โง โ (n : โ), edist (f^[n] x) y โค edist x (f x) * โK ^ n / (1 - โK) - MeasureTheory.isComplete_aestronglyMeasurable ๐ Mathlib.MeasureTheory.Function.ConditionalExpectation.AEMeasurable
{ฮฑ : Type u_1} {F : Type u_2} {p : ENNReal} [NormedAddCommGroup F] {m m0 : MeasurableSpace ฮฑ} {ฮผ : MeasureTheory.Measure ฮฑ} [hp : Fact (1 โค p)] [CompleteSpace F] (hm : m โค m0) : IsComplete {f | MeasureTheory.AEStronglyMeasurable (โโf) ฮผ}
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 69fae59