Documentation

Extra.Topology.IMetricSpace

@[simp]
@[simp]
theorem unitInterval.le_iff_le_val (x y : ↑unitInterval) :
x ≤ y ↔ ↑x ≤ ↑y
@[simp]
@[simp]
@[simp]
theorem unitInterval.mul_top {x : ↑unitInterval} :
x * ⊤ = x
@[simp]
theorem unitInterval.top_mul {x : ↑unitInterval} :
⊤ * x = x
theorem unitInterval.half_mul_lt_self_of_pos {ε : ↑unitInterval} (h : ε > 0) :
half * ε < ε
@[simp]
theorem unitInterval.coe_iSup_le {ι : Sort u_1} {f : ι → ↑unitInterval} {a : ℝ} (ha : 0 ≤ a) (h : ∀ (i : ι), ↑(f i) ≤ a) :
↑(iSup f) ≤ 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) :
↑(⨆ (x : ι), ⨆ (y : ι' x), f x y) ≤ a
theorem unitInterval.coe_le_iSup {ι : Sort u_1} {f : ι → ↑unitInterval} {i : ι} :
↑(f i) ≤ ↑(iSup f)
theorem unitInterval.coe_le_iSup₂ {ι : Sort u_1} {ι' : ι → Sort u_2} {f : (x : ι) → ι' x → ↑unitInterval} {i : ι} {j : ι' i} :
↑(f i j) ≤ ↑(⨆ (x : ι), ⨆ (y : ι' x), f x y)
theorem unitInterval.mul_iSup {ι : Sort u_1} {f : ι → ↑unitInterval} {a : ↑unitInterval} :
a * ⨆ (x : ι), f x = ⨆ (x : ι), a * f x
theorem unitInterval.iSup_mul {ι : Sort u_1} {f : ι → ↑unitInterval} {a : ↑unitInterval} :
(⨆ (x : ι), f x) * a = ⨆ (x : ι), f x * a
theorem unitInterval.div_coe_eq_of_one_le {a : ↑unitInterval} {b : ℝ} (hb : 1 ≤ b) :
↑a / b = ↑⟨↑a / b, ⋯⟩
class IDist (α : Type u_1) :
Type u_1
  • idist : α → α → ↑unitInterval

    The distance between two points, in the interval [0, 1].

Instances
    @[implicit_reducible]
    instance instDistOfIDist {α : Type u_1} [IDist α] :
    Dist α
    Equations
    @[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
    Instances For
      class PseudoIMetricSpace (α : Type u_1) extends IDist α :
      Type u_1
      Instances
        class IMetricSpace (α : Type u_1) extends PseudoIMetricSpace α :
        Type u_1
        Instances
          theorem IMetricSpace.idist_eq_zero_iff {α : Type u_1} {x y : α} [IMetricSpace α] :
          idist x y = 0 ↔ x = y
          @[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
            Instances For
              theorem edist_nonneg {α : Type u_1} [PseudoEMetricSpace α] {x y : α} :
              0 ≤ edist x y
              @[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
                Instances For
                  @[implicit_reducible, instance 100]
                  Equations
                  • One or more equations did not get rendered due to their size.
                  @[implicit_reducible, instance 100]
                  Equations
                  theorem IMetric.uniformity_basis_idist {α : Type u} [inst : PseudoIMetricSpace α] :
                  (uniformity α).HasBasis (fun (ε : ℝ) => 0 < ε) fun (ε : ℝ) => {p : α × α | ↑(idist p.1 p.2) < ε}
                  theorem IMetric.mem_uniformity_idist {α : Type u} [PseudoIMetricSpace α] {s : Set (α × α)} :
                  s ∈ uniformity α ↔ ∃ ε > 0, ∀ ⦃a b : α⦄, ↑(idist a b) < ε → (a, b) ∈ s
                  theorem IMetric.idist_mem_uniformity {α : Type u_1} [PseudoIMetricSpace α] {ε : ℝ} (ε0 : 0 < ε) :
                  {p : α × α | dist p.1 p.2 < ε} ∈ uniformity α

                  A constant size neighborhood of the diagonal is an entourage.

                  def IMetric.ball {α : Type u_1} [IDist α] (x : α) (ε : ℝ) :
                  Set α
                  Equations
                  Instances For
                    theorem IMetric.nhds_basis_ball {α : Type u_1} [PseudoIMetricSpace α] {x : α} :
                    (nhds x).HasBasis (fun (x : ℝ) => 0 < x) (ball x)
                    theorem IMetric.mem_nhds_iff {α : Type u_1} [PseudoIMetricSpace α] {s : Set α} {x : α} :
                    s ∈ nhds x ↔ ∃ ε > 0, ball x ε ⊆ s
                    theorem IMetric.isOpen_iff {α : Type u_1} [IMetricSpace α] {s : Set α} :
                    IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, ball x ε ⊆ s
                    @[simp]
                    theorem IMetric.mem_ball {α : Type u_1} [PseudoIMetricSpace α] {x y : α} {ε : ℝ} :
                    y ∈ ball x ε ↔ dist y x < ε
                    theorem IMetric.mem_ball' {α : Type u_1} [PseudoIMetricSpace α] {x y : α} {ε : ℝ} :
                    y ∈ ball x ε ↔ ↑(idist x y) < ε
                    theorem IMetric.mem_closure_iff {α : Type u_1} [PseudoIMetricSpace α] {s : Set α} {a : α} :
                    a ∈ closure s ↔ ∀ ε > 0, ∃ b ∈ s, idist a b < ε
                    theorem IMetric.denseRange_iff {α : Type u_1} {β : Type u_2} [PseudoIMetricSpace α] {f : β → α} :
                    DenseRange f ↔ ∀ (x : α), ∀ r > 0, ∃ (y : β), idist x (f y) < r
                    @[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
                      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) :
                            theorem Isometry.to_idist_eq {α : Type u} {β : Type v} [PseudoIMetricSpace α] [PseudoIMetricSpace β] {f : α → β} (h : Isometry f) (x y : α) :
                            idist (f x) (f y) = idist 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)
                            noncomputable def transport (x : ℝ) (h : x ≥ 0) :
                            Equations
                            Instances For
                              theorem transport_eq {x : ℝ} {hx : x ≥ 0} :
                              ↑(transport x hx) = 1 - 1 / (1 + x)
                              theorem transport_add {x y : ℝ} {hx : x ≥ 0} {hy : y ≥ 0} :
                              ↑(transport (x + y) ⋯) ≤ ↑(transport x hx) + ↑(transport y hy)
                              theorem transport_mono {x y : ℝ} {hx : x ≥ 0} {hy : y ≥ 0} (h : x ≤ y) :
                              theorem transport_strictMono {x y : ℝ} {hx : x ≥ 0} {hy : y ≥ 0} (h : x < y) :
                              theorem transport_lt_one {x : ℝ} {hx : x ≥ 0} :
                              ↑(transport x hx) < 1
                              theorem transport_pos {x : ℝ} (hx : x > 0) :
                              ↑(transport x ⋯) > 0
                              theorem lt_of_transport_lt {x y : ℝ} {hx : x ≥ 0} {hy : y ≥ 0} (h : ↑(transport x hx) < ↑(transport y hy)) :
                              x < y
                              theorem transport_lt_iff {x : ℝ} {hx : x ≥ 0} {ε : ℝ} (hε₀ : 0 < ε) (hε₁ : ε < 1) :
                              ↑(transport x hx) < ε ↔ x < ε / (1 - ε)
                              @[implicit_reducible]
                              noncomputable def IMetricSpace.transportMetricSpace {α : Type u_1} [inst : MetricSpace α] :
                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For
                                theorem PseudoIMetricSpace.dist_eq {α : Type u_1} [PseudoIMetricSpace α] {x y : α} :
                                dist x y = ↑(idist x y)
                                theorem PseudoIMetricSpace.edist_eq {α : Type u_1} [PseudoIMetricSpace α] {x y : α} :
                                @[implicit_reducible]
                                Equations
                                Instances For
                                  @[implicit_reducible]
                                  Equations
                                  Instances For
                                    theorem PseudoIMetricSpace.discrete.idist_eq {α : Type u_1} [DecidableEq α] {x y : α} :
                                    class DiscreteIMetricSpace (α : Type u_1) [DecidableEq α] extends IMetricSpace α :
                                    Type u_1
                                    Instances
                                      theorem LipschitzWith.to_idist_le {α : Type u_1} {β : Type u_2} [PseudoIMetricSpace α] [PseudoIMetricSpace β] {f : α → β} {K : NNReal} (h : LipschitzWith K f) (x y : α) :
                                      ↑(idist (f x) (f y)) ≤ ↑K * ↑(idist 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)) :
                                      class IsUltrametricIDist (α : Type u_1) [IDist α] :
                                      Instances
                                        @[instance 100]