BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
|
|
- Hannah Hicks
- 5 years ago
- Views:
Transcription
1 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 x n, one can defne the W -weghted L space L (W = L ( n, W, as the space wth norm (ˆ f L (W = (ˆ W (xf(x C dx = d W (xf(x, f(x dx < In ths paper we consder the L (W space above wth matrx weghts that satsfy the A property, that s, [W ] A = sup W W <, W We clam where the supremum s taken over all cubes n n and W s defned as that f W belongs to the A class, then the esz transform s bounded L (W L (W and n fact L (W L (W [W ] 3 A log[w ] A Even more generally, under the same A assumpton,the Ahlfors-Beurlng transform T also satsfes T L (W L (W [W ] 3 A log[w ] A The proof of both results reles heavly on the technques and results descrbed n [] Outlne and Notaton Let D denote a dyadc lattce n n and let {h } D, represent the famly of Haar functons adapted to D Also defne, h = for all D Notce that h s not L normalzed Followng [], we wll consder the W -adapted dsbalanced Haar functons These functons were orgnally defned n the matrx settng by Trel and Volberg n [6] and are gven n terms of the set of egenvectors of W Let e, e,, ed be a set of orthonormal egenvectors of W and take w k = W e k W ek The dsbalanced Haar functons are defned as g W,k, = := w k h e k + h ẽ k,,
2 where ẽ k, = A(W,, ew and A(W,, = W (W, W +, W Here +, and, represent the subsets of the cube to whch the Haar functon h assgns postve and respectvely negatve value Note that, by calculatons n [6], ( g W,k,, g W,l,j = 0, k, l d,, j n One can also see that g W,k, L (W s unformly bounded for all k and Another mportant ngredent of the proof s a generalzed verson of the square functon Let ˆf( be the n dmensonal vector wth entres ˆf ( = f, h = L d f, h e j j= L e j, n, where {e j } d j= s an orthonormal bass n Gven ˆf(, denote by T σ the Haar multpler operator T σ f = σ, ˆf (h, D = where σ, s a d d matrx wth entres and Wth ths notaton t s possble to defne a generalzed verson of the square functon S W as S W : L ( n, L ( n,, S W f(x = E W (xt σ f(x, T σ f(x We then have S W L = W I ˆf (, ˆf ( D If W s a scalar A weght, the square functon S W s bounded and the constant depends lnearly on the A characterstc The followng theorem descrbes the relaton between the L norm of S W and the norm of f n the matrx settng Theorem Let W be a d d A matrx weght Then ( W I ˆf (, ˆf ( [W ] A log[w ] A f L (W, f L (W D To prove ths theorem, we proceed as n [] The result requres the estmate below, whch follows by the argument of Trel and Volberg n [6]: Theorem Let W be a d d A matrx weght and let h be Haar functons on the cubes n D Let and be two dsjont subsets of of equal measure such that each dyadc chld of s contaned n ether or Then for all f L, W (W W D W W W f [W ] A log[w ] A f L
3 Ths s just the n verson of Theorem 6 n [6] wth the constants stated explctly For the sake of completeness, we provde a sketch of the proof of ths result n Secton 3 We wll also requre the followng lower bound of the square functon: Theorem 3 Let W be a d d A matrx weght and let C W be defned as Then for any f L (W, C W = [W ] A log[w ] A (3 f L (W C W S W f L Ths bound wll arse as a consequence of Theorem under a change n notaton 3 Proof of Theorem In ths secton we provde the proof of the result of Trel and Volberg for n We wll track the dependence of the bound on [W ] A, but not on dmensonal constants We begn by statng some lemmas from [6] and provdng the proofs for those results that need to be adapted to hgher dmensons Lemma 4 Let W be a nonnegatve measurable d d matrx functon on a measure space (X, µ Then ˆ ˆ W (t dµ(t d W (tdµ(t X The proof s mmedate gven that the norm of any square matrx s equvalent to ts trace Usng Lemma and the smlar result for scalar weghts, one obtans: Lemma 5 For a d d matrx A weght W, the followng nequalty holds: ˆ ( ˆ W C W, where C s a dmensonal constant The followng theorem s the man result of [6] Theorem 6 Let W be a d d A weght and let h be a collecton of Haar functons on the dyadc cubes Let and be two subsets of of equal measure such that each dyadc chld of belongs only to ether or Then D, for all dyadc cubes W (W W X W Proof For any dyadc cube, we defne the followng µ( = det W ν( = det W m( = µ(ν( [W ] A log[w ] A,
4 Note that W = W +W, so by Lemma 4 n [6], Wth ths notaton, µ( µ( µ( = det W W (det W = det µ( µ( µ( and ν( ν( + ν( ( W W W ( det W W W and followng the argu- Lettng A = W W W and B = W W W ment n Proposton 4 n [6], we obtan that ( det A det B exp 4 trace((a B Therefore, µ( (µ( µ( exp ( 4 trace By the defnton of m, snce ν( ν( ν(, ( (4 m( (m( m( exp ( ( 4 trace W ( ( W (W W (W W W W It s now possble to apply (4 to and, takng and and and respectvely to be the subsets of and wth the propertes descrbed n (4 epeatng the process, we obtan ( ( n ( δ ( ( m( m( δ exp 8 trace W δ W δ W δ W δ, δ where δ runs over all possble n-tuples of and By the same reasonng as n [6], ( δ ( ( trace W δ W δ W δ W δ [W ] A log[w ] A We can now provde the proof of Theorem Proof Set µ( = W (W W W Let J be the embeddng operator J : L ( l ({µ(},, { } J f = W W f It can be checked that the operator J, the formal adjont of J has representaton J {α } D = χ W W α, {α } D l ({µ(}, D D
5 Notce that f =, then the block (J J, of the operator (J J s zero Furthermore, (J J, = ((J J,, and f, (J J, = W W Therefore, f, (J J, = (J J, = W W Set t, = t, and let them be equal to the expresson above f If =, set t, = t, = 0 We obtan a matrx {t, }, D To prove Theorem, t suffces to show that ths matrx generates a bounded operator on l ({µ(},, and n fact, snce the matrx {t, }, D s symmetrc, t s suffcent to show that the matrx {T, }, D defned as { t, T, = 0 otherwse generates a bounded operator on l ({µ(}, To do so, we must bound the sum T, T, µ( D If =, by defnton, T, T, = 0, so we can assume wthout loss of generalty that and In ths case, T, T, µ( = T, T, µ( D D, = W W W W µ( D, = W W W W W W µ( D, W W W W µ( D, By Lemma 35 n [6], the weght W W W satsfes the A condton wth A char- acterstc [W ] A Thus we can apply Lemma 5 to bound W W : W W = W W W ˆ W W W ( ˆ C W W ( ˆ = C W W χ
6 By Lemma 6, D, W (W W W [W ] A log[w ] A, so t s possble to apply the dyadc Carleson Embeddng Theorem (Theorem 6 n [6] One obtans: T W W, T, µ( D, C ( ˆ W W χ µ( D, W C[W ] A W χ L ˆ = C[W ] A W W W C[W ] A W W W (ˆ = C[W ] A log[w ] A, where the last nequalty was obtaned from Lemma 4 Thus, D so Theorem s proved T, T, µ( C[W ] A W W = C[W ] A (T, + T,, 4 Proof of theorem Proof Assume wthout loss of generalty that W and W are bounded (see emark 34 n [] and let DW be the dscrete multplcaton operator { DW h j e W k = h e k f = j 0 f j, where e k are the standard bass vectors n Defne the ( n ( n matrx operator D W by ( D W,j = D W Also let F be the n vector wth entres F = f and let M W be the ( n ( n dagonal matrx operator ( M W = M W, where M W s the multplcaton by W operator on L Note that S W f L = DW F, F L Therefore, nequalty (3 becomes MW F, F C n W DW F, F L L
7 Followng the argument n [] (whch tself follows [4], we proeed to nvert the nequalty Snce W and W, are bounded, the operators M W and DW are bounded and nvertble and ther nverses are M W = M W and { (DW h j e W k = h e k f = j 0 f j, respectvely Thus D W and M W are nvertble wth nverses D W and M W and the nequalty above can be nverted as: (5 D W F, F C W M L W L F, F In concluson, the proof of Theorem 3 amounts to showng that W ˆf (, ˆf ( C W f L (W f L D Frst defne, for D, a set of orthonormal egenvectors e, e,, ed of W Also defne w k = W e k W ek Then D W = ˆf (, ˆf ( = D d (w k f, h e k L Usng the dsbalanced Haar functons adapted to W, we expand h ek as: D d (w k f, h e k = L D D + D d (w k f, (wq k g W,k, L (w k A(W, h e k d f, g W,k, L + d f, A(W, h e k L = S + S + S 3 We now bound the three sums ndvdually By defnton, S = d f, g W,k, L D = d W f, g W,k, D f L (W, D L (W d f, g W,k, f, A(W, h e k L L where the last nequalty s a result of the fact that the functons g W,k, are unformly bounded n L (W and have dsjont support To bound S 3, one can rewrte t as
8 S 3 = D = D = D = D D D d d d d f, W (W, W +, W h e k L f, W Ŵ ( W h e k L f, W Ŵ ( W ek W f, W Ŵ ( W ek d W f W Ŵ ( W W f W Ŵ ( W ek Applyng Theorem to the functon W f, one obtans S 3 [W ] A log[w ] A f L (W Fnally, to bound S, notce that S S S 3, so the bounds on S and S 3 mply a bound on S Therefore, the quantty s bounded, that s whch completes the proof of Theorem S + S + S 3 C W f L (W, We can now apply Theorem to prove Theorem 3 Proof For ease of notaton, let B W = [W ] A log[w ] A, and as before assume wthout loss of generalty that W and W are bounded Usng the same notaton as above, we fnd that provng Theorem 3 s equvalent to showng that D W f, f L B W M W f, f L f L As before, t suffces to prove D W f, f L B W M W f, f L f L We clam that D W [W ] A ((D W By the A condton, W W e, W W e [W ] A e,
9 for all D and all vectors e In partcular, for a fxed g L and e = W ĝ (, W ĝ (, W W ĝ ( [W ] A ĝ (, W Then D W g, g = W L ĝ (, W ĝ ( D W [W ] A ĝ (, W ĝ ( D = [W ] A D W g, g L ĝ ( By equaton (5 n the proof of theorem 3, D W g, g L [W ] A (D W g, g L [W ] A C W M W g, g L = B W g L (W 5 The sez Transform In [5], Petermchl, Trel, and Volberg proved that the esz transform on L (W can be consdered essentally as an average of dyadc shfts Ths result s an extenson of the frst author s result n [3], whch stated that unform boundedness of the dyadc shfts mples the boundedness of the Hlbert transform The dyadc shft operator on a dyadc lattce D s defned as D f = f ((h + h D By the man results n [5], the esz transform on L ( n can be wrtten as = ct + M b, where c s a constant, T s the closure of the convex hull of the planar dyadc shfts n the weak operator topology, b s a bounded functon on n, and M b s the multplcaton by b operator Applyng ths result componentwse to the esz transform on L ( n,, we obtan the same expresson as before Gven ths equalty, we fnd that the bound proved n Theorem mples a smlar bound for the esz transform Theorem 7 If s the esz transform on L ( n, and W s a d d matrx A weght, f L (W [W ] 3 A log[w ] A f L (W Proof Note that the square functon S W does not depend on dyadc shfts More precsely, f s the parent of n the dyadc grd, W f(, f( D = = D D = S W L W f (, f ( W f (, f (
10 Now, by Theorems, and 3 f L (W [W ] A log[w ] A W f (, f ( D [W ] 3 A (log[w ] A f L (W The expresson for n terms of f then gves whch proves the theorem f L (W [W ]3 A (log[w ] A f L (W, A smlar argument mples the same bound for the Ahlfors-Beurlng transform Theorem 8 If T s the Ahlfors-Beurlng transform on L ( n, and W s a d d matrx A weght, T f L (W [W ] A log[w ] A f L (W Proof In [], t s shown that the Ahlfors-Beurlng transform T s n the weakly closed lnear span of two-dmensonal martngale transforms τ σ Consder the dyadc lattce D as the collecton of squares of the form = I J, where I and J are dyadc ntervals of the same length Then one can consder three Haar functons assocated to : h I (x, y = h I (x J (y J h J (x, y = h J (x I (y I h (x, y = h I (xh J (y Wth ths notaton, the two-dmensonal martngale transform s defned as τ σ f := σ I ( f, h I h I + σ J ( f, h J h J + σ( f, h h, D D D where σ I, σ J, σ : D {, } The proof of the theorem amounts to boundng the operators τ σ unformly by the quantty [W ] A log[w ] A We have τ σ f L (W σ I ( f, h I h I + σ J ( D f, h J h J + σ( f, h h L D (W L D (W = B + B + B 3 The bounds on B and B are establshed n [] For B 3, one can consder B 3 T σ L (W The bound on T σ L (W arses from a smlar argument to that n [] Note that D = W Tσ f (, T σ f ( = D = D = = σ, W σ, f (, σ, f ( L (W W σ, W W f (, σ, W W f ( D = W f (, f (
11 By Theorems and 3, T σ L (W [W ] A log[w ] A W Tσ f (, T σ f ( [W ] A log[w ] A σ, D = [W ] 3 A (log[w ] A σ, f L (W W f (, f ( Therefore, the bound on B 3 s proved Substtutng back nto the defnton of τ σ, we obtan τ σ f L (W B + B + B 3 the desred nequalty [W ] 3 A log[w ] A f L (W, eferences [] K Bckel, S Petermchl, and B Wck, Bounds for the Hlbert Transform wth matrx A weghts (04, arxv:403886v3 [] O Dragčevć and A Volberg, Sharp estmates of the Ahlfors-Beurlng transform va averagng martngale transforms, Mchgan Math J5 (003 [3] S Petermchl, Dyadc shfts and a logarthmc estmate for Hankel operators wth matrx symbol, C Acad Sc Pars Sér I Math 330 (000, no 6, [4] S Petermchl and S Pott, An estmate for weghted Hlbert transform va square functons, Trans Amer Math Soc 354 (00, no 4, [5] S Petermchl, S Trel, and A Volberg, Why the esz transforms are averages of the dyadc shfts, Publ Math46 (00, no, 09 8 [6] S Trel and A Volberg, Wavelets and the angle between past and future, J Funct Anal, 43 (997, no,
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 informationAPPENDIX 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 informationLectures - 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 informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationThe 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 informationMATH 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 informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More information8.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 information2.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 informationInner 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 informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationSalmon: 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 informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationAppendix 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 informationA 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 informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationC/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 informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationSL 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 informationMaximizing 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 informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationComplete 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 informationRandom 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 informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationarxiv: 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 informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationChapter 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 informationarxiv: v2 [math.ca] 19 Feb 2014
BOUNDS FOR THE HLBERT TRANSFORM WTH MATRX A WEGHTS KELLY BCKEL, STEFANE PETERMCHL, AND BRETT D. WCK arxiv:140.3886v [math.ca] 19 Feb 014 Abstract. LetW denote a matrixa weight. n this paper we implement
More information3.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 informationEigenvalues 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 informationStanford 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 information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationOn 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 informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationON 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 informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationU.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 information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationNorms, 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 informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More information763622S 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 informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationUsing 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 informationCSCE 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 informationHowever, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values
Fall 007 Soluton to Mdterm Examnaton STAT 7 Dr. Goel. [0 ponts] For the general lnear model = X + ε, wth uncorrelated errors havng mean zero and varance σ, suppose that the desgn matrx X s not necessarly
More informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationFirst 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 informationANSWERS. 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 informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationThe 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 informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 6 Luca Trevisan September 12, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 6 Luca Trevsan September, 07 Scrbed by Theo McKenze Lecture 6 In whch we study the spectrum of random graphs. Overvew When attemptng to fnd n polynomal
More informationDeriving 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 informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationErrata to Invariant Theory with Applications January 28, 2017
Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng
More informationComposite 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 informationConvexity 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 informationPerron 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 informationChat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980
MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and
More informationGeneral 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 informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationNOTES 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= = = (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 informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationRestricted Lie Algebras. Jared Warner
Restrcted Le Algebras Jared Warner 1. Defntons and Examples Defnton 1.1. Let k be a feld of characterstc p. A restrcted Le algebra (g, ( ) [p] ) s a Le algebra g over k and a map ( ) [p] : g g called
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationThe proximal average for saddle functions and its symmetry properties with respect to partial and saddle conjugacy
The proxmal average for saddle functons and ts symmetry propertes wth respect to partal and saddle conjugacy Rafal Goebel December 3, 2009 Abstract The concept of the proxmal average for convex functons
More informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
More informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationPerfect 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 informationTHE CLASS NUMBER THEOREM
THE CLASS NUMBER THEOREM TIMUR AKMAN-DUFFY Abstract. In basc number theory we encounter the class group (also known as the deal class group). Ths group measures the extent that a rng fals to be a prncpal
More informationCommunication Complexity 16:198: February Lecture 4. x ij y ij
Communcaton Complexty 16:198:671 09 February 2010 Lecture 4 Lecturer: Troy Lee Scrbe: Rajat Mttal 1 Homework problem : Trbes We wll solve the thrd queston n the homework. The goal s to show that the nondetermnstc
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More information