Documentation

Extra.Topology.IMetricSpace.Constructions.Function

theorem uniformFun_edist_le_one {α : Type u} {β : Type v} [PseudoIMetricSpace β] (f g : UniformFun α β) :
edist f g ≤ 1
theorem uniformFun_edist_ne_top {α : Type u} {β : Type v} [PseudoIMetricSpace β] (f g : UniformFun α β) :
@[implicit_reducible]
noncomputable instance instIMetricSpaceUniformFun {α : Type u} {β : Type v} [IMetricSpace β] :
Equations
theorem UniformFun.idist_eq {α : Type u} {β : Type v} [PseudoIMetricSpace β] {f g : UniformFun α β} :
↑(idist f g) = (edist f g).toReal
theorem idist_bddAbove_real {α : Type u} {β : Type v} [PseudoIMetricSpace β] {f g : UniformFun α β} :
BddAbove (Set.range fun (x : α) => ↑(idist (f x) (g x)))
theorem idist_cast_eq_iSup_real {α : Type u} {β : Type v} [PseudoIMetricSpace β] {f g : UniformFun α β} :
↑(idist f g) = ⨆ (x : α), ↑(idist (f x) (g x))
theorem UniformFun.idist_eq_iSup {α : Type u} {β : Type v} [PseudoIMetricSpace β] {f g : UniformFun α β} :
idist f g = ⨆ (x : α), idist (f x) (g x)
theorem UniformFun.idist_eq_iSup₂ {α : Type u} {β : Type v} {δ : Type w} [PseudoIMetricSpace β] [PseudoIMetricSpace δ] {f g : UniformFun α (UniformFun β δ)} :
idist f g = ⨆ (x : α), ⨆ (y : β), idist (f x y) (g x y)
theorem UniformFun.continuous_apply {α : Type u} {β : Type v} [PseudoIMetricSpace β] (x : α) :
Continuous fun (f : UniformFun α β) => toFun f x
def UniformFun.comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : UniformFun β γ) (g : UniformFun α β) :
Equations
Instances For
    def UniformFun.apply {α : Type u_1} {β : Type u_2} (f : UniformFun α β) (x : α) :
    β
    Equations
    Instances For
      @[simp]
      theorem UniformFun.apply_apply {α : Type u_1} {β : Type u_2} {f : UniformFun α β} {x : α} :
      f.apply x = f x