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

Size: px
Start display at page:

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

Transcription

1 Quantum dilogarithm Wadim Zudilin (Moscow & Bonn) 14 March 2006 Abstract The q-exponential 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 q-binomial 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 5-term 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 q-pochhammer symbol. Note that the q-polynomials [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 q-factorials since [n] q! n! as q 1. For z C, z < 1, define the q-exponential 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 q-analogue of the dilogarithm function Li 2 (z) n1 z n n 2. Our aim is to show that this q-analogy is somehow deeper than just the above asymptotics. The description below follows R. Kashaev s preprint [3]. First, we prove Theorem 1 (q-binomial 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 left-hand 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, n-fold 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 q-binomial 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 q-binomial 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 q-binomial theorem (6). Theorem 3. The limiting case q 1 of the q-binomial 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 right-hand 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 left-hand 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 q-hypergeometric 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 3-variable formula for Li 2 (too cumbersome to be stated here). But finding an appropriate non-commutative analogue (like the pentagonal identity for the q-binomial 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, Springer-Verlag, New York (1994). [3] R. M. Kashaev, The q-binomial formula and the Rogers dilogarithm identity, E-print 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

arxiv:math/0601660v3 [math.nt] 25 Feb 2006

arxiv: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 information

Computing divisors and common multiples of quasi-linear ordinary differential equations

Computing divisors and common multiples of quasi-linear ordinary differential equations Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr

More information

Counting Primes whose Sum of Digits is Prime

Counting 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 information

3. Mathematical Induction

3. 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 information

Taylor and Maclaurin Series

Taylor 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 information

Jacobi s four squares identity Martin Klazar

Jacobi s four squares identity Martin Klazar Jacobi s four squares identity Martin Klazar (lecture on the 7-th 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 information

1 Lecture: Integration of rational functions by decomposition

1 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 information

9.2 Summation Notation

9.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 information

1 A duality between descents and connectivity.

1 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 information

Sample Induction Proofs

Sample 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 information

An example of a computable

An 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 information

Section 12.6: Directional Derivatives and the Gradient Vector

Section 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 information

Click on the links below to jump directly to the relevant section

Click 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 information

Math 120 Final Exam Practice Problems, Form: A

Math 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 information

Lecture 13: Martingales

Lecture 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 information

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

Student 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 information

QUADRATIC, EXPONENTIAL AND LOGARITHMIC FUNCTIONS

QUADRATIC, EXPONENTIAL AND LOGARITHMIC FUNCTIONS QUADRATIC, EXPONENTIAL AND LOGARITHMIC FUNCTIONS Content 1. Parabolas... 1 1.1. Top of a parabola... 2 1.2. Orientation of a parabola... 2 1.3. Intercept of a parabola... 3 1.4. Roots (or zeros) of a parabola...

More information

The 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 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 information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

SOME RELATIONSHIPS BETWEEN EXTRA PREMIUMS. BY G. V. BAYLEY, F.I.A. of the Equitable Life Assurance Society

SOME 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 whole-life or endowment assurance is effected by means of a single

More information

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY 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 information

arxiv:math/0202219v1 [math.co] 21 Feb 2002

arxiv: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 information

EC3070 FINANCIAL DERIVATIVES. Exercise 1

EC3070 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 information

Section 1. Logarithms

Section 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 information

Homework # 3 Solutions

Homework # 3 Solutions Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8

More information

Boundary value problems in complex analysis I

Boundary value problems in complex analysis I Boletín de la Asociación Matemática Venezolana, Vol. XII, No. (2005) 65 Boundary value problems in complex analysis I Heinrich Begehr Abstract A systematic investigation of basic boundary value problems

More information

CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS 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 information

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

parent ROADMAP MATHEMATICS SUPPORTING YOUR CHILD IN HIGH SCHOOL

parent ROADMAP MATHEMATICS SUPPORTING YOUR CHILD IN HIGH SCHOOL parent ROADMAP MATHEMATICS SUPPORTING YOUR CHILD IN HIGH SCHOOL HS America s schools are working to provide higher quality instruction than ever before. The way we taught students in the past simply does

More information

THE CENTRAL LIMIT THEOREM TORONTO

THE CENTRAL LIMIT THEOREM TORONTO THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................

More information

Integer Sequences and Matrices Over Finite Fields

Integer Sequences and Matrices Over Finite Fields Integer Sequences and Matrices Over Finite Fields arxiv:math/0606056v [mathco] 2 Jun 2006 Kent E Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpolyedu

More information

Sums of Independent Random Variables

Sums of Independent Random Variables Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables

More information

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails 12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

WHERE DOES THE 10% CONDITION COME FROM?

WHERE DOES THE 10% CONDITION COME FROM? 1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay

More information

SKEW-PRODUCTS WITH SIMPLE APPROXIMATIONS

SKEW-PRODUCTS WITH SIMPLE APPROXIMATIONS proceedings of the american mathematical society Volume 72, Number 3, December 1978 SKEW-PRODUCTS WITH SIMPLE APPROXIMATIONS P. N. WHITMAN Abstract. Conditions are given in order that the cartesian product

More information

SECTION 10-2 Mathematical Induction

SECTION 10-2 Mathematical Induction 73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

More information

1 Introduction to Ramanujan theta functions

1 Introduction to Ramanujan theta functions A Multisection of q-series Michael Somos 06 Sep 2010 somos@cis.csuohio.edu (draft version 32) 1 Introduction to Ramanujan theta functions Ramanujan used an approach to q-series which is general and is

More information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

More information

Practice with Proofs

Practice with Proofs Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

More information

About the Gamma Function

About the Gamma Function About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is

More information

ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS

ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS U.P.B. Sci. Bull., Series A, Vol. 75, Iss. 1, 2013 ISSN 1223-7027 ON ROUGH m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS Naveed Yaqoob 1, Muhammad Aslam 1, Bijan Davvaz 2, Arsham Borumand Saeid 3 In this

More information

1 Lecture 3: Operators in Quantum Mechanics

1 Lecture 3: Operators in Quantum Mechanics 1 Lecture 3: Operators in Quantum Mechanics 1.1 Basic notions of operator algebra. In the previous lectures we have met operators: ˆx and ˆp = i h they are called fundamental operators. Many operators

More information

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B

More information

PROOFS BY DESCENT KEITH CONRAD

PROOFS BY DESCENT KEITH CONRAD PROOFS BY DESCENT KEITH CONRAD As ordinary methods, such as are found in the books, are inadequate to proving such difficult propositions, I discovered at last a most singular method... that I called the

More information

Continuity of the Perron Root

Continuity of the Perron Root Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

More information

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

More information

Mathematical Induction. Mary Barnes Sue Gordon

Mathematical Induction. Mary Barnes Sue Gordon Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

More information

Lecture Notes on Elasticity of Substitution

Lecture Notes on Elasticity of Substitution Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before

More information

CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1. Peter Kahn. Spring 2007 CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

More information

Row Echelon Form and Reduced Row Echelon Form

Row Echelon Form and Reduced Row Echelon Form These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

More information

Math 241, Exam 1 Information.

Math 241, Exam 1 Information. Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)

More information

As we have seen, there is a close connection between Legendre symbols of the form

As we have seen, there is a close connection between Legendre symbols of the form Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In

More information

RINGS WITH A POLYNOMIAL IDENTITY

RINGS WITH A POLYNOMIAL IDENTITY RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in

More information

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie

More information

A simple and fast algorithm for computing exponentials of power series

A simple and fast algorithm for computing exponentials of power series A simple and fast algorithm for computing exponentials of power series Alin Bostan Algorithms Project, INRIA Paris-Rocquencourt 7815 Le Chesnay Cedex France and Éric Schost ORCCA and Computer Science Department,

More information

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1 Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

On the number-theoretic functions ν(n) and Ω(n)

On the number-theoretic functions ν(n) and Ω(n) ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,

More information

Integrals of Rational Functions

Integrals of Rational Functions Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t

More information

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca

More information

4.3 Lagrange Approximation

4.3 Lagrange Approximation 206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average

More information

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein) Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

More information

Note on some explicit formulae for twin prime counting function

Note on some explicit formulae for twin prime counting function Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:

More information

Mathematical Expectation

Mathematical Expectation Mathematical Expectation Properties of Mathematical Expectation I The concept of mathematical expectation arose in connection with games of chance. In its simplest form, mathematical expectation is the

More information

Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

More information

SCORE SETS IN ORIENTED GRAPHS

SCORE SETS IN ORIENTED GRAPHS Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

More information

Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

More information

Math 461 Fall 2006 Test 2 Solutions

Math 461 Fall 2006 Test 2 Solutions Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two

More information

Finite speed of propagation in porous media. by mass transportation methods

Finite speed of propagation in porous media. by mass transportation methods Finite speed of propagation in porous media by mass transportation methods José Antonio Carrillo a, Maria Pia Gualdani b, Giuseppe Toscani c a Departament de Matemàtiques - ICREA, Universitat Autònoma

More information

Asymptotics of discounted aggregate claims for renewal risk model with risky investment

Asymptotics of discounted aggregate claims for renewal risk model with risky investment Appl. Math. J. Chinese Univ. 21, 25(2: 29-216 Asymptotics of discounted aggregate claims for renewal risk model with risky investment JIANG Tao Abstract. Under the assumption that the claim size is subexponentially

More information

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

More information

MATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...

MATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators... MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................

More information

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than

More information

Chapter 7 - Roots, Radicals, and Complex Numbers

Chapter 7 - Roots, Radicals, and Complex Numbers Math 233 - Spring 2009 Chapter 7 - Roots, Radicals, and Complex Numbers 7.1 Roots and Radicals 7.1.1 Notation and Terminology In the expression x the is called the radical sign. The expression under the

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

( 1)2 + 2 2 + 2 2 = 9 = 3 We would like to make the length 6. The only vectors in the same direction as v are those

( 1)2 + 2 2 + 2 2 = 9 = 3 We would like to make the length 6. The only vectors in the same direction as v are those 1.(6pts) Which of the following vectors has the same direction as v 1,, but has length 6? (a), 4, 4 (b),, (c) 4,, 4 (d), 4, 4 (e) 0, 6, 0 The length of v is given by ( 1) + + 9 3 We would like to make

More information

THE ENUMERATION OF ROOTED TREES BY TOTAL HEIGHT

THE ENUMERATION OF ROOTED TREES BY TOTAL HEIGHT THE ENUMERATION OF ROOTED TREES BY TOTAL HEIGHT JOHN RIORDAN and N. J. A. SLOANE (Received 22 July 1968) 1. Introduction The height (as in [3] and [4]) of a point in a rooted tree is the length of the

More information

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

COLLEGE ALGEBRA. Paul Dawkins

COLLEGE ALGEBRA. Paul Dawkins COLLEGE ALGEBRA Paul Dawkins Table of Contents Preface... iii Outline... iv Preliminaries... Introduction... Integer Exponents... Rational Exponents... 9 Real Exponents...5 Radicals...6 Polynomials...5

More information

From Binomial Trees to the Black-Scholes Option Pricing Formulas

From Binomial Trees to the Black-Scholes Option Pricing Formulas Lecture 4 From Binomial Trees to the Black-Scholes Option Pricing Formulas In this lecture, we will extend the example in Lecture 2 to a general setting of binomial trees, as an important model for a single

More information

11 Multivariate Polynomials

11 Multivariate Polynomials CS 487: Intro. to Symbolic Computation Winter 2009: M. Giesbrecht Script 11 Page 1 (These lecture notes were prepared and presented by Dan Roche.) 11 Multivariate Polynomials References: MC: Section 16.6

More information

9 Multiplication of Vectors: The Scalar or Dot Product

9 Multiplication of Vectors: The Scalar or Dot Product Arkansas Tech University MATH 934: Calculus III Dr. Marcel B Finan 9 Multiplication of Vectors: The Scalar or Dot Product Up to this point we have defined what vectors are and discussed basic notation

More information

Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative variables

Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative variables Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 6 (013), 74 85 Research Article Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative

More information

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015. Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x

More information

What is Linear Programming?

What is Linear Programming? Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

More information

Inverse Functions and Logarithms

Inverse Functions and Logarithms Section 3. Inverse Functions and Logarithms 1 Kiryl Tsishchanka Inverse Functions and Logarithms DEFINITION: A function f is called a one-to-one function if it never takes on the same value twice; that

More information

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

More information

Nonbinary Quantum Reed-Muller Codes a

Nonbinary Quantum Reed-Muller Codes a Nonbinary Quantum Reed-Muller Codes a Pradeep Sarvepalli pradeep@cs.tamu.edu a Joint work with Dr. Andreas Klappenecker Department of Computer Science, Texas A&M University Nonbinary Quantum Reed-Muller

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

Understanding Basic Calculus

Understanding Basic Calculus Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other

More information

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

More information