Tomás Kisela

  • Citations Per Year
Learn More
and Applied Analysis 3 and define recursively a∇−nf t ∫ t a a∇−n 1f τ ∇τ 2.4 for n 2, 3, . . .. Then we have the following. Proposition 2.1 Nabla Cauchy formula . Let n ∈ Z , a, b ∈ T and let f : T → R be ∇-integrable on a, b ∩ T. If t ∈ T, a ≤ t ≤ b, then a∇−nf t ∫ t a ̂ hn−1 ( t, ρ τ ) f τ ∇τ . 2.5 Proof. This assertion can be proved by induction. If n 1,(More)
  • 1