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 quasinilpotent operators

In this note we modify a new technique of Enflo for producing hyperinvariant subspaces to obtain a much improved version of his ``two sequences' theorem with a somewhat simpler proof. As a corollary we get a proof of the ``best' theorem (due to V. Lomonosov) known about hyperinvariant subspaces for quasinilpotent operators that uses neither the Schauder-Tychonoff fixed point theorem nor the more recent techniques of Lomonosov.

     

Decomposition theorems

The countable-decomposition theorem for linear functionals has become a useful tool in the theory of representing measures (see [4–7]). The original proof of this theorem was based on a rather involved study of extreme points in the state space of a convex cone. Recently M. Neumann [9] gave an independent proof using a refined form of Simons convergence lemma and Choquet's theorem. In this paper a (relatively) short proof of an extension (to a more abstract situation) of the countable-decomposition theorem is given. Furthermore a decomposition criterion is obtained which even works in the case when not all states are decomposable. All the work is based on a complete characterization of those states which are partially decomposable with respect to a given sequence of sublinear functionals.     

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 Simpler Proof of the Excluded Minor Theorem for Higher Surfaces

We give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a graph which is minimal of genusgcannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson–Seymour theory, we obtain a simpler proof of the generalized Kuratowski theorem for each fixed surface. The proof requires no previous knowledge of graph embeddings.     

二阶Volterra系统对平稳正态激励的统计响应的表示定理的数学证明

1974年,Neal根据Kac和Siegert的思想,给出了一个在电子工程、海洋工程、建筑工程、航空工程、自动控制的随机振动中有重要应用的二阶Volterra非线性系统对平稳正态输入的统计响应的表示定理.1984年,Naess对此定理又给出了一个数学证明.经过研究后发现,他们对定理条件的叙述都是模糊的,而且其数学证明都是有问题的.本文重新讨论了这个表示定理,给出了明确的定理条件及严格的数学证明,为它的广泛应用奠定了理论基础.     

Existence of solution of the logarithmic diffusion equation with bounded above Gauss curvature

We give a simple proof of an extension of the existence results of Ricci flow of Giesen and Topping (2010, 2011) [15], [20], on incomplete surfaces with bounded above Gauss curvature without using the difficult Shi’s existence theorem of Ricci flow on complete non-compact surfaces and the pseudolocality theorem of Perelman [7] on Ricci flow. We will also give a simple proof of a special case of the existence theorem of Topping (2010) [16] without using the existence theorem of Shi (1989) [9].     

Some remarks on Arslan’s 2011 paper

It is shown that the main theorem of Arslan’s paper (Theorem 2, 2011), as stated, is incorrect. Under additional conditions, we present a short proof of the corrected version of the theorem. We also give a proof of a theorem of Rao and Shanbhag (1991) [2], employed by Arslan, without the use of the Kolmogorov Consistency Theorem.     

Selections and topological convexity

A simple natural proof of van de Vel's selection theorem for topological convex structures is given. The technique developed to achieve this proof allows to give also a direct simple proof of the classical Michael's selection theorem in Fréchet spaces, and the Horvath's selection theorem in metric l.c.-spaces.     

Generalized Kneser coloring theorems with combinatorial proofs

The Kneser conjecture (1955) was proved by Lovász (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions. Only in 2000, Matoušek provided the first combinatorial proof of the Kneser conjecture. Here we provide a hypergraph coloring theorem, with a combinatorial proof, which has as special cases the Kneser conjecture as well as its extensions and generalization by (hyper)graph coloring theorems of Dol’nikov, Alon-Frankl-Lovász, Sarkaria, and Kriz. We also give a combinatorial proof of Schrijver’s theorem. Oblatum 17-IV-2001 & 12-IX-2001?Published online: 19 November 2001 An erratum to this article is available at .     

Tauberian Theorem of Erdős Revisited

Dedicated to the memory of Paul Erdős In connection with the elementary proof of the prime number theorem, Erdős obtained a striking quadratic Tauberian theorem for sequences. Somewhat later, Siegel indicated in a letter how a powerful "fundamental relation" could be used to simplify the difficult combinatorial proof. Here the author presents his version of the (unpublished) Erdős–Siegel proof. Related Tauberian results by the author are described. Received December 20, 1999     

An elementary geometric nonstandard proof of the Jordan curve theorem

We give an elementary proof, using nonstandard analysis, of the Jordan curve theorem. We also give a nonstandard generalization of the theorem. The proof is purely geometrical in character, without any use of topological concepts and is based on a discrete finite form of the Jordan theorem, whose proof is purely combinatorial.Some familiarity with nonstandard analysis is assumed. The rest of the paper is self-contained except for the proof a discrete standard form of the Jordan theorem. The proof is based on hyperfinite approximations to regions on the plane.Research of the first author partially supported by FONDECYT Grant # 91-1208 and of the second author, by FONDECYT Grant # 90-0647.     

On pairs of multidimensional matrices

Recently Bapat applied a topological theorem of Kronecker and generalized a theorem of Sinkhorn on positive matrices. Here we give an alternative proof of a slightly stronger version of his generalization. This proof combines Kakutani's fixed point theorem and the duality theorem of linear programming and gives yet another proof of a theorem of Bacharach and Menon on pairs of nonnegative matrices.     

A constructive proof of the Peter‐Weyl theorem

We present a new and constructive proof of the Peter‐Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C*‐algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the characters of a finite group. We use this proof as a basis for a constructive proof in the style of Bishop. In fact, the present theory of compact groups may be seen as a natural continuation in the line of Bishop's work on locally compact, but Abelian, groups [2]. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Crowns and centralizers of chief factors of finite groups

We give a new proof of Vaserstein’s Pre-stabilization theorem. This theorem describes GL_n (A) ? E(A) when n is just below the stable range for GL_m (A)/E_m (A) The new proof works only for commutative rings (or ideals in such rings) but it does not need assumptions on Krull dimension, like the old proofs did. All one needs is the relevant stable range con-dition. The new ideas in the proof come from Vaserstein’s recent treatment of the case n = 2. (See preceding paper).     

A discrete four vertex theorem

A discrete four vertex theorem is proved for a general plane polygon using a method of proof that also yields a proof, that appears to be new, for the classical four vertex theorem.     

A new proof of the support theorem and the range characterization for the Radon transform

The aim of this note is to give a new and elementary proof of the support theorem for the Radon transform, which is based only on the projection theorem and the Paley-Wiener theorem for the Fourier transform. The idea is to solve a certain system of linear equations in order to determine the coefficients of a homogeneous polynomial (interpolation problem). By the same method, we get a short proof of the range characterization for Radon transforms of functions supported in a ball.     

An alternative proof of Pellet’s theorem for matrix polynomials

We propose an alternative proof of Pellet’s theorem for matrix polynomials that, unlike existing proofs, does not rely on Rouché’s theorem. A similar proof is provided for the generalization to matrix polynomials of a result by Cauchy that can be considered as a limit case of Pellet’s theorem.     

Conjugate and conformally conjugate parallelisms on Finsler manifolds

In this paper we study conjugate parallelisms and their conformal changes on Finsler manifolds. We provide sufficient conditions for a Finsler manifold endowed with two conjugate (resp. conformally conjugate) covering parallelisms to become a Berwald (resp. Wagner) manifold. As an application for Lie groups, we give a new proof for a theorem of Latifi and Razavi about bi-invariant Finsler functions being Berwald. By introducing the concept of a conformal change of a parallelism, we also obtain a conceptual proof of a theorem of Hashiguchi and Ichijyō: the class of generalized Berwald manifolds is closed under conformal change.