On the convergence of the Neumann series in interval analysis

Let $\text{A}$ be a real or complex n × n interval matrix. Then it is shown that the Neumann series $\text{Σ}{}^{\mathrm{\infty }}{}_{\mathrm{k=0}}\text{A}{}^{\mathrm{k}}$ is convergent iff the sequence {$\text{A}$^k} converges to the null matrix $\text{O}$, i.e., iff the spectral radius of the real comparison matrix $\text{B}$ constructed in [2] is less than one.     

Multiplicativity of lp norms for matrices. II

For 1 ? p ? ∞, let

$\text{|A|}{}_{\mathrm{p}}\text{=}\text{Σ}\text{i=1}\text{m}\text{Σ}\text{j=1}\text{n}\text{, |α}{}_{\mathrm{ij}}\text{|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}$

, be the l_p norm of an m × n complex A = (α_ij) ?C_{m × n}. The main purpose of this paper is to find, for any p, q ? 1, the best (smallest) possible constants τ(m, k, n, p, q) and σ(m, k, n, p, q) for which inequalities of the form

$\text{|AB|}{}_{\mathrm{p}}\text{? τ(m, k, n, p, q) |A|}{}_{\mathrm{p}}\text{|B|}{}_{\mathrm{q}}\text{, |AB|}{}_{\mathrm{p}}\text{? σ (m, k, n, p, q)|A|}{}_{\mathrm{q}}\text{|B|}{}_{\mathrm{p}}$

hold for all A?C_{m × k}, B?C_{k × n}. This leads to upper bounds for inner products on C^k and for ordinary l_p operator norms on C_{m × n}.     

Strong law for the bootstrap

Let X₁, X₂, X₃, … be i.i.d. r.v. with E|X₁| < ∞, E X₁ = μ. Given a realization X = (X₁,X₂,…) and integers n and m, construct Y_n,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution $\text{P}{}^1\text{(Y}{}_{\mathrm{n,i}}\text{= X}{}_{\mathrm{j}}\text{) =}\text{1}\text{n}$ for 1 ? j ? n. ($\text{P}{}^1$ denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X₁ are given to ensure the almost sure convergence of $\text{(}\text{1}\text{m}\text{)Σ}{}^{\mathrm{m}}{}_{\mathrm{i=1}}\text{Y}{}_{\mathrm{n,i}}$ toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).     

More bounds for elgenvalues using traces

Let the n × n complex matrix A have complex eigenvalues λ₁,λ₂,…λ_n. Upper and lower bounds for Σ(Reλ_i)² are obtained, extending similar bounds for Σ|λ_i|² obtained by Eberlein (1965), Henrici (1962), and Kress, de Vries, and Wegmann (1974). These bounds involve the traces of A¹A, B², C², and D², where $\text{B}\text{=}\text{1}\text{2}\text{(}\text{A}\text{+}\text{A}{}^1\text{)}$, $\text{C}\text{=}\text{1}\text{2}\text{(}\text{A}\text{?}\text{A}{}^1\text{) /i}$, and $\text{D}\text{=}\text{AA}{}^1\text{?}\text{A}{}^1\text{A}$, and strengthen some of the results in our earlier paper “Bounds for eigenvalues using traces” in Linear Algebra and Appl. [12].     

Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order

Our first result is a ‘sum–product’ theorem for subsets A of the finite field $\text{F}{}_{\mathrm{p}}$, p prime, providing a lower bound on max(|A+A|,|A·A|). As corollary, the second and main result provides new bounds on exponential sums associated to subgroups of the multiplicative group $\text{F}{}^1{}_{\mathrm{p}}$. To cite this article: J. Bourgain, S.V. Konyagin, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Best pseudo-isolated Gerschgorin disks for Eigenvalues

Let A be an arbitrary n×n matrix, partitioned so that if A=[A_ij], then all submatrices A_ii are square. If x is a positive vector, it is well-known that $\text{G(}\text{x}\text{) =∪}{}^{\mathrm{N}}{}_{\mathrm{i=1}}\text{G}{}_{\mathrm{i}}\text{(}\text{x}\text{)}$, where

$\text{G}{}_{\mathrm{i}}\text{(}\text{x}\text{) =}\text{z}\text{6(zI ? A}{}_{\mathrm{ii}}\text{)}{}^{\mathrm{?1}}\text{6}{}^{\mathrm{?1}}\text{?}\text{1}\text{x}{}_{\mathrm{i}}\text{∑}\text{j = 1}\text{j ≠ i}\text{N}\text{`6A}{}_{\mathrm{ij}}\text{6x}{}_{\mathrm{j}}$

, contains all the eigenvalues of A. The purpose of this paper is to give a new definition of the concept of an isolated subregion of G(x). An algorithm is given for obtaining the best such isolated subregion in a certain sense, and examples are given to show that tighter bounds for some eigenvalues of A may be obtained than with previous algorithms. For ease of computation, each subregion G_i(x) is replaced by the union of circular disks centered at the eigenvalues of A_ii.     

A note on computing the distribution of the norm of Hilbert space valued Gaussian random variables

Let X be a Gaussian rv with values in a separable Hilbert space H having a covariance operator R of the form $\text{R = L}{}_0{}^1\text{A}{}^1\text{AL}{}_0$, where L₀, A are linear operators on H. A method is given for computing in terms of $\text{R}{}_0\text{= L}{}_0{}^1\text{L}{}_0$ and A the distribution of |X|², |·| being the norm in H. The result is applied to the evaluation of the asymptotic distribution of Cramér-von Mises statistics when parameters are present. L₀ corresponds to the case where the true underlying parameter is known and A represents the effect of estimating the unknown parameter.     

On Lp-spectrum of elliptic operators

For elliptic operators $\text{A = ∑}{}_{\mathrm{¦\alpha ¦\; ?\; m}}\text{a}{}_{\mathrm{\alpha }}\text{(x) D}{}^{\mathrm{\alpha }}$ on Rⁿ and certain of their singular perturbations $\text{B = ∑}{}_{\mathrm{¦\alpha ¦\; ?\; m}}\text{b}{}_{\mathrm{\alpha }}\text{(x)D}{}^{\mathrm{\alpha }}$ relative compactness of B with respect to A is established. This result applies to the study of L^p-spectra of elliptic operators for different p.     

Arnold's canonical matrices and the asymptotic simplification of ordinary differential equations

Let A(x,ε) be an n×n matrix function holomorphic for |x|?x₀, 0<ε?ε₀, and possessing, uniformly in x, an asymptotic expansion $\text{A(x,ε)?Σ}{}^{\mathrm{\infty }}{}_{\mathrm{r=0}}\text{A}{}_{\mathrm{r}}\text{(x) ε}{}^{\mathrm{r}}$, as ε→0⁺. An invertible, holomorphic matrix function P(x,ε) with an asymptotic expansion $\text{P(x,ε)?Σ}{}^{\mathrm{\infty }}{}_{\mathrm{r=0}}\text{P}{}_{\mathrm{r}}\text{(x)ε}{}^{\mathrm{r}}$, as ε→0⁺, is constructed, such that the transformation y = P(x,ε)z takes the differential equation $\text{ε}{}^{\mathrm{h}}\text{dy}\text{dx}\text{= A(x,ε)y,h}$ a positive integer, into $\text{ε}{}^{\mathrm{h}}\text{dz}\text{dx}\text{= B(x,ε)z}$, where B(x,ε) is asymptotically equal, to all orders, to a matrix in a canonical form for holomorphic matrices due to V.I. Arnold.     

Coding theory in white Gaussian channel with feedback

The message m = {m(t)} is a Gaussian process that is to be transmitted through the white Gaussian channel with feedback: $\text{Y(t) = ∫}{}_0{}^{\mathrm{t}}\text{F(s, Y}{}_0{}^{\mathrm{s}}\text{, m)ds + W(t)}$. Under the average power constraint, $\text{E[F}{}^2\text{(s, Y}{}_0{}^{\mathrm{s}}\text{, m)] ≤ P}{}_0$, we construct causally the optimal coding, in the sense that the mutual information I_t(m, Y) between the message m and the channel output Y (up to t) is maximized. The optimal coding is presented by $\text{Y(t) = ∫}{}_0{}^{\mathrm{t}}\text{A(s)[m(s) ?}\text{m}\text{?}\text{(s)] ds + W(t)}$, where $\text{m}\text{?}\text{(s) = E[m(s) ¦ Y(u), 0 ≤ u ≤ s]}$ and A(s) is a positive function such that $\text{A}{}^2\text{(s) E |m(s) ?}\text{m}\text{?}\text{(s)|}{}^2\text{= P}{}_0$.     

On the fair coin tossing process

Let Ω = {1, 0} and for each integer n ≥ 1 let $\text{Ω}{}_{\mathrm{n}}\text{= Ω × Ω × … × Ω}$ (n-tuple) and $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}\text{= {(a}{}_1\text{, a}{}_2\text{, …, a}{}_{\mathrm{n}}\text{)|(a}{}_1\text{, a}{}_2\text{, … , a}{}_{\mathrm{n}}\text{) ? Ω}{}_{\mathrm{n}}\text{and}\text{Σ}{}_{\mathrm{i=1}}{}^{\mathrm{n}}\text{a}{}_{\mathrm{i}}\text{= k}}$ for all k = 0,1,…,n. Let {Y_m}_m≥1 be a sequence of i.i.d. random variables such that $\text{P(Y}{}_1\text{= 0) = P(Y}{}_1\text{= 1) =}\text{1}\text{2}$. For each A in $\text{Ω}{}_{\mathrm{n}}$, let T_A be the first occurrence time of A with respect to the stochastic process {Y_m}_m≥1. R. Chen and A.Zame (1979, J. Multivariate Anal. 9, 150–157) prove that if n ≥ 3, then for each element A in $\text{Ω}{}_{\mathrm{n}}$, there is an element B in $\text{Ω}{}_{\mathrm{n}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$. This result is sharpened as follows: (I) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element B also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$; (II) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A = (a₁, a₂,…,a_n) in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element C also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_A is less than T_C is greater than $\text{1}\text{2}$ if n ≠ 2m or n = 2m but a_i = a_{i + 1} for some 1 ≤ i ≤ n?1. These new results provide us with a better and deeper understanding of the fair coin tossing process.     

Maximum zero strings of Bell numbers modulo primes

For any prime p, the sequence of Bell exponential numbers B_n is shown to have p ? 1 consecutive values congruent to zero (mod p), beginning with B_m, where $\text{m ≡ 1 ?}\text{(p}{}^{\mathrm{p}}\text{? 1)}\text{(p ? 1)}{}^2$ ($\text{mod}\text{(p}{}^{\mathrm{p}}\text{? 1)}\text{(p ? 1)}$). This is an improvement over previous results on the maximal strings of zero residues of the Bell numbers. Similar results are obtained for the sequence of generalized Bell numbers A_n generated by .     

Extensions of factorial states of C1-algebras

Let A be a $\text{C}{}^1$-algebra, B be a $\text{C}{}^1$-subalgebra of A, and φ be a factorial state of B. Sometimes, φ may be extended to a factorial state of A by a tensor product method of Sakai (“$\text{C}{}^1$-algebras and $\text{W}{}^1$-algebras, Springer-Verlag, Berlin/Heidelberg/ New York 1971”). Sometimes, there is a weak expectation of A into $\text{π}{}_{\mathrm{\phi }}\text{(B)}$, and then factorial extensions may be found by a method of Sakai and Tsui (Yokohama Math. J.29 (1981), 157–160). These two methods are shown to have the same effect, and the factorial extensions produced by them are analysed.     

On the approximation of measurable linear functionals

Every Gaussian Radon measure (nonsymmetric) has the Riesz property. On R^∞, a shift μ₀ 1 σ_b of the law μ₀ of the Bernoulli sequence has the Riesz property iff $\text{b ? l}{}^2\text{or}\text{b ?}\text{R}{}_0{}^{\mathrm{\infty }}$.     

Rôle de l'espace de Besov B∞−1,∞ dans le contrôle de l'explosion éventuelle en temps fini des solutions régulières des équations de Navier–Stokes

Let $\text{u∈C([0,T}{}^1\text{[;L}{}^{\mathrm{n}}\text{(}\text{R}{}^{\mathrm{n}}\text{)}{}^{\mathrm{n}}\text{)}$ be a maximal solution of the Navier–Stokes equations. We prove that u is C^∞ on $\text{]0,T}{}^1\text{[×}\text{R}{}^{\mathrm{n}}$ and there exists a constant $\text{ε}{}_1\text{>0}$, which depends only on n, such that if $\text{T}{}^1$ is finite then, for all $\text{ω∈S(}\text{R}{}^{\mathrm{n}}\text{)}{}^{\mathrm{n}}\text{,}$ we have To cite this article: R. May, C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

The asymptotic eigenvalue-distribution for a certain class of random matrices

For an n × n Hermitean matrix A with eigenvalues λ₁, …, λ_n the eigenvalue-distribution is defined by $\text{G(x, A) :=}\text{1}\text{n}$ · number {λ_i: λ_i ? x} for all real x. Let A_n for n = 1, 2, … be an n × n matrix, whose entries a_ik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, $\text{R}$, p) with the same distribution F_a. Suppose that all moments $\text{E}$ | a | ^k, k = 1, 2, … are finite, $\text{E}$a=0 and $\text{E}$ | a | ². Let

$\text{M(A)=}\text{∑}\text{σ=1}\text{s}\text{θ}{}_{\mathrm{\sigma }}\text{P}{}_{\mathrm{\sigma }}\text{(A,A}{}^1\text{)}$

with complex numbers θ_σ and finite products P_σ of factors A and $\text{A}{}^1$ (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G₀(x) = G₁x) + G₂(x), where G₁ is a step function and G₂ is absolutely continuous, such that with probability $\text{1 G(x, M(}\text{A}{}_{\mathrm{n}}\text{n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{))}$ converges to G₀(x) as n → ∞ for all continuity points x of G₀. The density g of G₂ vanishes outside a finite interval. There are only finitely many jumps of G₁. Both, G₁ and G₂, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples $\text{A}{}_{\mathrm{r}}\text{A}{}^{\mathrm{1r}}$, $\text{A}{}^{\mathrm{r}}\text{+ A}{}^{\mathrm{1r}}$, $\text{A}{}^{\mathrm{r}}\text{A}{}^{\mathrm{1r}}\text{± A}{}^{\mathrm{1r}}\text{A}{}^{\mathrm{r}}$, r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form

$\text{lim sup}\text{n→∞}\text{∑}\text{i=1}{}^{\mathrm{n}}\text{|γ}{}_{\mathrm{i}}{}^{\mathrm{(n)}}\text{|}{}^2\text{?6A}{}_{\mathrm{n}}\text{6}{}^2\text{? 0.8228…}$

of Schur's inequality for the eigenvalues λ_i⁽ⁿ⁾ of A_n holds. Consequently random matrices do not tend to be normal matrices for large n.     

An Lp bound for the Riesz and Bessel potentials of orthonormal functions

Let ψ₁, …,ψ_N be orthonormal functions in $\text{R}$^d and let $\text{u}{}_{\mathrm{i}}\text{= (?Δ)}{}^{\mathrm{<mtext>?</mtext><mtext>1</mtext><mtext>2</mtext>}}\text{ψ}{}_{\mathrm{i}}$, or $\text{u}{}_{\mathrm{i}}\text{= (?Δ + 1)}{}^{\mathrm{<mtext>?</mtext><mtext>1</mtext><mtext>2</mtext>}}\text{ψ}{}_{\mathrm{i}}$, and let $\text{p(x) = ∑¦u}{}_{\mathrm{i}}\text{(x)¦}{}^2$. L^p bounds are proved for p, an example being $\text{∥p∥}{}_{\mathrm{p}}\text{? A}{}_{\mathrm{d}}\text{N}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}\text{for}\text{d ? 3}$, with p = d(d ? 2)^?1. The unusual feature of these bounds is that the orthogonality of the ψ_i, yields a factor $\text{N}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}$ instead of N, as would be the case without orthogonality. These bounds prove some conjectures of Battle and Federbush (a Phase Cell Cluster Expansion for Euclidean Field Theories, I, 1982, preprint) and of Conlon (Comm. Math. Phys., in press).