Equations
Instances For
theorem
unitInterval.coe_iSup_le
{ι : Sort u_1}
{f : ι → ↑unitInterval}
{a : ℝ}
(ha : 0 ≤ a)
(h : ∀ (i : ι), ↑(f i) ≤ a)
:
theorem
unitInterval.coe_iSup₂_le
{ι : Sort u_1}
{ι' : ι → Sort u_2}
{f : (x : ι) → ι' x → ↑unitInterval}
{a : ℝ}
(ha : 0 ≤ a)
(h : ∀ (i : ι) (j : ι' i), ↑(f i j) ≤ a)
:
theorem
unitInterval.coe_le_iSup₂
{ι : Sort u_1}
{ι' : ι → Sort u_2}
{f : (x : ι) → ι' x → ↑unitInterval}
{i : ι}
{j : ι' i}
:
- idist : α → α → ↑unitInterval
The distance between two points, in the interval
[0, 1].
Instances
@[implicit_reducible]
Equations
- instDistOfIDist = { dist := fun (x y : α) => ↑(idist x y) }
@[implicit_reducible]
def
uniformSpaceOfIDist
{α : Type u_1}
(idist : α → α → ↑unitInterval)
(idist_self : ∀ (x : α), idist x x = 0)
(idist_comm : ∀ (x y : α), idist x y = idist y x)
(idist_triangle : ∀ (x y z : α), ↑(idist x z) ≤ ↑(idist x y) + ↑(idist y z))
:
Creating a uniform space from an extended distance.
Equations
- uniformSpaceOfIDist idist idist_self idist_comm idist_triangle = UniformSpace.ofFun (fun (x y : α) => ↑(idist x y)) ⋯ ⋯ idist_triangle UniformSpace.ofDist_aux
Instances For
- idist : α → α → ↑unitInterval
- toUniformSpace : UniformSpace α
Instances
- idist : α → α → ↑unitInterval
- uniformity_idist : uniformity α = ⨅ (ε : ℝ), ⨅ (_ : ε > 0), Filter.principal {p : α × α | ↑(idist p.1 p.2) < ε}
Instances
@[implicit_reducible]
def
PseudoIMetricSpace.of_metric_space_of_dist_le_one
{α : Type u_1}
[inst : PseudoMetricSpace α]
(h : ∀ (x y : α), dist x y ≤ 1 := by intros; bound)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[implicit_reducible]
def
IMetricSpace.of_metric_space_of_dist_le_one
{α : Type u_1}
[inst : MetricSpace α]
(h : ∀ (x y : α), dist x y ≤ 1 := by intros; bound)
:
Equations
- IMetricSpace.of_metric_space_of_dist_le_one h = { toPseudoIMetricSpace := PseudoIMetricSpace.of_metric_space_of_dist_le_one h, eq_of_idist_eq_zero := ⋯ }
Instances For
@[implicit_reducible]
def
PseudoIMetricSpace.of_emetric_space_of_dist_le_one
{α : Type u_1}
[inst : PseudoEMetricSpace α]
(h : ∀ (x y : α), edist x y ≤ 1 := by intros; bound)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[implicit_reducible]
def
IMetricSpace.of_emetric_space_of_dist_le_one
{α : Type u_1}
[inst : EMetricSpace α]
(h : ∀ (x y : α), edist x y ≤ 1 := by intros; bound)
:
Equations
- IMetricSpace.of_emetric_space_of_dist_le_one h = { toPseudoIMetricSpace := PseudoIMetricSpace.of_emetric_space_of_dist_le_one h, eq_of_idist_eq_zero := ⋯ }
Instances For
@[implicit_reducible, instance 100]
Equations
- One or more equations did not get rendered due to their size.
@[implicit_reducible, instance 100]
Equations
- instMetricSpaceOfIMetricSpace = { toPseudoMetricSpace := instPseudoMetricSpaceOfPseudoIMetricSpace, eq_of_dist_eq_zero := ⋯ }
A constant size neighborhood of the diagonal is an entourage.
@[simp]
@[implicit_reducible]
def
PseudoIMetricSpace.induced
{α : Type u_1}
{β : Type u_2}
(f : α → β)
(m : PseudoIMetricSpace β)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[implicit_reducible]
def
IMetricSpace.induced
{α : Type u_1}
{β : Type u_2}
(f : α → β)
(hf : Function.Injective f)
(m : IMetricSpace β)
:
Equations
- IMetricSpace.induced f hf m = { toPseudoIMetricSpace := PseudoIMetricSpace.induced f m.toPseudoIMetricSpace, eq_of_idist_eq_zero := ⋯ }
Instances For
@[implicit_reducible]
def
PseudoIMetricSpace.ofIDistTopology
{α : Type u}
[TopologicalSpace α]
(idist : α → α → ↑unitInterval)
(idist_self : ∀ (x : α), idist x x = 0)
(idist_comm : ∀ (x y : α), idist x y = idist y x)
(idist_triangle : ∀ (x y z : α), ↑(idist x z) ≤ ↑(idist x y) + ↑(idist y z))
(H : ∀ (s : Set α), IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, ∀ (y : α), ↑(idist x y) < ε → y ∈ s)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[implicit_reducible]
def
IMetricSpace.ofIDistTopology
{α : Type u}
[TopologicalSpace α]
(idist : α → α → ↑unitInterval)
(idist_self : ∀ (x : α), idist x x = 0)
(idist_comm : ∀ (x y : α), idist x y = idist y x)
(idist_triangle : ∀ (x y z : α), ↑(idist x z) ≤ ↑(idist x y) + ↑(idist y z))
(H : ∀ (s : Set α), IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, ∀ (y : α), ↑(idist x y) < ε → y ∈ s)
(eq_of_idist_eq_zero : ∀ (x y : α), idist x y = 0 → x = y)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
theorem
Isometry.of_idist_eq
{α : Type u}
{β : Type v}
[PseudoIMetricSpace α]
[PseudoIMetricSpace β]
{f : α → β}
(h : ∀ (x y : α), idist (f x) (f y) = idist x y)
:
Isometry f
theorem
Isometry.to_idist_eq
{α : Type u}
{β : Type v}
[PseudoIMetricSpace α]
[PseudoIMetricSpace β]
{f : α → β}
(h : Isometry f)
(x y : α)
:
theorem
uniformContinuous_idist
{α : Type u_1}
[PseudoIMetricSpace α]
:
UniformContinuous fun (p : α × α) => idist p.1 p.2
theorem
UniformContinuous.idist
{α : Type u_1}
{β : Type u_2}
[PseudoIMetricSpace α]
[UniformSpace β]
{f g : β → α}
(hf : UniformContinuous f)
(hg : UniformContinuous g)
:
UniformContinuous fun (b : β) => idist (f b) (g b)
theorem
continuous_idist
{α : Type u_1}
[PseudoIMetricSpace α]
:
Continuous fun (p : α × α) => idist p.1 p.2
theorem
Continuous.idist
{α : Type u_1}
{β : Type u_2}
[PseudoIMetricSpace α]
[TopologicalSpace β]
{f g : β → α}
(hf : Continuous f)
(hg : Continuous g)
:
Continuous fun (b : β) => IDist.idist (f b) (g b)
@[implicit_reducible]
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[implicit_reducible]
Equations
Instances For
@[implicit_reducible]
Equations
- IMetricSpace.discrete = { toPseudoIMetricSpace := PseudoIMetricSpace.discrete, eq_of_idist_eq_zero := ⋯ }
Instances For
- idist : α → α → ↑unitInterval
- uniformity_idist : uniformity α = ⨅ (ε : ℝ), ⨅ (_ : ε > 0), Filter.principal {p : α × α | ↑(idist p.1 p.2) < ε}
Instances
theorem
DiscreteIMetricSpace.completeSpace
{α : Type u_1}
[DecidableEq α]
[DiscreteIMetricSpace α]
:
theorem
LipschitzWith.to_idist_le
{α : Type u_1}
{β : Type u_2}
[PseudoIMetricSpace α]
[PseudoIMetricSpace β]
{f : α → β}
{K : NNReal}
(h : LipschitzWith K f)
(x y : α)
:
theorem
LipschitzWith.of_idist_le
{α : Type u_1}
{β : Type u_2}
[PseudoIMetricSpace α]
[PseudoIMetricSpace β]
{f : α → β}
{K : NNReal}
(h : ∀ (x y : α), ↑(idist (f x) (f y)) ≤ ↑K * ↑(idist x y))
:
LipschitzWith K f
@[instance 100]