73,503 research outputs found
Fourier Series Formalization in ACL2(r)
We formalize some basic properties of Fourier series in the logic of ACL2(r),
which is a variant of ACL2 that supports reasoning about the real and complex
numbers by way of non-standard analysis. More specifically, we extend a
framework for formally evaluating definite integrals of real-valued, continuous
functions using the Second Fundamental Theorem of Calculus. Our extended
framework is also applied to functions containing free arguments. Using this
framework, we are able to prove the orthogonality relationships between
trigonometric functions, which are the essential properties in Fourier series
analysis. The sum rule for definite integrals of indexed sums is also
formalized by applying the extended framework along with the First Fundamental
Theorem of Calculus and the sum rule for differentiation. The Fourier
coefficient formulas of periodic functions are then formalized from the
orthogonality relations and the sum rule for integration. Consequently, the
uniqueness of Fourier sums is a straightforward corollary.
We also present our formalization of the sum rule for definite integrals of
infinite series in ACL2(r). Part of this task is to prove the Dini Uniform
Convergence Theorem and the continuity of a limit function under certain
conditions. A key technique in our proofs of these theorems is to apply the
overspill principle from non-standard analysis.Comment: In Proceedings ACL2 2015, arXiv:1509.0552
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program
Computer programs may go wrong due to exceptional behaviors, out-of-bound
array accesses, or simply coding errors. Thus, they cannot be blindly trusted.
Scientific computing programs make no exception in that respect, and even bring
specific accuracy issues due to their massive use of floating-point
computations. Yet, it is uncommon to guarantee their correctness. Indeed, we
had to extend existing methods and tools for proving the correct behavior of
programs to verify an existing numerical analysis program. This C program
implements the second-order centered finite difference explicit scheme for
solving the 1D wave equation. In fact, we have gone much further as we have
mechanically verified the convergence of the numerical scheme in order to get a
complete formal proof covering all aspects from partial differential equations
to actual numerical results. To the best of our knowledge, this is the first
time such a comprehensive proof is achieved.Comment: N° RR-8197 (2012). arXiv admin note: text overlap with
arXiv:1112.179
Pincherle's theorem in Reverse Mathematics and computability theory
We study the logical and computational properties of basic theorems of
uncountable mathematics, in particular Pincherle's theorem, published in 1882.
This theorem states that a locally bounded function is bounded on certain
domains, i.e. one of the first 'local-to-global' principles. It is well-known
that such principles in analysis are intimately connected to (open-cover)
compactness, but we nonetheless exhibit fundamental differences between
compactness and Pincherle's theorem. For instance, the main question of Reverse
Mathematics, namely which set existence axioms are necessary to prove
Pincherle's theorem, does not have an unique or unambiguous answer, in contrast
to compactness. We establish similar differences for the computational
properties of compactness and Pincherle's theorem. We establish the same
differences for other local-to-global principles, even going back to
Weierstrass. We also greatly sharpen the known computational power of
compactness, for the most shared with Pincherle's theorem however. Finally,
countable choice plays an important role in the previous, we therefore study
this axiom together with the intimately related Lindel\"of lemma.Comment: 43 pages, one appendix, to appear in Annals of Pure and Applied Logi
An argument for psi-ontology in terms of protective measurements
The ontological model framework provides a rigorous approach to address the
question of whether the quantum state is ontic or epistemic. When considering
only conventional projective measurements, auxiliary assumptions are always
needed to prove the reality of the quantum state in the framework. For example,
the Pusey-Barrett-Rudolph theorem is based on an additional preparation
independence assumption. In this paper, we give a new proof of psi-ontology in
terms of protective measurements in the ontological model framework. The proof
does not rely on auxiliary assumptions, and also applies to deterministic
theories such as the de Broglie-Bohm theory. In addition, we give a simpler
argument for psi-ontology beyond the framework, which is only based on
protective measurements and a weaker criterion of reality. The argument may be
also appealing for those people who favor an anti-realist view of quantum
mechanics.Comment: 13 pages, no figures. Studies in History and Philosophy of Modern
Physics, Available online 17 August 201
- …