A Direct Proof of the Nekhoroshev Theorem for Nearly Integrable Symplectic Maps

We provide the direct proof of the Nekhoroshev theorem on the stability of nearly integrable analytic symplectic maps. Specifically, we prove the stability of the actions for a number of iterations which grows exponentially with an inverse power of the norm of the perturbation by conjugating the generating function of the map to suitable normal forms with exponentially small remainder.Communicated by Eduard Zehndersubmitted 16/06/03, accepted 31/03/04     

Typical ambiguity and elementary equivalence

A sentence of the usual language of set theory is said to be stratified if it is obtained by “erasing” type indices in a sentence of the language of Russell's Simple Theory of Types. In this paper we give an alternative presentation of a proof the ambiguity theorem stating that any provable stratified sentence has a stratified proof. To this end, we introduce a new set of ambiguity axioms, inspired by Fraïssé's characterization of elementary equivalence; these axioms can be naturally used to give different proofs of the ambiguity theorem (semantic or syntactic, classical or intuitionistic). MSC: 03B15, 03F50, 03F55.     

Stein Neighborhood Bases of Embedded Strongly Pseudoconvex Domains and Approximation of Mappings

In this paper we construct a Stein neighborhood basis for any compact subvariety A with strongly pseudoconvex boundary bA and Stein interior A \ bA in a complex space X. This is an extension of a well known theorem of Siu. When A is a complex curve, our result coincides with the result proved by Drinovec-Drnovšek and Forstnerič. We shall adapt their proof to the higher dimensional case, using also some ideas of Demailly’s proof of Siu’s theorem. For embedded strongly pseudoconvex domain in a complex manifold we also find a basis of tubular Stein neighborhoods. These results are applied to the approximation problem for holomorphic mappings. Research supported by grants ARRS (3311-03-831049), Republic of Slovenia.     

Some Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice

Dzik [2] gives a direct proof of the axiom of choice from the generalized Lindenbaum extension theorem LET. The converse is part of every decent logical education. Inspection of Dzik’s proof shows that its premise let attributes a very special version of the Lindenbaum extension property to a very special class of deductive systems, here called Dzik systems. The problem therefore arises of giving a direct proof, not using the axiom of choice, of the conditional . A partial solution is provided. Mathematics Subject Classification (2000): Primary 03B22; Secondary 03E25     

THE JUDGEMENT CALCULUS FOR INTUITIONISTIC LINEAR LOGIC: PROOF THEORY AND SEMANTICS

In this paper we propose a new set of rules for a judgement calculus, i.e. a typed lambda calculus, based on Intuitionistic Linear Logic; these rules ease the problem of defining a suitable mathematical semantics. A proof of the canonical form theorem for this new system is given: it assures, beside the consistency of the calculus, the termination of the evaluation process of every well-typed element. The definition of the mathematical semantics and a completeness theorem, that turns out to be a representation theorem, follow. This semantics is the basis to obtain a semantics for the evaluation process of every well-typed program. 1991 MSC: 03B20, 03B40.     

A formalization of Sambins's normalization for GL

Sambin [6] proved the normalization theorem (Hauptsatz) for GL, the modal logic of provability, in a sequent calculus version called by him GLS. His proof does not take into account the concept of reduction, commonly used in normalization proofs. Bellini [1], on the other hand, gave a normalization proof for GL using reductions. Indeed, Sambin's proof is a decision procedure which builds cut-free proofs. In this work we formalize this procedure as a recursive function and prove its recursiveness in an arithmetically formalizable way, concluding that the normalization of GL can be formalized in PA. MSC: 03F05, 03B35, 03B45.     

A generalization of Banchoff's triple point theorem

Consider an immersion of a surface into . Banchoff's theorem states that the parity of the number of triple points and the parity of the Euler characteristic of the surface coincide. Here we generalize this theorem to codimension 1 immersions of arbitrary even dimensional manifolds in spheres. The proof is an analogue of a proof of Banchoff's theorem circulated in preprint form due to R. Fenn and P. Taylor in 1977.

     

A new topological proof of the Abhyankar–Moh theorem

We present a new simple proof of the famous theorem of Abhyankar, Moh and Suzuki about rational curves in a plane. This proof relies on the Poincaré–Hopf theorem. This work was supported by Polish KBN Grant No 2 P03A 041 15Mathematics Subject Classification (2002):14E25.     

Hahn–Banach extension theorems for multifunctions revisited

Several generalizations of the Hahn–Banach extension theorem to K-convex multifunctions were stated recently in the literature. In this note we provide an easy direct proof for the multifunction version of the Hahn–Banach–Kantorovich theorem and show that in a quite general situation it can be obtained from existing results. Then we derive the Yang extension theorem using a similar proof as well as a stronger version of it using a classical separation theorem. Moreover, we give counterexamples to several extension theorems stated in the literature. Dedicated to Jean-Paul Penot with the occasion of his retirement.     

Stokes Cocycle and Differential Galois Groups

The classification of germs of ordinary linear differential systems with meromorphic coefficients at 0 under convergent gauge transformations and fixed normal form is essentially given by the non-Abelian 1-cohomology set of Malgrange–Sibuya. (Germs themselves are actually classified by a quotient of this set.) It is known that there exists a natural isomorphism h between a unipotent Lie group (called the Stokes group) and the 1-cohomology set of Malgrange–Sibuya; the inverse map which consists of choosing, in each cohomology class, a special cocycle called a Stokes cocycle is proved to be natural and constructive. We survey here the definition of the Stokes cocycle and give a combinatorial proof for the bijectivity of h. We state some consequences of this result, such as Ramis, density theorem in linear differential Galois theory; we note that such a proof based on the Stokes cocycle theorem and the Tannakian theory does not require any theory of (multi-)summation.     

A Complete Rewrite System and Normal Forms for (S) reg

The ( . ) _reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S) _reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J -order structure). We show that (S) _reg can be described by a rather simple complete string rewrite system , as a consequence of which we obtain a new proof of the normal form theorem for (S) _reg . The new proof of the normal form theorem is conceptually simpler than the previous proofs.     

Primitive recursive estimate of strong normalization for predicate calculus

The strong normalization theorem asserts that any sequence of reductions (standard steps of cut elimination) stops at an object in normal form, i.e., at an object to which further reductions are inapplicable. The most intuitive proofs of strong normalization for various systems, including first- and second-order arithmetic, use, essentially, the concept of hereditary normalizability of an object. This concept, for objects of unbounded complexity, cannot be expressed in the language of arithmetic, so that the proofs mentioned leave its domain. Howard's proof for arithmetic, using nonunique assignment of ordinals, apparently, can be modified so as to get a primitive recursive proof of strict normalizability for the -fragment of the intuitionistic predicate calculus, but the author of the present paper has not succeeded in overcoming the combinatorial difficulties. Our goal is to give an intuitive proof for the predicate calculus, from which one can extract a primitive recursive estimate of the number of reductions, and a proof in primitive recursive arithmetic of the fact that this estimate is proper. The proof of normalizability, that is, the construction of a special reduction sequence stopping at a normal term, is well known. In this sequence one first converts subterms of the highest levell, and first the innermost of them. (Corresponding to this, in the proof one can apply reduction with respect to level.) Here the number of convertible terms of maximal level, suitable for reduction, is lowered and the newly arising convertible terms have lower level.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 131–135, 1979.     

The Strength of Cartan's Version of Nevanlinna Theory

In 1933 Henri Cartan proved a fundamental theorem in Nevanlinnatheory, namely a generalization of Nevanlinna's second fundamentaltheorem. Cartan's theorem works very well for certain kindsof problems. Unfortunately, it seems that Cartan's theorem,its proof, and its usefulness, are not as widely known as theydeserve to be. To help give wider exposure to Cartan's theorem,the simple and general forms of the theorem are stated here.A proof of the general form is given, as well as several applicationsof the theorem. 2000 Mathematics Subject Classification 30D35.     

Where can we really prove instances of the Paris-Harrington principle?

A fundamental question in mathematical logic asks: What are the minimal assumptions and deduction principles required to prove a particular theorem? Now consider the special case of a theorem that can be established by checking a finite number of decidable cases — think of a single instance of the finite Ramsey theorem. In this particular situation the answer to our question is trivial: The theorem can be demonstrated by an explicit verification, thus without the use of any “strong” proof principles. This answer, however, is not very satisfying: An explicit verification may be unfeasible if there is an enormous number of cases to check. At the same time there might be a short and meaningful proof using stronger proof methods. Such a situation suggests a modified question: What are the minimal assumptions and deduction principles required for a reasonably short proof of the given theorem? Our contribution explores this question for instances of the Paris-Harrington principle. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on a theorem of Kanovei

We give a short proof of a theorem of Kanovei on separating induction and collection schemes for _n formulas using families of subsets of countable models of arithmetic coded in elementary end extensions.Mathematics Subject Classification (2000): 03C62     

On quantitative versions of theorems due to F.E. Browder and R. Wittmann

This paper is another case study in the program of logically analyzing proofs to extract new (typically effective) information (‘proof mining’). We extract explicit uniform rates of metastability (in the sense of T. Tao) from two ineffective proofs of a classical theorem of F.E. Browder on the convergence of approximants to fixed points of nonexpansive mappings as well as from a proof of a theorem of R. Wittmann which can be viewed as a nonlinear extension of the mean ergodic theorem. The first rate is extracted from Browder's original proof that is based on an application of weak sequential compactness (in addition to a projection argument). Wittmann's proof follows a similar line of reasoning and we adapt our analysis of Browder's proof to get a quantitative version of Wittmann's theorem as well. In both cases one also obtains totally elementary proofs (even for the strengthened quantitative forms) of these theorems that neither use weak compactness nor the existence of projections anymore. In this way, the present article also discusses general features of extracting effective information from proofs based on weak compactness. We then extract another rate of metastability (of similar nature) from an alternative proof of Browder's theorem essentially due to Halpern that already avoids any use of weak compactness. The paper is concluded by general remarks concerning the logical analysis of proofs based on weak compactness as well as a quantitative form of the so-called demiclosedness principle. In a subsequent paper these results will be utilized in a quantitative analysis of Baillon's nonlinear ergodic theorem.     

On Wainer's notation for a minimal subrecursive inaccessible ordinal

We show the following results on Wainer's notation for a minimal subrecursive inaccessible ordinal τ: First, we give a constructive proof of the collapsing theorem. Secondly, we prove that the slow-growing hierarchy and the fast-growing hierarchy up to τ have elementary properties on increase and domination, which completes Wainer's proof that τ is a minimal subrecursive inaccessible. Our results are obtained by showing a strong normalization theorem for the term structure of the notation. MSC: 03D20, 03F15.     

Relative Discrete Spectrum and Joinings

 A joining characterization of ergodic isometric extensions is given. We also give a simple joining proof of a relative version of the Halmos-von Neumann theorem. Research partly supported by KBN grant 2 P03A 002 14 (1998). Received June 5, 2001; in revised form March 4, 2002     

A short proof of a theorem of Birkhoff

This paper gives a new proof of a theorem of G. Birkhoff: Every group can be represented as the automorphism group of a distributive lattice D; if is finite, D can be chosen to be finite. The new proof is short, and it is easily visualized. Received November 3, 1995; accepted in final form October 3, 1996.     

On the characterization of complex Shimura varieties

In this paper we recall basic properties of complex Shimura varieties and show that they actually characterize them. This characterization immediately implies the explicit form of Kazhdan's theorem on the conjugation of Shimura varieties. It also implies the existence of unique equivariant models over the reflex field of Shimura varieties corresponding to adjoint groups and the existence of a p-adic uniformization of certain unitary Shimura varieties. In the appendix we give a modern formulation and a proof of Weil's descent theorem.