Related papers: A visual and simple proof for the Picard Little Th…

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

An analog of Picard's little theorem for entire functions of matrices is proved.

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

For an upper semi-continuous set-valued mapping from one topological space to another and for a lower semi-continuous function defined on the product of these spaces, Berge's theorem states lower semi-continuity of the minimum of this…

The article introduces Ahlfors' generalization of the Schwarz lemma. With this powerful geometric tool of complex functions in one variable, we are able to prove some theorems concerning the size of images under holomorphic mappings,…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.

In this short note we give a proof of Liouville's theorem (every bounded entire complex function is constant) following Peterzil and Starchenko's approach to complex analysis via o-minimality.

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…

In one complex variable it is well known that if we consider the family of all holomorphic functions on the unit disc that fix the origin and with first derivative equal to 1 at the origin, then there exists a constant $\rho$, independent…

In this article, we study the Lipschitz Geometry at infinity of complex analytic sets and we obtain results on algebraicity of analytic sets and on Bernstein's problem. Moser's Bernstein Theorem says that a minimal hypersurface which is a…

Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…

This article shows a very elementary and straightforward proof of the Implicit Function Theorem for differentiable maps $F(x,y)$ defined on a finite-dimensional Euclidean space. There are no hypothesis on the continuity of the partial…

In 1994 J. Lewis obtained a purely harmonic proof of the classical Little Picard Theorem by showing that if the joint value distribution of two entire harmonic functions satisfies certain restrictions then they are necessarily constant. We…

The aim of this note is to give a quick algebraic proof of (the combinatorial part of) the classification theorem for compact real surfaces, whose classical proofs (as in the Massey book and in the Conway ZIP proof) are based on surgery…

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…

These lecture notes present a computation driven pathway from classical complex analysis to the theory of compact Riemann surfaces and their connections to algebraic geometry. The exposition follows a compute first then abstract philosophy,…

Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…

A problem of completing a linear map on C*-algebras to a completely positive map is analyzed. It is shown that whenever such a completion is feasible there exists a unique minimal completion. This theorem is used to show that under some…