THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK

Size: px
Start display at page:

Download "THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK"

Transcription

1 THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E MCCARTHY, SANDRA POTT, AND BRETT D WICK Abstract We provide a ew proof of Volberg s Theorem characterizig thi iterpolatig sequeces as those for which the Gram matrix associated to the ormalized reproducig kerels is a compact perturbatio of the idetity I the same paper, Volberg characterized sequeces for which the Gram matrix is a compact perturbatio of a uitary as well as those for which the Gram matrix is a Schatte- class perturbatio of a uitary operator We exted this characterizatio from to p, where p 1 Itroductio Let D deote the ope uit disk ad T the uit circle Give {α j }, a Blaschke sequece of poits i D, we let B deote the correspodig Blaschke product ad B deote the Blaschke product with the zero α removed Further, we let δ j = B j (α j ), k j = 1 1 α j deote the z Szegő kerel (the reproducig kerel for H ) at α j, g j = k j / k j the H -ormalized kerel, ad G the Gram matrix with etries G ij = g j, g i I the secod part of [10, Theorem ], Volberg s goal was to develop a coditio esurig that {g } is ear a orthogoal basis; by this, oe meas that there exist U uitary ad K compact such that g = (U + K)e, where {e } is the stadard orthogoal basis for l By [7, Sectio 3] or [4, Propositio 3], this is equivalet to the Gram matrix defiig a bouded operator of the form I + K with K compact Followig Volberg ad aticipatig the coectio to the Schatte-p classes, we call such bases U + S bases Volberg showed that {g } is a U + S basis if ad oly if lim δ = 1; i other words, if ad oly if {α } is a thi sequece Assumig {g } is a U +S basis, it is ot difficult to show that the sequece {α } must be thi But Volberg s proof of the coverse is more difficult ad depeds o the mai lemma of a paper of Axler, Chag ad Saraso [, Lemma 5], estimatig the orm of a certai product of Hakel operators as well as a factorizatio theorem for Blaschke products The lemma i [] uses maximal fuctios ad a certai distributio fuctio iequality A more direct proof of Volberg s result is desirable, ad we provide a simpler proof of this result i Theorem 35 of this paper I a secod theorem, lettig S deote the class of Hilbert-Schmidt operators, Volberg showed (see [10, Theorem 3]) that {g } is a U +S basis if ad oly if =1 δ coverges We are iterested i estimates for the i-betwee cases We provide a ew proof of Volberg s theorem for p = ad prove the followig theorem Theorem 11 For p <, the operator G I S p if ad oly if (1 δ ) p/ < Volberg s theorem covered the cases p = ad p =, but our proofs differ i the followig way: Istead of usig the results of [] ad theorems about Hakel operators, we use the PG Partially supported by Simos Foudatio Grat JM Partially supported by Natioal Sciece Foudatio Grat DMS BDW Partially supported by Natioal Sciece Foudatio Grat DMS

2 P GORKIN, JEMCCARTHY, S POTT, AND BDWICK relatioship betwee growth estimates of fuctios that do iterpolatio o thi sequeces (see [5], [6]) ad the orm of the Gram matrix This simplifies previous proofs ad provides the best estimates available Prelimiaries ad otatio Let {α j } be a sequece i D with correspodig Blaschke product B, ad B j be the Blaschke product with zeroes at every poit i the sequece except α j ad δ j = B j (α j ) The separatio costat δ is defied to be δ := if j δ j Carleso s iterpolatio theorem says that the sequece {α j } is iterpolatig if ad oly if δ > 0, [3] The sequece {α j } is said to be thi if lim j δ j = 1 Give a thi sequece we may arrage the δ j i icreasig order ad rearrage the zeros of the Blaschke product accordigly Recall that if T is a operator o a Hilbert space H ad λ is the th sigular value of T, the give p with 1 p < the Schatte-p class, S p, is defied to be the space of all compact operators with correspodig sigular sequece i l p, the space of p-summable sequeces The S p is a Baach space with orm T p = ( λ p ) 1/p For p =, we let S deote the space of compact operators Recall that k j deotes the Szegő kerel, g j = k j / k j, ad G the Gram matrix with etries G ij = g j, g i (The Gram matrix depeds of course o the sequece {α j }, but we suppress this i the otatio) For {α j } iterpolatig, we let D be the diagoal matrix with etries 1/B j (α j ) It is kow (see, for example, formula (6) of [8]) that (1) G 1 = D G t D For a give sequece {α j }, the iterpolatio costat is the ifimum of those M such that for ay sequece {a j } i l, oe ca fid a fuctio f i H with f(α j ) = a j ad f M a l We shall let M(δ) deote the supremum of the iterpolatio costats over all sequeces {α j } with separatio costat δ The followig result is due essetially to A Shields ad H Shapiro [9] See [1, Propositio 95] for a proof of this versio Propositio 1 Let {α j } be a iterpolatig sequece i D (i) If the iterpolatio costat is M, the both G ad G 1 are bouded by M (ii) If G = C 1 ad G 1 = C, the the iterpolatio costat is bouded by C 1 C We shall use the followig estimate of JP Earl (see [5] or [6]) to obtai our results Theorem (Earl s Theorem) The iterpolatio costat M(δ) satisfies ( ) δ M(δ) δ 3 Schatte-p classes I this sectio we provide estimates o the Schatte-p orm of G I We will eed the theorem ad lemma below

3 THIN SEQUENCES AND THE GRAM MATRIX 3 Theorem 31 (see eg [11, Theorem 133]) Let T be a operator o a separable Hilbert space, H If 0 < p the { } T p S p = if T e p : {e } is ay orthoormal basis i H ad if p < { } T p S p = sup T e p : {e } is ay orthoormal basis i H We say that two sequeces {x } ad {y } of positive umbers are equivalet if there exist costats c ad C, idepedet of, such that cy x Cy for all We write x y We will also write A B to idicate that there exists a costat C such that A CB Lemma 3 Let {e } deote the stadard orthoormal basis for l ad {α j } be a iterpolatig sequece i D with correspodig δ j The Proof We have (G I)e 1 δ (G I)e = (G I)(G I)e, e g, g 1 g, g 1 g =, g 1 g,, g g, g +1 = g, g j g, g j g, g +1 = 1 αj 1 α 1 α α j = 1 α j α 1 α α j But log x 1 x for x > 0 ad log x < c(1 x) for x < 1 bouded away from 0 ad some costat c idepedet of x, so log x 1 x for x bouded away from 0 Cosequetly, (G I)e log α j α 1 α α j = log α j α 1 α α j = log δ 1 δ

4 4 P GORKIN, JEMCCARTHY, S POTT, AND BDWICK Note that the costats ivolved do ot deped o Combiig the lemma with Theorem 31, we obtai the followig theorem Theorem 33 The followig estimates hold: If p < the If 0 < p the If p = the (1 δ ) p G I p G I p S p S p ; (1 δ ) p ; (1 δ ) G I S Lemma 34 Let {α j } be a iterpolatig sequece ad G the correspodig Gram matrix Let C = G 1 The G I C 1 Proof By (1), we have G CI, ad as G is a positive operator, we have G (1/C)I Therefore ( ) 1 C 1 I G I (C 1)I, ad as C > 1, we get G I C 1 I what follows, for a positive iteger N, we let G N deote the lower right-had corer of the Gram matrix obtaied by deletig the first N rows ad colums of G Thus, G N = 1 g N+1, g N g N+j, g N g N, g N+1 1 g N+j, g N+1 ad λ 0 deotes the -th sigular value of G I, where the sigular values are arraged i decreasig order We are ow ready to provide our simpler proof of Volberg s result [10, Theorem, p 15] Theorem 35 The sequece {α } is a thi sequece if ad oly if the Gram matrix G is the idetity plus a compact operator Proof ( ) Suppose {α } is thi By discardig fiitely may poits i the sequece (α ), we ca assume that the sequece has a positive separatio costat, ad hece is iterpolatig Let G N be the Gram matrix of {g j } for j N We shall let δ N,j deote the δ j defied for G N (that is, correspodig to the Blaschke sequece {α j } j N ) Note that δ N,j δ N+j for j = 0, 1,,, ad so we have that δ(n) := if j δ N,j if j δ N+j = δ N By Theorem ad Propositio 1, G 1 N (M(δ(N)) ( 1 + ) 4 1 δ(n) δ(n) 4 ( 1 + ) 4 1 δn δ 4 N

5 Applyig Lemma 34 THIN SEQUENCES AND THE GRAM MATRIX 5 G N I N ( 1 + ) 4 1 δn δ 4 N 1 C 1 δ N, where C is a costat idepedet of N Sice 1 δ N 0 as N, we coclude that G I is compact ( ) From (1), we have (31) G 1 I = D (G t I)D + [D D I] If G I is compact, the so are G t I ad G 1 I = G 1 (I G) Therefore from (31), we have D D I is compact, which meas lim j δj = 1 Cosequetly, the sequece is thi Theorem 36 For p <, the operator G I S p if ad oly if (1 δ ) p/ < Proof By Theorem 33, if G I S p, the the sum is fiite Now suppose the sum is fiite Usig Lemma 34 as i Theorem 35, we have where C is idepedet of N By [11, Theorem 1411], G N I N C 1 δ N, λ N+1 if{ (G I) F : F F N }, where F N is the set of all operators of rak less tha or equal to N Therefore, takig F to be the matrix with the same first N rows ad colums as G I, which is of rak at most N, we have λ N+1 G N+1 I N+1 C 1 δ N+1, by our computatio above Therefore λ N+1 p C p (1 δ N+1 ) p/ Sice the sigular values are arraged i decreasig order, λ +1 > λ for each Thus, if N (1 δ N) p/ <, the λ p λ +1 p < ad we coclude that G I S p We coclude by remarkig that it is possible to trace through the proofs above to determie costats c ad C, which deped oly o δ = if δ, such that for p, (3) c 1 δ l p G I Sp C 1 δ l p I particular, by choosig δ close eough to 1, oe ca choose c ad C i (3) arbitrarily close to ad 4 ( 1/p ), respectively Questio 37 Is Theorem 36 true for p <? Ackowledgemet We thak the referee for his or her careful readig of this mauscript as well as helpful commets

6 6 P GORKIN, JEMCCARTHY, S POTT, AND BDWICK Refereces [1] J Agler ad JE McCarthy, Pick Iterpolatio ad Hilbert Fuctio Spaces, America Mathematical Society, Providece, 00 [] Sheldo Axler, Su-Yug A Chag, ad Doald Saraso, Products of Toeplitz operators, Itegral Equatios Operator Theory 1 (1978), o 3, , [3] L Carleso, A iterpolatio problem for bouded aalytic fuctios, America J Math 80 (1958), [4] I Chaledar, E Fricai, ad D Timoti, Fuctioal models ad asymptotically orthoormal sequeces, A Ist Fourier (Greoble) 53 (003), o 5, [5] J P Earl, O the iterpolatio of bouded sequeces by bouded fuctios, J Lodo Math Soc (1970), [6] J P Earl, A ote o bouded iterpolatio i the uit disc, J Lodo Math Soc () 13 (1976), o 3, [7] Emmauel Fricai, Bases of reproducig kerels i model spaces, J Operator Theory 46 (001), o 3, suppl, [8] Paul Koosis, Carleso s iterpolatio theorem deduced from a result of Pick, Complex aalysis, operators, ad related topics, Oper Theory Adv Appl, 113, Birkhäuser, Basel, 000, pp [9] HS Shapiro ad AL Shields, O some iterpolatio problems for aalytic fuctios, America J Math 83 (1961), [10] A L Vol berg, Two remarks cocerig the theorem of S Axler, S-Y A Chag ad D Saraso, J Operator Theory 7 (198), o, , 4 [11] Kehe Zhu, Operator theory i fuctio spaces, Secod, Mathematical Surveys ad Moographs, vol 138, America Mathematical Society, Providece, RI, 007 3, 5 Pamela Gorki, Departmet of Mathematics, Buckell Uiversity, Lewisburg, PA USA address: Joh E McCarthy, Dept of Mathematics, Washigto Uiversity i St Louis, St Louis, MO address: Sadra Pott, Faculty of Sciece, Cetre for Mathematical Scieces, Lud Uiversity, 100 Lud, Swede address: Brett D Wick, School of Mathematics, Georgia Istitute of Techology, 686 Cherry Street, Atlata, GA USA address:

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

The Euler Totient, the Möbius and the Divisor Functions

The Euler Totient, the Möbius and the Divisor Functions The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

THE COMPLETENESS OF CONVERGENT SEQUENCES SPACE OF FUZZY NUMBERS. Hee Chan Choi

THE COMPLETENESS OF CONVERGENT SEQUENCES SPACE OF FUZZY NUMBERS. Hee Chan Choi Kagweo-Kyugki Math. Jour. 4 (1996), No. 2, pp. 117 124 THE COMPLETENESS OF CONVERGENT SEQUENCES SPACE OF FUZZY NUMBERS Hee Cha Choi Abstract. I this paper we defie a ew fuzzy metric θ of fuzzy umber sequeces,

More information

Sequences II. Chapter 3. 3.1 Convergent Sequences

Sequences II. Chapter 3. 3.1 Convergent Sequences Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,

More information

Irreducible polynomials with consecutive zero coefficients

Irreducible polynomials with consecutive zero coefficients Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

A CHARACTERIZATION OF MINIMAL ZERO-SEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS

A CHARACTERIZATION OF MINIMAL ZERO-SEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(1) (2005), #A27 A CHARACTERIZATION OF MINIMAL ZERO-SEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS Scott T. Chapma 1 Triity Uiversity, Departmet

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

AN ASYMPTOTIC ROBIN INEQUALITY. Patrick Solé CNRS/LAGA, Université Paris 8, Saint-Denis, France.

AN ASYMPTOTIC ROBIN INEQUALITY. Patrick Solé CNRS/LAGA, Université Paris 8, Saint-Denis, France. #A8 INTEGERS 6 (206) AN ASYMPTOTIC ROBIN INEQUALITY Patrick Solé CNRS/LAGA, Uiversité Paris 8, Sait-Deis, Frace. sole@est.fr Yuyag Zhu Departmet of Math ad Physics, Hefei Uiversity, Hefei, Chia zhuyy@hfuu.edu.c

More information

A Note on Sums of Greatest (Least) Prime Factors

A Note on Sums of Greatest (Least) Prime Factors It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423-432 HIKARI Ltd, www.m-hikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos

More information

7. Sample Covariance and Correlation

7. Sample Covariance and Correlation 1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

More information

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

More information

2.7 Sequences, Sequences of Sets

2.7 Sequences, Sequences of Sets 2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For

More information

An example of non-quenched convergence in the conditional central limit theorem for partial sums of a linear process

An example of non-quenched convergence in the conditional central limit theorem for partial sums of a linear process A example of o-queched covergece i the coditioal cetral limit theorem for partial sums of a liear process Dalibor Volý ad Michael Woodroofe Abstract A causal liear processes X,X 0,X is costructed for which

More information

Section IV.5: Recurrence Relations from Algorithms

Section IV.5: Recurrence Relations from Algorithms Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by

More information

SUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland

SUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland #A46 INTEGERS 4 (204) SUMS OF GENERALIZED HARMONIC SERIES Michael E. Ho ma Departmet of Mathematics, U. S. Naval Academy, Aapolis, Marylad meh@usa.edu Courtey Moe Departmet of Mathematics, U. S. Naval

More information

Section 9.2 Series and Convergence

Section 9.2 Series and Convergence Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives

More information

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively

More information

MATH 361 Homework 9. Royden Royden Royden

MATH 361 Homework 9. Royden Royden Royden MATH 61 Homework 9 Royde..9 First, we show that for ay subset E of the real umbers, E c + y = E + y) c traslatig the complemet is equivalet to the complemet of the traslated set). Without loss of geerality,

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

ORDERS OF GROWTH KEITH CONRAD

ORDERS OF GROWTH KEITH CONRAD ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus

More information

Lecture 7: Borel Sets and Lebesgue Measure

Lecture 7: Borel Sets and Lebesgue Measure EE50: Probability Foudatios for Electrical Egieers July-November 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,

More information

Confidence Intervals for One Mean with Tolerance Probability

Confidence Intervals for One Mean with Tolerance Probability Chapter 421 Cofidece Itervals for Oe Mea with Tolerace Probability Itroductio This procedure calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) with

More information

Matrix Transforms of A-statistically Convergent Sequences with Speed

Matrix Transforms of A-statistically Convergent Sequences with Speed Filomat 27:8 2013, 1385 1392 DOI 10.2298/FIL1308385 Published by Faculty of Scieces ad Mathematics, Uiversity of Niš, Serbia vailable at: http://www.pmf.i.ac.rs/filomat Matrix Trasforms of -statistically

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on. Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

4.3. The Integral and Comparison Tests

4.3. The Integral and Comparison Tests 4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

A note on the boundary behavior for a modified Green function in the upper-half space

A note on the boundary behavior for a modified Green function in the upper-half space Zhag ad Pisarev Boudary Value Problems (015) 015:114 DOI 10.1186/s13661-015-0363-z RESEARCH Ope Access A ote o the boudary behavior for a modified Gree fuctio i the upper-half space Yulia Zhag1 ad Valery

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

Lecture 5: Span, linear independence, bases, and dimension

Lecture 5: Span, linear independence, bases, and dimension Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;

More information

Approximating the Sum of a Convergent Series

Approximating the Sum of a Convergent Series Approximatig the Sum of a Coverget Series Larry Riddle Ages Scott College Decatur, GA 30030 lriddle@agesscott.edu The BC Calculus Course Descriptio metios how techology ca be used to explore covergece

More information

8.5 Alternating infinite series

8.5 Alternating infinite series 65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

TAYLOR SERIES, POWER SERIES

TAYLOR SERIES, POWER SERIES TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the

More information

Measurable Functions

Measurable Functions Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then

4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or p-series (the Compariso Test), but of

More information

Lesson 12. Sequences and Series

Lesson 12. Sequences and Series Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or

More information

π d i (b i z) (n 1)π )... sin(θ + )

π d i (b i z) (n 1)π )... sin(θ + ) SOME TRIGONOMETRIC IDENTITIES RELATED TO EXACT COVERS Joh Beebee Uiversity of Alaska, Achorage Jauary 18, 1990 Sherma K Stei proves that if si π = k si π b where i the b i are itegers, the are positive

More information

1 The Binomial Theorem: Another Approach

1 The Binomial Theorem: Another Approach The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

8.1 Arithmetic Sequences

8.1 Arithmetic Sequences MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first

More information

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S, Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σ-algebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio

More information

1. a n = 2. a n = 3. a n = 4. a n = 5. a n = 6. a n =

1. a n = 2. a n = 3. a n = 4. a n = 5. a n = 6. a n = Versio PREVIEW Homework Berg (5860 This prit-out should have 9 questios. Multiple-choice questios may cotiue o the ext colum or page fid all choices before aswerig. CalCb0b 00 0.0 poits Rewrite the fiite

More information

1. C. The formula for the confidence interval for a population mean is: x t, which was

1. C. The formula for the confidence interval for a population mean is: x t, which was s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

More information

13 Fast Fourier Transform (FFT)

13 Fast Fourier Transform (FFT) 13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform.

More information

A Gentle Introduction to Algorithms: Part II

A Gentle Introduction to Algorithms: Part II A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The Big-O, Big-Θ, Big-Ω otatios: asymptotic bouds

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

On Formula to Compute Primes. and the n th Prime

On Formula to Compute Primes. and the n th Prime Applied Mathematical cieces, Vol., 0, o., 35-35 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih Abdul-Nabi

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average

More information

Convex Bodies of Minimal Volume, Surface Area and Mean Width with Respect to Thin Shells

Convex Bodies of Minimal Volume, Surface Area and Mean Width with Respect to Thin Shells Caad. J. Math. Vol. 60 (1), 2008 pp. 3 32 Covex Bodies of Miimal Volume, Surface Area ad Mea Width with Respect to Thi Shells Károly Böröczky, Károly J. Böröczky, Carste Schütt, ad Gergely Witsche Abstract.

More information

ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE

ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE Proceedigs of the Iteratioal Coferece o Theory ad Applicatios of Mathematics ad Iformatics ICTAMI 3, Alba Iulia ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE by Maria E Gageoea ad Silvia Moldoveau

More information

A sharp Trudinger-Moser type inequality for unbounded domains in R n

A sharp Trudinger-Moser type inequality for unbounded domains in R n A sharp Trudiger-Moser type iequality for ubouded domais i R Yuxiag Li ad Berhard Ruf Abstract The Trudiger-Moser iequality states that for fuctios u H, 0 (Ω) (Ω R a bouded domai) with Ω u dx oe has Ω

More information

On the L p -conjecture for locally compact groups

On the L p -conjecture for locally compact groups Arch. Math. 89 (2007), 237 242 c 2007 Birkhäuser Verlag Basel/Switzerlad 0003/889X/030237-6, ublished olie 2007-08-0 DOI 0.007/s0003-007-993-x Archiv der Mathematik O the L -cojecture for locally comact

More information

MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

More information

A NEW PROOF FOR A CLASSICAL QUADRATIC HARMONIC SERIES. 1. Introduction and the main result

A NEW PROOF FOR A CLASSICAL QUADRATIC HARMONIC SERIES. 1. Introduction and the main result Joural of Classical Aalysis Volume 8, Number (6, 55 6 doi:.753/jca-8-4 A NEW PROOF FOR A CLASSICAL QUADRATIC HARMONIC SERIES CORNEL IOAN VĂLEAN To my parets, Ileaa ad Ioel Abstract. I the followig paper

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1 1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

More information

Alternatives To Pearson s and Spearman s Correlation Coefficients

Alternatives To Pearson s and Spearman s Correlation Coefficients Alteratives To Pearso s ad Spearma s Correlatio Coefficiets Floreti Smaradache Chair of Math & Scieces Departmet Uiversity of New Mexico Gallup, NM 8730, USA Abstract. This article presets several alteratives

More information

1 Itroductio Let A be a complex matrix ad let C (A) be its th compoud. It was show i [10, Formula (12)] that the imal row sum (of moduli) of elemets o

1 Itroductio Let A be a complex matrix ad let C (A) be its th compoud. It was show i [10, Formula (12)] that the imal row sum (of moduli) of elemets o Bouds o orms of compoud matrices ad o products of eigevalues Ludwig Elser Faultat fur Mathemati Uiversitat Bielefeld Postfach 100131 D-33615 Bielefeld Germay Daiel Hershowitz Departmet of Mathematics Techio

More information

Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant

Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

3. Covariance and Correlation

3. Covariance and Correlation Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

Estimating the Mean and Variance of a Normal Distribution

Estimating the Mean and Variance of a Normal Distribution Estimatig the Mea ad Variace of a Normal Distributio Learig Objectives After completig this module, the studet will be able to eplai the value of repeatig eperimets eplai the role of the law of large umbers

More information

Factors of sums of powers of binomial coefficients

Factors of sums of powers of binomial coefficients ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

More information

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k. 18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The

More information

0,1 is an accumulation

0,1 is an accumulation Sectio 5.4 1 Accumulatio Poits Sectio 5.4 Bolzao-Weierstrass ad Heie-Borel Theorems Purpose of Sectio: To itroduce the cocept of a accumulatio poit of a set, ad state ad prove two major theorems of real

More information

arxiv: v2 [math.nt] 5 Nov 2013

arxiv: v2 [math.nt] 5 Nov 2013 arxiv:29.64v2 [math.nt] 5 Nov 23 EULER SUMS OF HYPERHARMONIC NUMBERS Ayha Dil Departmet of Mathematics, Adeiz Uiversity, 758 Atalya Turey e-mail: adil@adeiz.edu.tr Khristo N. Boyadzhiev Departmet of Mathematics

More information

An Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function

An Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;

More information

A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY

A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY J. Appl. Prob. 45, 060 070 2008 Prited i Eglad Applied Probability Trust 2008 A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY MARK BROWN, The City College of New York EROL A. PEKÖZ, Bosto Uiversity SHELDON

More information

Advanced Probability Theory

Advanced Probability Theory Advaced Probability Theory Math5411 HKUST Kai Che (Istructor) Chapter 1. Law of Large Numbers 1.1. σ-algebra, measure, probability space ad radom variables. This sectio lays the ecessary rigorous foudatio

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information