Topological structure on EReal

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

Main results

• Real.toEReal : ℝ → EReal is an open embedding
• ENNReal.toEReal : ℝ≥0∞ → EReal is a closed embedding
• The addition on EReal is continuous except at (⊥, ⊤) and at (⊤, ⊥).
• Negation is a homeomorphism on EReal.

Implementation

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

instance EReal.instTopologicalSpace : TopologicalSpace EReal

Equations

• EReal.instTopologicalSpace = Preorder.topology EReal

instance EReal.instOrderTopology : OrderTopology EReal

instance EReal.instT5Space : T5Space EReal

instance EReal.instT2Space : T2Space EReal

theorem EReal.denseRange_ratCast : DenseRange fun (r : ℚ) => ↑↑r

instance EReal.instSecondCountableTopology : SecondCountableTopology EReal

Real coercion

theorem EReal.isEmbedding_coe : Topology.IsEmbedding Real.toEReal

@[deprecated EReal.isEmbedding_coe]

theorem EReal.embedding_coe : Topology.IsEmbedding Real.toEReal

Alias of EReal.isEmbedding_coe.

theorem EReal.isOpenEmbedding_coe : Topology.IsOpenEmbedding Real.toEReal

@[deprecated EReal.isOpenEmbedding_coe]

theorem EReal.openEmbedding_coe : Topology.IsOpenEmbedding Real.toEReal

Alias of EReal.isOpenEmbedding_coe.

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 continuous_coe_real_ereal : Continuous Real.toEReal

theorem EReal.continuous_coe_iff {α : Type u_1} [TopologicalSpace α] {f : α → ℝ} : (Continuous fun (a : α) => ↑(f a)) ↔ Continuous f

theorem EReal.nhds_coe {r : ℝ} : nhds ↑r = Filter.map Real.toEReal (nhds r)

theorem EReal.nhds_coe_coe {r p : ℝ} : nhds (↑r, ↑p) = Filter.map (fun (p : ℝ × ℝ) => (↑p.1, ↑p.2)) (nhds (r, p))

theorem EReal.tendsto_toReal {a : EReal} (ha : a ≠ ⊤) (h'a : a ≠ ⊥) : Filter.Tendsto EReal.toReal (nhds a) (nhds a.toReal)

theorem EReal.continuousOn_toReal : ContinuousOn EReal.toReal {⊥, ⊤}ᶜ

def EReal.neBotTopHomeomorphReal : ↑{⊥, ⊤}ᶜ ≃ₜ ℝ

The set of finite EReal numbers is homeomorphic to ℝ.

Equations

• EReal.neBotTopHomeomorphReal = { toEquiv := EReal.neTopBotEquivReal, continuous_toFun := EReal.neBotTopHomeomorphReal.proof_1, continuous_invFun := EReal.neBotTopHomeomorphReal.proof_2 }

ENNReal coercion

theorem EReal.isEmbedding_coe_ennreal : Topology.IsEmbedding ENNReal.toEReal

@[deprecated EReal.isEmbedding_coe_ennreal]

theorem EReal.embedding_coe_ennreal : Topology.IsEmbedding ENNReal.toEReal

Alias of EReal.isEmbedding_coe_ennreal.

theorem EReal.isClosedEmbedding_coe_ennreal : Topology.IsClosedEmbedding ENNReal.toEReal

@[deprecated EReal.isClosedEmbedding_coe_ennreal]

theorem EReal.closedEmbedding_coe_ennreal : Topology.IsClosedEmbedding ENNReal.toEReal

Alias of EReal.isClosedEmbedding_coe_ennreal.

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 continuous_coe_ennreal_ereal : Continuous ENNReal.toEReal

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 : nhds ⊤ = ⨅ (a : EReal), ⨅ (_ : a ≠ ⊤), Filter.principal (Set.Ioi a)

theorem EReal.nhds_top_basis : (nhds ⊤).HasBasis (fun (x : ℝ) => True) fun (x : ℝ) => Set.Ioi ↑x

theorem EReal.nhds_top' : nhds ⊤ = ⨅ (a : ℝ), Filter.principal (Set.Ioi ↑a)

theorem EReal.mem_nhds_top_iff {s : Set EReal} : s ∈ nhds ⊤ ↔ ∃ (y : ℝ), Set.Ioi ↑y ⊆ s

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 : nhds ⊥ = ⨅ (a : EReal), ⨅ (_ : a ≠ ⊥), Filter.principal (Set.Iio a)

theorem EReal.nhds_bot_basis : (nhds ⊥).HasBasis (fun (x : ℝ) => True) fun (x : ℝ) => Set.Iio ↑x

theorem EReal.nhds_bot' : nhds ⊥ = ⨅ (a : ℝ), Filter.principal (Set.Iio ↑a)

theorem EReal.mem_nhds_bot_iff {s : Set EReal} : s ∈ nhds ⊥ ↔ ∃ (y : ℝ), Set.Iio ↑y ⊆ s

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

theorem EReal.nhdsWithin_top : nhdsWithin ⊤ {⊤}ᶜ = Filter.map Real.toEReal Filter.atTop

theorem EReal.nhdsWithin_bot : nhdsWithin ⊥ {⊥}ᶜ = Filter.map Real.toEReal Filter.atBot

theorem EReal.tendsto_toReal_atTop : Filter.Tendsto EReal.toReal (nhdsWithin ⊤ {⊤}ᶜ) Filter.atTop

theorem EReal.tendsto_toReal_atBot : Filter.Tendsto EReal.toReal (nhdsWithin ⊥ {⊥}ᶜ) Filter.atBot

Infs and Sups

theorem EReal.add_iInf_le_iInf_add {α : Type u_2} {u v : α → EReal} : (⨅ (x : α), u x) + ⨅ (x : α), v x ≤ ⨅ (x : α), (u + v) x

theorem EReal.iSup_add_le_add_iSup {α : Type u_2} {u v : α → EReal} : ⨆ (x : α), (u + v) x ≤ (⨆ (x : α), u x) + ⨆ (x : α), v x

Liminfs and Limsups

theorem EReal.liminf_neg {α : Type u_3} {f : Filter α} {v : α → EReal} : Filter.liminf (-v) f = -Filter.limsup v f

theorem EReal.limsup_neg {α : Type u_3} {f : Filter α} {v : α → EReal} : Filter.limsup (-v) f = -Filter.liminf v f

theorem EReal.le_liminf_add {α : Type u_3} {f : Filter α} {u v : α → EReal} : Filter.liminf u f + Filter.liminf v f ≤ Filter.liminf (u + v) f

theorem EReal.limsup_add_le {α : Type u_3} {f : Filter α} {u v : α → EReal} (h : Filter.limsup u f ≠ ⊥ ∨ Filter.limsup v f ≠ ⊤) (h' : Filter.limsup u f ≠ ⊤ ∨ Filter.limsup v f ≠ ⊥) : Filter.limsup (u + v) f ≤ Filter.limsup u f + Filter.limsup v f

theorem EReal.le_limsup_add {α : Type u_3} {f : Filter α} {u v : α → EReal} : Filter.limsup u f + Filter.liminf v f ≤ Filter.limsup (u + v) f

theorem EReal.liminf_add_le {α : Type u_3} {f : Filter α} {u v : α → EReal} (h : Filter.limsup u f ≠ ⊥ ∨ Filter.liminf v f ≠ ⊤) (h' : Filter.limsup u f ≠ ⊤ ∨ Filter.liminf v f ≠ ⊥) : Filter.liminf (u + v) f ≤ Filter.limsup u f + Filter.liminf v f

@[deprecated EReal.le_liminf_add]

theorem EReal.add_liminf_le_liminf_add {α : Type u_3} {f : Filter α} {u v : α → EReal} : Filter.liminf u f + Filter.liminf v f ≤ Filter.liminf (u + v) f

Alias of EReal.le_liminf_add.

@[deprecated EReal.limsup_add_le]

theorem EReal.limsup_add_le_add_limsup {α : Type u_3} {f : Filter α} {u v : α → EReal} (h : Filter.limsup u f ≠ ⊥ ∨ Filter.limsup v f ≠ ⊤) (h' : Filter.limsup u f ≠ ⊤ ∨ Filter.limsup v f ≠ ⊥) : Filter.limsup (u + v) f ≤ Filter.limsup u f + Filter.limsup v f

Alias of EReal.limsup_add_le.

@[deprecated EReal.le_limsup_add]

theorem EReal.limsup_add_liminf_le_limsup_add {α : Type u_3} {f : Filter α} {u v : α → EReal} : Filter.limsup u f + Filter.liminf v f ≤ Filter.limsup (u + v) f

Alias of EReal.le_limsup_add.

@[deprecated EReal.liminf_add_le]

theorem EReal.liminf_add_le_limsup_add_liminf {α : Type u_3} {f : Filter α} {u v : α → EReal} (h : Filter.limsup u f ≠ ⊥ ∨ Filter.liminf v f ≠ ⊤) (h' : Filter.limsup u f ≠ ⊤ ∨ Filter.liminf v f ≠ ⊥) : Filter.liminf (u + v) f ≤ Filter.limsup u f + Filter.liminf v f

Alias of EReal.liminf_add_le.

theorem EReal.limsup_add_bot_of_ne_top {α : Type u_3} {f : Filter α} {u v : α → EReal} (h : Filter.limsup u f = ⊥) (h' : Filter.limsup v f ≠ ⊤) : Filter.limsup (u + v) f = ⊥

theorem EReal.limsup_add_le_of_le {α : Type u_3} {f : Filter α} {u v : α → EReal} {a b : EReal} (ha : Filter.limsup u f < a) (hb : Filter.limsup v f ≤ b) : Filter.limsup (u + v) f ≤ a + b

theorem EReal.liminf_add_gt_of_gt {α : Type u_3} {f : Filter α} {u v : α → EReal} {a b : EReal} (ha : a < Filter.liminf u f) (hb : b < Filter.liminf v f) : a + b < Filter.liminf (u + v) f

theorem EReal.liminf_add_top_of_ne_bot {α : Type u_3} {f : Filter α} {u v : α → EReal} (h : Filter.liminf u f = ⊤) (h' : Filter.liminf v f ≠ ⊥) : Filter.liminf (u + v) f = ⊤

Continuity of addition

theorem EReal.continuousAt_add_coe_coe (a b : ℝ) : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (↑a, ↑b)

theorem EReal.continuousAt_add_top_coe (a : ℝ) : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (⊤, ↑a)

theorem EReal.continuousAt_add_coe_top (a : ℝ) : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (↑a, ⊤)

theorem EReal.continuousAt_add_top_top : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (⊤, ⊤)

theorem EReal.continuousAt_add_bot_coe (a : ℝ) : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (⊥, ↑a)

theorem EReal.continuousAt_add_coe_bot (a : ℝ) : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (↑a, ⊥)

theorem EReal.continuousAt_add_bot_bot : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) (⊥, ⊥)

theorem EReal.continuousAt_add {p : EReal × EReal} (h : p.1 ≠ ⊤ ∨ p.2 ≠ ⊥) (h' : p.1 ≠ ⊥ ∨ p.2 ≠ ⊤) : ContinuousAt (fun (p : EReal × EReal) => p.1 + p.2) p

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

Negation

instance EReal.instContinuousNeg : ContinuousNeg EReal

Continuity of multiplication

theorem EReal.continuousAt_mul {p : EReal × EReal} (h₁ : p.1 ≠ 0 ∨ p.2 ≠ ⊥) (h₂ : p.1 ≠ 0 ∨ p.2 ≠ ⊤) (h₃ : p.1 ≠ ⊥ ∨ p.2 ≠ 0) (h₄ : p.1 ≠ ⊤ ∨ p.2 ≠ 0) : ContinuousAt (fun (p : EReal × EReal) => p.1 * p.2) p

The multiplication on EReal is continuous except at indeterminacies (i.e. whenever one value is zero and the other infinite).

theorem EReal.lowerSemicontinuous_add : LowerSemicontinuous fun (p : EReal × EReal) => p.1 + p.2