Cycling in proofs and feasibility

There is a common perception by which small numbers are considered more concrete and large numbers more abstract. A mathematical formalization of this idea was introduced by Parikh (1971) through an inconsistent theory of feasible numbers in which addition and multiplication are as usual but for which some very large number is defined to be not feasible. Parikh shows that sufficiently short proofs in this theory can only prove true statements of arithmetic. We pursue these topics in light of logical flow graphs of proofs (Buss, 1991) and show that Parikh's lower bound for concrete consistency reflects the presence of cycles in the logical graphs of short proofs of feasibility of large numbers. We discuss two concrete constructions which show the bound to be optimal and bring out the dynamical aspect of formal proofs. For this paper the concept of feasible numbers has two roles, as an idea with its own life and as a vehicle for exploring general principles on the dynamics and geometry of proofs. Cycles can be seen as a measure of how complicated a proof can be. We prove that short proofs must have cycles.

     

More proofs of menger's theorem

Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph G if it holds for the graphs obtained from G by deleting and contracting the same edge. The other two prove the directed version of Menger's Theorem to be true for a finite digraph D if it is true for a digraph obtained by deleting an edge from D.     

A “from scratch” proof of a theorem of Rockafellar and Fulkerson

The theorem of this paper is of the same general class as Farkas' Lemma, Stiemke's Theorem, and the Kuhn—Fourier Theorem in the theory of linear inequalities. LetV be a vector subspace ofR ⁿ , and let intervalsI ¹,, I ⁿ of real numbers be prescribed. A necessary and sufficient condition is given for existence of a vector (x ¹ ,, x ⁿ ) inV such thatx ⁱ I ⁱ (i = 1, ,n); this condition involves the elementary vectors (nonzero vectors with minimal support) ofV . The proof of the theorem uses only elementary linear algebra.The author at present holds a Senior Scientist Award of the Alexander von Humboldt Stiftung.     

Analytic normal basis theorem

Let p be a prime number, ℚ _p the field of p-adic numbers, and a fixed algebraic closure of ℚ _p . We provide an analytic version of the normal basis theorem which holds for normal extensions of intermediate fields ℚ _p ⊆ K ⊆ L ⊆ .      

Geometric proofs of the two-dimensional Borsuk–Ulam theorem

We give two proofs of the two-dimensional Borsuk–Ulam theorem. One is completely elementary and does not use homology theory or the mapping degree, while the second one makes use of the recent theory of symplectic quasi-states.     

Geometric proofs of the two-dimensional Borsuk–Ulam theorem

We give two proofs of the two-dimensional Borsuk–Ulam theorem. One is completely elementary and does not use homology theory or the mapping degree, while the second one makes use of the recent theory of symplectic quasi-states.     

Three elementary proofs of the goldberg-straus theorem on numerical radii

Three elementary proofs of the positive definiteness of the A-numerical radius, as defined by Goldberg and Straus, are given and a stronger result concerning exterior powers is conjectured     

Alternative proofs of a theorem of Moyls and Marcus on the numerical range of a square matrix

Moyls and Marcus [4] showed that for n≤4,n×n an complex matrix A is normal if and only if the numerical range of A is the convex hull of the eigenvalues of A. When n≥5, there exist matrices which are not normal, but such that the numerical range is still the convex hull of the eigenvalues. Two alternative proofs of this fact are given. One proof uses the known structure of the numerical range of a 2×2 matrix. The other relies on a theorem of Motzkin and Taussky stating that a pair of Hermitian matrices with property L must commute.     

Semigroup-theoretic proofs of the central limit theorem and other theorems of analysis

The theory of one parameter semigroups of bounded linear operators on Banach spaces has deep and far reaching applications to partial differential equations and Markov processes. Here we present some known elementary applications of operator semigroups to approximation theory, a new proof of the central limit theorem, and we give E. Nelson's rigorous interpretation of Feynman integrals. Our main tools are (i) a special case of the Trotter-Neveu-Kato approximation theorem, of which we give a new elementary proof, and (ii) P. Chernoff's product formula.     

On proofs of the general density theorem

We show that if is a compact manifold, then there is a residual subset of the set of homeomorphisms on with the property that if , then the periodic points of are dense in its chain recurrent set. This result was first announced in [4], but a flaw in that argument was noted in [1], where a different proof was given. It was recently noted in [5] that this new argument only serves to show that the density of periodic points in the chain recurrent set is generic in the closure of the set of diffeomorphisms. We show how to patch the original argument from [4] to prove the result.

     

Analytic completeness theorem for singular biprobability models

The aim of the paper is to prove tha analytic completeness theorem for a logic L(∫₁, ∫₂)_A^s with two integral operators in the singular case. The case of absolute continuity was proved in [4]. MSC: 03B48, 03C70.     

Simple proofs and extensions of a result of L. D. Pustylnikov on the nonautonomous Siegel theorem

We present simple proofs of a result of L.D. Pustylnikov extending to nonautonomous dynamics the Siegel theorem of linearization of analytic mappings. We show that if a sequence f _n of analytic mappings of C ^d has a common fixed point f _n (0) = 0, and the maps f _n converge to a linear mapping A∞ so fast that

$$\sum\limits_n {{{\left\| {{f_m} - {A_\infty }} \right\|}_{L\infty \left( B \right)}} < \infty } $$

$${A_\infty } = diag\left( {{e^{2\pi i{\omega _1}}},...,{e^{2\pi i{\omega _d}}}} \right)\omega = \left( {{\omega _1},...,{\omega _q}} \right) \in {\mathbb{R}^d},$$

then f _n is nonautonomously conjugate to the linearization. That is, there exists a sequence h _n of analytic mappings fixing the origin satisfying

$${h_{n + 1}} \circ {f_n} = {A_\infty }{h_n}.$$

The key point of the result is that the functions hn are defined in a large domain and they are bounded. We show that

$${\sum\nolimits_n {\left\| {{h_n} - Id} \right\|} _{L\infty (B)}} < \infty .$$

We also provide results when f _n converges to a nonlinearizable mapping f∞ or to a nonelliptic linear mapping. In the case that the mappings f _n preserve a geometric structure (e. g., symplectic, volume, contact, Poisson, etc.), we show that the hn can be chosen so that they preserve the same geometric structure as the f _n . We present five elementary proofs based on different methods and compare them. Notably, we consider the results in the light of scattering theory. We hope that including different methods can serve as an introduction to methods to study conjugacy equations.

     

The Atiyah-Singer index theorem for families of Dirac operators: Two heat equation proofs

Summary The purpose of this paper is to give two heat equation proofs of the Index Theorem of Atiyah-Singer for a family of Dirac operators.