Beurling Integers: Part 2

Size: px
Start display at page:

Download "Beurling Integers: Part 2"

Transcription

1 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers or as a multiplicatio fuctio over the atural umbers. These two represetatios are isomorphic, though we really oly showed how to get a multiplicatio fuctio from a give sequece of real umbers. To go i the opposite directio, we actually eed to itroduce a third represetatio: a sequece of prime factorizatios. To discuss prime factorizatios, we eed to have a way of represetig the factorizatios as objects themselves. Oe represetatio we ca use is expoet vectors, which are best explaied with examples (see Table 1). This otatio ivites aalogies to a vector space, although the atural umbers do ot form a field so we do ot have a vector space. Noetheless, some typical operatios have atural correspodece. Multiplicatio correspods to vector additio ad expoetiatio correspods to scalar multiplicatio. The prime umbers correspod to uit (basis) vectors i a ifiite dimesioal space. Sice the vectors live i a ifiite dimesioal space, we require a fiite represetatio. I the table above the vectors have their tail sequeces of zeros cut off, but geerally this ist the most compact represetatio. We also write factorizatios as sets of (prime, expoet) pairs eg. 2, 0, 5 correspods to {(1, 2), (3, 5)} This pair represetatio is aki to writig a vector as a liear combiatio of basis vectors. The set of pairs represetatio teds to be more coveiet whe a vector is sparse (ie. it has may zeros Table 1: Comparig represetatios of the sequece of atural umbers Natural Number Prime Factorizatio Sequece of Prime Expoets Expoet Vector (Trucated Zeros) 1 oe 0,0,0,0,0,0, ,0,0,0,0,0, ,1,0,0,0,0,... 0, ,0,0,0,0,0, ,0,1,0,0,0,... 0, 0, ,1,0,0,0,0,... 1, ,0,0,1,0,0,... 0, 0, 0, ,0,0,0,0,0, ,2,0,0,0,0,... 0, ,0,1,0,0,0,... 1, 0, ,0,0,0,1,0,... 0, 0, 0, 0, ,1,0,0,0,0,... 2, 1 1

2 Table 2: Comparig factorizatio orderigs of the atural umbers ad the odds Natural Number Natural Vector Odd Vector Odd Number , 1 0, , 0, , 0, , 1 0, 0, 0, , 0, 0, 1 0, 0, 0, 0, , , 2 {(6,1)} , 0, 1 {(7,1)} , 0, 0, 0, 1 1, 0, , 1 {(8,1)} 23 betwee o-zero elemets it cotais a large prime, but is a relatively small umber). Moreover, the pair represetatio makes sese whe discussig powers of primes because the each umber has oly oe pair (i this case represetatio is really as cocise as is possible). Sice multiplicatio ca be chaied, we ca cosider it as a map from multisets (sets where multiplicity is allowed) of atural umbers to a atural umber, istead of a map just from pairs of atural umbers to a atural umber. If we restrict the domai to multisets of prime umbers, the the uiqueess of prime factorizatio guaratees that this map is ijective oly oe item i the domai maps to some umber i the rage. We could also defie the map from the sigleto multiset (of a prime umber) as a idetity mappig, which would allow the map to be surjective. This ew form of the multiplicatio fuctio is thus a bijectio with the atural umbers as its rage, which meas that it is equivalet to a sequece: a orderig of its domai. So every multiplicatio fuctio correspods to a orderig of prime factorizatios. For example, we ca compare the orderigs of the atural umbers ad the odd umbers as i Table 2. We ca cosider a triagle of isomorphic represetatios of the Beurlig geeralized itegers as see i Figure 1. We have show that the multiplicatio fuctios ad sequeces of Factorizatios are isomorphic. We have also show that sequeces of real umbers determie multiplicatio fuctios. Figure 1: Isomorphism Triagle Now quite obviously, a sequece of all factorizatios determies the orderigs of prime powers, sice these are just subsequeces. I sectio 4 of the paper, Beurlig Zeta Fuctios, Geeralised Primes, ad Fractal Membraes, Lapidus ad Hilberdik prove the isomorphism betwee orderigs of prime powers ad the sequece of real umbers represetatio, which completes our isomorphism 2

3 triagle. I shall reproduce their proof here (usig some of their otatios, which hopefully ca be iferred if I eglect to defie them), which takes the form of two theorems ad a lemma. Just provig oe directio, that a orderig of prime powers determies a sequece of real umbers, should be sufficiet to complete the isomorphism triagle. (As a aside, the basics of the proof rely o usig the orderig to pi values of ay power of ay prime p betwee some power of p 1 ad the ext power +1. I had always suspected such a approach could be used i this proof, but my attempts failed i vai. For this reaso the relative simplicity ad the elegace of the followig proofs always impressed me.) 2 The Lapidus-Hilberdik Proof Notes: This proof uses some elemetary real aalysis. If youre ot iterested, you ca skim or skip the proof ad move o to the other posts i the series. For a give system of geeralized itegers, the authors use P to refer to the set of associated primes (as real umbers). They use N to refer to the set of itegers geerated by P. This proof requires the ifiitude of both primes ad composites. This is largely a verbatim copy of their proof, with some small chages ad my ow otes throw i. For the proofs of each idividual theorem/lemma I provide a digest i brackets [], mostly for my ow coveiece as this article serves as a persoal referece. The first part of the proof comes from that the recogitio that if a sequece of umbers is defied as aother sequece with each elemet take to some fixed power greater tha zero, the the multiplicatio fuctio remais the same. For example, with the squares of the atural umbers, four times four equals 16, so m(2, 2) = 4. I geeral, if b = a λ, the b 1 (x) = a 1 (x 1/λ ) ad multiplicatio for b ca be defied as: m(x, y) = b 1 (b x b y ) = a 1 ((a λ x a λ y) 1/λ ) = a 1 (a x a y ) It turs out the coverse is true, if the multiplicatio fuctio (ad hece the factorizatio orderig) is the same for two sequeces of real umbers, the the sequeces must be some power of each other. (Note that the coverse is oly true assumig that we have i ifiite umber of composite umbers.) Here is the exact theorem due to Lapidus ad Hilberdik (with a early verbatim copy of the proof): 2.1 Theorem: Let P 1 ad P 2 be two geeralized prime systems with geeralized itegers N 1 ad N 2 respectively. If the orderigs of N 1 ad N 2 coicide, the P 1 = P λ 2 for some λ > 0 ad hece N 1 = N λ 2. [Proof otes: boud p m k, qm k by powers of p 1, q 1 to, + 1, take log. Now forms of p m k ad qm k are bouded by the same umbers, + 1 ad we ca use substitutio to get ps ad qs i same iequality. Takig limit as m gives us our result.] 3

4 2.2 Proof: Deote the primes i P 1 by p1, p 2,..., ad those i P 2 by q 1, q 2,.... Let k, m N. The p m k [p 1, p 1 + 1) for some N. Sice N 2 has the same orderig as N 1 we also have qk m [q 1, q 1 + 1). Takig logs gives: mlog(p k) log(p 1 ) < + 1 ad mlog(q k) log(q 1 ) < + 1 ie. = mlog(p k) log(p 1 ) = mlog(q k) log(q 1 ). So we ca relate the sequeces q ad p mlog(p k ) log(p 1 ) 1 < mlog(q k) log(q 1 ) < + 1 mlog(p k) logp ad hece This holds for all m, so lettig m gives log(p k ) log(p 1 ) 1 m < log(q k) log(q 1 ) < log(p k) log(p 1 ) + 1 m log(p k ) log(p 1 ) = log(q k) log(q 1 ) i.e. p k = q λ k, where λ = log(p 1) log(q 1 ), ad hece P 1 = P λ Axioms Lapidus ad Hilberdik ote the subsequece of N as of powers of real umbers, Q = {p : p P, N} ad remark that Q is isomorphic to N 2 via the isomorphism p m (m, ). They defie three axioms regardig the order Q imposes o N 2, which correspod to the properties we defied for multiplicatio earlier: A1: (m, ) (m, ) wheever both m m ad, with strict iequality if < A2: (m, ) (m) implies (m, k) (m, k) for every k N, with strict iequality if (m, ) < (m, ). A3: Fiiteess: (i) For all N, there exists k N such that (1, ) < (k, 1). (ii) For all m N, there exists l N such that (m, 1) < (1, l). A3 correspods to havig ifiitely may composites ad ifiitely may primes, so that we have a order o all of N 2. Oe ca view A1 ad A2 as correspodig to icreasigess ad traslatio ivariace, respectively. The fial theorem requires a lemma. The purpose of the lemma is as follows. We kow that sequeces of umbers geerate the same system whe they are powers of each other, ad we just showed that this is actually the oly case. Thus we should be able to geerate uique values of the primes give a order of prime powers if we choose a value of the first prime (the values of all the itegers are i tur determied by the values of the primes, hece why we oly eed to care about the order of prime powers.) We could the write the value of ay k th prime as a real (ad o-itegral) power of the first prime, power(k). We ca boud ay power of a k th prime by powers of the first prime, ad if we choose some power f k () to give the 4

5 maximum lower boud the f k () + 1 will give the miimum upper boud (if oe of these bouds eed be ostrict the other could be strict.) Now for ay such we have a iequality: f k () < power(k) < f k() + 1 For example, with the atural umbers , ie. power(2) = (power(2) refers to 3 as the secod prime). Our first iequalities imply 2 < 3 < 4 = 1 < power(2) < 2 8 < 9 < 16 = 1.5 < power(2) < 2 16 < 27 < 32 = < power(2) < Eve after the first few iequalities, we are able to boud 1.5 < power(2) < , which give p 1 = 2 puts our guess for 3s value at < 3 < We would hope that sup f k() f = power() or eve that lim k () = power(). (This basically is what I had hoped before fidig the Lapidus-Hilberdik paper, but I was ever able to arrive at a proof.) The followig lemma aids i our proof of the theorem by showig a coditio for which the limit of f k() exists. 2.4 Lemma Let f : N R be such that for all m, N f(m) m f() the lim exists. [Proof otes: show that f() f() 1 is bouded. The show that f(m) m lim if f() (usig the fact that there exists a sequece k for which f( k) k The use this to show that f() approaches this limit.] 2.5 Proof By puttig = 1 ito the coditio (1) it follows that f() f() α = lim if is bouded. Let By defiitio of α, there exists sequece k tedig to ifiity with k such that f( k ) k α as k Hece, for fixed m N, we have f(m k) m k α as k, sice f(m k ) f( k) m k k 1 k (ad f( k) (1) approaches the same limit as approaches this limit). k α while 1 k 0) Now fix N, put m = k i the iitial coditio ad let k. The f( k ) f() k k 1 5

6 Sice f( k) k α as m we have f() α 1 ad the result follows. 2.6 Theorem Give a order o N 2 satisfyig axioms A1-A3, there exists a geeralized prime system P which iduces this order. [Proof otes: Fix the k th prime. Boud the th power of this prime (k, ) from below by some maximal power f k () of p 1 (so f k ()+1 bouds it above). Note that this iequality is preserved if we replace by some m (because it is simply a substitutio), or if we multiply all the powers by some m (due to traslatio ivariace). We mix these these derived iequalities sice the middle term (k, m) is the same. For this proof Lapidus specifically gives that the lefthad side of oe iequality is less tha the righthad side of the other, sice the iequalities have the same middle term, but ote that a eve stroger result is quite obvious: sice f k (m) gives a maximal lower boud (ad hece f k (m) gives a miimal upper boud) we have that the lower boud mf k () f k (m) ad the upper boud m(f k () + 1) f k (m). We ca write this i oe lie: (1, mf k ()) (1, f k (m)) (k, m) < (1, f k (m) + 1) (1, m(f k () + 1)) ad it is eve more apparet that the first term is less tha the fourth term ad the secod term is less tha the fifth. Takig those two iequalities, we ca create correspodig iequalities for the expoets, sice the iequalities are o powers of the same prime. These ew iequalities ca be combied ad adjusted so that the coditio (1) of the Lemma is applicable. We defie our sequece of real umbers by lettig p k = p α k 1, where α k is the limit of f k(). At this poit, lettig m leads to our result, sice iequalities p m < p m o our sequece of real umbers imply iequalities o f k (), which i tur implies iequalities (m, ) < (m, ) o our orderig of N 2.] 2.7 Proof Fix k N. For N, let f k () be the uique positive iteger for which (1, f k ()) (k, ) < (1, f k () + 1) (2) (*Im ot sure why ostrict iequality is ecessary here (for k=1?), but it doest really matter.) This exists o accout of A2 ad A3, ad is uique by A1. Replacig by m, we have (1, f k (m)) (k, m) < (1, f k (m) + 1) (3) O the other had, A2 implies that (give the first equatio, (2)) (3) ad (4) give (1, mf k ()) (k, m) < (1, m(f k () + 1)) (4) (1, f k (m)) < (1, m(f k () + 1)), ad (1, mf k ()) < (1, f k (m) + 1) 6

7 These iequalities ivolve the same prime base ad thus we ca apply the iequality to their expoets Combiig these ad dividig through by m gives f k () f k (m) < mf k () + m ad (5) mf k () < f k (m) + 1 (6) 1 m < f(m) m < f k() + 1 Thus f k () satisfies the coditio of the Lemma (1), that its distace from f(m) m is less tha 1. This meas that f k() α k for some α k. Now choose some p 1 > 1 ad defie a system of geeralized primes such that p k = p α k 1. We shall prove that this system iduces the give orderig o prime powers. Lettig m i (6) we have that If p m < p m (i.e. α m < α m ) the, f k () < α k < f k () + 1 f m () α m < α m f m () + 1 Sice f m () ad f m () are itegers, this implies that f m () f m (), i.e. (m, ) (m, ). [The equality case ca be illustrated by example. Imagie the umbers 25 ad 27 i the case of the atural umbers. We have that p 2 3 < p3 2, but that f 3(2) = f 2 (3). However, log 2 (25 3 ) < log 2 (27 3 ), so f 3 (3 2) < f 2 (3 3). So we ca amed the argumet with a call to traslatio ivariace.] Now if (m, ) = (m, ), the (m, k) = (m, k) for all k N by A2. Hece fm(k) k = fm(k) k ad, lettig k, we have α m = α m, i.e. p m = p m. This shows that p m < p m implies that (m, ) < (m, ). This proof cocludes Part 2 of the series ad our itroductio to the Beurlig geeralized itegers. The followig articles i the series will explore the partial order that the geeralized itegers impose o the set of factorizatios. (7) 7

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

Chapter IV Integration Theory

Chapter IV Integration Theory Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

The natural exponential function

The natural exponential function The atural expoetial fuctio Attila Máté Brookly College of the City Uiversity of New York December, 205 Cotets The atural expoetial fuctio for real x. Beroulli s iequality.....................................2

More information

End-of-Year Contest. ERHS Math Club. May 5, 2009

End-of-Year Contest. ERHS Math Club. May 5, 2009 Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F. CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

2 Geometric interpretation of complex numbers

2 Geometric interpretation of complex numbers 2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that

More information

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

Exercises 1 Sets and functions

Exercises 1 Sets and functions Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,

More information

Math 299 Supplement: Real Analysis Nov 2013

Math 299 Supplement: Real Analysis Nov 2013 Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality

More information

Chapter 1. Complex Numbers. Dr. Pulak Sahoo

Chapter 1. Complex Numbers. Dr. Pulak Sahoo Chapter 1 Complex Numbers BY Dr. Pulak Sahoo Assistat Professor Departmet of Mathematics Uiversity Of Kalyai West Begal, Idia E-mail : sahoopulak1@gmail.com 1 Module-2: Stereographic Projectio 1 Euler

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

The Pointwise Ergodic Theorem and its Applications

The Pointwise Ergodic Theorem and its Applications The Poitwise Ergodic Theorem ad its Applicatios Itroductio Peter Oberly 11/9/2018 Algebra has homomorphisms ad topology has cotiuous maps; i these otes we explore the structure preservig maps for measure

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

2.4 Sequences, Sequences of Sets

2.4 Sequences, Sequences of Sets 72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1) 5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

1 Introduction. 1.1 Notation and Terminology

1 Introduction. 1.1 Notation and Terminology 1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

The Wasserstein distances

The Wasserstein distances The Wasserstei distaces March 20, 2011 This documet presets the proof of the mai results we proved o Wasserstei distaces themselves (ad ot o curves i the Wasserstei space). I particular, triagle iequality

More information

Series III. Chapter Alternating Series

Series III. Chapter Alternating Series Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with

More information

Lecture XVI - Lifting of paths and homotopies

Lecture XVI - Lifting of paths and homotopies Lecture XVI - Liftig of paths ad homotopies I the last lecture we discussed the liftig problem ad proved that the lift if it exists is uiquely determied by its value at oe poit. I this lecture we shall

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Chapter Vectors

Chapter Vectors Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

Lecture 10 October Minimaxity and least favorable prior sequences

Lecture 10 October Minimaxity and least favorable prior sequences STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

C. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions

C. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions C. Complex Numbers. Complex arithmetic. Most people thik that complex umbers arose from attempts to solve quadratic equatios, but actually it was i coectio with cubic equatios they first appeared. Everyoe

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Enumerative & Asymptotic Combinatorics

Enumerative & Asymptotic Combinatorics C50 Eumerative & Asymptotic Combiatorics Stirlig ad Lagrage Sprig 2003 This sectio of the otes cotais proofs of Stirlig s formula ad the Lagrage Iversio Formula. Stirlig s formula Theorem 1 (Stirlig s

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Riesz-Fischer Sequences and Lower Frame Bounds

Riesz-Fischer Sequences and Lower Frame Bounds Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A05 Q-BINOMIALS AND THE GREATEST COMMON DIVISOR Keith R. Slavi 8474 SW Chevy Place, Beaverto, Orego 97008, USA slavi@dsl-oly.et Received:

More information

FUNDAMENTALS OF REAL ANALYSIS by

FUNDAMENTALS OF REAL ANALYSIS by FUNDAMENTALS OF REAL ANALYSIS by Doğa Çömez Backgroud: All of Math 450/1 material. Namely: basic set theory, relatios ad PMI, structure of N, Z, Q ad R, basic properties of (cotiuous ad differetiable)

More information

Hoggatt and King [lo] defined a complete sequence of natural numbers

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS

More information

Sequences and Limits

Sequences and Limits Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions MA54 : Real Aalysis Tutorial ad Practice Problems - Hits ad Solutios. Suppose that S is a oempty subset of real umbers that is bouded (i.e. bouded above as well as below). Prove that if S sup S. What ca

More information

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n. 0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate

More information

ENGI Series Page 6-01

ENGI Series Page 6-01 ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Math 4400/6400 Homework #7 solutions

Math 4400/6400 Homework #7 solutions MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH

More information

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

More information

Empirical Processes: Glivenko Cantelli Theorems

Empirical Processes: Glivenko Cantelli Theorems Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3

More information

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]

More information

Part A, for both Section 200 and Section 501

Part A, for both Section 200 and Section 501 Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Dr. Clemens Kroll. Abstract

Dr. Clemens Kroll. Abstract Riema s Hypothesis ad Stieltjes Cojecture Riema s Hypothesis ad Stieltjes Cojecture Dr. Clemes Kroll Abstract It is show that Riema s hypothesis is true by showig that a equivalet statemet is true. Eve

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

TENSOR PRODUCTS AND PARTIAL TRACES

TENSOR PRODUCTS AND PARTIAL TRACES Lecture 2 TENSOR PRODUCTS AND PARTIAL TRACES Stéphae ATTAL Abstract This lecture cocers special aspects of Operator Theory which are of much use i Quatum Mechaics, i particular i the theory of Quatum Ope

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More information