Nets and Reverse Mathematics, a pilot study

05/10/2019
by   Sam Sanders, et al.
0

Nets are generalisations of sequences involving possibly uncountable index sets; this notion was introduced about a century ago by Moore and Smith. They also established the generalisation to nets of various basic theorems of analysis due to Bolzano-Weierstrass, Dini, Arzela, and others. More recently, nets are central to the development of domain theory, providing intuitive definitions of the associated Scott and Lawson topologies, among others. This paper deals with the Reverse Mathematics study of basic theorems about nets. We restrict ourselves to nets indexed by subsets of Baire space, and therefore third-order arithmetic, as such nets suffice to obtain our main results. Over Kohlenbach's base theory of higher-order Reverse Mathematics, the Bolzano-Weierstrass theorem for nets implies the Heine-Borel theorem for uncountable covers. We establish similar results for other basic theorems about nets and even some equivalences, e.g. for Dini's theorem for nets. Finally, we show that replacing nets by sequences is hard, but that replacing sequences by nets can obviate the need for the Axiom of Choice, a foundational concern in domain theory. In an appendix, we study the power of more general index sets, establishing that the 'size' of a net is directly proportional to the power of the associated convergence theorem.

READ FULL TEXT
research
08/15/2019

Lifting countable to uncountable mathematics

Ordinary, i.e.non-set theoretic mathematics is generally formalised in s...
research
08/15/2019

Lifting recursive counterexamples to higher-order arithmetic

In classical computability theory, a recursive counterexample to a theor...
research
02/25/2021

Digital almost nets

Digital nets (in base 2) are the subsets of [0,1]^d that contain the exp...
research
09/21/2021

Perpetual Free-choice Petri nets are lucent – proof of a theorem of van der Aalst using CP-exhaustions

Van der Aalst's theorem is an important result for the analysis and synt...
research
06/12/2023

Analysis and Synthesis of Digital Dyadic Sequences

We explore the space of matrix-generated (0, m, 2)-nets and (0, 2)-seque...
research
03/09/2020

The open and clopen Ramsey theorems in the Weihrauch lattice

We investigate the uniform computational content of the open and clopen ...
research
01/07/2023

On the Weihrauch degree of the additive Ramsey theorem

We characterize the strength, in terms of Weihrauch degrees, of certain ...

Please sign up or login with your details

Forgot password? Click here to reset