Decidability and Specker sequences in intuitionistic mathematics

A bounded monotone sequence of reals without a limit is called a Specker sequence. In Russian constructive analysis, Church's Thesis permits the existence of a Specker sequence. In intuitionistic mathematics, Brouwer's Continuity Principle implies it is false that every bounded monotone sequence of real numbers has a limit. We claim that the existence of Specker sequences crucially depends on the properties of intuitionistic decidable sets. We propose a schema (which we call ED ) about intuitionistic decidability that asserts “there exists an intuitionistic enumerable set that is not intuitionistic decidable” and show that the existence of a Specker sequence is equivalent to ED . We show that ED is consistent with some certain well known axioms of intuitionistic analysis as Weak Continuity Principle, bar induction, and Kripke Schema. Thus, the assumption of the existence of a Specker sequence is conceivable in intuitionistic analysis. We will also introduce the notion of double Specker sequence and study the existence of them (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On local non‐compactness in recursive mathematics

A metric space is said to be locally non‐compact if every neighborhood contains a sequence that is eventually bounded away from every element of the space, hence contains no accumulation point. We show within recursive mathematics that a nonvoid complete metric space is locally non‐compact iff it is without isolated points. The result has an interesting consequence in computable analysis: If a complete metric space has a computable witness that it is without isolated points, then every neighborhood contains a computable sequence that is eventually computably bounded away from every computable element of the space. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Kronecker’s density theorem and irrational numbers in constructive reverse mathematics

To prove Kronecker’s density theorem in Bishop-style constructive analysis one needs to define an irrational number as a real number that is bounded away from each rational number. In fact, once one understands “irrational” merely as “not rational”, then the theorem becomes equivalent to Markov’s principle. To see this we undertake a systematic classification, in the vein of constructive reverse mathematics, of logical combinations of “rational” and “irrational” as predicates of real numbers.     

The anti‐Specker property,positivity, and total boundedness

Working within Bishop‐style constructive mathematics, we examine some of the consequences of the anti‐Specker property, known to be equivalent to a version of Brouwer's fan theorem. The work is a contribution to constructive reverse mathematics (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Étude constructive de problèmes de topologie pour les réels irrationnels

We study in a constructive manner some problems of topology related to the set Irr of irrational reals. The constructive approach requires a strong notion of an irrational number; constructively, a real number is irrational if it is clearly different from any rational number. We show that the set Irr is one-to-one with the set Dfc of infinite developments in continued fraction (dfc). We define two extensions of Irr, one, called Dfc₁, is the set of dfc of rationals and irrationals preserving for each rational one dfc, the other, called Dfc₂, is the set of dfc of rationals and irrationals preserving for each rational its two dfc. We introduce six natural distances over Irr wich we denote by d_fc0, d_fc1, d_fc2, d, d_mir and d_cut. We show that only the four distances d_fco, d_fc1, d and d_mir among the six make Irr a complete metric space. The last distances define in Irr the same topology in a constructive sens. We study further the set Dfc₁ in which we show that the irrationals constitute a closed subset. Finally, we make a particular study of the completion Dfc₂ of Dfc for the two equivalent metrics d_fc2 and d_cut.     

A fan-theoretic equivalent of the antithesis of Specker's theorem

The antithesis of Specker's theorem states that every sequence eventually hounded away from each point of [0,1] is eventually bounded away from [0,1]. We show constructively (that is, with intuitionistic logic) that this is equivalent to a version of the fan theorem.     

The Kripke schema in metric topology

A form of Kripke's schema turns out to be equivalent to each of the following two statements from metric topology: every open subspace of a separable metric space is separable; every open subset of a separable metric space is a countable union of open balls. Thus Kripke's schema serves as a point of reference for classifying theorems of classical mathematics within Bishop‐style constructive reverse mathematics.     

The point of continuity property in Banach spaces not containing ℓ<Subscript>1</Subscript>

We obtain a local characterization of the point of continuity property for bounded subsets in Banach spaces not containing basic sequences equivalent to the standard basis of ℓ₁ and, as a consequence, we deduce that, in Banach spaces with a separable dual, every closed, bounded, convex and nonempty subset failing the point of continuity property contains a further subset which can be seen inside the set of Borel regular probability measures on the Cantor set in a weak-star dense way. Also, we characterize in terms of trees the point of continuity property of Banach spaces not containing ℓ₁, by proving that a Banach space not containing ℓ₁ satis- fies the point of continuity property if, and only if, every seminormalized weakly null tree has a boundedly complete branch.     

Banach空间中Reich-Takahashi迭代法的强收敛定理

设E是具有一致正规结构的实Banach空间,其范数是一致Gateaux可微的;设D是E的非空有界闭凸子集,T:D→D是渐近非扩张映象.本文证明了,在一些适当的条件下,由修正的Reich-Takahashi迭代法(1.2)式所定义的序列{xn}强收敛到渐近非扩张映象的不动点,其中x0是D中一任给点,{αn},{β}是区间[0,1]中满足某些限制的实数列.     

Chebyshev Centers that are Not Farthest Points

In this paper, we address the question whether in a given Banach space, a Chebyshev center of a nonempty bounded subset can be a farthest point of the set. We obtain a characterization of two-dimensional real strictly convex spaces as those ones where a Chebyshev center cannot contribute to the set of farthest points of a subset. In dimension greater than two, every non-Hilbert smooth space contains a subset whose Chebyshev center is a farthest point. We explore the scenario in uniformly convex Banach spaces and further study the roles played by centerability and Mcompactness in the scheme of things to obtain a step by step characterization of strictly convex Banach spaces.     

Compactness under constructive scrutiny

How are the various classically equivalent definitions of compactness for metric spaces constructively interrelated? This question is addressed with Bishop‐style constructive mathematics as the basic system – that is, the underlying logic is the intuitionistic one enriched with the principle of dependent choices. Besides surveying today's knowledge, the consequences and equivalents of several sequential notions of compactness are investigated. For instance, we establish the perhaps unexpected constructive implication that every sequentially compact separable metric space is totally bounded. As a by‐product, the fan theorem for detachable bars of the complete binary fan proves to be necessary for the unit interval possessing the Heine‐Borel property for coverings by countably many possibly empty open balls. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on the axiomatisation of real numbers

Is it possible to give an abstract characterisation of constructive real numbers? A condition should be that all axioms are valid for Dedekind reals in any topos, or for constructive reals in Bishop mathematics. We present here a possible first‐order axiomatisation of real numbers, which becomes complete if one adds the law of excluded middle. As an application of the forcing relation defined in [3, 2], we give a proof that the formula which specifies the maximum function is not provable in this theory. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Locating subsets of a normed space

Within the framework of Bishop's constructive mathematics, we give conditions under which a bounded convex subset of a uniformly smooth normed space over is located, extending results presented recently by F. Richman and H. Ishihara for subsets of a Hilbert space.

     

Frames and the Feichtinger conjecture

We show that the conjectured generalization of the Bourgain-Tzafriri restricted-invertibility theorem is equivalent to the conjecture of Feichtinger, stating that every bounded frame can be written as a finite union of Riesz basic sequences. We prove that any bounded frame can at least be written as a finite union of linearly independent sequences. We further show that the two conjectures are implied by the paving conjecture. Finally, we show that Weyl-Heisenberg frames over rational lattices are finite unions of Riesz basic sequences.

     

Locatedness and overt sublocales

Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to be fundamental in constructive locale theory. We show that the two notions are intimately connected.Bishop defines a metric space to be compact if it is complete and totally bounded. A subset of a totally bounded set is again totally bounded iff it is located. So a closed subset of a Bishop compact set is Bishop compact iff it is located. We translate this result to formal topology. ‘Bishop compact’ is translated as compact and overt. We propose a definition of locatedness on subspaces of a formal topology, and prove that a closed subspace of a compact regular formal space is located iff it is overt. Moreover, a Bishop-closed subset of a complete metric space is Bishop compact — that is, totally bounded and complete — iff its localic completion is compact overt.Finally, we show by elementary methods that the points of the Vietoris locale of a compact regular locale are precisely its compact overt sublocales.We work constructively, predicatively and avoid the use of the axiom of countable choice.     

Locatedness and overt sublocales

Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to be fundamental in constructive locale theory. We show that the two notions are intimately connected.Bishop defines a metric space to be compact if it is complete and totally bounded. A subset of a totally bounded set is again totally bounded iff it is located. So a closed subset of a Bishop compact set is Bishop compact iff it is located. We translate this result to formal topology. ‘Bishop compact’ is translated as compact and overt. We propose a definition of locatedness on subspaces of a formal topology, and prove that a closed subspace of a compact regular formal space is located iff it is overt. Moreover, a Bishop-closed subset of a complete metric space is Bishop compact — that is, totally bounded and complete — iff its localic completion is compact overt.Finally, we show by elementary methods that the points of the Vietoris locale of a compact regular locale are precisely its compact overt sublocales.We work constructively, predicatively and avoid the use of the axiom of countable choice.     

Constructive Order Theory

We introduce the notion of constructive suprema and of constructively directed sets. The Axiom of Choice turns out to be equivalent to the postulate that every supremum is constructive, but also to the hypothesis that every directed set admits a function assigning to each finite subset an upper bound. The Axiom of Multiple Choice (which is known to be weaker than the full Axiom of Choice in set theory without foundation) implies a simple set‐theoretical induction principle (SIP), stating that any system of sets that is closed under unions of well‐ordered subsystems and contains all finite subsets of a given set must also contain that set itself. This is not provable without choice principles but equivalent to the statement that the existence of joins for constructively directed subsets of a poset follows from the existence of joins for nonempty well‐ordered subsets. Moreover, we establish the equivalence of SIP with several other fundamental statements concerning inductivity, compactness, algebraic closure systems, and the exchange between chains and directed sets.     

On the Action of a Linear Operator over Sequences in a Banach Space

In this paper we study the action of a bounded linear operator over different kinds of sequences of a Banach space. Our work is mainly devoted to minimal and M - basic sequences. Plans and García Castellón have characterized the boundedness of a linear operator T by requiring the minimality of any sequence whose image is a minimal sequence (e.g. [P, 1969], [GC, 1990]). We extend these results to other types of sequences like M-basic, basic, strong M-basic, etc., We are also interested on conditions that ensure the minimality of the image of a given minimal sequence. Thus in Corollary 3.7 we characterize semi - Fredholm operators as those which transform every p-minimal sequence into q-minimal. In the last section we deal with M - basis whose image is M - basis or norming M - basis or basis or in general the “best” possible sequence.     

Almost convergence and a core theorem for double sequences

The idea of almost convergence was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define the M-core for double sequences and determine those four dimensional matrices which transform every bounded double sequence x=[x_jk] into one whose core is a subset of the M-core of x.