Related papers: The reverse mathematics of Cousin's lemma
The smooth development of large parts of mathematics hinges on the idea that some sets are `small' or `negligible' and can therefore be ignored for a given purpose. The perhaps most famous smallness notion, namely `measure zero', originated…
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to…
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…
We prove two-sided inequalities between the integral moduli of smoothness of a function on $\mathbb{R}^d/\mathbb{T}^d$ and the weighted tail-type integrals of its Fourier transform/series. Sharpness of obtained results in particular is…
For a Gaussian process $X$ and smooth function $f$, we consider a Stratonovich integral of $f(X)$, defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on $X$ such that the sequence converges…
It is shown that the approximating functions used to define the Bochner integral can be formed using geometrically nice sets, such as balls, from a differentiation basis. Moreover, every appropriate sum of this form will be within a…
We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…
We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman's neat…
In the first part, we consider generalized quadratic Gauss sums as finite analogues of the Jacobi theta function, and the reciprocity law for Gauss sums as their transformation formula. We attach finite Dirichlet series to Gauss sums using…
Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…
A 1963 theorem of P. Cs\'aki and J. Fischer deals with the "maximal correlation coefficient" in the context of independent pairs of $\sigma$-fields on a probability space. Here a somewhat restricted "cousin" of their result is presented for…
We examine regularity and basis properties of the family of rescaled $p$-cosine functions. We find sharp estimates for their Fourier coefficients. We then determine two thresholds, $p_0<2$ and $p_1>2$, such that this family is a Schauder…
A Gauss-Lucas theorem is proved for multivariate entire functions, using a natural notion of separate convexity to obtain sharp results. Previous work in this area is mostly restricted to univariate entire functions (of genus no greater…
Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field…
The uniform Artin-Rees lemma has been proved by C. Huneke using algebraic methods. We give a new proof for this result in the analytic setting using residue calculus. We also have to introduce a type of product of complexes of vector…
An elementary application of Fatou's lemma gives a strengthened version of the monotone convergence theorem. We call this the convergence from below theorem. We make the case that this result should be better known, and deserves a place in…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the…
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…