Documentation

Mathlib.Topology.Instances.EReal

Topological structure on EReal #

We endow EReal with the order topology, and prove basic properties of this topology.

Main results #

Implementation #

Most proofs are adapted from the corresponding proofs on ℝ≥0∞.

theorem EReal.denseRange_ratCast :
DenseRange fun r => ↑↑r

Real coercion #

theorem EReal.tendsto_coe {α : Type u_2} {f : Filter α} {m : α → ℝ} {a : ℝ} :
Filter.Tendsto (fun a => ↑(m a)) f (nhds ↑a) ↔ Filter.Tendsto m f (nhds a)
theorem EReal.continuous_coe_iff {α : Type u_1} [TopologicalSpace α] {f : α → ℝ} :
(Continuous fun a => ↑(f a)) ↔ Continuous f
theorem EReal.nhds_coe_coe {r : ℝ} {p : ℝ} :
nhds (↑r, ↑p) = Filter.map (fun p => (↑p.fst, ↑p.snd)) (nhds (r, p))

The set of finite EReal numbers is homeomorphic to ℝ.

Equations
Instances For

    ennreal coercion #

    theorem EReal.tendsto_coe_ennreal {α : Type u_2} {f : Filter α} {m : α → ENNReal} {a : ENNReal} :
    Filter.Tendsto (fun a => ↑(m a)) f (nhds ↑a) ↔ Filter.Tendsto m f (nhds a)
    theorem EReal.continuous_coe_ennreal_iff {α : Type u_1} [TopologicalSpace α] {f : α → ENNReal} :
    (Continuous fun a => ↑(f a)) ↔ Continuous f

    Neighborhoods of infinity #

    theorem EReal.nhds_top_basis :
    Filter.HasBasis (nhds ⊤) (fun x => True) fun x => Set.Ioi ↑x
    theorem EReal.tendsto_nhds_top_iff_real {α : Type u_2} {m : α → EReal} {f : Filter α} :
    Filter.Tendsto m f (nhds ⊤) ↔ ∀ (x : ℝ), ∀ᶠ (a : α) in f, ↑x < m a
    theorem EReal.nhds_bot_basis :
    Filter.HasBasis (nhds ⊥) (fun x => True) fun x => Set.Iio ↑x
    theorem EReal.tendsto_nhds_bot_iff_real {α : Type u_2} {m : α → EReal} {f : Filter α} :
    Filter.Tendsto m f (nhds ⊥) ↔ ∀ (x : ℝ), ∀ᶠ (a : α) in f, m a < ↑x

    Continuity of addition #

    theorem EReal.continuousAt_add_coe_coe (a : ℝ) (b : ℝ) :
    ContinuousAt (fun p => p.fst + p.snd) (↑a, ↑b)
    theorem EReal.continuousAt_add_top_coe (a : ℝ) :
    ContinuousAt (fun p => p.fst + p.snd) (⊤, ↑a)
    theorem EReal.continuousAt_add_coe_top (a : ℝ) :
    ContinuousAt (fun p => p.fst + p.snd) (↑a, ⊤)
    theorem EReal.continuousAt_add_top_top :
    ContinuousAt (fun p => p.fst + p.snd) (⊤, ⊤)
    theorem EReal.continuousAt_add_bot_coe (a : ℝ) :
    ContinuousAt (fun p => p.fst + p.snd) (⊥, ↑a)
    theorem EReal.continuousAt_add_coe_bot (a : ℝ) :
    ContinuousAt (fun p => p.fst + p.snd) (↑a, ⊥)
    theorem EReal.continuousAt_add_bot_bot :
    ContinuousAt (fun p => p.fst + p.snd) (⊥, ⊥)
    theorem EReal.continuousAt_add {p : EReal × EReal} (h : p.fst ≠ ⊤ ∨ p.snd ≠ ⊥) (h' : p.fst ≠ ⊥ ∨ p.snd ≠ ⊤) :
    ContinuousAt (fun p => p.fst + p.snd) p

    The addition on EReal is continuous except where it doesn't make sense (i.e., at (⊥, ⊤) and at (⊤, ⊥)).

    Negation #

    @[deprecated Homeomorph.neg]

    Negation on EReal as a homeomorphism

    Equations
    Instances For
      @[deprecated ContinuousNeg.continuous_neg]
      theorem EReal.continuous_neg :
      Continuous fun x => -x