Asymptotically Optimal Discrimination between Pure Quantum States

Size: px
Start display at page:

Download "Asymptotically Optimal Discrimination between Pure Quantum States"

Transcription

1 Asymptotcally Optmal Dscrmnaton between Pure Quantum States Mchael Nussbaum 1, and Arleta Szko la 2 1 Department of Mathematcs, Cornell Unversty, Ithaca NY, USA 2 Max Planck Insttute for Mathematcs n the Scences, Lepzg, Germany Abstract. We consder the decson problem between a fnte number of states of a fnte quantum system, when an arbtrarly large number of copes of the system s avalable for measurements. We provde an upper bound on the exponental rate of decay of the averaged probablty of rejectng the true state. It represents a generalzed quantum Chernoff dstance of a fnte set of states. As our man result we prove that the bound s sharp n the case of pure states. Keywords: multple quantum state dscrmnaton, generalzed quantum Chernoff dstance, quantum hypothess testng, error exponents. 1 Introducton In varous branches of quantum theory such as quantum nformaton processng, quantum communcaton theory or quantum statstcs one of the basc problems s to determne the state of a gven quantum system. In the smplest case there s a fnte set of states specfyng the possble preparaton of the quantum system. In the Bayesan approach of quantum statstcs, the lkelhood of the dfferent states s determned by an a pror probablty dstrbuton. One makes a decson n favor of one of the states followng a specfed rule based on the outcomes of a generalzed measurement -called a quantum test. In the bnary case optmal tests,.e. tests mnmzng the averaged probablty of rejectng the true state, are known to be gven by Holevo-Helstrom projectons [5], [4]. These generalze the classcal lkelhood rato tests. Here we consder the scenaro where there s an arbtrarly large fnte number n of copes of the quantum system avalable for performng a measurement. The correspondng state s then descrbed by an n-fold tensor product of one of the assocated densty operators. There are two man goals: frstly, to construct a sequence of quantum tests n n whch maxmze the asymptotc exponental rate of decay of the averaged probablty of rejectng the true state. The second goal s to determne the correspondng optmal error exponent. It has been shown that n the bnary case asymptotcally optmal quantum tests, thus n partcular the Holevo-Helstrom tests, acheve an exponental rate of decay whch s equal to the quantum Chernoff bound, cf. [8], [1] and [2]. Surprsngly, the correspondng questons n the case of r>2 states Supported n part by NSF grant DMS W. van Dam et al. Eds.: TQC 2010, LNCS 6519, pp. 1 8, c Sprnger-Verlag Berln Hedelberg 2011

2 2 M. Nussbaum and A. Szko la have not yet receved a fnal answer, despte a number of efforts and numerous strong results obtaned n relaton to multple quantum state dscrmnaton, see [11], [7], [3], [10] and references theren. We defne a generalzed quantum Chernoff dstance of a fnte set of states as the mnmum of the bnary quantum Chernoff dstances over all possble pars of dfferent states. The bnary quantum Chernoff dstance has been ntroduced n the context of bnary quantum hypothess testng n [8]. Relyng on [8] we prove that the generalzed quantum Chernoff dstance specfes a bound on the achevable asymptotc error exponents n multple quantum state dscrmnaton. Ths s n lne wth results obtaned n the context of classcal multple hypothess testng, cf. [9]. As our man result we prove that n the specal case of pure quantum states ths bound, ndeed, s achevable and hence specfes the optmal asymptotc error exponent. The correspondng asymptotcally optmal quantum tests rely on a Gram-Schmdt orthonormalzaton procedure of the assocated state vectors. Smlar quantum tests were already consdered by Holevo n [6] n the context of quantum mnmal error decson problems. However, the queston of the correspondng asymptotc error exponent s not addressed n [6]. 2 Notatons and the Man Results Let S be a fnte quantum system and H be the assocated complex Hlbert space wth dm H = d<. Further denote by A the algebra of observables of S,.e. A s the algebra of lnear operators on H. Foreachn N denote by A n the algebra of lnear operators on the n-fold tensor product Hlbert space H n.it represents the algebra of observables of a compound quantum system S n wth ts n unt systems beng of the same type S. For each n N the set of densty operators n A n corresponds one-to-one to the state space SA n ofa n. Recall that a densty operator s defned to be a self-adjont, postve lnear operator of trace 1. Let r N and Σ be a set of densty operators ρ SA, = 1,...,r, representng the possble states of the quantum system S. Assume that for each n N there s a compound quantum system S n beng an n-fold copy of S. Ths means, n partcular, that the correspondng quantum state s n Σ n := {ρ n } r =1,.e. t s unquely determned by the ndex {1,...,r}. Further, let E n = {E n } r =1 be a postve operator valued measure POVM n A n,.e. each E n, =1,...,r, s a self-adjont element of A n wth E n 0 and r =1 En = 1. ThePOVMsE n descrbe quantum tests for dscrmnaton between the r states from Σ n,orsmplyquantum tests for Σ n, by dentfyng the measurement outcome correspondng to E n, =1,...,r, wth the densty operator ρ n, respectvely. If ρ happens to descrbe the true state of S, and correspondngly ρ n determnes the state of S n, then the assocated ndvdual success probablty s gven by Succ E n :=tr[ρ n E n ].

3 Asymptotcally Optmal Dscrmnaton between Pure Quantum States 3 The nddvdual error probablty refers to the stuaton when the densty operator ρ s dscarded as possble preparaton of S; t s gven by the formula Err E n :=tr[ρ n 1 E n ]. Assumng 0 <p < 1, =1,...,r,wth r =1 p = 1 to be the a pror dstrbuton of the r quantum states from Σ the averaged error probablty s defned by ErrE n = r =1 p tr [ρ n 1 E n ]. If the lmt lm n 1 n log ErrEn exsts, we refer to t as the asymptotc error exponent. Otherwse we have to consder the correspondng lm sup and lm nf expressons. For two densty operators ρ 1 and ρ 2 the quantum Chernoff dstance s defned by ξ QCB ρ 1,ρ 2 := log nf 0 s 1 tr [ρ1 s 1 ρ s 2 ]. 1 It specfes the optmal achevable asymptotc error exponent n dscrmnatng between ρ 1 and ρ 2, compare [8], [1], [2]. Quantum tests wth mnmal averaged error probablty for a par of dfferent densty operators ρ 1 and ρ 2 on the same Hlbert space H are well-known to be gven by the respectve Holevo-Helstrom projectors Π 1 := supp ρ 1 ρ 2 +, Π 2 := supp ρ 2 ρ 1 + = 1 Π 1. Here supp a denotes the support projector of a self-adjont operator a, whle a + means ts postve part,.e. a + = a + a/2 for a := a a 1/2, see [5], [4]. As mentoned n the ntroducton, the Holevo-Helstrom projectors generalze the lkelhood rato tests for two probablty dstrbutons. Ths can be verfed by lettng ρ 1 and ρ 2 be two commutng densty matrces, cf. [8]. For a set Σ = {ρ } r =1 of densty operators on H, wherer>2, we ntroduce the generalzed quantum Chernoff dstance ξ QCB Σ :=mn{ξ QCB ρ,ρ j : 1 <j r}. 2 Ths s n full analogy to the defnton of the generalzed Chernoff dstance n classcal multple hypothess testng, where the densty operators are replaced by probablty dstrbutons on a fnte sample space, cf. [9]. Our frst theorem s an mplcaton of Theorem 2.2 n [8]. Theorem 1. Let r N and Σ = {ρ } r =1 be a set of parwse dfferent densty operators on H wth correspondng a pror probablty dstrbuton {p } r =1.For any sequence E n, n N, ofquantumtestsforσ n, respectvely, t holds lm sup 1 n n log ErrEn ξ QCB Σ, where ξ QCB Σ s the generalzed quantum Chernoff dstance defned by 2.

4 4 M. Nussbaum and A. Szko la It turns out that the generalzed quantum Chernoff dstance s achevable as an asymptotc error exponent n the case of pure states. Ths s the statement of our man theorem below. Theorem 2. Let r N and Σ = {ρ } r =1 be a set of parwse dfferent pure states of a quantum system S. Then there exsts a sequence {E n } n N of quantum tests for Σ n, respectvely, wth lm 1 n n log ErrEn =ξ QCB Σ,.e. the generalzed quantum Chernoff dstance s an achevable asymptotc error exponent n multple pure state dscrmnaton. 3 Generalzed Quantum Chernoff Bound n Multple Quantum State Dscrmnaton In ths secton we gve a proof of Theorem 1 statng that the generalzed quantum Chernoff dstance specfes a bound on the asymptotcally achevable error exponents n multple quantum state dscrmnaton. It reles on ts bnary verson presented n Theorem 2.2 n [8]. Proof Theorem 1. Fx any two ndces 1 < j r. For n N let A n,b n A n be two postve operators such that A n + B n = 1 E n E n j. Then the postve operators Ẽ n n := E + A n and Ẽj n n := E j + B n represent a POVM Ẽn n A n, whch we consder a quantum test for the par {ρ n }. For the ndvdual error probabltes of the modfed quantum test Ẽ n we obtan the upper bounds,ρ n j Err Ẽn =tr[ρ n 1 Ẽ n ] tr [ρ n 1 E n ] = Err E n, and smlarly Err j Ẽn Err j E n. It follows a lower bound on the average error probablty wth respect to the orgnal tests {E n } r =1 : r ErrE n = p k Err k E n p Err E n +p j Err j E n k=1 p Err Ẽn +p j Err j Ẽn p mn Err Ẽn +Err j Ẽn where p mn := mn{p : 1 r}. The above bound mples lm sup n 1 n log ErrEn lm sup 1 n n log p mn + lm sup 1 Err n n log Ẽn +Err j Ẽn = lm sup 1 n n log 1 2 ξ QCB ρ,ρ j., Err Ẽn +Err j Ẽn

5 Asymptotcally Optmal Dscrmnaton between Pure Quantum States 5 Here the last nequalty s by Theorem 2.2 n [8], whch represents the statement of our Theorem 1 n ts bnary verson correspondng to the specal case r = 2. Snce the par of ndces, j was choosen arbtrary, the statement of the theorem follows. 4 Asymptotcally Optmal Pure State Dscrmnaton In ths secton we provde a constructve proof for Theorem 2. Roughly speakng, our quantum tests, whch can be shown to acheve an asymptotc error exponent equal to the generalzed quantum Chernoff dstance of Σ, are obtaned from a Gram-Schmdt orthonormalzaton procedure of the unt vectors assocated to the pure states n Σ. Proof Theorem 2. Observe that n vew of Theorem 1 t s suffcent to construct quantum tests for whch we can verfy lm nf n 1 n log ErrEn ξ QCB Σ. For each 1 r let v be a unt vector n H such that v v = ρ. 1. We assume that the set V Σ :={v } r =1 s lnearly ndependent and start wth the case n = 1, where no tensor products are ncluded. We defne for each k =1,...,r,ad k matrxψ k Ψ k := v 1,...,v k, 3.e. the columns of Ψ k are equal to the state vectors v,1 k. We refer to the k k-matrx Ψ k Ψ k =: Γ k as a Gram matrx of {v 1,...,v k }. By the assumpton of lnear ndependence of the set V Σ foreachk {1,...,r} the operator P k := Ψ k Ψ k Ψ k 1 Ψ k = Ψ k Γ 1 k Ψ k, represents an orthogonal projector onto a k-dmensonal subspace of H, whch s spanned by the k state vectors v 1,...,v k.further,wesetp 0 = 0 and defne for 1 k r E k := P k P k 1. The E k represent one-dmensonal orthogonal projectors, whch are mutually 1 orthogonal. Wth e k := E k v k E kv k we can wrte E k = e k e k,andtheset {e k } r k=1 represents a Gram-Schmdt orthonormalzaton of the lnearly ndependent set V Σ of unt vectors v k, k =1,...,r.

6 6 M. Nussbaum and A. Szko la Observe that by constructon r =1 E 1. IfE 0 := 1 r =1 E 0,we redefne E 1 to be E 1 + E 0, such that r =1 E = 1 s satsfed. By dentfyng E, =1,...,r,wthρ, respectvely, we obtan a quantum test E 1 = {E } r =1 for Σ. For 1 r the correspondng ndvdual success probablty reads Succ E 1 =tr[ρ E ]=tr[ v v E ]= v P P 1 v. 4 Snce the P s are constructed as orthogonal projectors onto span{v 1,...,v } t holds v v P and as a consequence v P v = 1. Then from the relaton Err E 1 =1 Succ E 1 weobtan Err E 1 = v P 1 v = v Ψ Γ 1 1 Ψ 1 v 1 λ mn Γ 1 v Ψ 1 Ψ 1 v = 1 λ mn Γ 1 Ψ 1v 2, 5 where λ mn denotes the mnmal egenvalue of a self-adjont matrx. By defnton 3 of Ψ we have Ψ 1 v 1 2 = v j v 2, =2,...,r. 6 j=1 Insertng expresson 6 nto 5 we obtan the upper bound Err E 1 1 j=1 v j v 2 λ mn Γ 1. 7 Recall that the densty operators ρ, =1,...,r, are expected to appear wth probablty p, respectvely. Then the averaged error probablty can be estmated from above as follows ErrE 1 = r p Err E 1 =1 r Err E 1 =1 r 1 =2 j=1 v j v 2 λ mn Γ 1, 8 where n the second lne we have appled Let n>1. Notce that stll assumng that V Σ sasetofr lnearly ndependent unt vectors, the same remans true for V Σ n consstng of the n-fold tensor product state vectors v n, =1,...,r. Hence we can adopt the constructon of the quantum test E 1 for Σ as t stands for the tensor product

7 Asymptotcally Optmal Dscrmnaton between Pure Quantum States 7 case. In partcular, we defne Ψ j,n,1 j r, analogously to 3 as the d n j- matrx Ψ j,n := v1 n,...,vj n, respectvely. Then the correspondng averaged error probablty Err E n can be upper bounded smlarly to 8: r 1 Err E n v n j v n 2 r 1 λ mn Γ 1,n = vj v 2 n λ mn Γ 1,n, =2 j=1 =2 j=1 where Γ 1,n := Ψ 1,n Ψ 1,n. Observe that each Gram matrx Γ j,n = Ψj,n Ψ j,n, j =1,...,r,sasquare matrx of fxed dmenson j, respectvely. Further, note that the dagonal entres γ j,n kk, k =1,...,j of Γ j,n are gven by v n k v n k, respectvely, and hence are all equal to 1. Snce for k l t holds v k v l < 1, the off-dagonal entres = v n k 1 j r γ j,n k,l v n l = v k v l n tend to 0 as n goes to nfnty. It follows for every Γ j,n I j as n, where I j denotes the dentty matrx of dmenson j.bycontnutyofthemnmal egenvalue ths mples We conclude Err E n λ mn Γ j,n 1 as n. r 1 vj v 2 n 1 + o1. =2 j=1 As n tends to nfnty the largest term domnates. As a consequence we have 1 n log Err En max{log v j v 2 : 1 j< r} + o1 = mn{ξ QCB ρ,ρ j, 1 j< r} + o1 = ξ QCB Σ+o1, 9 wherenthesecondlnewehaveusedthefactthatnthecaseoftwodfferent pure states on H, sayρ = v v and σ = w w, the correspondng bnary quantum Chernoff dstance ξ QCB ρ, σ takes the smple form log v w 2,cf.[8]. The last dentty s by defnton 2 of the generalzed quantum Chernoff dstance. The proof s complete under the assumpton of lnear ndependence of the set of egenvectors of Σ. 3. Fnally, notce that even f V Σ s not lnearly ndependent, the set V Σ N consstng of N-fold tensor product vectors becomes lnearly ndependent for N large enough. Then, for every n N we can adopt the constructon of quantum tests E n for Σ n as presented n parts 1 and 2 of the proof, and the asymptotc relaton 9 remans vald.

8 8 M. Nussbaum and A. Szko la Acknowledgments. The work of M. N. has been supported n part by NSF Grant DMS A. S. wshes to thank the research groups of Prof. Jost and Nhat Ay at the MPI MS for ther nterest and helpful dscussons. References 1. Audenaert, K.M.R., Casamgla, J., Munoz-Tapa, R., Bagan, E., Masanes, L.l., Acn, A., Verstraete, F.: Dscrmnatng States: The Quantum Chernoff Bound. Phys. Rev. Lett. 98, Audenaert, K.M.R., Nussbaum, M., Szko la, A., Verstraete, F.: Asymptotc Error Rates n Quantum Hypothess Testng. Commun. Math. Phys. 279, Barett, S., Croke, S.: On the condtons for dscrmnaton between quantum states wth mnmum error. J. Phys. A: Math. Theor Helstrom, C.W.: Quantum Detecton and Estmaton Theory. Academc Press, New York Holevo, A.: Investgatons n the general theory of statstcal decsons. Trudy Mat. Inst. Steklov 124 n Russan Englsh translaton n Proc. Steklov Inst. of Math. 3. Amer. Math. Soc., Provdence Kholevo, A.: On asymptotcally optmal hypothess testng n quantum statstcs. Theor. Probab. Appl. 23, Köng, R., Renner, R., Schaffner, C.: The operatonal meanng of mn- and maxentropy. IEEE Trans. Inf. Th Nussbaum, M., Szko la, A.: The Chernoff lower bound for symmetrc quantum hypothess testng. Ann. Stat. 372, Salkhov, N.P.: On one generalsaton of Chernov s dstance. Theory Probab. Appl. 432, Tyson, J.: Two-sded estmates of mnmum-error dstngushablty of mxed quantum states va generalzed Holevo-Curlander bounds. J. Math. Phys. 50, Yuen, H.P., Kennedy, R.S., Lax, M.: Optmum testng of Multple Hypotheses n Quantum Detecton Theory. IEEE Trans. Inform. Thoery IT-212,

für Mathematik in den Naturwissenschaften Leipzig

für Mathematik in den Naturwissenschaften Leipzig ŠܹÈÐ Ò ¹ÁÒ Ø ØÙØ für Mathematk n den Naturwssenschaften Lepzg Asymptotcally optmal dscrmnaton between multple pure quantum states by Mchael Nussbaum, and Arleta Szkola Preprnt no.: 1 2010 Asymptotcally

More information

arxiv: v1 [quant-ph] 15 Jan 2010

arxiv: v1 [quant-ph] 15 Jan 2010 arxv:00.265v [quant-ph] 5 Jan 200 Exponental error rates n multple state dscrmnaton on a quantum spn chan Mchael Nussbaum, Arleta Szo la 2 Department of Mathematcs, Cornell Unversty Ithaca NY, 4853, USA

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Ph 219a/CS 219a. Exercises Due: Wednesday 23 October 2013

Ph 219a/CS 219a. Exercises Due: Wednesday 23 October 2013 1 Ph 219a/CS 219a Exercses Due: Wednesday 23 October 2013 1.1 How far apart are two quantum states? Consder two quantum states descrbed by densty operators ρ and ρ n an N-dmensonal Hlbert space, and consder

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1. 7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)

More information

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions PHYS 5C: Quantum Mechancs Sprng 07 Problem Set 3 Solutons Prof. Matthew Fsher Solutons prepared by: Chatanya Murthy and James Sully June 4, 07 Please let me know f you encounter any typos n the solutons.

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

A Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach

A Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

be a second-order and mean-value-zero vector-valued process, i.e., for t E

be a second-order and mean-value-zero vector-valued process, i.e., for t E CONFERENCE REPORT 617 DSCUSSON OF TWO PROCEDURES FOR EXPANDNG A VECTOR-VALUED STOCHASTC PROCESS N AN ORTHONORMAL WAY by R. GUTkRREZ and M. J. VALDERRAMA 1. ntroducton Snce K. Karhunen [l] and M. Lo&e [2]

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

Ph 219a/CS 219a. Exercises Due: Wednesday 12 November 2008

Ph 219a/CS 219a. Exercises Due: Wednesday 12 November 2008 1 Ph 19a/CS 19a Exercses Due: Wednesday 1 November 008.1 Whch state dd Alce make? Consder a game n whch Alce prepares one of two possble states: ether ρ 1 wth a pror probablty p 1, or ρ wth a pror probablty

More information

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent

More information

On Finite Rank Perturbation of Diagonalizable Operators

On Finite Rank Perturbation of Diagonalizable Operators Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Deriving the X-Z Identity from Auxiliary Space Method

Deriving the X-Z Identity from Auxiliary Space Method Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

Convergence of random processes

Convergence of random processes DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Refined Coding Bounds for Network Error Correction

Refined Coding Bounds for Network Error Correction Refned Codng Bounds for Network Error Correcton Shenghao Yang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, N.T., Hong Kong shyang5@e.cuhk.edu.hk Raymond W. Yeung Department

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: v1 [math.co] 1 Mar 2014 Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler

More information

Goodness of fit and Wilks theorem

Goodness of fit and Wilks theorem DRAFT 0.0 Glen Cowan 3 June, 2013 Goodness of ft and Wlks theorem Suppose we model data y wth a lkelhood L(µ) that depends on a set of N parameters µ = (µ 1,...,µ N ). Defne the statstc t µ ln L(µ) L(ˆµ),

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

A Note on Bound for Jensen-Shannon Divergence by Jeffreys

A Note on Bound for Jensen-Shannon Divergence by Jeffreys OPEN ACCESS Conference Proceedngs Paper Entropy www.scforum.net/conference/ecea- A Note on Bound for Jensen-Shannon Dvergence by Jeffreys Takuya Yamano, * Department of Mathematcs and Physcs, Faculty of

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

Quantum and Classical Information Theory with Disentropy

Quantum and Classical Information Theory with Disentropy Quantum and Classcal Informaton Theory wth Dsentropy R V Ramos rubensramos@ufcbr Lab of Quantum Informaton Technology, Department of Telenformatc Engneerng Federal Unversty of Ceara - DETI/UFC, CP 6007

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

MIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU

MIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU Group M D L M Chapter Bayesan Decson heory Xn-Shun Xu @ SDU School of Computer Scence and echnology, Shandong Unversty Bayesan Decson heory Bayesan decson theory s a statstcal approach to data mnng/pattern

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Norms, Condition Numbers, Eigenvalues and Eigenvectors

Norms, Condition Numbers, Eigenvalues and Eigenvectors Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b

More information

STAT 3008 Applied Regression Analysis

STAT 3008 Applied Regression Analysis STAT 3008 Appled Regresson Analyss Tutoral : Smple Lnear Regresson LAI Chun He Department of Statstcs, The Chnese Unversty of Hong Kong 1 Model Assumpton To quantfy the relatonshp between two factors,

More information

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 125, Number 7, July 1997, Pages 2119{2125 S 0002-9939(97)03816-1 TH STRONG OPN ST CONDITION IN TH RANDOM CAS NORBRT PATZSCHK (Communcated by Palle. T.

More information

On C 0 multi-contractions having a regular dilation

On C 0 multi-contractions having a regular dilation SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

An Inequality for the trace of matrix products, using absolute values

An Inequality for the trace of matrix products, using absolute values arxv:1106.6189v2 [math-ph] 1 Sep 2011 An Inequalty for the trace of matrx products, usng absolute values Bernhard Baumgartner 1 Fakultät für Physk, Unverstät Wen Boltzmanngasse 5, A-1090 Venna, Austra

More information

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

More information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator

More information

Explicit constructions of all separable two-qubits density matrices and related problems for three-qubits systems

Explicit constructions of all separable two-qubits density matrices and related problems for three-qubits systems Explct constructons of all separable two-qubts densty matrces and related problems for three-qubts systems Y. en-ryeh and. Mann Physcs Department, Technon-Israel Insttute of Technology, Hafa 2000, Israel

More information

Error Probability for M Signals

Error Probability for M Signals Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski EPR Paradox and the Physcal Meanng of an Experment n Quantum Mechancs Vesseln C Nonnsk vesselnnonnsk@verzonnet Abstract It s shown that there s one purely determnstc outcome when measurement s made on

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

für Mathematik in den Naturwissenschaften Leipzig

für Mathematik in den Naturwissenschaften Leipzig ŠܹÈÐ Ò ¹ÁÒ Ø ØÙØ für Mathematk n den Naturwssenschaften Lepzg Bounds for multpartte concurrence by Mng L, Shao-Mng Fe, and Zh-X Wang Preprnt no.: 11 010 Bounds for multpartte concurrence Mng L 1, Shao-Mng

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models

More information

7. Products and matrix elements

7. Products and matrix elements 7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ

More information

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Statistics II Final Exam 26/6/18

Statistics II Final Exam 26/6/18 Statstcs II Fnal Exam 26/6/18 Academc Year 2017/18 Solutons Exam duraton: 2 h 30 mn 1. (3 ponts) A town hall s conductng a study to determne the amount of leftover food produced by the restaurants n the

More information

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng

More information

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of

More information

The Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices

The Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY

More information

Why Bayesian? 3. Bayes and Normal Models. State of nature: class. Decision rule. Rev. Thomas Bayes ( ) Bayes Theorem (yes, the famous one)

Why Bayesian? 3. Bayes and Normal Models. State of nature: class. Decision rule. Rev. Thomas Bayes ( ) Bayes Theorem (yes, the famous one) Why Bayesan? 3. Bayes and Normal Models Alex M. Martnez alex@ece.osu.edu Handouts Handoutsfor forece ECE874 874Sp Sp007 If all our research (n PR was to dsappear and you could only save one theory, whch

More information