Related papers: A visual and simple proof for the Picard Little Th…
In the context of the complex-analytic structure within the open unit disk, that was established in a previous paper, here we establish a simple generalization of the Cauchy-Goursat theorem of complex analytic functions. We do this first…
In this paper, we want to study the link between the presence of compact objects with some analytic structure and the global geometry of a weakly complete surface. We begin with a brief survey of some now classic results on the local…
We prove several cases of Zimmer's conjecture for actions of higher-rank cocompact lattices on low dimensional manifolds. For example, if $\Gamma$ is a cocompact lattice in $\mathrm{Sl}(n, \mathbb R)$, $M$ is a compact manifold, and…
We extend and improve the result of Makkai and Par\'e that the powerful image of any accessible functor F is accessible, assuming there exists a sufficiently large strongly compact cardinal. We reduce the required large cardinal assumption…
(i) We provide a short and simple proof of the first selection lemma. (ii) We also prove a selection lemma of a new type in $\Re^d$. For example, when $d=2$ assuming $n$ is large enough we prove that for any set $P$ of $n$ points in general…
Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
The nonlinear concepts of mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type…
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…
The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph $G$. A graph $G$ is called \emph{perfect} if $\chi(H)=\omega(H)$ for…
Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
This note is purely expository. The statement of the Gauss theorem on the constructibility of regular polygons by means of compass and ruler is simple and well-known. However, its proofs given in most textbooks rely upon much unmotivated…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…
An abstract simplicial complex is said to be $d$-representable if it records the intersection pattern of a collection of convex sets in $\mathbb{R}^d$. In this paper, we show that $d$-representability of a simplicial complex is equivalent…
A compact subset $K$ of the complex plane $\C$ is a set of polynomial (respectively rational) approximation if $P(K)=A(K)$ (respectively $R(K)=A(K)$), where $P(K)$ (respectively $R(K)$) is the family of functions on $K$ which are uniform…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…