The Origins of Complex Geometry in the 19Th Century ∗
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
LOOKING BACKWARD: from EULER to RIEMANN 11 at the Age of 24
LOOKING BACKWARD: FROM EULER TO RIEMANN ATHANASE PAPADOPOULOS Il est des hommes auxquels on ne doit pas adresser d’´eloges, si l’on ne suppose pas qu’ils ont le goˆut assez peu d´elicat pour goˆuter les louanges qui viennent d’en bas. (Jules Tannery, [241] p. 102) Abstract. We survey the main ideas in the early history of the subjects on which Riemann worked and that led to some of his most important discoveries. The subjects discussed include the theory of functions of a complex variable, elliptic and Abelian integrals, the hypergeometric series, the zeta function, topology, differential geometry, integration, and the notion of space. We shall see that among Riemann’s predecessors in all these fields, one name occupies a prominent place, this is Leonhard Euler. The final version of this paper will appear in the book From Riemann to differential geometry and relativity (L. Ji, A. Papadopoulos and S. Yamada, ed.) Berlin: Springer, 2017. AMS Mathematics Subject Classification: 01-02, 01A55, 01A67, 26A42, 30- 03, 33C05, 00A30. Keywords: Bernhard Riemann, function of a complex variable, space, Rie- mannian geometry, trigonometric series, zeta function, differential geometry, elliptic integral, elliptic function, Abelian integral, Abelian function, hy- pergeometric function, topology, Riemann surface, Leonhard Euler, space, integration. Contents 1. Introduction 2 2. Functions 10 3. Elliptic integrals 21 arXiv:1710.03982v1 [math.HO] 11 Oct 2017 4. Abelian functions 30 5. Hypergeometric series 32 6. The zeta function 34 7. On space 41 8. Topology 47 9. Differential geometry 63 10. Trigonometric series 69 11. Integration 79 12. Conclusion 81 References 85 Date: October 12, 2017. -
How to Show That Various Numbers Either Can Or Cannot Be Constructed Using Only a Straightedge and Compass
How to show that various numbers either can or cannot be constructed using only a straightedge and compass Nick Janetos June 3, 2010 1 Introduction It has been found that a circular area is to the square on a line equal to the quadrant of the circumference, as the area of an equilateral rectangle is to the square on one side... -Indiana House Bill No. 246, 1897 Three problems of classical Greek geometry are to do the following using only a compass and a straightedge: 1. To "square the circle": Given a circle, to construct a square of the same area, 2. To "trisect an angle": Given an angle, to construct another angle 1/3 of the original angle, 3. To "double the cube": Given a cube, to construct a cube with twice the area. Unfortunately, it is not possible to complete any of these tasks until additional tools (such as a marked ruler) are provided. In section 2 we will examine the process of constructing numbers using a compass and straightedge. We will then express constructions in algebraic terms. In section 3 we will derive several results about transcendental numbers. There are two goals: One, to show that the numbers e and π are transcendental, and two, to show that the three classical geometry problems are unsolvable. The two goals, of course, will turn out to be related. 2 Constructions in the plane The discussion in this section comes from [8], with some parts expanded and others removed. The classical Greeks were clear on what constitutes a construction. Given some set of points, new points can be defined at the intersection of lines with other lines, or lines with circles, or circles with circles. -
Nonintersecting Brownian Motions on the Unit Circle: Noncritical Cases
The Annals of Probability 2016, Vol. 44, No. 2, 1134–1211 DOI: 10.1214/14-AOP998 c Institute of Mathematical Statistics, 2016 NONINTERSECTING BROWNIAN MOTIONS ON THE UNIT CIRCLE By Karl Liechty and Dong Wang1 DePaul University and National University of Singapore We consider an ensemble of n nonintersecting Brownian particles on the unit circle with diffusion parameter n−1/2, which are condi- tioned to begin at the same point and to return to that point after time T , but otherwise not to intersect. There is a critical value of T which separates the subcritical case, in which it is vanishingly un- likely that the particles wrap around the circle, and the supercritical case, in which particles may wrap around the circle. In this paper, we show that in the subcritical and critical cases the probability that the total winding number is zero is almost surely 1 as n , and →∞ in the supercritical case that the distribution of the total winding number converges to the discrete normal distribution. We also give a streamlined approach to identifying the Pearcey and tacnode pro- cesses in scaling limits. The formula of the tacnode correlation kernel is new and involves a solution to a Lax system for the Painlev´e II equation of size 2 2. The proofs are based on the determinantal × structure of the ensemble, asymptotic results for the related system of discrete Gaussian orthogonal polynomials, and a formulation of the correlation kernel in terms of a double contour integral. 1. Introduction. The probability models of nonintersecting Brownian motions have been studied extensively in last decade; see Tracy and Widom (2004, 2006), Adler and van Moerbeke (2005), Adler, Orantin and van Moer- beke (2010), Delvaux, Kuijlaars and Zhang (2011), Johansson (2013), Ferrari and Vet˝o(2012), Katori and Tanemura (2007) and Schehr et al. -
Dynamical Systems/Syst`Emes Dynamiques SIMPLE
Dynamical systems/Systemes` dynamiques SIMPLE EXPONENTIAL ESTIMATE FOR THE NUMBER OF REAL ZEROS OF COMPLETE ABELIAN INTEGRALS Dmitri Novikov, Sergeı˘ Yakovenko The Weizmann Institute of Science (Rehovot, Israel) Abstract. We show that for a generic real polynomial H = H(x, y) and an arbitrary real differential 1-form ω = P (x, y) dx + Q(x, y) dy with polynomial coefficients of degree 6 d, the number of ovals of the foliation H = const, which yield the zero value of the complete H Abelian integral I(t) = H=t ω, grows at most as exp OH (d) as d → ∞, where OH (d) depends only on H. This result essentially improves the previous double exponential estimate obtained in [1] for the number of zero ovals on a bounded distance from singular level curves of H. La borne simplement exponentielle pour le nombre de zeros´ reels´ isoles´ des integrales completes` abeliennes´ R´esum´e. Soit H = H(x, y) un polynˆome r´eel de deux variables et ω = P (x, y) dx + Q(x, y) dy une forme diff´erentielle quelconque avec des coefficients polynomiaux r´eels de degr´e d. Nous montrons que le nombre des ovales (c’est-a-dire les composantes compactes connexes) des courbes de niveau H = const, telles que l’int´egrale de la forme s’annule, est au plus exp OH (d) quand d → ∞, o`u OH (d) ne d´epend que du polynˆome H. Ce th´eor`emeam´eliore de mani`ere essentielle la borne doublement exponentielle obtenue dans [1]. Nous ´etablissons aussi les bornes sup´erieures exponentielles similaires pour le nom- bre de z´eros isol´espour les enveloppes polynomiales des ´equations diff´erentielles ordinaires lin´eaires irr´eductibles ou presque irr´eductibles. -
Abelian Integrals and the Genesis of Abel's Greatest Discovery
Abelian integrals and the genesis of Abel's greatest discovery Christian F. Skau Department of Mathematical Sciences, Norwegian University of Science and Technology March 20, 2020 Draft P(x) R(x) = Q(x) 3x 7 − 18x 6 + 46x 5 − 84x 4 + 127x 3 − 122x 2 + 84x − 56 = (x − 2)3(x + i)(x − i) 4x 4 − 12x 3 + 7x 2 − x + 1 = 3x 2 + 7 + (x − 2)3(x + i)(x − i) (−1) 3 4 i=2 (−i=2) = 3x 2 + 7 + + + + + (x − 2)3 (x − 2)2 x − 2 x + i x − i Draft Z 1=2 −3 R(x) dx = x 3 + 7x + + + 4 log (x − 2) (x − 2)2 x − 2 i −i + log (x + i) + log (x − i) 2 2 i −i = Re(x) + 4 log (x − 2) + log (x + i) + log (x − i) 2 2 The integral of a rational function R(x) is a rational function Re(x) plus a sum of logarithms of the form log(x + a), a 2 C, multiplied with constants. Draft eix − e−ix 1 p sin x = arcsin x = log ix + 1 − x 2 2i i Trigonometric functions and the inverse arcus-functions can be expressed by (complex) exponential and logarithmic functions. Draft A rational function R(x; y) of x and y is of the form P(x; y) R(x; y) = ; Q(x; y) where P and Q are polynomials in x and y. So, P i j aij x y R(x; y) = P k l bkl x y Similarly we define a rational function of x1; x2;:::; xn. -
Operations with Complex Numbers Adding & Subtracting: Combine Like Terms (풂 + 풃풊) + (풄 + 풅풊) = (풂 + 풄) + (풃 + 풅)풊 Examples: 1
Name: __________________________________________________________ Date: _________________________ Period: _________ Chapter 2: Polynomial and Rational Functions Topic 1: Complex Numbers What is an imaginary number? What is a complex number? The imaginary unit is defined as 풊 = √−ퟏ A complex number is defined as the set of all numbers in the form of 푎 + 푏푖, where 푎 is the real component and 푏 is the coefficient of the imaginary component. An imaginary number is when the real component (푎) is zero. Checkpoint: Since 풊 = √−ퟏ Then 풊ퟐ = Operations with Complex Numbers Adding & Subtracting: Combine like terms (풂 + 풃풊) + (풄 + 풅풊) = (풂 + 풄) + (풃 + 풅)풊 Examples: 1. (5 − 11푖) + (7 + 4푖) 2. (−5 + 7푖) − (−11 − 6푖) 3. (5 − 2푖) + (3 + 3푖) 4. (2 + 6푖) − (12 − 4푖) Multiplying: Just like polynomials, use the distributive property. Then, combine like terms and simplify powers of 푖. Remember! Multiplication does not require like terms. Every term gets distributed to every term. Examples: 1. 4푖(3 − 5푖) 2. (7 − 3푖)(−2 − 5푖) 3. 7푖(2 − 9푖) 4. (5 + 4푖)(6 − 7푖) 5. (3 + 5푖)(3 − 5푖) A note about conjugates: Recall that when multiplying conjugates, the middle terms will cancel out. With complex numbers, this becomes even simpler: (풂 + 풃풊)(풂 − 풃풊) = 풂ퟐ + 풃ퟐ Try again with the shortcut: (3 + 5푖)(3 − 5푖) Dividing: Just like polynomials and rational expressions, the denominator must be a rational number. Since complex numbers include imaginary components, these are not rational numbers. To remove a complex number from the denominator, we multiply numerator and denominator by the conjugate of the Remember! You can simplify first IF factors can be canceled. -
Lecture 9 Riemann Surfaces, Elliptic Functions Laplace Equation
Lecture 9 Riemann surfaces, elliptic functions Laplace equation Consider a Riemannian metric gµν in two dimensions. In two dimensions it is always possible to choose coordinates (x,y) to diagonalize it as ds2 = Ω(x,y)(dx2 + dy2). We can then combine them into a complex combination z = x+iy to write this as ds2 =Ωdzdz¯. It is actually a K¨ahler metric since the condition ∂[i,gj]k¯ = 0 is trivial if i, j = 1. Thus, an orientable Riemannian manifold in two dimensions is always K¨ahler. In the diagonalized form of the metric, the Laplace operator is of the form, −1 ∆=4Ω ∂z∂¯z¯. Thus, any solution to the Laplace equation ∆φ = 0 can be expressed as a sum of a holomorphic and an anti-holomorphid function. ∆φ = 0 φ = f(z)+ f¯(¯z). → In the following, we assume Ω = 1 so that the metric is ds2 = dzdz¯. It is not difficult to generalize our results for non-constant Ω. Now, we would like to prove the following formula, 1 ∂¯ = πδ(z), z − where δ(z) = δ(x)δ(y). Since 1/z is holomorphic except at z = 0, the left-hand side should vanish except at z = 0. On the other hand, by the Stokes theorem, the integral of the left-hand side on a disk of radius r gives, 1 i dz dxdy ∂¯ = = π. Zx2+y2≤r2 z 2 I|z|=r z − This proves the formula. Thus, the Green function G(z, w) obeying ∆zG(z, w) = 4πδ(z w), − should behave as G(z, w)= log z w 2 = log(z w) log(¯z w¯), − | − | − − − − near z = w. -
Theory of Trigintaduonion Emanation and Origins of Α and Π
Theory of Trigintaduonion Emanation and Origins of and Stephen Winters-Hilt Meta Logos Systems Aurora, Colorado Abstract In this paper a specific form of maximal information propagation is explored, from which the origins of , , and fractal reality are revealed. Introduction The new unification approach described here gives a precise derivation for the mysterious physics constant (the fine-structure constant) from the mathematical physics formalism providing maximal information propagation, with being the maximal perturbation amount. Furthermore, the new unification provides that the structure of the space of initial ‘propagation’ (with initial propagation being referred to as ‘emanation’) has a precise derivation, with a unit-norm perturbative limit that leads to an iterative-map-like computed (a limit that is precisely related to the Feigenbaum bifurcation constant and thus fractal). The computed can also, by a maximal information propagation argument, provide a derivation for the mathematical constant . The ideal constructs of planar geometry, and related such via complex analysis, give methods for calculation of to incredibly high precision (trillions of digits), thereby providing an indirect derivation of to similar precision. Propagation in 10 dimensions (chiral, fermionic) and 26 dimensions (bosonic) is indicated [1-3], in agreement with string theory. Furthermore a preliminary result showing a relation between the Feigenbaum bifurcation constant and , consistent with the hypercomplex algebras indicated in the Emanator Theory, suggest an individual object trajectory with 36=10+26 degrees of freedom (indicative of heterotic strings). The overall (any/all chirality) propagation degrees of freedom, 78, are also in agreement with the number of generators in string gauge symmetries [4]. -
The Historical Development of Algebraic Geometry∗
The Historical Development of Algebraic Geometry∗ Jean Dieudonn´e March 3, 1972y 1 The lecture This is an enriched transcription of footage posted by the University of Wis- consin{Milwaukee Department of Mathematical Sciences [1]. The images are composites of screenshots from the footage manipulated with Python and the Python OpenCV library [2]. These materials were prepared by Ryan C. Schwiebert with the goal of capturing and restoring some of the material. The lecture presents the content of Dieudonn´e'sarticle of the same title [3] as well as the content of earlier lecture notes [4], but the live lecture is natu- rally embellished with different details. The text presented here is, for the most part, written as it was spoken. This is why there are some ungrammatical con- structions of spoken word, and some linguistic quirks of a French speaker. The transcriber has taken some liberties by abbreviating places where Dieudonn´e self-corrected. That is, short phrases which turned out to be false starts have been elided, and now only the subsequent word-choices that replaced them ap- pear. Unfortunately, time has taken its toll on the footage, and it appears that a brief portion at the beginning, as well as the last enumerated period (VII. Sheaves and schemes), have been lost. (Fortunately, we can still read about them in [3]!) The audio and video quality has contributed to several transcription errors. Finally, a lack of thorough knowledge of the history of algebraic geometry has also contributed some errors. Contact with suggestions for improvement of arXiv:1803.00163v1 [math.HO] 1 Mar 2018 the materials is welcome. -
Truly Hypercomplex Numbers
TRULY HYPERCOMPLEX NUMBERS: UNIFICATION OF NUMBERS AND VECTORS Redouane BOUHENNACHE (pronounce Redwan Boohennash) Independent Exploration Geophysical Engineer / Geophysicist 14, rue du 1er Novembre, Beni-Guecha Centre, 43019 Wilaya de Mila, Algeria E-mail: [email protected] First written: 21 July 2014 Revised: 17 May 2015 Abstract Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This paper provides a definitive solution to this problem by defining the truly hypercomplex numbers of dimension N ≥ 3. The secret lies in the definition of the multiplicative law and its properties. This law is based on spherical and hyperspherical coordinates. These numbers which I call spherical and hyperspherical hypercomplex numbers define Abelian groups over addition and multiplication. Nevertheless, the multiplicative law generally does not distribute over addition, thus the set of these numbers equipped with addition and multiplication does not form a mathematical field. However, such numbers are expected to have a tremendous utility in mathematics and in science in general. Keywords Hypercomplex numbers; Spherical; Hyperspherical; Unification of numbers and vectors Note This paper (or say preprint or e-print) has been submitted, under the title “Spherical and Hyperspherical Hypercomplex Numbers: Merging Numbers and Vectors into Just One Mathematical Entity”, to the following journals: Bulletin of Mathematical Sciences on 08 August 2014, Hypercomplex Numbers in Geometry and Physics (HNGP) on 13 August 2014 and has been accepted for publication on 29 April 2015 in issue No. -
Lectures on the Combinatorial Structure of the Moduli Spaces of Riemann Surfaces
LECTURES ON THE COMBINATORIAL STRUCTURE OF THE MODULI SPACES OF RIEMANN SURFACES MOTOHICO MULASE Contents 1. Riemann Surfaces and Elliptic Functions 1 1.1. Basic Definitions 1 1.2. Elementary Examples 3 1.3. Weierstrass Elliptic Functions 10 1.4. Elliptic Functions and Elliptic Curves 13 1.5. Degeneration of the Weierstrass Elliptic Function 16 1.6. The Elliptic Modular Function 19 1.7. Compactification of the Moduli of Elliptic Curves 26 References 31 1. Riemann Surfaces and Elliptic Functions 1.1. Basic Definitions. Let us begin with defining Riemann surfaces and their moduli spaces. Definition 1.1 (Riemann surfaces). A Riemann surface is a paracompact Haus- S dorff topological space C with an open covering C = λ Uλ such that for each open set Uλ there is an open domain Vλ of the complex plane C and a homeomorphism (1.1) φλ : Vλ −→ Uλ −1 that satisfies that if Uλ ∩ Uµ 6= ∅, then the gluing map φµ ◦ φλ φ−1 (1.2) −1 φλ µ −1 Vλ ⊃ φλ (Uλ ∩ Uµ) −−−−→ Uλ ∩ Uµ −−−−→ φµ (Uλ ∩ Uµ) ⊂ Vµ is a biholomorphic function. Remark. (1) A topological space X is paracompact if for every open covering S S X = λ Uλ, there is a locally finite open cover X = i Vi such that Vi ⊂ Uλ for some λ. Locally finite means that for every x ∈ X, there are only finitely many Vi’s that contain x. X is said to be Hausdorff if for every pair of distinct points x, y of X, there are open neighborhoods Wx 3 x and Wy 3 y such that Wx ∩ Wy = ∅. -
Elliptic Curve Cryptography and Digital Rights Management
Lecture 14: Elliptic Curve Cryptography and Digital Rights Management Lecture Notes on “Computer and Network Security” by Avi Kak ([email protected]) March 9, 2021 5:19pm ©2021 Avinash Kak, Purdue University Goals: • Introduction to elliptic curves • A group structure imposed on the points on an elliptic curve • Geometric and algebraic interpretations of the group operator • Elliptic curves on prime finite fields • Perl and Python implementations for elliptic curves on prime finite fields • Elliptic curves on Galois fields • Elliptic curve cryptography (EC Diffie-Hellman, EC Digital Signature Algorithm) • Security of Elliptic Curve Cryptography • ECC for Digital Rights Management (DRM) CONTENTS Section Title Page 14.1 Why Elliptic Curve Cryptography 3 14.2 The Main Idea of ECC — In a Nutshell 9 14.3 What are Elliptic Curves? 13 14.4 A Group Operator Defined for Points on an Elliptic 18 Curve 14.5 The Characteristic of the Underlying Field and the 25 Singular Elliptic Curves 14.6 An Algebraic Expression for Adding Two Points on 29 an Elliptic Curve 14.7 An Algebraic Expression for Calculating 2P from 33 P 14.8 Elliptic Curves Over Zp for Prime p 36 14.8.1 Perl and Python Implementations of Elliptic 39 Curves Over Finite Fields 14.9 Elliptic Curves Over Galois Fields GF (2n) 52 14.10 Is b =0 a Sufficient Condition for the Elliptic 62 Curve6 y2 + xy = x3 + ax2 + b to Not be Singular 14.11 Elliptic Curves Cryptography — The Basic Idea 65 14.12 Elliptic Curve Diffie-Hellman Secret Key 67 Exchange 14.13 Elliptic Curve Digital Signature Algorithm (ECDSA) 71 14.14 Security of ECC 75 14.15 ECC for Digital Rights Management 77 14.16 Homework Problems 82 2 Computer and Network Security by Avi Kak Lecture 14 Back to TOC 14.1 WHY ELLIPTIC CURVE CRYPTOGRAPHY? • As you saw in Section 12.12 of Lecture 12, the computational overhead of the RSA-based approach to public-key cryptography increases with the size of the keys.