English
Related papers

Related papers: Weak K\"{o}nig's lemma implies the uniform continu…

200 papers

In this note we look at the interdependences between James' theorem and the boundary problem. To do so we show a variant of James' sup-theorem for C(K)-spaces conjectured by Godefroy: in order to know that a bounded weakly closed subset of…

Functional Analysis · Mathematics 2012-01-27 Hermann Pfitzner

We state and prove a version of Dyson's Lemma for a product of smooth projective varieties of arbitrary dimension using positivity methods.

Algebraic Geometry · Mathematics 2007-05-23 Markus Wessler

(i) We provide a short and simple proof of the first selection lemma. (ii) We also prove a selection lemma of a new type in $\Re^d$. For example, when $d=2$ assuming $n$ is large enough we prove that for any set $P$ of $n$ points in general…

Discrete Mathematics · Computer Science 2015-12-24 Alexandre Rok , Shakhar Smorodinsky

We show that for a fixed positive integer k one can efficiently decide if a finite algebra A admits a k-ary weak near unanimity operation by looking at the local behavior of the terms of A. We also observe that the problem of deciding if a…

Rings and Algebras · Mathematics 2021-02-12 Alexandr Kazda

We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak K\"onig's Lemma, and…

Logic · Mathematics 2014-08-14 Stephen Binns , Bjørn Kjos-Hanssen

The replacement (or collection or choice) axiom scheme asserts bounded quantifier exchange. We prove the independence of this scheme from various weak theories of arithmetic, sometimes under a complexity assumption.

Logic in Computer Science · Computer Science 2007-05-23 Stephen Cook , Neil Thapen

We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…

Logic in Computer Science · Computer Science 2025-10-14 Vasco Brattka , Hendrik Smischliaew

The purpose of this paper is to provide a proof of James' weak compactness theorem that is able to be taught in a first year graduate class in functional analysis.

Functional Analysis · Mathematics 2017-05-19 Warren B. Moors , Samuel White

A uniformly continuously integrable sequence of real-valued measurable functions, defined on some probability space, is relatively compact in the $\sigma(L^1,L^\infty)$ topology. In this paper, we link such a result to weak convergence…

Functional Analysis · Mathematics 2021-08-10 Gane Samb Lo , Aladji Babacar Niang

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

Logic · Mathematics 2020-01-27 Trevor M. Wilson

The diagonal lemma asserts that if a map of bisimplicial sets is a levelwise weak equivalence in the Kan-Quillen model structure, then it induces a weak equivalence of the diagonal simplicial sets. In this short note, we observe that the…

Algebraic Topology · Mathematics 2025-12-23 Daniel Carranza , Chris Kapulkin , Liang Ze Wong

A common statistical task lies in showing asymptotic normality of certain statistics. In many of these situations, classical textbook results on weak convergence theory suffice for the problem at hand. However, there are quite some…

Probability · Mathematics 2019-03-26 Viktor Bengs , Hajo Holzmann

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

Probability · Mathematics 2010-11-23 Jan Pachl

In this paper, a general hybrid fixed point theorem for the contractive mappings in generalized Banach spaces is proved via measure of weak non-compactness and it is further applied to fractional integral equations for proving the existence…

Functional Analysis · Mathematics 2024-01-17 Aref Jeribi , Najib Kaddachi , Zahra Laouar

The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…

Logic · Mathematics 2025-01-07 Alessandro Andretta , Lorenzo Notaro

We prove that the statement "there is a $k$ such that for every $f$ there is a $k$-bounded diagonally non-recursive function relative to $f$" does not imply weak K\"onig's lemma over $\mathrm{RCA}_0 + \mathrm{B}\Sigma^0_2$. This answers a…

Logic · Mathematics 2015-02-12 François G. Dorais , Jeffry L. Hirst , Paul Shafer

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…

We generalize the notion of an exact category and introduce weakly exact categories. A proof of the snake lemma in this general setting is given. Some applications are given to illustrate how one can do homological algebra in a weakly exact…

Category Theory · Mathematics 2009-01-19 Amir Jafari

We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais