Quantum dilogarithm. z n n 2 as q 1. n=1


 Roger Lester
 1 years ago
 Views:
Transcription
1 Quantum dilogarithm Wadim Zudilin (Moscow & Bonn) 14 March 2006 Abstract The qexponential function e q (z) 1/ (1 zqn ), defined for q < 1 and z < 1, satisfies the remarkable quantum pentagonal identity e q (X)e q (Y ) e q (Y )e q ( Y X)e q (X), where e q (X), e q (Y ) and e q ( Y X) are elements in the algebra C q [[X, Y ]] of formal power series in two elements X, Y linked by the commutation relation XY qy X. Following R. Kashaev we prove that the pentagonal identity is a consequence of the qbinomial theorem and, on the basis of the asymptotics log e q (z) 1 log q n1 z n n 2 as q 1 (already known to S. Ramanujan), it implies the famous Spence Abel 5term identity for the ordinary dilogarithm (which statement is also nice but more cumbersome). The above asymptotics and implication allow one to attribute e q (z) as a quantum dilogarithm. Let q C satisfy q < 1. Throughout the talk we will use the standard notation (z; q) n (1 z)(1 zq) (1 zq n 1 ) if n 1, 2,...,, (z; q) 0 1 for the qpochhammer symbol. Note that the qpolynomials [n] q! (1 q) n n k1 1 q k 1 q A talk at Seminar on Algebra, Geometry and Physics (Max Planck Institute for Mathematics in Bonn, March 14, 2006). 1
2 may be viewed as qfactorials since [n] q! n! as q 1. For z C, z < 1, define the qexponential function e(z) e q (z) 1 (z; q) 1 (1 zqn ). (1) The similarity with the classical exponential function comes from the expansion z n (1 q) n z n e q (z), (2) [n] q! which will be shown below. In addition, this function satisfies the exponential functional identity [5] e(x + Y ) e(x)e(y ), if e(x) e q (X), e(y ) e q (Y ) and e(x + Y ) e q (X + Y ) are viewed as elements in the algebra C q [[X, Y ]] of formal power series in two elements X, Y linked by the commutation relation XY qy X. On the other hand, from (1) we have the asymptotic behaviour log e(z) ( log(1 q n z) ) 1 1 q m1 m1 q mn z m m m1 z m m(1 q m )/(1 q) 1 log q m1 z m m(1 q m ) z m m 2 as q 1 (already mentioned by S. Ramanujan [2]), since (1 q m )/(1 q) m and log q q 1 as q 1. This allows to think of log e(z) (and, thus, of e(z) itself) as of a qanalogue of the dilogarithm function Li 2 (z) n1 z n n 2. Our aim is to show that this qanalogy is somehow deeper than just the above asymptotics. The description below follows R. Kashaev s preprint [3]. First, we prove Theorem 1 (qbinomial theorem). For complex x and y, where y < 1, the following is valid: (x; q) n y n (xy; q). (4) (y; q) 2 (3)
3 Proof. Denote the sum in the lefthand side of (4) by f(x, y). Then manipulations with the series give and implying f(x, y) f(qx, y) xyf(qx, y) f(x, y) f(x, qy) (1 x)yf(qx, y) f(x, qy) f(x, y) 1 y. Finally, nfold iteration of the latter relation results in n 1 f(x, q n 1 yq k y) f(x, y) q ; k letting now n tend to we deduce that k0 f(x, 0) f(x, y) (y; q) (xy; q). It remains to use f(x, 0) 1 and write the last relation in the required form (4). Specializing x 0, y z in (4) we obtain the promised expansion (2); another specialization x z/y, y 0 gives the expansion Using the formula 1 e q (z) ( 1) n q n(n 1)/2 z n. (5) (z; q) n (z; q) e(zqn ) (zq n ; q) e(z) for n 0, 1, 2,..., we may state the qbinomial theorem by means of the function (1): e(xq n ) e(q n+1 ) yn e(x)e(y) e(q)e(xy). (6) 3
4 Theorem 2. The qbinomial theorem (6) is equivalent to the quantum pentagonal identity e(x)e(y ) e(y )e( Y X)e(X), (7) where e(x) e q (X), e(y ) e q (Y ) and e( Y X) e q ( Y X) are elements in the algebra C q [[X, Y ]] of formal power series in two elements X, Y linked by the commutation relation XY qy X. Proof. We start by mentioning that XY qy X implies X m Y n q mn Y n X m and (Y X) n q n(n 1)/2 Y n X n for n, m 0, 1, 2,.... Therefore, from (2) and e(x)e(y ) m0 m, e(y )e( Y X)e(X) X m (q; q) m Y n q mn (q; q) m Y n X m n,k,m0 m,n,k0 m, Y n k0 ( Y X) k (q; q) k m, m0 ( 1) k Y n (Y X) k X m (q; q) k (q; q) m X m Y n (q; q) m X m (q; q) m (q; q) m (q; q) k Y n+k X m+k min{m,n} k0 (q; q) m k k (q; q) k Y n X m. Comparing corresponding coefficients in the obtained expansions we conclude that identity (7) is equivalent to the series of equalities q mn min{m,n} (q; q) m k0 (q; q) m k k (q; q) k, m, n 0, 1, 2,.... (8) On the other hand, taking complex variables x, y inside the unit disc and applying (2), (5) we see that e(xq n y n ) m, 4 q mn x m y n (q; q) m
5 and e(x)e(y)e(xy) 1 m0 m,n,k0 m, x m (q; q) m y n (xy) k k0 (q; q) k (q; q) m (q; q) k x m+k y n+k min{m,n} x m y n k0 (q; q) m k k (q; q) k. Thus (8) is equivalent to e(xq n ) y n e(x)e(y) e(xy), which is exactly the qbinomial theorem (6). Theorem 3. The limiting case q 1 of the qbinomial theorem (4) (or, equivalently, of the quantum pentagonal identity (7)) is the equality ( ) ( ) ( ) x y xy Li 2 (x) + Li 2 (y) Li 2 + Li 2 Li 2 1 y 1 x (1 x)(1 y) log(1 x) log(1 y), 0 < x < 1, 0 < y < 1. (9) Remark. Formula (9) is due to N. Abel [1] but an equivalent formula was published by W. Spence [6] nearly twenty years earlier. Another equivalent form of (9) (see (21) below) was given by L. Rogers [4]. Proof. Without loss of generality assume that q is sufficiently close to 1, namely, that max{x, y, 1 y(1 x)} < q < 1. (10) The easy part of the theorem is the asymptotics of the righthand side of (4): log (xy; q) (y; q) log e(y) e(xy) 1 ( Li2 (xy) Li 2 (y) ) as q 1, (11) log q which is obtained on the basis of (3). 5
6 For the lefthand side of (4), write Then the sequence (x; q) n y n c n, where c n (x; q) n y n > 0. (12) d n c n+1 c n 1 xqn y > 0, n 0, 1, 2,..., (13) 1 qn+1 satisfies d n+1 (1 xqn+1 )(1 q n+1 ) d n (1 xq n )(1 q n+2 ) 1 qn (1 q)(q x) (1 xq n )(1 q n+2 ) < 1 q n (1 q)(q x), n 0, 1, 2,... (14) (we use 0 < x < q < 1), i.e. is strictly decreasing. On the other hand, 1 y(1 x) < q implies while d 0 c 1 c 0 1 x 1 q y > 1, lim d 1 xq n n lim y y < 1; n n 1 qn+1 thus, there exists the unique index N 1 such that d N 1 c N c N 1 1 and d N c N+1 c N < 1. (15) Solving the inequality c n+1 /c n < 1 or, equivalently, (1 xq n )y < 1 q n+1 we obtain n > T, where T 1 log q log 1 y q xy, (16) hence N [T ]. From (13) (15) we conclude that c N is the main term contributing the sum in (12), namely, 1 < c n c N < const. 6
7 This result implies log Note now that from (16) ( ) e(q)e(xq N ) c n log c N log e(x)e(q N+1 ) yn ( ) e(q)e(xq T ) log e(x)e(q T +1 ) yt as q 1. (17) q T 1 y q xy, whence the asymptotics in (17) may be continued as follows: log ( c n log e(q) + log e x 1 y ) ( log e(x) log e q 1 y ) q xy q xy + log y log q log 1 y q xy 1 ( ( 1 y Li 2 (x) + Li 2 log q ) + log y log 1 y ) ( Li 2 (1) Li 2 x 1 y ) as q 1, (18) where (3) is used. Comparing asymptotics (11) and (18) of the both sides of (4) we arrive at the identity ( ) ( 1 y Li 2 (x) + Li 2 Li 2 (1) Li 2 x 1 y ) + log y log 1 y Li 2 (xy) Li 2 (y). (19) Take x 0 in (19) to get Li 2 (y) + Li 2 (1 y) Li 2 (1) + log y log(1 y) 0. This identity, in particular, implies Li 2 ( 1 y ) Li 2 (1) Li 2 ( 1 1 y ) log 1 y ( log 1 1 y ). (20) 7
8 Substituting (20) into (19) results in ( ) ( ) x(1 y) y(1 x) Li 2 (xy) + Li 2 + Li 2 + log 1 y log 1 x Li 2 (x) + Li 2 (y). (21) Finally, changing variable x x(1 y)/(), ỹ y(1 x)/(), hence 1 x 1 x, 1 ỹ 1 y, x x 1 ỹ, y ỹ 1 x, reduces identity (21) to the required form (9). I would like to end the exposition by noting that any qhypergeometric summation or transformation identity produces an identity for the dilogarithm function, e.g., Heine s summation (x; q) n (y; q) n (xyz; q) n z n (xz; q) (xy; q) (z; q) (xyz; q) results in a lengthy 3variable formula for Li 2 (too cumbersome to be stated here). But finding an appropriate noncommutative analogue (like the pentagonal identity for the qbinomial theorem) seems to be always tricky. References [1] N. H. Abel, Note sur la fonction ψx x + x2 + x xn +, n 2 Œuvres complèts, vol. 2, Imprimerie de Grondahl & Son, Christiania (1881), pp [2] B. C. Berndt, Ramanujan s notebooks. Part IV, SpringerVerlag, New York (1994). [3] R. M. Kashaev, The qbinomial formula and the Rogers dilogarithm identity, Eprint math.qa/ (2004). [4] L. J. Rogers, On function sum theorems connected with the series n1 xn /n 2, Proc. London Math. Soc. 4 (1907), [5] M.P. Schützenberger, Une interprétation de certaines solutions de l equation fonctionelle: F (x + y) F (x)f (y), C. R. Acad. Sci. Paris 236 (1953),
9 [6] W. Spence, An essay on logarithmic transcendents, London and Edinburgh (1809). 9
8.7 Mathematical Induction
8.7. MATHEMATICAL INDUCTION 8135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture
More informationCHAPTER 5 BASIC HYPERGEOMETEIC FUNCTIONS
CHAPTER 5 BASIC HYPERGEOMETEIC FUNCTIONS [This chapter is based on the lectures of Dr. Remy Y. Denis of the Gorakhpur University, Gorakhpur, India and Professor S. Bhargava of the Department of Mathematics,
More informationarxiv:math/0601660v3 [math.nt] 25 Feb 2006
NOTES Edited by William Adkins arxiv:math/666v3 [math.nt] 25 Feb 26 A Short Proof of the Simple Continued Fraction Expansion of e Henry Cohn. INTRODUCTION. In [3], Euler analyzed the Riccati equation to
More informationRAMANUJAN S HARMONIC NUMBER EXPANSION INTO NEGATIVE POWERS OF A TRIANGULAR NUMBER
Volume 9 (008), Issue 3, Article 89, pp. RAMANUJAN S HARMONIC NUMBER EXPANSION INTO NEGATIVE POWERS OF A TRIANGULAR NUMBER MARK B. VILLARINO DEPTO. DE MATEMÁTICA, UNIVERSIDAD DE COSTA RICA, 060 SAN JOSÉ,
More information3. Recurrence Recursive Definitions. To construct a recursively defined function:
3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a
More informationComputing divisors and common multiples of quasilinear ordinary differential equations
Computing divisors and common multiples of quasilinear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univlille1.fr
More informationThe Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs A counterexample to a continued fraction conjecture Journal Article How to cite: Short, Ian (2006).
More informationNOTE ON NORMAL DECIMALS 59 This is a stronger result than that asserted in Theorem 1. But the proof of Theorem 1 is simpler than that of Theorem 2, an
NOTE ON NORMAL DECIMALS H. DAVENPORT AND P. ERDÖS 1. Introduction. A real number, expressed as a decimal, is said to be normal (in the scale of 10) if every combination of digits occurs in the decimal
More informationDouble Sequences and Double Series
Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine Email: habil@iugaza.edu Abstract This research considers two traditional important questions,
More informationCounting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
More informationMath 201 Lecture 23: Power Series Method for Equations with Polynomial
Math 201 Lecture 23: Power Series Method for Equations with Polynomial Coefficients Mar. 07, 2012 Many examples here are taken from the textbook. The first number in () refers to the problem number in
More informationHIGHER ORDER DIFFERENTIAL EQUATIONS
HIGHER ORDER DIFFERENTIAL EQUATIONS 1 Higher Order Equations Consider the differential equation (1) y (n) (x) f(x, y(x), y (x),, y (n 1) (x)) 11 The Existence and Uniqueness Theorem 12 The general solution
More informationp 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)
.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other
More informationMATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:
MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,
More informationExercises with solutions (1)
Exercises with solutions (). Investigate the relationship between independence and correlation. (a) Two random variables X and Y are said to be correlated if and only if their covariance C XY is not equal
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationDefinition The covariance of X and Y, denoted by cov(x, Y ) is defined by. cov(x, Y ) = E(X µ 1 )(Y µ 2 ).
Correlation Regression Bivariate Normal Suppose that X and Y are r.v. s with joint density f(x y) and suppose that the means of X and Y are respectively µ 1 µ 2 and the variances are 1 2. Definition The
More informationOn the Exponential Diophantine Equation (12m 2 + 1) x + (13m 2 1) y = (5m) z
International Journal of Algebra, Vol. 9, 2015, no. 6, 261272 HIKARI Ltd, www.mhikari.com http://dx.doi.org/10.12988/ija.2015.5529 On the Exponential Diophantine Equation (12m 2 + 1) x + (13m 2 1) y
More informationThe minimal number with a given number of. divisors
The minimal number with a given number of divisors Ron Brown Department of Mathematics, 2565 McCarthy Mall, University of Hawaii, Honolulu, HI 96822, USA Phone (808) 9564665 Fax (808) 9569139 Email address:
More informationJacobi s four squares identity Martin Klazar
Jacobi s four squares identity Martin Klazar (lecture on the 7th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i
More informationThe Limit of a Sequence of Numbers: Infinite Series
Connexions module: m36135 1 The Limit of a Sequence of Numbers: Infinite Series Lawrence Baggett This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License
More informationMITES Physics III Summer Introduction 1. 3 Π = Product 2. 4 Proofs by Induction 3. 5 Problems 5
MITES Physics III Summer 010 Sums Products and Proofs Contents 1 Introduction 1 Sum 1 3 Π Product 4 Proofs by Induction 3 5 Problems 5 1 Introduction These notes will introduce two topics: A notation which
More informationVectors, Gradient, Divergence and Curl.
Vectors, Gradient, Divergence and Curl. 1 Introduction A vector is determined by its length and direction. They are usually denoted with letters with arrows on the top a or in bold letter a. We will use
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationCHAPTER 2. Inequalities
CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential
More informationLecture 3: Summations and Analyzing Programs with Loops
high school algebra If c is a constant (does not depend on the summation index i) then ca i = c a i and (a i + b i )= a i + b i There are some particularly important summations, which you should probably
More information3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.
CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted
More informationSecond Project for Math 377, fall, 2003
Second Project for Math 377, fall, 003 You get to pick your own project. Several possible topics are described below or you can come up with your own topic (subject to my approval). At most two people
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationSection 12.6: Directional Derivatives and the Gradient Vector
Section 26: Directional Derivatives and the Gradient Vector Recall that if f is a differentiable function of x and y and z = f(x, y), then the partial derivatives f x (x, y) and f y (x, y) give the rate
More informationCAN WE INTEGRATE x 2 e x2 /2? 1. THE PROBLEM. xe x2 /2 dx
CAN WE INTEGRATE x 2 e x2 /2? MICHAEL ANSHELEVICH ABSTRACT. Not every nice function has an integral given by a formula. The standard example is e x 2 /2 dx which is not an elementary function. On the other
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More information1 A duality between descents and connectivity.
The Descent Set and Connectivity Set of a Permutation 1 Richard P. Stanley 2 Department of Mathematics, Massachusetts Institute of Technology Cambridge, MA 02139, USA rstan@math.mit.edu version of 16 August
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Alessandro Artale UniBZ  http://www.inf.unibz.it/ artale/ SECTION 5.2 Mathematical Induction I Copyright Cengage Learning. All rights reserved.
More informationWorksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation
Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other
More informationSequences and Series
Contents 6 Sequences and Series 6. Sequences and Series 6. Infinite Series 3 6.3 The Binomial Series 6 6.4 Power Series 3 6.5 Maclaurin and Taylor Series 40 Learning outcomes In this Workbook you will
More informationItems related to expected use of graphing technology appear in bold italics.
 1  Items related to expected use of graphing technology appear in bold italics. Investigating the Graphs of Polynomial Functions determine, through investigation, using graphing calculators or graphing
More informationPERIMETERS OF PRIMITIVE PYTHAGOREAN TRIANGLES. 1. Introduction
PERIMETERS OF PRIMITIVE PYTHAGOREAN TRIANGLES LINDSEY WITCOSKY ADVISOR: DR. RUSS GORDON Abstract. This paper examines two methods of determining whether a positive integer can correspond to the semiperimeter
More informationSome Notes on Taylor Polynomials and Taylor Series
Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited
More informationLesson 6: Proofs of Laws of Exponents
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 6 8 Student Outcomes Students extend the previous laws of exponents to include all integer exponents. Students base symbolic proofs on concrete examples to
More informationExam #5 Sequences and Series
College of the Redwoods Mathematics Department Math 30 College Algebra Exam #5 Sequences and Series David Arnold Don Hickethier Copyright c 000 DonHickethier@Eureka.redwoods.cc.ca.us Last Revision Date:
More informationFINITE AND INFINITE ROGERS RAMANUJAN CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK
FINITE AND INFINITE ROGERS RAMANUJAN CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK BRUCE C. BERNDT, SOONYI KANG AND JAEBUM SOHN Abstract. Some entries on both finite and infinite Rogers Ramanujan continued
More informationTaylor Polynomials and Taylor Series Math 126
Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationDirect Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction
Direct Proofs CS 19: Discrete Mathematics Amit Chakrabarti Proofs by Contradiction and by Mathematical Induction At this point, we have seen a few examples of mathematical proofs. These have the following
More informationConvergence and stability results for a class of asymptotically quasinonexpansive mappings in the intermediate sense
Functional Analysis, Approximation and Computation 7 1) 2015), 57 66 Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/faac Convergence and
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationLecture 3. Mathematical Induction
Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion
More informationStudent Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain
More informationMath 140a  HW 1 Solutions
Math 140a  HW 1 Solutions Problem 1 (WR Ch 1 #1). If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Given that r is rational, we can write r = a b for some
More informationM248 Diagnostic Quiz
THE OPEN UNIVERSITY Faculty of Mathematics and Computing M248 Diagnostic Quiz Prepared by the Course Team [Press to begin] c 2005 The Open University Last Revision Date: March 17, 2006 Version 1.4 Section
More informationMathematical induction: variants and subtleties
Mathematical induction: variants and subtleties October 29, 2010 Mathematical induction is one of the most useful techniques for solving problems in mathematics. I m assuming you re familiar with the basic
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationMATH 105: PRACTICE PROBLEMS FOR SERIES: SPRING Problems
MATH 05: PRACTICE PROBLEMS FOR SERIES: SPRING 20 INSTRUCTOR: STEVEN MILLER (SJM@WILLIAMS.EDU).. Sequences and Series.. Problems Question : Let a n =. Does the series +n+n 2 n= a n converge or diverge?
More information1. R In this and the next section we are going to study the properties of sequences of real numbers.
+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real
More informationA COUNTEREXAMPLE FOR SUBADDITIVITY OF MULTIPLIER IDEALS ON TORIC VARIETIES
Communications in Algebra, 40: 1618 1624, 2012 Copyright Taylor & Francis Group, LLC ISSN: 00927872 print/15324125 online DOI: 10.1080/00927872.2011.552084 A COUNTEREXAMPLE FOR SUBADDITIVITY OF MULTIPLIER
More informationAN IMPROVED EXPONENTIAL REGULA FALSI METHODS WITH CUBIC CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
J. Appl. Math. & Informatics Vol. 8(010), No. 56, pp. 14671476 Website: http://www.kcam.biz AN IMPROVED EXPONENTIAL REGULA FALSI METHODS WITH CUBIC CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS S. A. HODA
More informationAssociative binary operations and the Pythagorean Theorem
Associative binary operations and the Pythagorean Theorem Denis Bell April 22, 2016 The Pythagorean Theorem a c b a 2 +b 2 = c 2 Babylonians, Egyptians, Greeks, 2000 BC The approach of Lucio Berrone Denote
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationQUINTIC AND SEPTIC EISENSTEIN SERIES. jq j 1 q j, Q(q) = j 5 q j. R(q) = q j. (1 q j ). (q) =
QUINTIC AND SEPTIC EISENSTEIN SERIES SHAUN COOPER AND PEE CHOON TOH Abstract. Using results that were well known to Ramanujan, we give proofs of some results for Eisenstein series in the lost notebook.
More informationSOME RELATIONSHIPS BETWEEN EXTRA PREMIUMS. BY G. V. BAYLEY, F.I.A. of the Equitable Life Assurance Society
86 SOME RELATIONSHIPS BETWEEN EXTRA PREMIUMS BY G. V. BAYLEY, F.I.A. of the Equitable Life Assurance Society IT sometimes happens that a wholelife or endowment assurance is effected by means of a single
More information21st Annual Iowa Collegiate Mathematics Competition ISU, Saturday, February 21, 2015 Problems by Razvan Gelca
21st Annual Iowa Collegiate Mathematics Competition ISU, Saturday, February 21, 215 Problems by Razvan Gelca SOLUTIONS 1. Asked about his age, a boy replied: I have a sister, and four years ago when she
More informationInfinite series, improper integrals, and Taylor series
Chapter Infinite series, improper integrals, and Taylor series. Introduction This chapter has several important and challenging goals. The first of these is to understand how concepts that were discussed
More informationPOSITIVE INTEGERS, INTEGERS AND RATIONAL NUMBERS OBTAINED FROM THE AXIOMS OF THE REAL NUMBER SYSTEM
MAT 1011 TECHNICAL ENGLISH I 03.11.2016 Dokuz Eylül University Faculty of Science Department of Mathematics Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web: http://kisi.deu.edu.tr/engin.mermut/
More informationCharacterizing the Sum of Two Cubes
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 6 (003), Article 03.4.6 Characterizing the Sum of Two Cubes Kevin A. Broughan University of Waikato Hamilton 001 New Zealand kab@waikato.ac.nz Abstract
More information1.3 Induction and Other Proof Techniques
4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.
More informationGeometry and Arithmetic
Geometry and Arithmetic Alex Tao 10 June 2008 1 Rational Points on Conics We begin by stating a few definitions: A rational number is a quotient of two integers and the whole set of rational numbers is
More informationSection 1. Logarithms
Worksheet 2.7 Logarithms and Exponentials Section 1 Logarithms The mathematics of logarithms and exponentials occurs naturally in many branches of science. It is very important in solving problems related
More informationThe Euler constant : γ
Numbers, constants and computation 1 The Euler constant : γ Xavier Gourdon and Pascal Sebah April 14, 2004 1 γ = 0.57721566490153286060651209008240243104215933593992... 1 Introduction Euler s Constant
More informationHermitian Operators An important property of operators is suggested by considering the Hamiltonian for the particle in a box: d 2 dx 2 (1)
CHAPTER 4 PRINCIPLES OF QUANTUM MECHANICS In this Chapter we will continue to develop the mathematical formalism of quantum mechanics, using heuristic arguments as necessary. This will lead to a system
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More informationOn Transforming Logarithmic to Linear Convergence by Interpolation
On Transforming Logarithmic to Linear Convergence by Interpolation Herbert H. H. Homeier Institut für Physikalische und Theoretische Chemie Universität Regensburg, D93040 Regensburg, Germany August 5,
More informationReview for Calculus Rational Functions, Logarithms & Exponentials
Definition and Domain of Rational Functions A rational function is defined as the quotient of two polynomial functions. F(x) = P(x) / Q(x) The domain of F is the set of all real numbers except those for
More informationEC3070 FINANCIAL DERIVATIVES. Exercise 1
EC3070 FINANCIAL DERIVATIVES Exercise 1 1. A credit card company charges an annual interest rate of 15%, which is effective only if the interest on the outstanding debts is paid in monthly instalments.
More informationON THE FIBONACCI NUMBERS
ON THE FIBONACCI NUMBERS Prepared by Kei Nakamura The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties
More informationSection 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.
M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider
More informationThe minimum number of distinct areas of triangles determined by a set of n points in the plane
The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,
More informationarxiv:math/0304317v1 [math.ca] 22 Apr 2003
AN ENTRY OF RAMANUJAN ON HYPERGEOMETRIC SERIES IN HIS NOTEBOOKS arxiv:math/030437v math.ca Apr 003 K. Srinivasa Rao a,b, G. Vanden Berghe a,c and C. Krattenthaler d a Flemish Academic Center VLAC), Royal
More informationCHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS
CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we construct the set of rational numbers Q using equivalence
More informationManipulating Power Series
LECTURE 24 Manipulating Power Series Our technique for solving di erential equations by power series will essentially be to substitute a generic power series expression y(x) a n (x x o ) n into a di erential
More information1 Orthogonal projections and the approximation
Math 1512 Fall 2010 Notes on least squares approximation Given n data points (x 1, y 1 ),..., (x n, y n ), we would like to find the line L, with an equation of the form y = mx + b, which is the best fit
More informationdiffy boxes (iterations of the ducci four number game) 1
diffy boxes (iterations of the ducci four number game) 1 Peter Trapa September 27, 2006 Begin at the beginning and go on till you come to the end: then stop. Lewis Carroll Consider the following game.
More informationSTAT 571 Assignment 1 solutions
STAT 571 Assignment 1 solutions 1. If Ω is a set and C a collection of subsets of Ω, let A be the intersection of all σalgebras that contain C. rove that A is the σalgebra generated by C. Solution: Let
More informationLecture 3: Fourier Series: pointwise and uniform convergence.
Lecture 3: Fourier Series: pointwise and uniform convergence. 1. Introduction. At the end of the second lecture we saw that we had for each function f L ([, π]) a Fourier series f a + (a k cos kx + b k
More informationCONVERGENCE OF SEQUENCES OF ITERATES OF RANDOMVALUED VECTOR FUNCTIONS
C O L L O Q U I U M M A T H E M A T I C U M VOL. 97 2003 NO. 1 CONVERGENCE OF SEQUENCES OF ITERATES OF RANDOMVALUED VECTOR FUNCTIONS BY RAFAŁ KAPICA (Katowice) Abstract. Given a probability space (Ω,
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationRandom ksat: the limiting probability for satisfiability for moderately growing k
Random ksat: the limiting probability for satisfiability for moderately growing k Amin CojaOghlan Alan Frieze Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213, USA.
More informationAN EXPLICIT FORMULA GENERATING THE NONFIBONACCI NUMBERS
AN EXPLICIT FORMULA GENERATING THE NONFIBONACCI NUMBERS BAKIR FARHI Abstract We show among others that the formula: { 5 ( n + log Φ log Φ ( ) 5n) + n 5 + } 2 n (n 2), (where Φ denotes the golden ratio
More informationSOME TYPES OF CONVERGENCE OF SEQUENCES OF REAL VALUED FUNCTIONS
Real Analysis Exchange Vol. 28(2), 2002/2003, pp. 43 59 Ruchi Das, Department of Mathematics, Faculty of Science, The M.S. University Of Baroda, Vadodara  390002, India. email: ruchid99@yahoo.com Nikolaos
More informationLECTURE 2. Part/ References Topic/Sections Notes/Speaker. 1 Enumeration 1 1.1 Generating functions... 1. Combinatorial. Asst #1 Due FS A.
Wee Date Sections f aculty of science MATH 8954 Fall 0 Contents 1 Sept 7 I1, I, I3 Symbolic methods I A3/ C Introduction to Prob 4 A sampling 18 IX1 of counting sequences Limit Laws and and generating
More information0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2.
SOLUTION SET FOR THE HOMEWORK PROBLEMS Page 5. Problem 8. Prove that if x and y are real numbers, then xy x + y. Proof. First we prove that if x is a real number, then x 0. The product of two positive
More informationThe kperiodic Fibonacci Sequence and an extended Binet s formula
The kperiodic Fibonacci Sequence and an extended Binet s formula Marcia Edson, Scott Lewis, Omer Yayenie Abstract It is wellknown that a continued fraction is periodic if and only if it is the representation
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationarxiv:math/ v1 [math.nt] 9 Mar 2005
QUADRATIC ADDITION RULES FOR QUANTUM INTEGERS arxiv:math/0503177v1 [math.nt] 9 Mar 2005 ALEX V. KONTOROVICH AND MELVYN B. NATHANSON Abstract. For every positive integer n, the quantum integer [n] q is
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationNumerical Analysis and Computing
Joe Mahaffy, mahaffy@math.sdsu.edu Spring 2010 #4: Solutions of Equations in One Variable (1/58) Numerical Analysis and Computing Lecture Notes #04 Solutions of Equations in One Variable, Interpolation
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More information2.5 Complex Eigenvalues
1 25 Complex Eigenvalues Real Canonical Form A semisimple matrix with complex conjugate eigenvalues can be diagonalized using the procedure previously described However, the eigenvectors corresponding
More informationUnderstanding and Applying Quadratic Relationships
Grade: 8 (Algebra & Geometry 1) Duration: 6 Weeks Summary: Students will identify, compute with, and factor polynomial expressions. Students will learn to recognize the special products of polynomials,
More informationNotes on Linear Recurrence Sequences
Notes on Linear Recurrence Sequences April 8, 005 As far as preparing for the final exam, I only hold you responsible for knowing sections,,, 6 and 7 Definitions and Basic Examples An example of a linear
More information