Two remarks on normality preserving Borel automorphisms of R n
|
|
- Victor Taylor
- 6 years ago
- Views:
Transcription
1 Proc. Indian Acad. Sci. (Math. Sci.) Vol. 3, No., February 3, pp c Indian Academy of Sciences Two remarks on normality preserving Borel automorphisms of R n K R PARTHASARATHY Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, 7, S. J. S. Sansanwal Marg, New Delhi 6, India krp@isid.ac.in MS received 8 November ; revised 7 May Abstract. Let T beabijectivemaponr n such that both T and T are Borel measurable. For any θ R n and any real n n positive definite matrix, let N(θ, )denote the n-variate normal (Gaussian) probability measure on R n with mean vector θ and covariance matrix. Here we prove the following two results: () Suppose N(θ j, I )T is gaussian for j n, wherei is the identity matrix and {θ j θ, j n} is a basis for R n. Then T is an affine linear transformation; () Let j = I + ε j u j u j, j n where ε j > forevery j and {u j, j n} is a basis of unit vectors in R n with u j denoting the transpose of the column vector u j. Suppose N(, I )T and N(, j )T, j n are gaussian. Then T (x) = s E s (x)v sux a.e. x, wheres runs over the set of n diagonal matrices of order n with diagonal entries ±, U, V are n n orthogonal matrices and {E s } is a collection of n Borel subsets of R n such that {E s } and {V su(e s )} are partitions of R n modulo Lebesgue-null sets and for every j, V su j (V su) is independent of all s for which the Lebesgue measure of E s is positive. The converse of this result also holds. Our results constitute a sharpening of the results of Nabeya and Kariya (J. Multivariate Anal. (986) 5 64) and part of Khatri (Sankhyā Ser. A 49 (987) ). Keywords. partition. Borel automorphism; normality preserving Borel automorphism; Lebesgue. Introduction and preliminaries Let ( i, F i ), i =, be measurable spaces and let P i be a set of probability measures on F i for each i. In the context of statistical theory, Basu and Khatri [] posed the important problem of characterizing the set of all measurable maps T : satisfying the property that μt P whenever μ P. They present many examples and solve the problem completely when = R n, = R m, F and F are Borel σ -algebras and P and P are sets of all gaussian laws. When = = R m, P = P ={μa, A an affine linear transformation of R n }, where μ is a fixed probability measure, the problem looks particularly interesting. When n = and μ is the symmetric Cauchy law this problem has been given a complete solution 75
2 76 K R Parthasarathy by Letac [4]. In the gaussian case on the real line there are many variations due to Ghosh [] and Mase [6]. Nabeya and Kariya [7] have studied the problem when T is a Borel automorphism of R n, i.e., a bijective map on R n such that T and T are Borel measurable, P is the class of all nonsingular gaussian measures on R n and P is a restricted class of such gaussian measures. Here we follow their approach and obtain a sharpened version of their results after a more detailed analysis in two cases when P is the set of all nonsingular gaussian measures in R n but P is () a set of n + gaussian measures with a fixed nonsingular covariance matrix and mean vectors θ j, j n where {θ j θ, j n} is a basis for R n ; () a set of (n + ) gaussian measures with a fixed mean vector θ and nonsingular covariance matrices j, j n such that Rank( j ) = and there exists a basis {u j, j n} of unit vectors in R n satisfying the condition u j Range ( j ) for each j =,,...,n. The main result of Nabeya and Kariya in the gaussian case follows as a corollary. Theorem of Khatri s paper [3] has a more general version of our first characterization result of Corollary 3. when there are two covariance matrices, instead of a single. For the case of several covariance matrices his conjecture is still open. However, in the case of a fixed mean vector our second characterization result in Theorem 4.4 seems to be new. We conclude this section with some notations and definitions that will be used in the following sections. Let GL(n), S + (n) and D n denote respectively the set of all real n n nonsingular matrices, positive definite matrices and diagonal matrices with entries ±. For any matrix A, denote by A its transpose. We express any element of R n as a n matrix and for any θ R n, S + (n), denote by N(θ, ) the gaussian probability measure in R n with density function (π) n/ / exp{ /(x θ) (x θ)}, being the determinant of. A Borel map T on R n is called an affine automorphism if T (x) = Ax + a a.e. x with respect to the Lebesgue measure where A GL(n) and a R n. All almost everywhere statements in R n will be with respect to Lebesgue measure. By a Lebesgue partition over D n we mean a collection {E s, s D n } of Borel sets with the property that all the sets R n \ s Dn E s, E s E t, s = t have zero Lebesgue measure. If T is an affine automorphism of R n such that T (x) = Ax + a a.e. x for some A GL(n), a R n and N(θ, )is a gaussian probability measure with mean vector θ and covariance matrix then N(θ, )T = N(Aθ + a, A A ). We say that two Borel automorphisms T and T are affine equivalent if T = RT S a.e. for some affine automorphisms R and S. If T is a Borel automorphism of R n and N(θ, )T = N(ϕ, ) for some θ, ϕ R n,, GL(n) then there exists a Borel automorphism T affine equivalent to T such that N(, I ) T = N(, I ), i.e., T preserves the standard gaussian probability measure with mean vector and covariance matrix I. Thus problems of the type we have described in the context of gaussian measures can be translated to the case when the Borel automorphism preserves the standard gaussian measure in R n.. Borel automorphisms preserving the normality of a pair of normal distributions Let T be a Borel automorphism of R n such that N(θ i, i )T = N(ϕ i, i ), i =, (.) where i, i S + (n), θ i, ϕ i R n for each i. Our aim is to establish the following proposition which, together with its proof, is a slight variation of Lemmas. and. together in the paper of Nabeya and Kariya [7].
3 Two remarks on normality preserving Borel automorphisms 77 PROPOSITION. Under condition (.) the following hold: () / / and / / have the same characteristic polynomial. () (ϕ ϕ ) ( z ) (ϕ ϕ ) = (θ θ ) ( z ) (θ θ ) as analytic functions of z. (3) (ϕ ϕ ) (ϕ ϕ ) = (θ θ ) (θ θ ). (4) (T (x) ϕ ) (T (x) ϕ ) (T (x) ϕ ) (T (x) ϕ ) = (x θ ) (x θ ) (x θ ) (x θ ), a.e. x. Proof. Let f i, f i denote respectively the density functions of N(θ i, i ), N(ϕ i, i ), i =,. Equation (.) implies, in particular, that the Lebesgue measure L in R n is equivalent to the measure LT and for any real t, [ ] t f (T (x)) = f [ ] t f (x) a.e. x. (.) f Integrating both sides with respect to the probability measure N(θ, ) and using (.) for i = wegetforallt in a neighbourhood of, ( t (t+/) t + ) t exp t(ϕ ϕ ) (ϕ ϕ ) { + t (ϕ ϕ ) (( t + ) t ( ) ( = t t+ t + ) t exp t (θ θ ) (θ θ ) { + t (θ θ ) (( t + ) t Squaring both sides and rearranging the terms this can be expressed as (t + ) t = e (t + ) t χ(t), ) (ϕ ϕ ) } ) } (θ θ ). where the left-hand side and the function χ(t) in the exponent of the right-hand side are rational functions of t in a neighbourhood of in R. By exactly the same arguments and using the theory of analytic functions as in the proof of Lemma. in [7] wenow conclude that ( t + ( t = t + ) t, χ(t) = (.3) )
4 78 K R Parthasarathy for all t in a neighbourhood of. The first part of equation (.3) implies property () of the proposition and, in particular, =. (.4) Now the second part of equation (.3) can be written as t{(θ θ ) (θ θ ) (ϕ ϕ ) { + t (θ θ ) (( t + ) t (ϕ ϕ )} ) (θ θ ) (( (ϕ ϕ ) t + ) ) } t (ϕ ϕ ) = in a neighbourhood of. Dividing by t and letting t we get property (3). After deleting the first term, dividing by t and replacing the parameter (t + ) t by z we get property (). Going back to equation (.), putting t =, using (.4) and taking logarithms we get property (4). This completes the proof. COROLLARY. Under condition (.) the following hold: (i) If =, then = ; (ii) If θ = θ, then ϕ = ϕ. Proof. Property (i) follows from property () in Proposition. whereas property (ii) is a consequence of property (3) of the same proposition. 3. The first characterization theorem Here we consider a Borel automorphism T of R n satisfying the property that N(θ, )T is a gaussian probability measure for a fixed in S + (n) and the mean vector θ varying in a natural set of (n + ) points in R n. We shall make use of the remark at the end of. Theorem 3. Let T be a Borel automorphism of R n and let {θ j, j n} R n be a set of (n + ) points with the property that θ j θ, j =,,...,n is a basis for R n. Suppose N(θ j, I )T = N(ϕ j, j ), j n. Then T is an affine automorphism. Proof. By part (i) of Corollary. there exists S + (n) such that j = for every j. From property (3) of Proposition. we have (ϕ i ϕ j ) (ϕ i ϕ j ) = (θ i θ j ) (θ i θ j ) (3.)
5 Two remarks on normality preserving Borel automorphisms 79 for all i, j {,,,...,n}. Hence the correspondence (θ i θ ) / (ϕ i ϕ ), i n is distance preserving in R n with the Euclidean metric. Since {θ i θ, i n} is a basis for R n it follows that there exists an orthogonal matrix U such that U(θ i θ ) = / (ϕ i ϕ ), i n. (3.) Using property (4) of Proposition. we have (T (x) ϕ i ) (T (x) ϕ i ) (T (x) ϕ j ) (T (x) ϕ j ) = (x θ i ) (x θ i ) (x θ j ) (x θ j ), i, j {,,,...,n} a.e. x. Expressing T (x) ϕ i = T (x) ϕ + ϕ ϕ i, x θ i = x θ + θ θ i for each i and expanding both sides of the equation above we obtain by using (3.) the equation (ϕ i ϕ j ) (T (x) ϕ ) = (θ i θ j ) (x θ ) a.e. x. Writing A = (θ θ ). (θ n θ ), B = (ϕ ϕ ). (ϕ n ϕ ) and using (3.) we conclude that A and B are nonsingular matrices and T (x) = ϕ + B A(x θ ) a.e. In other words, T is an affine automorphism. COROLLARY 3. Let T be a Borel automorphism of R n and let {θ j, j n} R n be a set of n + points such that {θ j θ, j n} R n is a basis for R n. Suppose there exists an n n nonsingular covariance matrix such that N(θ j, )T = N(ϕ j, j ), j n. Then T is an affine automorphism. Proof. Define T (x) = T ( / x). Then T is a Borel automorphism for which N(/ θ j, I )T = N(ϕ j, j ), j n. Since {/ (θ j θ ), j n} is a basis for R n it follows that T and therefore T is an affine automorphism. Remark 3.3. Corollary 3. is false if T is just a Borel measurable map. Using a result of Linnik (Theorem 4.3. of [5]), Mase [6] has shown that given any finite set of normal
6 8 K R Parthasarathy distributions {N j, j k} on R there exists a Borel map T : R R such that N j T is the probability measure of the standard normal distribution on R. 4. The second characterization theorem Here we consider the case of a Borel automorphism T of R n such that N(θ, )T is a gaussian probability measure for a fixed θ in R n but varying in a set of n + covariance matrices with n of them being rank one perturbations of the remaining one. Without loss of generality one may assume the fixed mean vector θ to be. We begin with a lemma. Lemma 4.. Let T be a Borel automorphism of R n such that N(, I )T = N(, I ), N(, )T = N(η, ), where = I + εuu, u is a unit vector in R n and ε is a real nonzero scalar such that ε>. Then η = and = I + εvv for some unit vector v. Furthermore, (v T (x)) = (u x) a.e. x. (4.) Proof. By property (ii) of Corollary., η =. By property () of Proposition., and have the same characteristic polynomial and therefore = I + εvv for some unit vector v. By property (4) of Proposition. we have T (x) (I + εvv ) T (x) T (x) T (x) = x (I + εuu ) x x x a.e. x. (4.) Since, for any unit vector w,(i + εww ) = I Lemma 4.. Let T be a Borel automorphism of R n such that (i) N(, I )T = N(, I ), (ii) N(, j )T = N(ϕ j, j ), j n, ε +ε ww, (4.) follows from (4.). where j = I + ε j u j u j, j n, = ε j > j and {u j, j n} is a basis of unit vectors in R n. Then there exist A, BinGL(n) and a Lebesgue partition {E s, s D n } of R n over D n such that (i) {BsAE s, s D n } is a Lebesgue partition over D n, (ii) T (x) = s Dn Es (x)b s Ax a.e. x, (iii) T (x) = s Dn BsA(Es )(x)a sb x a.e. x. Proof. From Lemma 4. we have ϕ j = j and j = I + ε j v j v j, j n where each v j is a unit vector. Furthermore, (v j T (x)) = (u j x) a.e. x, j n.
7 Two remarks on normality preserving Borel automorphisms 8 Denoting s = diag(s, s,...,s n ) with s j =± and diag indicating diagonal matrix define the Borel sets E s ={x v j T (x) = s ju j x j =,,...,n}, s D n. Then it follows that for the Lebesgue measure L, ( ) L R n \ =. Write Then s Dn E s u v u A =., C = v.. u n v n CT(x) = sax x E s. Choose s D n such that L(E s )>. Then we know that {sax, x E s } spans R n and therefore {CT(x), x E s } spans R n. Thus C GL(n). Writing B = C we have T (x) = BsAx x E s. Now let s, t D n, s = t. If x E s E t we have sax = tax. In other words, Ax is an eigenvector of st and st = I. Hence L(E s E t ) =. Thus {E s, s D n } is a Lebesgue partition over D n and T (x) = s Es (x)bsax a.e. x. Putting T (x) = y and solving for x from this equation we get T (y) = s BsA(Es )(y)a sb y a.e. y, where {BsA(E s ), s D n } is also a Lebesgue partition. This proves all the required properties (i) (iii) of the lemma. Lemma 4.3. In Lemma 4., the matrices A and B can be chosen to be orthogonal. Proof. Following the notations of Lemma 4. and its proof denote F s = BsA(E s ) and by (, ) any of the pairs (I, I ), ( j, j ), j n. Then we have = and N(, )T = N(, ).Thus, for any λ R n we have e λ x x x dx = e λ T (x) x x dx = s e λ BsAx x x E s = AB s F s e λ x x (A sb ) A sb x dx.
8 8 K R Parthasarathy By the uniqueness of Laplace transforms we conclude that e x x = AB s Dn Fs (x)e x (A sb ) A sb x a.e. x. Suppose L(E s )>. Then L(F s )>. Since {F t } is a Lebesgue partition we have log AB = x ( (A sb ) A sb )x a.e. x F s. In other words, the quadratic form on the right-hand side is a constant on a set of positive Lebesgue measure. A simple argument based on Fubini s theorem implies that AB = and BsA (BsA) =, whenever L(E s )>. Choosing (, ) = (I, I ) we conclude that BsA is orthogonal. Let B = VK, A = HU where U, V are orthogonal and K, H are positive definite. Then K sh sk = I and therefore K = sh s and BsA = V su. This shows that V su (V su) =, whenever L(E s )> and Lemma 4. holds with A, B replaced by U, V respectively. Theorem 4.4 Let T be a Borel automorphism of R n and let j = I +ε j u j u j, j n where ε j > for every j and {u j, j n} is a basis of unit vectors in R n. Then N(, I )T = N(, I ) and N(, j )T is a gaussian probability measure for every j if and only if there exist n n orthogonal matrices U, V and a Lebesgue partition {E s, s D n } of R n such that the following hold: (i) T (x) = s Dn Es (x)v sux a.e. x; (ii) {V su(e s ), s D n } is also a Lebesgue partition. In such a case there exists a basis {v j, j n} of unit vectors in R n such that (iii) V suu j = v j if L(E s )>, j n; (iv) N(, j )T = N(, j ), j where j = I + ε j v j v j, j n. Proof. The only if part is contained in Lemmas 4. and 4.3 and their proofs. Conversely, suppose there exist orthogonal matrices U, V and a Lebesgue partition {E s, s D n } such that (i), (ii) and (iii) hold. Then for every pair (, ) = (I, I ), ( j, j ), j n we have e λ T (x) x x dx = s e λ V sux x x dx E s = s e λ x x x dx = V su(e s ) e λ x x x dx. Since = it follows that N(, )T = N(, ).
9 COROLLARY 4.5 Two remarks on normality preserving Borel automorphisms 83 Let T be a Borel automorphism of R n and let j, j n be elements in S + (n) satisfying the following conditions: () rank( j ) =, () Range( j ) = Ru j with u j as a unit vector, where u, u,...,u n is a basis for R n. Then N(, j )T = N(, j ) for every j, for some covariance matrices,,..., n if and only if there exist orthogonal matrices U, V of order n and a Lebesgue partition {E s, s D n } such that {V su(e s ), s D n } is also a Lebesgue partition and T (x) = s Dn Es (/ x) / VsU/ x a.e. x. Proof. This is immediate from Theorem 4.4 and the fact that the Borel automorphism T defined by T (x) = / T (/ x) preserves N(, I ) and transforms N(,/ j / ) to a mean zero gaussian probability measure for each j =,,...,n. Remark 4.6. Let R = F j+ F j be a partition of R into two disjoint symmetric Borel subsets, i.e. F j+ = F j+ and F j = F j for each j =,,...,n and for s = diag(s, s,...,s n ) in D n let F s = F s F s F sn where F s j = { Fj+, if s j =+, F j, if s j =. If U, V are orthogonal matrices of order n, putting E s = U F s for every s we note that {E s, s D n } and {V sue s, s D n } are Lebesgue partitions of R n. Indeed, V sue s = VF s for every s. Remark 4.7. If {E s, s D n } happens to be a trivial Lebesgue partition in the sense that for some s, L(R n \E S ) = then the Borel automorphism T in Theorem 4.4 is an orthogonal transformation a.e. whereas in Corollary 4.5 it is a nonsingular linear transformation a.e. in R n. Remark 4.8. In Theorem 4.4, let D ={s L(E s )>} D n and let T satisfy (i) (iv). Suppose C ={A A S + (n), suau s is independent of s varying in D}.
10 84 K R Parthasarathy Then N(, A)T = N(, V suau sv ) A C, s D. Acknowledgements The author is grateful to B G Manjunath for bringing his attention to all the references in this paper and particularly to the results of Nabeya and Kariya [7]. He wishes to thank Manjunath and the referee for citing the importance of Khatri s paper [3] in the course of revision of this paper. References [] Basu D and Khatri C G, On some characterizations of statistics, Sankhyā Ser. A 3 (969) 99 8 [] Ghosh J K, Only linear transformations preserve normality, Sankhyā Ser. A 3 (969) 39 3 [3] Khatri C G, Characterization of bijective and bimeasurable transformations of normal variates, Sankhyā Ser. A 49 (987) [4] Letac G, Which functions preserve Cauchy laws? Proc. Amer. Math. Soc. 67 (977) [5] Linnik Yu V, Statistical Problems with Nuisance Parameters (968) (American Mathematical Society) [6] Mase S, Some theorems on normality preserving transformations, Sankhyā Ser. A 39 (977) 86 9 [7] Nabeya S and Kariya T, Transformations preserving normality and Wishartness, J. Multivariate Anal. (986) 5 64
A note on Gaussian distributions in R n
Proc. Indian Acad. Sci. (Math. Sci. Vol., No. 4, November 0, pp. 635 644. c Indian Academy of Sciences A note on Gaussian distributions in R n B G MANJUNATH and K R PARTHASARATHY Indian Statistical Institute,
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationThe Hilbert Transform and Fine Continuity
Irish Math. Soc. Bulletin 58 (2006), 8 9 8 The Hilbert Transform and Fine Continuity J. B. TWOMEY Abstract. It is shown that the Hilbert transform of a function having bounded variation in a finite interval
More informationDUALITY, CENTRAL CHARACTERS, AND REAL-VALUED CHARACTERS OF FINITE GROUPS OF LIE TYPE
DUALITY, CENTRAL CHARACTERS, AND REAL-VALUED CHARACTERS OF FINITE GROUPS OF LIE TYPE C. RYAN VINROOT Abstract. We prove that the duality operator preserves the Frobenius- Schur indicators of characters
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More informationDS-GA 1002 Lecture notes 10 November 23, Linear models
DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.
More informationReminder Notes for the Course on Measures on Topological Spaces
Reminder Notes for the Course on Measures on Topological Spaces T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie
More informationMATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003
MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More informationLinear Algebra. Session 8
Linear Algebra. Session 8 Dr. Marco A Roque Sol 08/01/2017 Abstract Linear Algebra Range and kernel Let V, W be vector spaces and L : V W, be a linear mapping. Definition. The range (or image of L is the
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationA Sharpened Hausdorff-Young Inequality
A Sharpened Hausdorff-Young Inequality Michael Christ University of California, Berkeley IPAM Workshop Kakeya Problem, Restriction Problem, Sum-Product Theory and perhaps more May 5, 2014 Hausdorff-Young
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationChapter 3: Theory Review: Solutions Math 308 F Spring 2015
Chapter : Theory Review: Solutions Math 08 F Spring 05. What two properties must a function T : R m R n satisfy to be a linear transformation? (a) For all vectors u and v in R m, T (u + v) T (u) + T (v)
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More informationINTRODUCTION TO FURSTENBERG S 2 3 CONJECTURE
INTRODUCTION TO FURSTENBERG S 2 3 CONJECTURE BEN CALL Abstract. In this paper, we introduce the rudiments of ergodic theory and entropy necessary to study Rudolph s partial solution to the 2 3 problem
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
More informationLinear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University Math 8530, Spring 2017
Linear maps Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8530, Spring 2017 M. Macauley (Clemson) Linear maps Math 8530, Spring 2017
More informationOn the eigenvalues of Euclidean distance matrices
Volume 27, N. 3, pp. 237 250, 2008 Copyright 2008 SBMAC ISSN 00-8205 www.scielo.br/cam On the eigenvalues of Euclidean distance matrices A.Y. ALFAKIH Department of Mathematics and Statistics University
More informationLecture 7. Econ August 18
Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationx. Figure 1: Examples of univariate Gaussian pdfs N (x; µ, σ 2 ).
.8.6 µ =, σ = 1 µ = 1, σ = 1 / µ =, σ =.. 3 1 1 3 x Figure 1: Examples of univariate Gaussian pdfs N (x; µ, σ ). The Gaussian distribution Probably the most-important distribution in all of statistics
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationA BOOLEAN ACTION OF C(M, U(1)) WITHOUT A SPATIAL MODEL AND A RE-EXAMINATION OF THE CAMERON MARTIN THEOREM
A BOOLEAN ACTION OF C(M, U(1)) WITHOUT A SPATIAL MODEL AND A RE-EXAMINATION OF THE CAMERON MARTIN THEOREM JUSTIN TATCH MOORE AND S LAWOMIR SOLECKI Abstract. We will demonstrate that if M is an uncountable
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
More informationThe matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.
) Find all solutions of the linear system. Express the answer in vector form. x + 2x + x + x 5 = 2 2x 2 + 2x + 2x + x 5 = 8 x + 2x + x + 9x 5 = 2 2 Solution: Reduce the augmented matrix [ 2 2 2 8 ] to
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationThe density of rational points on non-singular hypersurfaces, I
The density of rational points on non-singular hypersurfaces, I T.D. Browning 1 and D.R. Heath-Brown 2 1 School of Mathematics, Bristol University, Bristol BS8 1TW 2 Mathematical Institute,24 29 St. Giles,Oxford
More informationINTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES
Indian J Pure Appl Math, 49: 87-98, March 08 c Indian National Science Academy DOI: 0007/s36-08-056-9 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES João Lita da Silva Department of Mathematics and
More informationHomework 11 Solutions. Math 110, Fall 2013.
Homework 11 Solutions Math 110, Fall 2013 1 a) Suppose that T were self-adjoint Then, the Spectral Theorem tells us that there would exist an orthonormal basis of P 2 (R), (p 1, p 2, p 3 ), consisting
More informationON TOPOLOGISING THE FIELD C(t)
ON TOPOLOGISING THE FIELD C(t) J. H. WILLIAMSON In many questions concerning the existence of fields over the complex field, with topologies satisfying given compatibility axioms, it is sufficient to restrict
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationThe Erwin Schrodinger International Boltzmanngasse 9. Institute for Mathematical Physics A-1090 Wien, Austria
ESI The Erwin Schrodinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria Common Homoclinic Points of Commuting Toral Automorphisms Anthony Manning Klaus Schmidt
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXXI, 2(2002), pp. 201 210 201 ERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES G. R. GOODSON Abstract. We investigate the question of when an ergodic automorphism
More informationThe isomorphism problem of Hausdorff measures and Hölder restrictions of functions
The isomorphism problem of Hausdorff measures and Hölder restrictions of functions Theses of the doctoral thesis András Máthé PhD School of Mathematics Pure Mathematics Program School Leader: Prof. Miklós
More informationDistance Between Ellipses in 2D
Distance Between Ellipses in 2D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To
More informationHere is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J
Class Notes 4: THE SPECTRAL RADIUS, NORM CONVERGENCE AND SOR. Math 639d Due Date: Feb. 7 (updated: February 5, 2018) In the first part of this week s reading, we will prove Theorem 2 of the previous class.
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationSCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE
SCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE BETSY STOVALL Abstract. This result sharpens the bilinear to linear deduction of Lee and Vargas for extension estimates on the hyperbolic paraboloid
More informationHausdorff operators in H p spaces, 0 < p < 1
Hausdorff operators in H p spaces, 0 < p < 1 Elijah Liflyand joint work with Akihiko Miyachi Bar-Ilan University June, 2018 Elijah Liflyand joint work with Akihiko Miyachi (Bar-Ilan University) Hausdorff
More informationALGEBRAIC GROUPS J. WARNER
ALGEBRAIC GROUPS J. WARNER Let k be an algebraically closed field. varieties unless otherwise stated. 1. Definitions and Examples For simplicity we will work strictly with affine Definition 1.1. An algebraic
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationx 1 x 2. x 1, x 2,..., x n R. x n
WEEK In general terms, our aim in this first part of the course is to use vector space theory to study the geometry of Euclidean space A good knowledge of the subject matter of the Matrix Applications
More informationELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n
Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationElementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.
Elementary Linear Algebra Review for Exam Exam is Monday, November 6th. The exam will cover sections:.4,..4, 5. 5., 7., the class notes on Markov Models. You must be able to do each of the following. Section.4
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationarxiv: v1 [math.ca] 7 Jan 2015
Inertia of Loewner Matrices Rajendra Bhatia 1, Shmuel Friedland 2, Tanvi Jain 3 arxiv:1501.01505v1 [math.ca 7 Jan 2015 1 Indian Statistical Institute, New Delhi 110016, India rbh@isid.ac.in 2 Department
More informationINVARIANT PROBABILITIES ON PROJECTIVE SPACES. 1. Introduction
INVARIANT PROBABILITIES ON PROJECTIVE SPACES YVES DE CORNULIER Abstract. Let K be a local field. We classify the linear groups G GL(V ) that preserve an probability on the Borel subsets of the projective
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Vectors Arrays of numbers Vectors represent a point in a n dimensional space
More informationMore Powerful Tests for Homogeneity of Multivariate Normal Mean Vectors under an Order Restriction
Sankhyā : The Indian Journal of Statistics 2007, Volume 69, Part 4, pp. 700-716 c 2007, Indian Statistical Institute More Powerful Tests for Homogeneity of Multivariate Normal Mean Vectors under an Order
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationPreliminary Linear Algebra 1. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 100
Preliminary Linear Algebra 1 Copyright c 2012 Dan Nettleton (Iowa State University) Statistics 611 1 / 100 Notation for all there exists such that therefore because end of proof (QED) Copyright c 2012
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
More informationLinear Algebra. Week 7
Linear Algebra. Week 7 Dr. Marco A Roque Sol 10 / 09 / 2018 If {v 1, v 2,, v n } is a basis for a vector space V, then any vector v V, has a unique representation v = x 1 v 1 + x 2 v 2 + + x n v n where
More informationj=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
More informationSzemerédi s Lemma for the Analyst
Szemerédi s Lemma for the Analyst László Lovász and Balázs Szegedy Microsoft Research April 25 Microsoft Research Technical Report # MSR-TR-25-9 Abstract Szemerédi s Regularity Lemma is a fundamental tool
More informationBanach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable Sequences
Advances in Dynamical Systems and Applications ISSN 0973-532, Volume 6, Number, pp. 9 09 20 http://campus.mst.edu/adsa Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More information3.2 Subspace. Definition: If S is a non-empty subset of a vector space V, and S satisfies the following conditions: (i).
. ubspace Given a vector spacev, it is possible to form another vector space by taking a subset of V and using the same operations (addition and multiplication) of V. For a set to be a vector space, it
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationReview 1 Math 321: Linear Algebra Spring 2010
Department of Mathematics and Statistics University of New Mexico Review 1 Math 321: Linear Algebra Spring 2010 This is a review for Midterm 1 that will be on Thursday March 11th, 2010. The main topics
More informationPolynomials of small degree evaluated on matrices
Polynomials of small degree evaluated on matrices Zachary Mesyan January 1, 2013 Abstract A celebrated theorem of Shoda states that over any field K (of characteristic 0), every matrix with trace 0 can
More information1.4 Outer measures 10 CHAPTER 1. MEASURE
10 CHAPTER 1. MEASURE 1.3.6. ( Almost everywhere and null sets If (X, A, µ is a measure space, then a set in A is called a null set (or µ-null if its measure is 0. Clearly a countable union of null sets
More informationERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. Szemerédi s Theorem states that a set of integers with positive upper density contains arbitrarily
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationTREE AND GRID FACTORS FOR GENERAL POINT PROCESSES
Elect. Comm. in Probab. 9 (2004) 53 59 ELECTRONIC COMMUNICATIONS in PROBABILITY TREE AND GRID FACTORS FOR GENERAL POINT PROCESSES ÁDÁM TIMÁR1 Department of Mathematics, Indiana University, Bloomington,
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationApplied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University
Applied Matrix Algebra Lecture Notes Section 22 Gerald Höhn Department of Mathematics, Kansas State University September, 216 Chapter 2 Matrices 22 Inverses Let (S) a 11 x 1 + a 12 x 2 + +a 1n x n = b
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationTopological groups with dense compactly generated subgroups
Applied General Topology c Universidad Politécnica de Valencia Volume 3, No. 1, 2002 pp. 85 89 Topological groups with dense compactly generated subgroups Hiroshi Fujita and Dmitri Shakhmatov Abstract.
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationarxiv: v1 [math.ds] 24 Jul 2011
Simple Spectrum for Tensor Products of Mixing Map Powers V.V. Ryzhikov arxiv:1107.4745v1 [math.ds] 24 Jul 2011 1 Introduction June 28, 2018 In this note we consider measure-preserving transformations of
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationContinuous Ordinal Clustering: A Mystery Story 1
Continuous Ordinal Clustering: A Mystery Story 1 Melvin F. Janowitz Abstract Cluster analysis may be considered as an aid to decision theory because of its ability to group the various alternatives. There
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationLecture 3: Linear Algebra Review, Part II
Lecture 3: Linear Algebra Review, Part II Brian Borchers January 4, Linear Independence Definition The vectors v, v,..., v n are linearly independent if the system of equations c v + c v +...+ c n v n
More informationOn the exponential map on Riemannian polyhedra by Monica Alice Aprodu. Abstract
Bull. Math. Soc. Sci. Math. Roumanie Tome 60 (108) No. 3, 2017, 233 238 On the exponential map on Riemannian polyhedra by Monica Alice Aprodu Abstract We prove that Riemannian polyhedra admit explicit
More informationNOTES ON NEWLANDER-NIRENBERG THEOREM XU WANG
NOTES ON NEWLANDER-NIRENBERG THEOREM XU WANG Abstract. In this short note we shall recall the classical Newler-Nirenberg theorem its vector bundle version. We shall also recall an L 2 -Hörmer-proof given
More informationLinearization at equilibrium points
TMA4165 2007 Linearization at equilibrium points Harald Hanche-Olsen hanche@math.ntnu.no This note is about the behaviour of a nonlinear autonomous system ẋ = f (x) (where x(t) R n ) near an equilibrium
More information4.2. ORTHOGONALITY 161
4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance
More informationCONSTRUCTIVE PROOF OF THE CARPENTER S THEOREM
CONSTRUCTIVE PROOF OF THE CARPENTER S THEOREM MARCIN BOWNIK AND JOHN JASPER Abstract. We give a constructive proof of Carpenter s Theorem due to Kadison [14, 15]. Unlike the original proof our approach
More information4. Ergodicity and mixing
4. Ergodicity and mixing 4. Introduction In the previous lecture we defined what is meant by an invariant measure. In this lecture, we define what is meant by an ergodic measure. The primary motivation
More informationSome recent results on controllability of coupled parabolic systems: Towards a Kalman condition
Some recent results on controllability of coupled parabolic systems: Towards a Kalman condition F. Ammar Khodja Clermont-Ferrand, June 2011 GOAL: 1 Show the important differences between scalar and non
More informatione j = Ad(f i ) 1 2a ij/a ii
A characterization of generalized Kac-Moody algebras. J. Algebra 174, 1073-1079 (1995). Richard E. Borcherds, D.P.M.M.S., 16 Mill Lane, Cambridge CB2 1SB, England. Generalized Kac-Moody algebras can be
More information