Formalization Techniques for Asymptotic Reasoning in Classical Analysis - Archive ouverte HAL Access content directly
Journal Articles Journal of Formalized Reasoning Year : 2018

Formalization Techniques for Asymptotic Reasoning in Classical Analysis

(1) , (2) , (2)
1
2

Abstract

Formalizing analysis on a computer involves a lot of “epsilon-delta” reasoning, while informal reasoning may use some asymptotical hand-waving. Whether or not the arithmetic details are hidden using some abstraction like filters, a human user eventually has to break it down for the proof assistant anyway, and provide a witness for the existential variable “delta”. We describe formalization techniques that take advantage of existential variables to delay the input of witnesses until a stage where the proof assistant can actually infer them. We use these techniques to prove theorems about classical analysis and to provide equational Bachmann-Landau notations. This partially restores the simplicity of informal hand-waving without compromising the proof. As expected this also reduces the size of proof scripts and the time to write them, and it also makes proofs more stable.
Fichier principal
Vignette du fichier
8124-27375-1-PB.pdf (434.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01719918 , version 1 (28-02-2018)
hal-01719918 , version 2 (12-06-2018)
hal-01719918 , version 3 (30-10-2018)

Identifiers

  • HAL Id : hal-01719918 , version 3

Cite

Reynald Affeldt, Cyril Cohen, Damien Rouhling. Formalization Techniques for Asymptotic Reasoning in Classical Analysis. Journal of Formalized Reasoning, 2018. ⟨hal-01719918v3⟩
509 View
376 Download

Share

Gmail Facebook Twitter LinkedIn More