Rep#2: An algebraic proof of an analytic lemma
نویسنده
چکیده
There is a rule of thumb that in 90% of all cases when a proof in algebra or combinatorics seems to use analysis, this use can be easily avoided. For example, when a proof of a combinatorial identity uses power series, it is in most cases enough to replace the words ”power series” by ”formal power series”, and there is no need anymore to worry about issues of convergence and well-definedness. When a proof of an algebraic fact works in the field C, it will in most cases work just as well in the algebraic closure of Q, or in any algebraically closed field of characteristic zero, and sometimes even the ”algebraically closed” condition can be lifted, and it is enough to consider a sufficiently large finite algebraic extension of Q. However, as always when it comes to such rules of thumb, there are exceptions. Here is one lemma that is used in various algebraical proofs, and which seems to be really much simpler to prove using analytical properties of C than using pure algebra:
منابع مشابه
A simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملFixed-Point Theorem, and Cohomology
1. INTRODUCTION. The proof of the Brouwer fixed-point Theorem based on Sperner's Lemma [S] is often presented as an elementary combi-natorial alternative to advanced proofs based on algebraic topology. See, for example, Section 6.3 of [P1]. One may ask if this proof is really based on ideas completely different from the ideas of algebraic topology (and, in particular, the ideas of Brouwer's own...
متن کاملRIGID ANALYTIC PICARD THEOREMS By WILLIAM CHERRY and MIN RU
We prove a geometric logarithmic derivative lemma for rigid analytic mappings to algebraic varieties in characteristic zero. We use the lemma to give a new and simpler proof (at least in characteristic zero) of Berkovich’s little Picard theorem, which says there are no nonconstant rigid analytic maps from the affine line to nonsingular projective curves of positive genus, and of Cherry’s result...
متن کاملRigid Analytic Picard Theorems
We prove a geometric logarithmic derivative lemma for rigid analytic mappings to algebraic varieties in characteristic zero. We use the lemma to give a new and simpler proof (at least in characteristic zero) of Berkovich’s little Picard theorem [Ber, Theorem 4.5.1], which says there are no nonconstant rigid analytic maps from the affine line to non-singular projective curves of positive genus, ...
متن کامل