English
Related papers

Related papers: Lebesgue integration. Detailed proofs to be formal…

200 papers

We establish optimal convergence rates for the continuous piecewise affine finite element approximation of the Sobolev constant in arbitrary dimensions N\geq 2 and for Lebesgue exponents 1<p<N. Our analysis relies on a refined study of the…

Numerical Analysis · Mathematics 2026-05-28 Liviu I. Ignat , Enrique Zuazua

We exhibit differential geometric structures that arise in numerical methods, based on the construction of Cauchy sequences, that are currently used to prove explicitly the existence of weak solutions to functional equations. We describe…

Functional Analysis · Mathematics 2020-08-13 Jean-Pierre Magnot

We introduce Besov spaces with variable smoothness and integrability by using the continuous version of Calder\`on reproducing formula. We show that our space is well-defined, i.e., independent of the choice of basis functions. We…

Functional Analysis · Mathematics 2017-11-27 Douadi Drihem

Assurance cases are often required as a means to certify a critical system. Use of formal methods in assurance can improve automation, and overcome problems with ambiguity, faulty reasoning, and inadequate evidentiary support. However,…

Logic in Computer Science · Computer Science 2019-05-16 Yakoub Nemouchi , Simon Foster , Mario Gleirscher , Tim Kelly

Recent advancements in finite element methods allows for the implementation of mesh cells with curved edges. In the present work, we develop the tools necessary to employ multiply connected mesh cells, i.e. cells with holes, in planar…

Numerical Analysis · Mathematics 2023-03-15 Jeffrey S. Ovall , Samuel E. Reynolds

Obtaining explicit stability estimates in classical functional inequalities like the Sobolev inequality has been an essentially open question for 30 years, after the celebrated but non-constructive result of G. Bianchi and H. Egnell in…

Analysis of PDEs · Mathematics 2025-09-23 Jean Dolbeault

This text grew out of notes I have used in teaching a one quarter course on integration at the advanced undergraduate level. My intent is to introduce the Lebesgue integral in a quick, and hopefully painless, way and then go on to…

Classical Analysis and ODEs · Mathematics 2009-08-10 John Franks

A convincing feature of least-squares finite element methods is the built-in a posteriori error estimator for any conforming discretization. In order to generalize this property to discontinuous finite element ansatz functions, this paper…

Numerical Analysis · Mathematics 2025-02-18 Philipp Bringmann

We develop a theory of BV and Sobolev Spaces via integration by parts formula in abstract metric spaces; the role of vector fields is played by Weaver's metric derivations. The definition hereby given is shown to be equivalent to many…

Metric Geometry · Mathematics 2014-09-22 Simone Di Marino

We study Lebesgue integration of sums of products of globally subanalytic functions and their logarithms, called constructible functions. Our first theorem states that the class of constructible functions is stable under integration. The…

Algebraic Geometry · Mathematics 2019-12-19 Raf Cluckers , Daniel J. Miller

Functions in a Sobolev space are approximated directly by piecewise affine interpolation in the norm of the space. The proof is based on estimates for interpolations and does not rely on the density of smooth functions.

Functional Analysis · Mathematics 2014-11-11 Jean Van Schaftingen

By a reduction method, the limiting weak-type behaviors of factional maximal operators and fractional integrals are established without any smoothness assumption on the kernel, which essentially improve and extend previous results. As a…

Classical Analysis and ODEs · Mathematics 2020-09-15 Guoping Zhao , Weichao Guo

The use of formal methods provides confidence in the correctness of developments. Yet one may argue about the actual level of confidence obtained when the method itself -- or its implementation -- is not formally checked. We address this…

Logic in Computer Science · Computer Science 2009-02-24 Eric Jaeger , Catherine Dubois

In this article, we conduct a detailed study of \emph{finitely additive measures} (fams) in the context of Boolean algebras, focusing on three specific topics: freeness and approximation, existence and extension criteria, and integration…

Logic · Mathematics 2025-12-15 Miguel A. Cardona , Diego A. Mejía , Andrés F. Uribe-Zapata

We consider the pointwise approximation of a subharmonic function by the logarithm of the modulus of an entire function up to a bounded quantity. In the case of finite order an estimate from below of the planar Lebesgue measure of an…

Complex Variables · Mathematics 2010-01-08 Markiyan Hirnyk

The ever-growing complexity of mathematical proofs makes their manual verification by mathematicians very cognitively demanding. Autoformalization seeks to address this by translating proofs written in natural language into a formal…

Computation and Language · Computer Science 2023-01-06 Garett Cunningham , Razvan C. Bunescu , David Juedes

This paper introduces first order Sobolev spaces on certain rectifiable varifolds. These complete locally convex spaces are contained in the generally nonlinear class of generalised weakly differentiable functions and share key functional…

Classical Analysis and ODEs · Mathematics 2017-05-25 Ulrich Menne

Component-based design paradigm is of paramount importance due to prolific growth in the complexity of modern-day systems. Since the components are developed primarily by multi-party vendors and often assembled to realize the overall…

Software Engineering · Computer Science 2022-05-31 Aritra Hazra

We present an approach to solid-state electronic-structure calculations based on the finite-element method. In this method, the basis functions are strictly local, piecewise polynomials. Because the basis is composed of polynomials, the…

Condensed Matter · Physics 2009-10-31 J. E. Pask , B. M. Klein , C. Y. Fong , P. A. Sterne

Reliable verification of proofs remains a bottleneck for training and evaluating AI systems on hard mathematical reasoning. Fully formal proofs, in languages like Lean, are easy to verify because they are unambiguous and modular. Most…

Logic in Computer Science · Computer Science 2026-05-21 Slim Barkallah , Luke Bailey , Kaiyue Wen , Mohammed Abouzaid , Tengyu Ma