Documentation

ConvexAnalysisMonotoneOperators_BauschkeCombettes_2017.Chap01.Text_1_0_66

Statements

Source excerpts; proofs omitted. recall restates an existing declaration; #check records an expression, not its inferred type.

Text 1.0.66: in a metric space, convergence of a sequence to a point is expressed by the canonical filter-theoretic notion Tendsto u atTop (nhds x).

recall Tendsto

Lean source

Source context
universe u v
open Filter
variable {X : Type u} [MetricSpace X]

Text 1.0.66: in a metric space, convergence to x is canonically characterized by tendsto_iff_dist_tendsto_zero; the sequence-at-atTop formulation is the textbook specialization recorded below.

recall tendsto_iff_dist_tendsto_zero {α : Type u} {β : Type v} [PseudoMetricSpace α]
    {f : β → α} {l : Filter β} {a : α} :
    Tendsto f l (nhds a) ↔ Tendsto (fun b ↦ dist (f b) a) l (nhds 0)

Lean source

Source context
universe u v
open Filter
variable {X : Type u} [MetricSpace X]

Module source

theorem sequence_tendsto_iff_dist_tendsto_zero {X : Type u} [MetricSpace X] {u : ℕ → X} {x : X} :
Filter.Tendsto u Filter.atTop (nhds x) ↔ Filter.Tendsto (fun (n : ℕ) => dist (u n) x) Filter.atTop (nhds 0)

In a metric space, a sequence converges to x exactly when its distances to x tend to 0.