Papers
Topics
Authors
Recent
Search
2000 character limit reached

Two remarks on Normality Preserving Borel Automorphisms of R^n

Published 21 Nov 2011 in math.PR | (1111.4804v2)

Abstract: Let $T$ be a bijective map on $\mathbb{R}n$ such that both $T$ and $T{-1}$ are Borel measurable. For any $\btheta \in \mathbb{R}n$ and any real $n \times n$ positive definite matrix $\Sigma,$ let $N (\btheta, \Sigma)$ denote the $n$-variate normal (gaussian) probability measure on $\mathbb{R}n$ with mean vector $\btheta$ and covariance matrix $\Sigma.$ Here we prove the following two results: (1) Suppose $N(\btheta_j, I)T{-1}$ is gaussian for $0 \leq j \leq n$ where $I$ is the identity matrix and ${\btheta_j - \btheta_0, 1 \leq j \leq n }$ is a basis for $\mathbb{R}n.$ Then $T$ is an affine linear transformation; (2) Let $\Sigma_j = I + \epsilon_j \mathbf{u}j \mathbf{u}_j{\prime},$ $1 \leq j \leq n$ where $\epsilon_j > -1$ for every $j$ and ${\mathbf{u}_j, 1 \leq j \leq n}$ is a basis of unit vectors in $\mathbb{R}n$ with $\mathbf{u}_j{\prime}$ denoting the transpose of the column vector $\mathbf{u}_j.$ Suppose $N(\mathbf{0}, I)T{-1}$ and $N (\mathbf{0}, \Sigma_j)T{-1},$ $1 \leq j \leq n$ are gaussian. Then $T(\mathbf{x}) = \sum\limits{\mathbf{s}} 1_{E_{\mathbf{s}}} V \mathbf{s} U \mathbf{x}$ a.e. $\mathbf{x}$ where $\mathbf{s}$ runs over the set of $2n$ diagonal matrices of order $n$ with diagonal entries $\pm 1,$ $U,\, V$ are $n \times n$ orthogonal matrices and ${E_{\mathbf{s}}}$ is a collection of $2n$ Borel subsets of $\mathbb{R}n$ such that ${E_{\mathbf{s}}}$ and ${V \mathbf{s} U (E_{\mathbf{s}})}$ are partitions of $\mathbb{R}n$ modulo Lebesgue-null sets and for every $j,$ $V \mathbf{s} U \Sigma_j (V \mathbf{s} U){-1}$ is independent of all $\mathbf{s}$ for which the Lebesgue measure of $E_{\mathbf{s}}$ is positive. The converse of this result also holds. \vskip0.1in Our results constitute a sharpening of the results of S. Nabeya and T. Kariya

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.