Documentation

Mathlib.Topology.Order.Cadlag

Càdlàg functions #

This file defines càdlàg functions, i.e. right-continuous functions with left limits. These are for instance a common hypothesis made on stochastic processes.

Using the to_dual machinery we also define càglàd functions (left-continuous with right limits).

def IsRightContinuous {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) :

A function f is right-continuous if for any a, f x → f a when x → a and x > a.

Equations
Instances For
    def IsLeftContinuous {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) :

    A function f is left-continuous if for any a, f x → f a when x → a and x < a.

    Equations
    Instances For
      theorem Continuous.isRightContinuous {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] (hf : Continuous f) :
      theorem Continuous.isLeftContinuous {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] (hf : Continuous f) :
      theorem IsRightContinuous.continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsRightContinuous f) (hg : Continuous g) :
      theorem IsLeftContinuous.continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsLeftContinuous f) (hg : Continuous g) :
      theorem IsLeftContinuous.fun_continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsLeftContinuous f) (hg : Continuous g) :
      IsLeftContinuous fun (x : X) => g (f x)

      Eta-expanded form of IsLeftContinuous.continuous_comp

      theorem IsRightContinuous.fun_continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsRightContinuous f) (hg : Continuous g) :
      IsRightContinuous fun (x : X) => g (f x)

      Eta-expanded form of IsRightContinuous.continuous_comp

      theorem IsRightContinuous.continuous_comp₂ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} {T : Type u_4} [TopologicalSpace Z] [TopologicalSpace T] {g : X → Z} {φ : Y → Z → T} (hf : IsRightContinuous f) (hg : IsRightContinuous g) (hφ : Continuous (Function.uncurry φ)) :
      IsRightContinuous fun (x : X) => φ (f x) (g x)
      theorem IsLeftContinuous.continuous_comp₂ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} {T : Type u_4} [TopologicalSpace Z] [TopologicalSpace T] {g : X → Z} {φ : Y → Z → T} (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) (hφ : Continuous (Function.uncurry φ)) :
      IsLeftContinuous fun (x : X) => φ (f x) (g x)
      @[simp]
      theorem IsRightContinuous.const {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] {c : Y} :
      IsRightContinuous fun (x : X) => c
      @[simp]
      theorem IsLeftContinuous.const {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] {c : Y} :
      IsLeftContinuous fun (x : X) => c
      theorem IsRightContinuous.mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      theorem IsRightContinuous.add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      theorem IsRightContinuous.fun_mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      IsRightContinuous fun (i : X) => f i * g i

      Eta-expanded form of IsRightContinuous.mul

      theorem IsRightContinuous.fun_add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      IsRightContinuous fun (i : X) => f i + g i

      Eta-expanded form of IsRightContinuous.add

      theorem IsLeftContinuous.fun_mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      IsLeftContinuous fun (i : X) => f i * g i
      theorem IsLeftContinuous.add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      theorem IsLeftContinuous.fun_add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      IsLeftContinuous fun (i : X) => f i + g i
      theorem IsLeftContinuous.mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      theorem IsRightContinuous.div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      theorem IsRightContinuous.fun_sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      IsRightContinuous fun (i : X) => f i - g i

      Eta-expanded form of IsRightContinuous.sub

      theorem IsRightContinuous.fun_div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      IsRightContinuous fun (i : X) => f i / g i

      Eta-expanded form of IsRightContinuous.div'

      theorem IsLeftContinuous.sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      theorem IsLeftContinuous.fun_sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      IsLeftContinuous fun (i : X) => f i - g i
      theorem IsLeftContinuous.fun_div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      IsLeftContinuous fun (i : X) => f i / g i
      theorem IsLeftContinuous.div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) :
      theorem IsRightContinuous.sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) :
      theorem IsRightContinuous.div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) (h : ∀ (x : X), g x ≠ 0) :
      theorem IsRightContinuous.fun_div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsRightContinuous f) (hg : IsRightContinuous g) (h : ∀ (x : X), g x ≠ 0) :
      IsRightContinuous fun (i : X) => f i / g i

      Eta-expanded form of IsRightContinuous.div

      theorem IsLeftContinuous.fun_div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) (h : ∀ (x : X), g x ≠ 0) :
      IsLeftContinuous fun (i : X) => f i / g i
      theorem IsLeftContinuous.div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsLeftContinuous f) (hg : IsLeftContinuous g) (h : ∀ (x : X), g x ≠ 0) :
      theorem IsRightContinuous.neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Neg Y] [ContinuousNeg Y] (hf : IsRightContinuous f) :
      theorem IsRightContinuous.fun_inv {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Inv Y] [ContinuousInv Y] (hf : IsRightContinuous f) :
      IsRightContinuous fun (i : X) => (f i)⁻¹

      Eta-expanded form of IsRightContinuous.inv

      theorem IsRightContinuous.fun_neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Neg Y] [ContinuousNeg Y] (hf : IsRightContinuous f) :
      IsRightContinuous fun (i : X) => -f i

      Eta-expanded form of IsRightContinuous.neg

      theorem IsLeftContinuous.neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Neg Y] [ContinuousNeg Y] (hf : IsLeftContinuous f) :
      theorem IsLeftContinuous.fun_neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Neg Y] [ContinuousNeg Y] (hf : IsLeftContinuous f) :
      IsLeftContinuous fun (i : X) => -f i
      theorem IsLeftContinuous.fun_inv {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Inv Y] [ContinuousInv Y] (hf : IsLeftContinuous f) :
      IsLeftContinuous fun (i : X) => (f i)⁻¹
      theorem IsRightContinuous.inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsRightContinuous f) (h : ∀ (x : X), f x ≠ 0) :
      theorem IsRightContinuous.fun_inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsRightContinuous f) (h : ∀ (x : X), f x ≠ 0) :
      IsRightContinuous fun (i : X) => (f i)⁻¹

      Eta-expanded form of IsRightContinuous.inv₀

      theorem IsLeftContinuous.fun_inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsLeftContinuous f) (h : ∀ (x : X), f x ≠ 0) :
      IsLeftContinuous fun (i : X) => (f i)⁻¹
      theorem IsLeftContinuous.inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsLeftContinuous f) (h : ∀ (x : X), f x ≠ 0) :
      theorem IsRightContinuous.const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsRightContinuous f) :
      theorem IsRightContinuous.fun_const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsRightContinuous f) :
      IsRightContinuous fun (i : X) => c • f i

      Eta-expanded form of IsRightContinuous.const_smul

      theorem IsLeftContinuous.const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsLeftContinuous f) :
      theorem IsLeftContinuous.fun_const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsLeftContinuous f) :
      IsLeftContinuous fun (i : X) => c • f i
      theorem IsRightContinuous.fun_const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsRightContinuous f) :
      IsRightContinuous fun (i : X) => c +ᵥ f i
      theorem IsLeftContinuous.const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsLeftContinuous f) :
      theorem IsRightContinuous.const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsRightContinuous f) :
      theorem IsLeftContinuous.fun_const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsLeftContinuous f) :
      IsLeftContinuous fun (i : X) => c +ᵥ f i
      def IsRightContinuousOn {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) (s : Set X) :

      A function f is right-continuous on a set s if for any a ∈ s, f x → f a when x → a with x ∈ s and x > a.

      Equations
      Instances For
        def IsLeftContinuousOn {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) (s : Set X) :

        A function f is left-continuous on a set s if for any a ∈ s, f x → f a when x → a with x ∈ s and x < a.

        Equations
        Instances For
          theorem IsRightContinuousOn.continuousWithinAt {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {a : X} (hf : IsRightContinuousOn f s) (ha : a ∈ s) :
          theorem IsLeftContinuousOn.continuousWithinAt {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {a : X} (hf : IsLeftContinuousOn f s) (ha : a ∈ s) :
          theorem IsRightContinuousOn.mono {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s t : Set X} (hf : IsRightContinuousOn f s) (h : t ⊆ s) :
          theorem IsLeftContinuousOn.mono {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s t : Set X} (hf : IsLeftContinuousOn f s) (h : t ⊆ s) :
          theorem IsLeftContinuous.isLeftContinuousOn {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hf : IsLeftContinuous f) :
          theorem ContinuousOn.isRightContinuousOn {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hf : ContinuousOn f s) :
          theorem ContinuousOn.isLeftContinuousOn {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hf : ContinuousOn f s) :
          @[simp]
          theorem isRightContinuousOn_empty {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) :
          @[simp]
          theorem isLeftContinuousOn_empty {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) :
          @[simp]
          theorem isRightContinuousOn_singleton {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) (a : X) :
          @[simp]
          theorem isLeftContinuousOn_singleton {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) (a : X) :
          theorem IsOpen.isRightContinuousOn_iff {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hs : IsOpen s) :
          theorem IsOpen.isLeftContinuousOn_iff {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hs : IsOpen s) :
          theorem IsRightContinuousOn.congr {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hf : IsRightContinuousOn f s) (h : Set.EqOn g f s) :
          theorem IsLeftContinuousOn.congr {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (hf : IsLeftContinuousOn f s) (h : Set.EqOn g f s) :
          theorem isRightContinuousOn_congr {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (h : Set.EqOn g f s) :
          theorem isLeftContinuousOn_congr {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} (h : Set.EqOn g f s) :
          theorem IsRightContinuousOn.continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsRightContinuousOn f s) (hg : Continuous g) :
          theorem IsLeftContinuousOn.continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsLeftContinuousOn f s) (hg : Continuous g) :
          theorem IsRightContinuousOn.continuous_fun_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsRightContinuousOn f s) (hg : Continuous g) :
          IsRightContinuousOn (fun (x : X) => g (f x)) s

          Eta-expanded form of IsRightContinuousOn.continuous_comp

          theorem IsLeftContinuousOn.continuous_fun_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsLeftContinuousOn f s) (hg : Continuous g) :
          IsLeftContinuousOn (fun (x : X) => g (f x)) s

          Eta-expanded form of IsLeftContinuousOn.continuous_comp

          theorem IsRightContinuousOn.continuous_comp₂ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {Z : Type u_3} {T : Type u_4} [TopologicalSpace Z] [TopologicalSpace T] {g : X → Z} {φ : Y → Z → T} (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) (hφ : Continuous (Function.uncurry φ)) :
          IsRightContinuousOn (fun (x : X) => φ (f x) (g x)) s
          theorem IsLeftContinuousOn.continuous_comp₂ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {Z : Type u_3} {T : Type u_4} [TopologicalSpace Z] [TopologicalSpace T] {g : X → Z} {φ : Y → Z → T} (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) (hφ : Continuous (Function.uncurry φ)) :
          IsLeftContinuousOn (fun (x : X) => φ (f x) (g x)) s
          @[simp]
          theorem IsRightContinuousOn.const {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] {s : Set X} {c : Y} :
          IsRightContinuousOn (fun (x : X) => c) s
          @[simp]
          theorem IsLeftContinuousOn.const {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] {s : Set X} {c : Y} :
          IsLeftContinuousOn (fun (x : X) => c) s
          theorem IsRightContinuousOn.mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Mul Y] [ContinuousMul Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          theorem IsRightContinuousOn.add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Add Y] [ContinuousAdd Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          theorem IsRightContinuousOn.fun_mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Mul Y] [ContinuousMul Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          IsRightContinuousOn (fun (i : X) => f i * g i) s

          Eta-expanded form of IsRightContinuousOn.mul

          theorem IsRightContinuousOn.fun_add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Add Y] [ContinuousAdd Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          IsRightContinuousOn (fun (i : X) => f i + g i) s

          Eta-expanded form of IsRightContinuousOn.add

          theorem IsLeftContinuousOn.mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Mul Y] [ContinuousMul Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          theorem IsLeftContinuousOn.fun_mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Mul Y] [ContinuousMul Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          IsLeftContinuousOn (fun (i : X) => f i * g i) s
          theorem IsLeftContinuousOn.add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Add Y] [ContinuousAdd Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          theorem IsLeftContinuousOn.fun_add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Add Y] [ContinuousAdd Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          IsLeftContinuousOn (fun (i : X) => f i + g i) s
          theorem IsRightContinuousOn.div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Div Y] [ContinuousDiv Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          theorem IsRightContinuousOn.fun_div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Div Y] [ContinuousDiv Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          IsRightContinuousOn (fun (i : X) => f i / g i) s

          Eta-expanded form of IsRightContinuousOn.div'

          theorem IsRightContinuousOn.fun_sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Sub Y] [ContinuousSub Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          IsRightContinuousOn (fun (i : X) => f i - g i) s

          Eta-expanded form of IsRightContinuousOn.sub

          theorem IsLeftContinuousOn.fun_div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Div Y] [ContinuousDiv Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          IsLeftContinuousOn (fun (i : X) => f i / g i) s
          theorem IsLeftContinuousOn.sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Sub Y] [ContinuousSub Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          theorem IsLeftContinuousOn.div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Div Y] [ContinuousDiv Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          theorem IsLeftContinuousOn.fun_sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Sub Y] [ContinuousSub Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) :
          IsLeftContinuousOn (fun (i : X) => f i - g i) s
          theorem IsRightContinuousOn.sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Sub Y] [ContinuousSub Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) :
          theorem IsRightContinuousOn.div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) (h : ∀ x ∈ s, g x ≠ 0) :
          theorem IsRightContinuousOn.fun_div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsRightContinuousOn f s) (hg : IsRightContinuousOn g s) (h : ∀ x ∈ s, g x ≠ 0) :
          IsRightContinuousOn (fun (i : X) => f i / g i) s

          Eta-expanded form of IsRightContinuousOn.div

          theorem IsLeftContinuousOn.div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) (h : ∀ x ∈ s, g x ≠ 0) :
          theorem IsLeftContinuousOn.fun_div {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [GroupWithZero Y] [ContinuousInv₀ Y] [ContinuousMul Y] (hf : IsLeftContinuousOn f s) (hg : IsLeftContinuousOn g s) (h : ∀ x ∈ s, g x ≠ 0) :
          IsLeftContinuousOn (fun (i : X) => f i / g i) s
          theorem IsRightContinuousOn.inv {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Inv Y] [ContinuousInv Y] (hf : IsRightContinuousOn f s) :
          theorem IsRightContinuousOn.neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Neg Y] [ContinuousNeg Y] (hf : IsRightContinuousOn f s) :
          theorem IsRightContinuousOn.fun_neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Neg Y] [ContinuousNeg Y] (hf : IsRightContinuousOn f s) :
          IsRightContinuousOn (fun (i : X) => -f i) s

          Eta-expanded form of IsRightContinuousOn.neg

          theorem IsRightContinuousOn.fun_inv {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Inv Y] [ContinuousInv Y] (hf : IsRightContinuousOn f s) :
          IsRightContinuousOn (fun (i : X) => (f i)⁻¹) s

          Eta-expanded form of IsRightContinuousOn.inv

          theorem IsLeftContinuousOn.inv {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Inv Y] [ContinuousInv Y] (hf : IsLeftContinuousOn f s) :
          theorem IsLeftContinuousOn.fun_inv {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Inv Y] [ContinuousInv Y] (hf : IsLeftContinuousOn f s) :
          IsLeftContinuousOn (fun (i : X) => (f i)⁻¹) s
          theorem IsLeftContinuousOn.fun_neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Neg Y] [ContinuousNeg Y] (hf : IsLeftContinuousOn f s) :
          IsLeftContinuousOn (fun (i : X) => -f i) s
          theorem IsLeftContinuousOn.neg {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Neg Y] [ContinuousNeg Y] (hf : IsLeftContinuousOn f s) :
          theorem IsRightContinuousOn.inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsRightContinuousOn f s) (h : ∀ x ∈ s, f x ≠ 0) :
          theorem IsRightContinuousOn.fun_inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsRightContinuousOn f s) (h : ∀ x ∈ s, f x ≠ 0) :
          IsRightContinuousOn (fun (i : X) => (f i)⁻¹) s

          Eta-expanded form of IsRightContinuousOn.inv₀

          theorem IsLeftContinuousOn.fun_inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsLeftContinuousOn f s) (h : ∀ x ∈ s, f x ≠ 0) :
          IsLeftContinuousOn (fun (i : X) => (f i)⁻¹) s
          theorem IsLeftContinuousOn.inv₀ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} [Zero Y] [Inv Y] [ContinuousInv₀ Y] (hf : IsLeftContinuousOn f s) (h : ∀ x ∈ s, f x ≠ 0) :
          theorem IsRightContinuousOn.const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsRightContinuousOn f s) :
          theorem IsRightContinuousOn.fun_const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsRightContinuousOn f s) :
          IsRightContinuousOn (fun (i : X) => c • f i) s

          Eta-expanded form of IsRightContinuousOn.const_smul

          theorem IsLeftContinuousOn.fun_const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsLeftContinuousOn f s) :
          IsLeftContinuousOn (fun (i : X) => c • f i) s
          theorem IsLeftContinuousOn.const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsLeftContinuousOn f s) :
          theorem IsRightContinuousOn.fun_const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsRightContinuousOn f s) :
          IsRightContinuousOn (fun (i : X) => c +ᵥ f i) s
          theorem IsLeftContinuousOn.const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsLeftContinuousOn f s) :
          theorem IsRightContinuousOn.const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsRightContinuousOn f s) :
          theorem IsLeftContinuousOn.fun_const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {s : Set X} {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsLeftContinuousOn f s) :
          IsLeftContinuousOn (fun (i : X) => c +ᵥ f i) s
          structure IsCaglad {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) :

          A function is càglàd if it is left-continuous and has right limits.

          Instances For
            structure IsCadlag {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] (f : X → Y) :

            A function is càdlàg if it is right-continuous and has left limits.

            Instances For
              theorem Continuous.isCadlag {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] (hf : Continuous f) :
              theorem Continuous.isCaglad {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] (hf : Continuous f) :
              @[simp]
              theorem IsCadlag.const {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] {c : Y} :
              IsCadlag fun (x : X) => c
              @[simp]
              theorem IsCaglad.const {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [Preorder X] [TopologicalSpace Y] {c : Y} :
              IsCaglad fun (x : X) => c
              theorem IsCadlag.continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsCadlag f) (hg : Continuous g) :
              theorem IsCaglad.continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsCaglad f) (hg : Continuous g) :
              theorem IsCadlag.fun_continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsCadlag f) (hg : Continuous g) :
              IsCadlag fun (x : X) => g (f x)

              Eta-expanded form of IsCadlag.continuous_comp

              theorem IsCaglad.fun_continuous_comp {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} [TopologicalSpace Z] {g : Y → Z} (hf : IsCaglad f) (hg : Continuous g) :
              IsCaglad fun (x : X) => g (f x)

              Eta-expanded form of IsCaglad.continuous_comp

              theorem IsCadlag.continuous_comp₂ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} {T : Type u_4} [TopologicalSpace Z] [TopologicalSpace T] {g : X → Z} {φ : Y → Z → T} (hf : IsCadlag f) (hg : IsCadlag g) (hφ : Continuous (Function.uncurry φ)) :
              IsCadlag fun (x : X) => φ (f x) (g x)
              theorem IsCaglad.continuous_comp₂ {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {Z : Type u_3} {T : Type u_4} [TopologicalSpace Z] [TopologicalSpace T] {g : X → Z} {φ : Y → Z → T} (hf : IsCaglad f) (hg : IsCaglad g) (hφ : Continuous (Function.uncurry φ)) :
              IsCaglad fun (x : X) => φ (f x) (g x)
              theorem IsCadlag.mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag (f * g)
              theorem IsCadlag.add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag (f + g)
              theorem IsCadlag.fun_mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag fun (i : X) => f i * g i

              Eta-expanded form of IsCadlag.mul

              theorem IsCadlag.fun_add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag fun (i : X) => f i + g i

              Eta-expanded form of IsCadlag.add

              theorem IsCaglad.fun_mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad fun (i : X) => f i * g i
              theorem IsCaglad.add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad (f + g)
              theorem IsCaglad.mul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Mul Y] [ContinuousMul Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad (f * g)
              theorem IsCaglad.fun_add {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Add Y] [ContinuousAdd Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad fun (i : X) => f i + g i
              theorem IsCadlag.div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag (f / g)
              theorem IsCadlag.fun_sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag fun (i : X) => f i - g i

              Eta-expanded form of IsCadlag.sub

              theorem IsCadlag.fun_div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag fun (i : X) => f i / g i

              Eta-expanded form of IsCadlag.div'

              theorem IsCaglad.div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad (f / g)
              theorem IsCaglad.fun_sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad fun (i : X) => f i - g i
              theorem IsCaglad.sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad (f - g)
              theorem IsCaglad.fun_div' {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Div Y] [ContinuousDiv Y] (hf : IsCaglad f) (hg : IsCaglad g) :
              IsCaglad fun (i : X) => f i / g i
              theorem IsCadlag.sub {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f g : X → Y} [Preorder X] [TopologicalSpace Y] [Sub Y] [ContinuousSub Y] (hf : IsCadlag f) (hg : IsCadlag g) :
              IsCadlag (f - g)
              theorem IsCadlag.const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsCadlag f) :
              theorem IsCadlag.fun_const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsCadlag f) :
              IsCadlag fun (i : X) => c • f i

              Eta-expanded form of IsCadlag.const_smul

              theorem IsCaglad.const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsCaglad f) :
              theorem IsCaglad.fun_const_smul {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [SMul R Y] [ContinuousConstSMul R Y] (c : R) (hf : IsCaglad f) :
              IsCaglad fun (i : X) => c • f i
              theorem IsCaglad.fun_const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsCaglad f) :
              IsCaglad fun (i : X) => c +ᵥ f i
              theorem IsCadlag.fun_const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsCadlag f) :
              IsCadlag fun (i : X) => c +ᵥ f i
              theorem IsCadlag.const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsCadlag f) :
              theorem IsCaglad.const_vadd {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [Preorder X] [TopologicalSpace Y] {R : Type u_3} [VAdd R Y] [ContinuousConstVAdd R Y] (c : R) (hf : IsCaglad f) :

              The image of a set of a second-countable linear order under a right-continuous function is a separable space.

              The image of a set of a second-countable linear order under a left-continuous function is a separable space.

              The range of a right-continuous function on a second-countable linear order is separable.

              The range of a left-continuous function on a second-countable linear order is separable.

              theorem IsCadlag.isLocallyBounded {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [LinearOrder X] [PseudoMetricSpace Y] (hf : IsCadlag f) (x : X) :
              ∃ t ∈ nhds x, Bornology.IsBounded (f '' t)

              A càdlàg function is locally bounded.

              theorem IsCaglad.isLocallyBounded {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [LinearOrder X] [PseudoMetricSpace Y] (hf : IsCaglad f) (x : X) :
              ∃ t ∈ nhds x, Bornology.IsBounded (f '' t)

              A càglàd function is locally bounded.

              theorem isBounded_image_of_isCadlag_of_isCompact {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [LinearOrder X] [PseudoMetricSpace Y] (hf : IsCadlag f) {s : Set X} (hs : IsCompact s) :

              A càdlàg function maps compact sets to bounded sets.

              theorem isBounded_image_of_isCaglad_of_isCompact {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] {f : X → Y} [LinearOrder X] [PseudoMetricSpace Y] (hf : IsCaglad f) {s : Set X} (hs : IsCompact s) :

              A càglàd function maps compact sets to bounded sets.