topology.metric_space.emetric_space

source

theorem uniformity_dist_of_mem_uniformity {α : Type u} {β : Type v} [linear_order β] {U : filter (α × α)} (z : β) (D : α → α → β) (H : ∀ (s : set (α × α)), s ∈ U ↔ ∃ (ε : β) (H : ε > z), ∀ {a b : α}, D a b < ε → (a, b) ∈ s) :

U = ⨅ (ε : β) (H : ε > z), filter.principal {p : α × α | D p.fst p.snd < ε}

Characterizing uniformities associated to a (generalized) distance function D in terms of the elements of the uniformity.

source

@[class]

structure has_edist (α : Type u_2) :

Type u_2

edist : α → α → ennreal

has_edist α means that α is equipped with an extended distance.

Instances of this typeclass

Instances of other typeclasses for has_edist

has_edist.has_sizeof_inst

source

noncomputable def uniform_space_of_edist {α : Type u} (edist : α → α → ennreal) (edist_self : ∀ (x : α), edist x x = 0) (edist_comm : ∀ (x y : α), edist x y = edist y x) (edist_triangle : ∀ (x y z : α), edist x z ≤ edist x y + edist y z) :

uniform_space α

Creating a uniform space from an extended distance.

Equations

uniform_space_of_edist edist edist_self edist_comm edist_triangle = uniform_space.of_fun edist edist_self edist_comm edist_triangle uniform_space_of_edist._proof_1

source

@[class]

structure pseudo_emetric_space (α : Type u) :

Type u

to_has_edist : has_edist α
edist_self : ∀ (x : α), has_edist.edist x x = 0
edist_comm : ∀ (x y : α), has_edist.edist x y = has_edist.edist y x
edist_triangle : ∀ (x y z : α), has_edist.edist x z ≤ has_edist.edist x y + has_edist.edist y z
to_uniform_space : uniform_space α
uniformity_edist : (uniformity α = ⨅ (ε : ennreal) (H : ε > 0), filter.principal {p : α × α | has_edist.edist p.fst p.snd < ε}) . "control_laws_tac"

Extended (pseudo) metric spaces, with an extended distance edist possibly taking the value ∞

Each pseudo_emetric space induces a canonical uniform_space and hence a canonical topological_space. This is enforced in the type class definition, by extending the uniform_space structure. When instantiating a pseudo_emetric_space structure, the uniformity fields are not necessary, they will be filled in by default. There is a default value for the uniformity, that can be substituted in cases of interest, for instance when instantiating a pseudo_emetric_space structure on a product.

Continuity of edist is proved in topology.instances.ennreal

Instances of this typeclass

Instances of other typeclasses for pseudo_emetric_space

pseudo_emetric_space.has_sizeof_inst

source

theorem edist_triangle_left {α : Type u} [pseudo_emetric_space α] (x y z : α) :

has_edist.edist x y ≤ has_edist.edist z x + has_edist.edist z y

Triangle inequality for the extended distance

source

theorem edist_triangle_right {α : Type u} [pseudo_emetric_space α] (x y z : α) :

has_edist.edist x y ≤ has_edist.edist x z + has_edist.edist y z

source

theorem edist_congr_right {α : Type u} [pseudo_emetric_space α] {x y z : α} (h : has_edist.edist x y = 0) :

has_edist.edist x z = has_edist.edist y z

source

theorem edist_congr_left {α : Type u} [pseudo_emetric_space α] {x y z : α} (h : has_edist.edist x y = 0) :

has_edist.edist z x = has_edist.edist z y

source

theorem edist_triangle4 {α : Type u} [pseudo_emetric_space α] (x y z t : α) :

has_edist.edist x t ≤ has_edist.edist x y + has_edist.edist y z + has_edist.edist z t

source

theorem edist_le_Ico_sum_edist {α : Type u} [pseudo_emetric_space α] (f : ℕ → α) {m n : ℕ} (h : m ≤ n) :

has_edist.edist (f m) (f n) ≤ (finset.Ico m n).sum (λ (i : ℕ), has_edist.edist (f i) (f (i + 1)))

The triangle (polygon) inequality for sequences of points; finset.Ico version.

source

theorem edist_le_range_sum_edist {α : Type u} [pseudo_emetric_space α] (f : ℕ → α) (n : ℕ) :

has_edist.edist (f 0) (f n) ≤ (finset.range n).sum (λ (i : ℕ), has_edist.edist (f i) (f (i + 1)))

The triangle (polygon) inequality for sequences of points; finset.range version.

source

theorem edist_le_Ico_sum_of_edist_le {α : Type u} [pseudo_emetric_space α] {f : ℕ → α} {m n : ℕ} (hmn : m ≤ n) {d : ℕ → ennreal} (hd : ∀ {k : ℕ}, m ≤ k → k < n → has_edist.edist (f k) (f (k + 1)) ≤ d k) :

has_edist.edist (f m) (f n) ≤ (finset.Ico m n).sum (λ (i : ℕ), d i)

A version of edist_le_Ico_sum_edist with each intermediate distance replaced with an upper estimate.

source

theorem edist_le_range_sum_of_edist_le {α : Type u} [pseudo_emetric_space α] {f : ℕ → α} (n : ℕ) {d : ℕ → ennreal} (hd : ∀ {k : ℕ}, k < n → has_edist.edist (f k) (f (k + 1)) ≤ d k) :

has_edist.edist (f 0) (f n) ≤ (finset.range n).sum (λ (i : ℕ), d i)

A version of edist_le_range_sum_edist with each intermediate distance replaced with an upper estimate.

source

theorem uniformity_pseudoedist {α : Type u} [pseudo_emetric_space α] :

uniformity α = ⨅ (ε : ennreal) (H : ε > 0), filter.principal {p : α × α | has_edist.edist p.fst p.snd < ε}

Reformulation of the uniform structure in terms of the extended distance

source

theorem uniform_space_edist {α : Type u} [pseudo_emetric_space α] :

pseudo_emetric_space.to_uniform_space = uniform_space_of_edist has_edist.edist pseudo_emetric_space.edist_self pseudo_emetric_space.edist_comm pseudo_emetric_space.edist_triangle

source

theorem uniformity_basis_edist {α : Type u} [pseudo_emetric_space α] :

(uniformity α).has_basis (λ (ε : ennreal), 0 < ε) (λ (ε : ennreal), {p : α × α | has_edist.edist p.fst p.snd < ε})

source

theorem mem_uniformity_edist {α : Type u} [pseudo_emetric_space α] {s : set (α × α)} :

s ∈ uniformity α ↔ ∃ (ε : ennreal) (H : ε > 0), ∀ {a b : α}, has_edist.edist a b < ε → (a, b) ∈ s

Characterization of the elements of the uniformity in terms of the extended distance

source

@[protected]

theorem emetric.mk_uniformity_basis {α : Type u} [pseudo_emetric_space α] {β : Type u_1} {p : β → Prop} {f : β → ennreal} (hf₀ : ∀ (x : β), p x → 0 < f x) (hf : ∀ (ε : ennreal), 0 < ε → (∃ (x : β) (hx : p x), f x ≤ ε)) :

(uniformity α).has_basis p (λ (x : β), {p : α × α | has_edist.edist p.fst p.snd < f x})

Given f : β → ℝ≥0∞, if f sends {i | p i} to a set of positive numbers accumulating to zero, then f i-neighborhoods of the diagonal form a basis of 𝓤 α.

For specific bases see uniformity_basis_edist, uniformity_basis_edist', uniformity_basis_edist_nnreal, and uniformity_basis_edist_inv_nat.

source

@[protected]

theorem emetric.mk_uniformity_basis_le {α : Type u} [pseudo_emetric_space α] {β : Type u_1} {p : β → Prop} {f : β → ennreal} (hf₀ : ∀ (x : β), p x → 0 < f x) (hf : ∀ (ε : ennreal), 0 < ε → (∃ (x : β) (hx : p x), f x ≤ ε)) :

(uniformity α).has_basis p (λ (x : β), {p : α × α | has_edist.edist p.fst p.snd ≤ f x})

Given f : β → ℝ≥0∞, if f sends {i | p i} to a set of positive numbers accumulating to zero, then closed f i-neighborhoods of the diagonal form a basis of 𝓤 α.

For specific bases see uniformity_basis_edist_le and uniformity_basis_edist_le'.

source

theorem uniformity_basis_edist_le {α : Type u} [pseudo_emetric_space α] :

(uniformity α).has_basis (λ (ε : ennreal), 0 < ε) (λ (ε : ennreal), {p : α × α | has_edist.edist p.fst p.snd ≤ ε})

source

theorem uniformity_basis_edist' {α : Type u} [pseudo_emetric_space α] (ε' : ennreal) (hε' : 0 < ε') :

(uniformity α).has_basis (λ (ε : ennreal), ε ∈ set.Ioo 0 ε') (λ (ε : ennreal), {p : α × α | has_edist.edist p.fst p.snd < ε})

source

theorem uniformity_basis_edist_le' {α : Type u} [pseudo_emetric_space α] (ε' : ennreal) (hε' : 0 < ε') :

(uniformity α).has_basis (λ (ε : ennreal), ε ∈ set.Ioo 0 ε') (λ (ε : ennreal), {p : α × α | has_edist.edist p.fst p.snd ≤ ε})

source

theorem uniformity_basis_edist_nnreal {α : Type u} [pseudo_emetric_space α] :

(uniformity α).has_basis (λ (ε : nnreal), 0 < ε) (λ (ε : nnreal), {p : α × α | has_edist.edist p.fst p.snd < ↑ε})

source

theorem uniformity_basis_edist_nnreal_le {α : Type u} [pseudo_emetric_space α] :

(uniformity α).has_basis (λ (ε : nnreal), 0 < ε) (λ (ε : nnreal), {p : α × α | has_edist.edist p.fst p.snd ≤ ↑ε})

source

theorem uniformity_basis_edist_inv_nat {α : Type u} [pseudo_emetric_space α] :

(uniformity α).has_basis (λ (_x : ℕ), true) (λ (n : ℕ), {p : α × α | has_edist.edist p.fst p.snd < (↑n)⁻¹})

source

theorem uniformity_basis_edist_inv_two_pow {α : Type u} [pseudo_emetric_space α] :

(uniformity α).has_basis (λ (_x : ℕ), true) (λ (n : ℕ), {p : α × α | has_edist.edist p.fst p.snd < 2⁻¹ ^ n})

source

theorem edist_mem_uniformity {α : Type u} [pseudo_emetric_space α] {ε : ennreal} (ε0 : 0 < ε) :

{p : α × α | has_edist.edist p.fst p.snd < ε} ∈ uniformity α

Fixed size neighborhoods of the diagonal belong to the uniform structure

source

@[protected, instance]

def emetric.uniformity.filter.is_countably_generated {α : Type u} [pseudo_emetric_space α] :

(uniformity α).is_countably_generated

source

theorem emetric.uniform_continuous_on_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] {f : α → β} {s : set α} :

uniform_continuous_on f s ↔ ∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ {a : α} {H : a ∈ s} {b : α} {H : b ∈ s}, has_edist.edist a b < δ → has_edist.edist (f a) (f b) < ε)

ε-δ characterization of uniform continuity on a set for pseudoemetric spaces

source

theorem emetric.uniform_continuous_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] {f : α → β} :

uniform_continuous f ↔ ∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ {a b : α}, has_edist.edist a b < δ → has_edist.edist (f a) (f b) < ε)

ε-δ characterization of uniform continuity on pseudoemetric spaces

source

theorem emetric.uniform_embedding_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] {f : α → β} :

uniform_embedding f ↔ function.injective f ∧ uniform_continuous f ∧ ∀ (δ : ennreal), δ > 0 → (∃ (ε : ennreal) (H : ε > 0), ∀ {a b : α}, has_edist.edist (f a) (f b) < ε → has_edist.edist a b < δ)

ε-δ characterization of uniform embeddings on pseudoemetric spaces

source

theorem emetric.controlled_of_uniform_embedding {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] {f : α → β} :

uniform_embedding f → ((∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ {a b : α}, has_edist.edist a b < δ → has_edist.edist (f a) (f b) < ε)) ∧ ∀ (δ : ennreal), δ > 0 → (∃ (ε : ennreal) (H : ε > 0), ∀ {a b : α}, has_edist.edist (f a) (f b) < ε → has_edist.edist a b < δ))

If a map between pseudoemetric spaces is a uniform embedding then the edistance between f x and f y is controlled in terms of the distance between x and y.

source

@[protected]

theorem emetric.cauchy_iff {α : Type u} [pseudo_emetric_space α] {f : filter α} :

cauchy f ↔ f ≠ ⊥ ∧ ∀ (ε : ennreal), ε > 0 → (∃ (t : set α) (H : t ∈ f), ∀ (x : α), x ∈ t → ∀ (y : α), y ∈ t → has_edist.edist x y < ε)

ε-δ characterization of Cauchy sequences on pseudoemetric spaces

source

theorem emetric.complete_of_convergent_controlled_sequences {α : Type u} [pseudo_emetric_space α] (B : ℕ → ennreal) (hB : ∀ (n : ℕ), 0 < B n) (H : ∀ (u : ℕ → α), (∀ (N n m : ℕ), N ≤ n → N ≤ m → has_edist.edist (u n) (u m) < B N) → (∃ (x : α), filter.tendsto u filter.at_top (nhds x))) :

complete_space α

A very useful criterion to show that a space is complete is to show that all sequences which satisfy a bound of the form edist (u n) (u m) < B N for all n m ≥ N are converging. This is often applied for B N = 2^{-N}, i.e., with a very fast convergence to 0, which makes it possible to use arguments of converging series, while this is impossible to do in general for arbitrary Cauchy sequences.

source

theorem emetric.complete_of_cauchy_seq_tendsto {α : Type u} [pseudo_emetric_space α] :

(∀ (u : ℕ → α), cauchy_seq u → (∃ (a : α), filter.tendsto u filter.at_top (nhds a))) → complete_space α

A sequentially complete pseudoemetric space is complete.

source

theorem emetric.tendsto_locally_uniformly_on_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] {ι : Type u_1} [topological_space β] {F : ι → β → α} {f : β → α} {p : filter ι} {s : set β} :

tendsto_locally_uniformly_on F f p s ↔ ∀ (ε : ennreal), ε > 0 → ∀ (x : β), x ∈ s → (∃ (t : set β) (H : t ∈ nhds_within x s), ∀ᶠ (n : ι) in p, ∀ (y : β), y ∈ t → has_edist.edist (f y) (F n y) < ε)

Expressing locally uniform convergence on a set using edist.

source

theorem emetric.tendsto_uniformly_on_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] {ι : Type u_1} {F : ι → β → α} {f : β → α} {p : filter ι} {s : set β} :

tendsto_uniformly_on F f p s ↔ ∀ (ε : ennreal), ε > 0 → (∀ᶠ (n : ι) in p, ∀ (x : β), x ∈ s → has_edist.edist (f x) (F n x) < ε)

Expressing uniform convergence on a set using edist.

source

theorem emetric.tendsto_locally_uniformly_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] {ι : Type u_1} [topological_space β] {F : ι → β → α} {f : β → α} {p : filter ι} :

tendsto_locally_uniformly F f p ↔ ∀ (ε : ennreal), ε > 0 → ∀ (x : β), ∃ (t : set β) (H : t ∈ nhds x), ∀ᶠ (n : ι) in p, ∀ (y : β), y ∈ t → has_edist.edist (f y) (F n y) < ε

Expressing locally uniform convergence using edist.

source

theorem emetric.tendsto_uniformly_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] {ι : Type u_1} {F : ι → β → α} {f : β → α} {p : filter ι} :

tendsto_uniformly F f p ↔ ∀ (ε : ennreal), ε > 0 → (∀ᶠ (n : ι) in p, ∀ (x : β), has_edist.edist (f x) (F n x) < ε)

Expressing uniform convergence using edist.

source

def pseudo_emetric_space.replace_uniformity {α : Type u_1} [U : uniform_space α] (m : pseudo_emetric_space α) (H : uniformity α = uniformity α) :

pseudo_emetric_space α

Auxiliary function to replace the uniformity on a pseudoemetric space with a uniformity which is equal to the original one, but maybe not defeq. This is useful if one wants to construct a pseudoemetric space with a specified uniformity. See Note [forgetful inheritance] explaining why having definitionally the right uniformity is often important.

Equations

m.replace_uniformity H = {to_has_edist := {edist := has_edist.edist pseudo_emetric_space.to_has_edist}, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := U, uniformity_edist := _}

source

def pseudo_emetric_space.induced {α : Type u_1} {β : Type u_2} (f : α → β) (m : pseudo_emetric_space β) :

pseudo_emetric_space α

The extended pseudometric induced by a function taking values in a pseudoemetric space.

Equations

pseudo_emetric_space.induced f m = {to_has_edist := {edist := λ (x y : α), has_edist.edist (f x) (f y)}, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := uniform_space.comap f pseudo_emetric_space.to_uniform_space, uniformity_edist := _}

source

@[protected, instance]

def subtype.pseudo_emetric_space {α : Type u_1} {p : α → Prop} [pseudo_emetric_space α] :

pseudo_emetric_space (subtype p)

Pseudoemetric space instance on subsets of pseudoemetric spaces

Equations

subtype.pseudo_emetric_space = pseudo_emetric_space.induced coe _inst_2

source

theorem subtype.edist_eq {α : Type u} [pseudo_emetric_space α] {p : α → Prop} (x y : subtype p) :

has_edist.edist x y = has_edist.edist ↑x ↑y

The extended psuedodistance on a subset of a pseudoemetric space is the restriction of the original pseudodistance, by definition

source

@[protected, instance]

def add_opposite.pseudo_emetric_space {α : Type u_1} [pseudo_emetric_space α] :

pseudo_emetric_space αᵃᵒᵖ

Pseudoemetric space instance on the additive opposite of a pseudoemetric space.

Equations

add_opposite.pseudo_emetric_space = pseudo_emetric_space.induced add_opposite.unop _inst_2

source

@[protected, instance]

def mul_opposite.pseudo_emetric_space {α : Type u_1} [pseudo_emetric_space α] :

pseudo_emetric_space αᵐᵒᵖ

Pseudoemetric space instance on the multiplicative opposite of a pseudoemetric space.

Equations

mul_opposite.pseudo_emetric_space = pseudo_emetric_space.induced mul_opposite.unop _inst_2

source

theorem mul_opposite.edist_unop {α : Type u} [pseudo_emetric_space α] (x y : αᵐᵒᵖ) :

has_edist.edist (mul_opposite.unop x) (mul_opposite.unop y) = has_edist.edist x y

source

theorem add_opposite.edist_unop {α : Type u} [pseudo_emetric_space α] (x y : αᵃᵒᵖ) :

has_edist.edist (add_opposite.unop x) (add_opposite.unop y) = has_edist.edist x y

source

theorem add_opposite.edist_op {α : Type u} [pseudo_emetric_space α] (x y : α) :

has_edist.edist (add_opposite.op x) (add_opposite.op y) = has_edist.edist x y

source

theorem mul_opposite.edist_op {α : Type u} [pseudo_emetric_space α] (x y : α) :

has_edist.edist (mul_opposite.op x) (mul_opposite.op y) = has_edist.edist x y

source

@[protected, instance]

def ulift.pseudo_emetric_space {α : Type u} [pseudo_emetric_space α] :

pseudo_emetric_space (ulift α)

Equations

ulift.pseudo_emetric_space = pseudo_emetric_space.induced ulift.down _inst_1

source

theorem ulift.edist_eq {α : Type u} [pseudo_emetric_space α] (x y : ulift α) :

has_edist.edist x y = has_edist.edist x.down y.down

source

@[simp]

theorem ulift.edist_up_up {α : Type u} [pseudo_emetric_space α] (x y : α) :

has_edist.edist {down := x} {down := y} = has_edist.edist x y

source

@[protected, instance]

def prod.pseudo_emetric_space_max {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] :

pseudo_emetric_space (α × β)

The product of two pseudoemetric spaces, with the max distance, is an extended pseudometric spaces. We make sure that the uniform structure thus constructed is the one corresponding to the product of uniform spaces, to avoid diamond problems.

Equations

prod.pseudo_emetric_space_max = {to_has_edist := {edist := λ (x y : α × β), has_edist.edist x.fst y.fst ⊔ has_edist.edist x.snd y.snd}, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := prod.uniform_space pseudo_emetric_space.to_uniform_space, uniformity_edist := _}

source

theorem prod.edist_eq {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] (x y : α × β) :

has_edist.edist x y = linear_order.max (has_edist.edist x.fst y.fst) (has_edist.edist x.snd y.snd)

source

@[protected, instance]

def pseudo_emetric_space_pi {β : Type v} {π : β → Type u_2} [fintype β] [Π (b : β), pseudo_emetric_space (π b)] :

pseudo_emetric_space (Π (b : β), π b)

The product of a finite number of pseudoemetric spaces, with the max distance, is still a pseudoemetric space. This construction would also work for infinite products, but it would not give rise to the product topology. Hence, we only formalize it in the good situation of finitely many spaces.

Equations

pseudo_emetric_space_pi = {to_has_edist := {edist := λ (f g : Π (b : β), π b), finset.univ.sup (λ (b : β), has_edist.edist (f b) (g b))}, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := Pi.uniform_space (λ (b : β), π b) (λ (i : β), pseudo_emetric_space.to_uniform_space), uniformity_edist := _}

source

theorem edist_pi_def {β : Type v} {π : β → Type u_2} [fintype β] [Π (b : β), pseudo_emetric_space (π b)] (f g : Π (b : β), π b) :

has_edist.edist f g = finset.univ.sup (λ (b : β), has_edist.edist (f b) (g b))

source

theorem edist_le_pi_edist {β : Type v} {π : β → Type u_2} [fintype β] [Π (b : β), pseudo_emetric_space (π b)] (f g : Π (b : β), π b) (b : β) :

has_edist.edist (f b) (g b) ≤ has_edist.edist f g

source

theorem edist_pi_le_iff {β : Type v} {π : β → Type u_2} [fintype β] [Π (b : β), pseudo_emetric_space (π b)] {f g : Π (b : β), π b} {d : ennreal} :

has_edist.edist f g ≤ d ↔ ∀ (b : β), has_edist.edist (f b) (g b) ≤ d

source

theorem edist_pi_const_le {α : Type u} {β : Type v} [pseudo_emetric_space α] [fintype β] (a b : α) :

has_edist.edist (λ (_x : β), a) (λ (_x : β), b) ≤ has_edist.edist a b

source

@[simp]

theorem edist_pi_const {α : Type u} {β : Type v} [pseudo_emetric_space α] [fintype β] [nonempty β] (a b : α) :

has_edist.edist (λ (x : β), a) (λ (_x : β), b) = has_edist.edist a b

source

def emetric.ball {α : Type u} [pseudo_emetric_space α] (x : α) (ε : ennreal) :

set α

emetric.ball x ε is the set of all points y with edist y x < ε

Equations

emetric.ball x ε = {y : α | has_edist.edist y x < ε}

source

@[simp]

theorem emetric.mem_ball {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} :

y ∈ emetric.ball x ε ↔ has_edist.edist y x < ε

source

theorem emetric.mem_ball' {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} :

y ∈ emetric.ball x ε ↔ has_edist.edist x y < ε

source

def emetric.closed_ball {α : Type u} [pseudo_emetric_space α] (x : α) (ε : ennreal) :

set α

emetric.closed_ball x ε is the set of all points y with edist y x ≤ ε

Equations

emetric.closed_ball x ε = {y : α | has_edist.edist y x ≤ ε}

source

@[simp]

theorem emetric.mem_closed_ball {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} :

y ∈ emetric.closed_ball x ε ↔ has_edist.edist y x ≤ ε

source

theorem emetric.mem_closed_ball' {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} :

y ∈ emetric.closed_ball x ε ↔ has_edist.edist x y ≤ ε

source

@[simp]

theorem emetric.closed_ball_top {α : Type u} [pseudo_emetric_space α] (x : α) :

emetric.closed_ball x ⊤ = set.univ

source

theorem emetric.ball_subset_closed_ball {α : Type u} [pseudo_emetric_space α] {x : α} {ε : ennreal} :

emetric.ball x ε ⊆ emetric.closed_ball x ε

source

theorem emetric.pos_of_mem_ball {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} (hy : y ∈ emetric.ball x ε) :

0 < ε

source

theorem emetric.mem_ball_self {α : Type u} [pseudo_emetric_space α] {x : α} {ε : ennreal} (h : 0 < ε) :

x ∈ emetric.ball x ε

source

theorem emetric.mem_closed_ball_self {α : Type u} [pseudo_emetric_space α] {x : α} {ε : ennreal} :

x ∈ emetric.closed_ball x ε

source

theorem emetric.mem_ball_comm {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} :

x ∈ emetric.ball y ε ↔ y ∈ emetric.ball x ε

source

theorem emetric.mem_closed_ball_comm {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} :

x ∈ emetric.closed_ball y ε ↔ y ∈ emetric.closed_ball x ε

source

theorem emetric.ball_subset_ball {α : Type u} [pseudo_emetric_space α] {x : α} {ε₁ ε₂ : ennreal} (h : ε₁ ≤ ε₂) :

emetric.ball x ε₁ ⊆ emetric.ball x ε₂

source

theorem emetric.closed_ball_subset_closed_ball {α : Type u} [pseudo_emetric_space α] {x : α} {ε₁ ε₂ : ennreal} (h : ε₁ ≤ ε₂) :

emetric.closed_ball x ε₁ ⊆ emetric.closed_ball x ε₂

source

theorem emetric.ball_disjoint {α : Type u} [pseudo_emetric_space α] {x y : α} {ε₁ ε₂ : ennreal} (h : ε₁ + ε₂ ≤ has_edist.edist x y) :

disjoint (emetric.ball x ε₁) (emetric.ball y ε₂)

source

theorem emetric.ball_subset {α : Type u} [pseudo_emetric_space α] {x y : α} {ε₁ ε₂ : ennreal} (h : has_edist.edist x y + ε₁ ≤ ε₂) (h' : has_edist.edist x y ≠ ⊤) :

emetric.ball x ε₁ ⊆ emetric.ball y ε₂

source

theorem emetric.exists_ball_subset_ball {α : Type u} [pseudo_emetric_space α] {x y : α} {ε : ennreal} (h : y ∈ emetric.ball x ε) :

∃ (ε' : ennreal) (H : ε' > 0), emetric.ball y ε' ⊆ emetric.ball x ε

source

theorem emetric.ball_eq_empty_iff {α : Type u} [pseudo_emetric_space α] {x : α} {ε : ennreal} :

emetric.ball x ε = ∅ ↔ ε = 0

source

theorem emetric.ord_connected_set_of_closed_ball_subset {α : Type u} [pseudo_emetric_space α] (x : α) (s : set α) :

{r : ennreal | emetric.closed_ball x r ⊆ s}.ord_connected

source

theorem emetric.ord_connected_set_of_ball_subset {α : Type u} [pseudo_emetric_space α] (x : α) (s : set α) :

{r : ennreal | emetric.ball x r ⊆ s}.ord_connected

source

def emetric.edist_lt_top_setoid {α : Type u} [pseudo_emetric_space α] :

setoid α

Relation “two points are at a finite edistance” is an equivalence relation.

Equations

emetric.edist_lt_top_setoid = {r := λ (x y : α), has_edist.edist x y < ⊤, iseqv := _}

source

@[simp]

theorem emetric.ball_zero {α : Type u} [pseudo_emetric_space α] {x : α} :

emetric.ball x 0 = ∅

source

theorem emetric.nhds_basis_eball {α : Type u} [pseudo_emetric_space α] {x : α} :

(nhds x).has_basis (λ (ε : ennreal), 0 < ε) (emetric.ball x)

source

theorem emetric.nhds_within_basis_eball {α : Type u} [pseudo_emetric_space α] {x : α} {s : set α} :

(nhds_within x s).has_basis (λ (ε : ennreal), 0 < ε) (λ (ε : ennreal), emetric.ball x ε ∩ s)

source

theorem emetric.nhds_basis_closed_eball {α : Type u} [pseudo_emetric_space α] {x : α} :

(nhds x).has_basis (λ (ε : ennreal), 0 < ε) (emetric.closed_ball x)

source

theorem emetric.nhds_within_basis_closed_eball {α : Type u} [pseudo_emetric_space α] {x : α} {s : set α} :

(nhds_within x s).has_basis (λ (ε : ennreal), 0 < ε) (λ (ε : ennreal), emetric.closed_ball x ε ∩ s)

source

theorem emetric.nhds_eq {α : Type u} [pseudo_emetric_space α] {x : α} :

nhds x = ⨅ (ε : ennreal) (H : ε > 0), filter.principal (emetric.ball x ε)

source

theorem emetric.mem_nhds_iff {α : Type u} [pseudo_emetric_space α] {x : α} {s : set α} :

s ∈ nhds x ↔ ∃ (ε : ennreal) (H : ε > 0), emetric.ball x ε ⊆ s

source

theorem emetric.mem_nhds_within_iff {α : Type u} [pseudo_emetric_space α] {x : α} {s t : set α} :

s ∈ nhds_within x t ↔ ∃ (ε : ennreal) (H : ε > 0), emetric.ball x ε ∩ t ⊆ s

source

theorem emetric.tendsto_nhds_within_nhds_within {α : Type u} {β : Type v} [pseudo_emetric_space α] {s : set α} [pseudo_emetric_space β] {f : α → β} {t : set β} {a : α} {b : β} :

filter.tendsto f (nhds_within a s) (nhds_within b t) ↔ ∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ ⦃x : α⦄, x ∈ s → has_edist.edist x a < δ → f x ∈ t ∧ has_edist.edist (f x) b < ε)

source

theorem emetric.tendsto_nhds_within_nhds {α : Type u} {β : Type v} [pseudo_emetric_space α] {s : set α} [pseudo_emetric_space β] {f : α → β} {a : α} {b : β} :

filter.tendsto f (nhds_within a s) (nhds b) ↔ ∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ {x : α}, x ∈ s → has_edist.edist x a < δ → has_edist.edist (f x) b < ε)

source

theorem emetric.tendsto_nhds_nhds {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] {f : α → β} {a : α} {b : β} :

filter.tendsto f (nhds a) (nhds b) ↔ ∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ ⦃x : α⦄, has_edist.edist x a < δ → has_edist.edist (f x) b < ε)

source

theorem emetric.is_open_iff {α : Type u} [pseudo_emetric_space α] {s : set α} :

is_open s ↔ ∀ (x : α), x ∈ s → (∃ (ε : ennreal) (H : ε > 0), emetric.ball x ε ⊆ s)

source

theorem emetric.is_open_ball {α : Type u} [pseudo_emetric_space α] {x : α} {ε : ennreal} :

is_open (emetric.ball x ε)

source

theorem emetric.is_closed_ball_top {α : Type u} [pseudo_emetric_space α] {x : α} :

is_closed (emetric.ball x ⊤)

source

theorem emetric.ball_mem_nhds {α : Type u} [pseudo_emetric_space α] (x : α) {ε : ennreal} (ε0 : 0 < ε) :

emetric.ball x ε ∈ nhds x

source

theorem emetric.closed_ball_mem_nhds {α : Type u} [pseudo_emetric_space α] (x : α) {ε : ennreal} (ε0 : 0 < ε) :

emetric.closed_ball x ε ∈ nhds x

source

theorem emetric.ball_prod_same {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] (x : α) (y : β) (r : ennreal) :

emetric.ball x r ×ˢ emetric.ball y r = emetric.ball (x, y) r

source

theorem emetric.closed_ball_prod_same {α : Type u} {β : Type v} [pseudo_emetric_space α] [pseudo_emetric_space β] (x : α) (y : β) (r : ennreal) :

emetric.closed_ball x r ×ˢ emetric.closed_ball y r = emetric.closed_ball (x, y) r

source

theorem emetric.mem_closure_iff {α : Type u} [pseudo_emetric_space α] {x : α} {s : set α} :

x ∈ closure s ↔ ∀ (ε : ennreal), ε > 0 → (∃ (y : α) (H : y ∈ s), has_edist.edist x y < ε)

ε-characterization of the closure in pseudoemetric spaces

source

theorem emetric.tendsto_nhds {α : Type u} {β : Type v} [pseudo_emetric_space α] {f : filter β} {u : β → α} {a : α} :

filter.tendsto u f (nhds a) ↔ ∀ (ε : ennreal), ε > 0 → (∀ᶠ (x : β) in f, has_edist.edist (u x) a < ε)

source

theorem emetric.tendsto_at_top {α : Type u} {β : Type v} [pseudo_emetric_space α] [nonempty β] [semilattice_sup β] {u : β → α} {a : α} :

filter.tendsto u filter.at_top (nhds a) ↔ ∀ (ε : ennreal), ε > 0 → (∃ (N : β), ∀ (n : β), n ≥ N → has_edist.edist (u n) a < ε)

source

theorem emetric.inseparable_iff {α : Type u} [pseudo_emetric_space α] {x y : α} :

inseparable x y ↔ has_edist.edist x y = 0

source

@[nolint]

theorem emetric.cauchy_seq_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] [nonempty β] [semilattice_sup β] {u : β → α} :

cauchy_seq u ↔ ∀ (ε : ennreal), ε > 0 → (∃ (N : β), ∀ (m : β), m ≥ N → ∀ (n : β), n ≥ N → has_edist.edist (u m) (u n) < ε)

In a pseudoemetric space, Cauchy sequences are characterized by the fact that, eventually, the pseudoedistance between its elements is arbitrarily small

source

theorem emetric.cauchy_seq_iff' {α : Type u} {β : Type v} [pseudo_emetric_space α] [nonempty β] [semilattice_sup β] {u : β → α} :

cauchy_seq u ↔ ∀ (ε : ennreal), ε > 0 → (∃ (N : β), ∀ (n : β), n ≥ N → has_edist.edist (u n) (u N) < ε)

A variation around the emetric characterization of Cauchy sequences

source

theorem emetric.cauchy_seq_iff_nnreal {α : Type u} {β : Type v} [pseudo_emetric_space α] [nonempty β] [semilattice_sup β] {u : β → α} :

cauchy_seq u ↔ ∀ (ε : nnreal), 0 < ε → (∃ (N : β), ∀ (n : β), N ≤ n → has_edist.edist (u n) (u N) < ↑ε)

A variation of the emetric characterization of Cauchy sequences that deals with ℝ≥0 upper bounds.

source

theorem emetric.totally_bounded_iff {α : Type u} [pseudo_emetric_space α] {s : set α} :

totally_bounded s ↔ ∀ (ε : ennreal), ε > 0 → (∃ (t : set α), t.finite ∧ s ⊆ ⋃ (y : α) (H : y ∈ t), emetric.ball y ε)

source

theorem emetric.totally_bounded_iff' {α : Type u} [pseudo_emetric_space α] {s : set α} :

totally_bounded s ↔ ∀ (ε : ennreal), ε > 0 → (∃ (t : set α) (H : t ⊆ s), t.finite ∧ s ⊆ ⋃ (y : α) (H : y ∈ t), emetric.ball y ε)

source

theorem emetric.subset_countable_closure_of_almost_dense_set {α : Type u} [pseudo_emetric_space α] (s : set α) (hs : ∀ (ε : ennreal), ε > 0 → (∃ (t : set α), t.countable ∧ s ⊆ ⋃ (x : α) (H : x ∈ t), emetric.closed_ball x ε)) :

∃ (t : set α) (H : t ⊆ s), t.countable ∧ s ⊆ closure t

For a set s in a pseudo emetric space, if for every ε > 0 there exists a countable set that is ε-dense in s, then there exists a countable subset t ⊆ s that is dense in s.

source

theorem emetric.subset_countable_closure_of_compact {α : Type u} [pseudo_emetric_space α] {s : set α} (hs : is_compact s) :

∃ (t : set α) (H : t ⊆ s), t.countable ∧ s ⊆ closure t

A compact set in a pseudo emetric space is separable, i.e., it is a subset of the closure of a countable set.

source

theorem emetric.second_countable_of_sigma_compact (α : Type u) [pseudo_emetric_space α] [sigma_compact_space α] :

topological_space.second_countable_topology α

A sigma compact pseudo emetric space has second countable topology. This is not an instance to avoid a loop with sigma_compact_space_of_locally_compact_second_countable.

source

theorem emetric.second_countable_of_almost_dense_set {α : Type u} [pseudo_emetric_space α] (hs : ∀ (ε : ennreal), ε > 0 → (∃ (t : set α), t.countable ∧ (⋃ (x : α) (H : x ∈ t), emetric.closed_ball x ε) = set.univ)) :

topological_space.second_countable_topology α

source

noncomputable def emetric.diam {α : Type u} [pseudo_emetric_space α] (s : set α) :

ennreal

The diameter of a set in a pseudoemetric space, named emetric.diam

Equations

emetric.diam s = ⨆ (x : α) (H : x ∈ s) (y : α) (H : y ∈ s), has_edist.edist x y

source

theorem emetric.diam_le_iff {α : Type u} [pseudo_emetric_space α] {s : set α} {d : ennreal} :

emetric.diam s ≤ d ↔ ∀ (x : α), x ∈ s → ∀ (y : α), y ∈ s → has_edist.edist x y ≤ d

source

theorem emetric.diam_image_le_iff {α : Type u} {β : Type v} [pseudo_emetric_space α] {d : ennreal} {f : β → α} {s : set β} :

emetric.diam (f '' s) ≤ d ↔ ∀ (x : β), x ∈ s → ∀ (y : β), y ∈ s → has_edist.edist (f x) (f y) ≤ d

source

theorem emetric.edist_le_of_diam_le {α : Type u} [pseudo_emetric_space α] {x y : α} {s : set α} {d : ennreal} (hx : x ∈ s) (hy : y ∈ s) (hd : emetric.diam s ≤ d) :

has_edist.edist x y ≤ d

source

theorem emetric.edist_le_diam_of_mem {α : Type u} [pseudo_emetric_space α] {x y : α} {s : set α} (hx : x ∈ s) (hy : y ∈ s) :

has_edist.edist x y ≤ emetric.diam s

If two points belong to some set, their edistance is bounded by the diameter of the set

source

theorem emetric.diam_le {α : Type u} [pseudo_emetric_space α] {s : set α} {d : ennreal} (h : ∀ (x : α), x ∈ s → ∀ (y : α), y ∈ s → has_edist.edist x y ≤ d) :

emetric.diam s ≤ d

If the distance between any two points in a set is bounded by some constant, this constant bounds the diameter.

source

theorem emetric.diam_subsingleton {α : Type u} [pseudo_emetric_space α] {s : set α} (hs : s.subsingleton) :

emetric.diam s = 0

The diameter of a subsingleton vanishes.

source

@[simp]

theorem emetric.diam_empty {α : Type u} [pseudo_emetric_space α] :

emetric.diam ∅ = 0

The diameter of the empty set vanishes

source

@[simp]

theorem emetric.diam_singleton {α : Type u} [pseudo_emetric_space α] {x : α} :

emetric.diam {x} = 0

The diameter of a singleton vanishes

source

theorem emetric.diam_Union_mem_option {α : Type u} [pseudo_emetric_space α] {ι : Type u_1} (o : option ι) (s : ι → set α) :

emetric.diam (⋃ (i : ι) (H : i ∈ o), s i) = ⨆ (i : ι) (H : i ∈ o), emetric.diam (s i)

source

theorem emetric.diam_insert {α : Type u} [pseudo_emetric_space α] {x : α} {s : set α} :

emetric.diam (has_insert.insert x s) = linear_order.max (⨆ (y : α) (H : y ∈ s), has_edist.edist x y) (emetric.diam s)

source

theorem emetric.diam_pair {α : Type u} [pseudo_emetric_space α] {x y : α} :

emetric.diam {x, y} = has_edist.edist x y

source

theorem emetric.diam_triple {α : Type u} [pseudo_emetric_space α] {x y z : α} :

emetric.diam {x, y, z} = linear_order.max (linear_order.max (has_edist.edist x y) (has_edist.edist x z)) (has_edist.edist y z)

source

theorem emetric.diam_mono {α : Type u} [pseudo_emetric_space α] {s t : set α} (h : s ⊆ t) :

emetric.diam s ≤ emetric.diam t

The diameter is monotonous with respect to inclusion

source

theorem emetric.diam_union {α : Type u} [pseudo_emetric_space α] {x y : α} {s t : set α} (xs : x ∈ s) (yt : y ∈ t) :

emetric.diam (s ∪ t) ≤ emetric.diam s + has_edist.edist x y + emetric.diam t

The diameter of a union is controlled by the diameter of the sets, and the edistance between two points in the sets.

source

theorem emetric.diam_union' {α : Type u} [pseudo_emetric_space α] {s t : set α} (h : (s ∩ t).nonempty) :

emetric.diam (s ∪ t) ≤ emetric.diam s + emetric.diam t

source

theorem emetric.diam_closed_ball {α : Type u} [pseudo_emetric_space α] {x : α} {r : ennreal} :

emetric.diam (emetric.closed_ball x r) ≤ 2 * r

source

theorem emetric.diam_ball {α : Type u} [pseudo_emetric_space α] {x : α} {r : ennreal} :

emetric.diam (emetric.ball x r) ≤ 2 * r

source

theorem emetric.diam_pi_le_of_le {β : Type v} {π : β → Type u_1} [fintype β] [Π (b : β), pseudo_emetric_space (π b)] {s : Π (b : β), set (π b)} {c : ennreal} (h : ∀ (b : β), emetric.diam (s b) ≤ c) :

emetric.diam (set.univ.pi s) ≤ c

source

@[class]

structure emetric_space (α : Type u) :

Type u

to_pseudo_emetric_space : pseudo_emetric_space α
eq_of_edist_eq_zero : ∀ {x y : α}, has_edist.edist x y = 0 → x = y

We now define emetric_space, extending pseudo_emetric_space.

Instances of this typeclass

Instances of other typeclasses for emetric_space

emetric_space.has_sizeof_inst

source

@[simp]

theorem edist_eq_zero {γ : Type w} [emetric_space γ] {x y : γ} :

has_edist.edist x y = 0 ↔ x = y

Characterize the equality of points by the vanishing of their extended distance

source

@[simp]

theorem zero_eq_edist {γ : Type w} [emetric_space γ] {x y : γ} :

0 = has_edist.edist x y ↔ x = y

source

theorem edist_le_zero {γ : Type w} [emetric_space γ] {x y : γ} :

has_edist.edist x y ≤ 0 ↔ x = y

source

@[simp]

theorem edist_pos {γ : Type w} [emetric_space γ] {x y : γ} :

0 < has_edist.edist x y ↔ x ≠ y

source

theorem eq_of_forall_edist_le {γ : Type w} [emetric_space γ] {x y : γ} (h : ∀ (ε : ennreal), ε > 0 → has_edist.edist x y ≤ ε) :

x = y

Two points coincide if their distance is < ε for all positive ε

source

@[protected, instance]

def to_separated {γ : Type w} [emetric_space γ] :

separated_space γ

An emetric space is separated

source

theorem emetric.uniform_embedding_iff' {β : Type v} {γ : Type w} [emetric_space γ] [emetric_space β] {f : γ → β} :

uniform_embedding f ↔ (∀ (ε : ennreal), ε > 0 → (∃ (δ : ennreal) (H : δ > 0), ∀ {a b : γ}, has_edist.edist a b < δ → has_edist.edist (f a) (f b) < ε)) ∧ ∀ (δ : ennreal), δ > 0 → (∃ (ε : ennreal) (H : ε > 0), ∀ {a b : γ}, has_edist.edist (f a) (f b) < ε → has_edist.edist a b < δ)

A map between emetric spaces is a uniform embedding if and only if the edistance between f x and f y is controlled in terms of the distance between x and y and conversely.

source

def emetric_space.of_t0_pseudo_emetric_space (α : Type u_1) [pseudo_emetric_space α] [t0_space α] :

emetric_space α

If a pseudo_emetric_space is a T₀ space, then it is an emetric_space.

Equations

emetric_space.of_t0_pseudo_emetric_space α = {to_pseudo_emetric_space := {to_has_edist := pseudo_emetric_space.to_has_edist _inst_3, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := pseudo_emetric_space.to_uniform_space _inst_3, uniformity_edist := _}, eq_of_edist_eq_zero := _}

source

def emetric_space.replace_uniformity {γ : Type u_1} [U : uniform_space γ] (m : emetric_space γ) (H : uniformity γ = uniformity γ) :

emetric_space γ

Auxiliary function to replace the uniformity on an emetric space with a uniformity which is equal to the original one, but maybe not defeq. This is useful if one wants to construct an emetric space with a specified uniformity. See Note [forgetful inheritance] explaining why having definitionally the right uniformity is often important.

Equations

m.replace_uniformity H = {to_pseudo_emetric_space := {to_has_edist := {edist := has_edist.edist pseudo_emetric_space.to_has_edist}, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := U, uniformity_edist := _}, eq_of_edist_eq_zero := _}

source

def emetric_space.induced {γ : Type u_1} {β : Type u_2} (f : γ → β) (hf : function.injective f) (m : emetric_space β) :

emetric_space γ

The extended metric induced by an injective function taking values in a emetric space.

Equations

emetric_space.induced f hf m = {to_pseudo_emetric_space := {to_has_edist := {edist := λ (x y : γ), has_edist.edist (f x) (f y)}, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := uniform_space.comap f pseudo_emetric_space.to_uniform_space, uniformity_edist := _}, eq_of_edist_eq_zero := _}

source

@[protected, instance]

def subtype.emetric_space {α : Type u_1} {p : α → Prop} [emetric_space α] :

emetric_space (subtype p)

Emetric space instance on subsets of emetric spaces

Equations

subtype.emetric_space = emetric_space.induced coe subtype.coe_injective _inst_3

source

@[protected, instance]

def mul_opposite.emetric_space {α : Type u_1} [emetric_space α] :

emetric_space αᵐᵒᵖ

Emetric space instance on the multiplicative opposite of an emetric space.

Equations

mul_opposite.emetric_space = emetric_space.induced mul_opposite.unop mul_opposite.unop_injective _inst_3

source

@[protected, instance]

def add_opposite.emetric_space {α : Type u_1} [emetric_space α] :

emetric_space αᵃᵒᵖ

Emetric space instance on the additive opposite of an emetric space.

Equations

add_opposite.emetric_space = emetric_space.induced add_opposite.unop add_opposite.unop_injective _inst_3

source

@[protected, instance]

def ulift.emetric_space {α : Type u_1} [emetric_space α] :

emetric_space (ulift α)

Equations

ulift.emetric_space = emetric_space.induced ulift.down ulift.down_injective _inst_3

source

@[protected, instance]

def prod.emetric_space_max {β : Type v} {γ : Type w} [emetric_space γ] [emetric_space β] :

emetric_space (γ × β)

The product of two emetric spaces, with the max distance, is an extended metric spaces. We make sure that the uniform structure thus constructed is the one corresponding to the product of uniform spaces, to avoid diamond problems.

Equations

prod.emetric_space_max = {to_pseudo_emetric_space := {to_has_edist := pseudo_emetric_space.to_has_edist prod.pseudo_emetric_space_max, edist_self := _, edist_comm := _, edist_triangle := _, to_uniform_space := pseudo_emetric_space.to_uniform_space prod.pseudo_emetric_space_max, uniformity_edist := _}, eq_of_edist_eq_zero := _}

source

theorem uniformity_edist {γ : Type w} [emetric_space γ] :

uniformity γ = ⨅ (ε : ennreal) (H : ε > 0), filter.principal {p : γ × γ | has_edist.edist p.fst p.snd < ε}

Reformulation of the uniform structure in terms of the extended distance

source

@[protected, instance]

def emetric_space_pi {β : Type v} {π : β → Type u_2} [fintype β] [Π (b : β), emetric_space (π b)] :

emetric_space (Π (b : β), π b)

The product of a finite number of emetric spaces, with the max distance, is still an emetric space. This construction would also work for infinite products, but it would not give rise to the product topology. Hence, we only formalize it in the good situation of finitely many spaces.

Equations