Minimum variance estimators for misclassification probabilities in discriminant analysis

Let α(n₁, n₂) be the probability of classifying an observation from population Π₁ into population Π₂ using Fisher's linear discriminant function based on samples of size n₁ and n₂. A standard estimator of α, denoted by T₁, is the proportion of observations in the first sample misclassified by the discriminant function. A modification of T₁, denoted by T₂, is obtained by eliminating the observation being classified from the calculation of the discriminant function. The UMVU estimators, $\text{T}{}_1{}^1$ and $\text{T}{}_2{}^1$, of ET₁ = τ₁(n₁, n₂) and ET₂ = τ₂(n₁, n₂) = α(n₁ ? 1, n₂) are derived for the case when the populations have multivariate normal distributions with common dispersion matrix. It is shown that $\text{T}{}_1{}^1$ and $\text{T}{}_2{}^1$ are nonincreasing functions of D², the Mahalanobis sample distance. This result is used to derive the sampling distributions and moments of $\text{T}{}_1{}^1$ and $\text{T}{}_2{}^1$. It is also shown that α is a decreasing function of Δ² = (μ₁ ? μ₂)′Σ^?1(μ₁ ? μ₂). Hence, by truncating $\text{T}{}_1{}^1$ and $\text{T}{}_2{}^1$ (or any estimator) at the value of α for Σ = 0, new estimators are obtained which, for all samples, are as close or closer to α.     

The second largest eigenvalue of a tree

Denote by λ₂(T) the second largest eigenvalue of a tree T. An easy algorithm is given to decide whether λ₂(T)?λ for a given number λ, and a structure theorem for trees withλ₂(T)?λ is proved. Also, it is shown that a tree T with n vertices has $\text{λ}{}_2\text{(T)?lsqb}\text{(n?3)}\text{2}\text{rsqb}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$; this bound is best possible for odd n.     

Decomposability of symmetric multilinear functions

Let V denote a finite dimensional vector space over a field K of characteristic 0, let T_n(V) denote the vector space whose elements are the K-valued n-linear functions on V, and let S_n(V) denote the subspace of T_n(V) whose members are the fully symmetric members of T_n(V). If $\text{L}$_n denotes the symmetric group on {1,2,…,n} then we define the projection $\text{P}{}_{\mathrm{<mtext>L</mtext>}}\text{: T}{}_{\mathrm{n}}\text{(V) → S}{}_{\mathrm{n}}\text{(V)}$ by the formula , where P_σ : T_n(V) → T_n(V) is defined so that P_σ(A)(y₁,y₂,…,y_n = A(y_σ(1),y_σ(2),…,y_σ(n)) for each A?T_n(V) and y_i?V, 1 ? i ? n. If $\text{x}{}_{\mathrm{i}}\text{? V}{}^1\text{, 1 ? i ? n}$, then x₁?x₂? … ?x_n denotes the member of T_n(V) such that $\text{(x}{}_1\text{?x}{}_2\text{· ? ? ?x}{}_{\mathrm{n}}\text{)(y}{}_1\text{,y}{}_2\text{,…,y}{}_{\mathrm{n}}\text{) = П}{}^{\mathrm{n}}{}_{\mathrm{i=1}}\text{x}{}_{\mathrm{i}}\text{(y}{}_{\mathrm{i}}\text{)}$ for each y₁ ,₂,…,y_n in V, and x₁·x₂… x_n denotes $\text{P}{}_{\mathrm{<mtext>L</mtext>}}\text{(x}{}_1\text{?x}{}_2\text{? … ?x}{}_{\mathrm{n}}\text{)}$. If B? S_n(V) and there exists $\text{x}{}_{\mathrm{i}}\text{? V}{}^1\text{, 1 ? i ? n}$, such that B = x₁·x₂…x_n, then B is said to be decomposable. We present two sets of necessary and sufficient conditions for a member B of S_n(V) to be decomposable. One of these sets is valid for an arbitrary field of characteristic zero, while the other requires that K = R or C.     

A remark on the tail probability of a distribution

Let {X_n}_n≥1 be a sequence of independent and identically distributed random variables. For each integer n ≥ 1 and positive constants r, t, and ?, let S_n = Σ_j=1ⁿX_j and $\text{E{N}{}_{\mathrm{\infty }}\text{(r, t, ?)} = Σ}{}_{\mathrm{n=1}}{}^{\mathrm{\infty }}\text{n}{}^{\mathrm{r?2}}\text{P{|S}{}_{\mathrm{n}}\text{| > ?n}{}^{\mathrm{<mtext>r</mtext><mtext>t</mtext>}}\text{}}$. In this paper, we prove that (1) lim_?→0+?^α(r?1)E{N_∞(r, t, ?)} = K(r, t) if E(X₁) = 0, Var(X₁) = 1, and E(| X₁ |^t) < ∞, where 2 ≤ t < 2r ≤ 2t, $\text{K(r, t) =}\text{{2}{}^{\mathrm{<mtext>\alpha (r?1)</mtext><mtext>2</mtext>}}\text{Γ(}\text{(1 + α(r ? 1))}\text{2}\text{)}}\text{{(r ? 1) Γ(}\text{1}\text{2}\text{)}}$, and $\text{α =}\text{2t}\text{(2r ? t)}$; (2) $\text{lim}{}_{\mathrm{?\to 0+}}\text{G(t, ?)}\text{H(t, ?)}\text{= 0}$ if 2 < t < 4, E(X₁) = 0, Var(X₁) > 0, and E(|X₁|^t) < ∞, where G(t, ?) = E{N_∞(t, t, ?)} = Σ_n=1^∞n^t?2P{| S_n | > ?n} → ∞ as ? → 0+ and $\text{H(t, ?) = E{N}{}_{\mathrm{\infty }}\text{(t, t, ?)} = Σ}{}_{\mathrm{n=1}}{}^{\mathrm{\infty }}\text{n}{}^{\mathrm{t?2}}\text{P{| S}{}_{\mathrm{n}}\text{| > ?n}{}^{\mathrm{<mtext>2</mtext><mtext>t</mtext>}}\text{} → ∞}\text{as}\text{? → 0+}$, i.e., H(t, ?) goes to infinity much faster than G(t, ?) as ? → 0+ if 2 < t < 4, E(X₁) = 0, Var(X₁) > 0, and E(| X₁ |^t) < ∞. Our results provide us with a much better and deeper understanding of the tail probability of a distribution.     

Asymptotic results for partitions (II) and a conjecture of Bateman and Erdös

Asymptotic results are obtained for p_A^(k)(n), the kth difference of the function p_A(n) which is the number of partitions of n into integers from A. Under certain restrictions on A it is shown that

$\text{P}{}_{\mathrm{A}}{}^{\mathrm{(k+1)}}\text{(n)}\text{P}{}_{\mathrm{A}}{}^{\mathrm{(k)}}\text{(n)}\text{= O(n}{}^{\mathrm{?1/2}}\text{) (n→ ∫)}$

thereby verifying for these A a conjecture of Bateman and Erdös.     

Barriers for uniformly elliptic equations and the exterior cone condition

We consider the mixed boundary value problem $\text{Au = f}\text{in}\text{Ω, B}{}_0\text{u = g}{}_0\text{in}\text{Γ}{}^{\mathrm{?}}\text{, B}{}_1\text{u = g}{}_1\text{in}\text{Γ}{}^{\mathrm{+}}$, where Ω is a bounded open subset of $\text{R}$ⁿ whose boundary Γ is divided into disjoint open subsets Γ⁺ and Γ^? by an (n ? 2)-dimensional manifold ω in Γ. We assume A is a properly elliptic second order partial differential operator on $\text{Ω}$ and B_j, for j = 0, 1, is a normal jth order boundary operator satisfying the complementing condition with respect to A on $\text{Γ}{}^{\mathrm{+}}$. The coefficients of the operators and Γ⁺, Γ^? and ω are all assumed arbitrarily smooth. As announced in [Bull. Amer. Math. Soc.83 (1977), 391–393] we obtain necessary and sufficient conditions in terms of the coefficients of the operators for the mixed boundary value problem to be well posed in Sobolev spaces. In fact, we construct an open subset $\text{T}$ of the reals such that, if $\text{D}{}^{\mathrm{s}}\text{= {u ? H}{}^{\mathrm{s}}\text{(Ω): Au = 0}}$ then for $\text{s ? =}\text{1}\text{2}\text{(}\text{mod}\text{1), (B}{}_0\text{,B}{}_1\text{): D}{}^{\mathrm{s}}\text{→ H}{}^{\mathrm{<mtext>s\; ?\; </mtext><mtext>1</mtext><mtext>2</mtext>}}\text{(Γ}{}^{\mathrm{?}}\text{) × H}{}^{\mathrm{<mtext>s\; ?\; </mtext><mtext>3</mtext><mtext>2</mtext>}}\text{(Γ}{}^{\mathrm{+}}\text{)}$ is a Fredholm operator if and only if s ∈$\text{T}$ . Moreover, $\text{T}$ = ?_xew$\text{T}$_x, where the sets $\text{T}$_x are determined algebraically by the coefficients of the operators at x. If n = 2, $\text{T}$_x is the set of all reals not congruent (modulo 1) to some exceptional value; if n = 3, $\text{T}$_x is either an open interval of length 1 or is empty; and finally, if n ? 4, $\text{T}$_x is an open interval of length 1.     

On the asymptotic number of tournament score sequences

An n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs. A tournament's score sequence is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The number S_n of distinct score sequences arising from all possible n-tournaments, as well as certain generalizations are investigated. A lower bound of the form

$\text{S}{}_{\mathrm{n}}\text{>}\text{C}{}_1\text{4}{}^{\mathrm{n}}\text{n}{}^{\mathrm{<mtext>5</mtext><mtext>2</mtext>}}$

(C₁ a constant) and an upper bound of the form $\text{S}{}_{\mathrm{n}}\text{<}\text{C}{}_2\text{4}{}^{\mathrm{n}}\text{n}{}^2$ are proved. A q-extension of the Catalan numbers

$\text{c}{}_1\text{(q)=1}\text{and}\text{c}{}_{\mathrm{n}}\text{(q)=}\text{∑}\text{i?1}\text{n?1}\text{c}{}_{\mathrm{i}}\text{(q)c}{}_{\mathrm{n?1}}\text{(q)q}{}^{\mathrm{i(n?i?1)}}$

is defined. It is conjectured that all coefficients in the polynomial C_n(q) are at most $\text{O(}\text{4}{}^{\mathrm{n}}\text{n}{}^3\text{)}$. It is shown that if this conjecture is true, then

$\text{S}{}_{\mathrm{n}}\text{<}\text{C}{}_3\text{4}{}^{\mathrm{n}}\text{n}{}^{\mathrm{<mtext>5</mtext><mtext>2</mtext>}}$

     

Almost resolvable decomposition of Kn1

In this paper, we show that the complete symmetric directed graph with n vertices $\text{K}{}_{\mathrm{n}}{}^1$ admits an almost resolvable decomposition into TT₃ (the transitive tournament on 3 vertices) or C₃ (the directed cycle of length 3) if and only if n ≡ 1(mod 3).     

The minimal generating space of a polynomial

Given a polynomial $\text{P(X}{}_1\text{,…,X}{}_{\mathrm{N}}\text{)∈}\text{R}\text{[}\text{X}\text{]}$, we calculate a subspace G_p of the linear space 〈X〉 generated by the indeterminates which is minimal with respect to the property $\text{P∈}\text{R}\text{[}\text{G}{}_{\mathrm{p}}\text{]}$ (the algebra generated by G_p, and prove its uniqueness. Furthermore, we use this result to characterize the pairs (P,Q) of polynomials P(X₁,…,X_n) and Q(X₁,…,X_n) for which there exists an isomorphism T:〈X〉 →〈X〉 that “separates P from Q,” i.e., such that for some k(1<k<n) we can write P and Q as $\text{P}{}^1\text{(Y}{}_1\text{,…,Y}{}_{\mathrm{k}}\text{)}$ and $\text{Q}{}^1\text{(Y}{}_{\mathrm{<mtext>k+</mtext><mtext>1</mtext>}}\text{,…,Y}{}_{\mathrm{n}}\text{)}$ respectively, where $\text{Y}\text{=T}\text{X}$.     

Asymptotic behavior of nonoscillatory solutions of nonlinear differential equations with retarded arguments

For nonlinear retarded differential equations $\text{y}{}^{\mathrm{2n}}\text{(t)?}\text{∑}\text{i=1}\text{m}\text{f}{}_{\mathrm{i}}\text{(t,y(t),y(g}{}_{\mathrm{i}}\text{(t)))=0}$ and $\text{y}{}^{\mathrm{n}}\text{(t)?}\text{∑}\text{i=1}\text{m}\text{P}{}_{\mathrm{i}}\text{(t)F}{}_{\mathrm{i}}\text{(y(g}{}_{\mathrm{i}}\text{(t)))=h(t),}$ the sufficient conditions are given on f_i, p_i, F_i, and h under which every bounded nonoscillatory solution of (${}^1$) or (${}^7$) tends to zero as t → ∞.     

On the matrix ring over a finite field

Let F_n be the ring of n × n matrices over the finite field F; let o(F_n) be the number of elements in F_n, and s(F_n) be the number of singular matrices in F_n. We prove that $\text{o(F}{}_{\mathrm{n}}\text{)<s(F}{}_{\mathrm{n}}\text{)}{}^{\mathrm{<mtext>1+1</mtext><mtext>n(n-1)</mtext>}}$ if n ? 2, and if n = 2 and o(F) ? 3, then .     

Trace formulas for a class of Toeplitz-like operators II

Let P_T denote the orthogonal projection of L²(R¹, dΔ) onto the space of entire functions of exponential type ? T which are square summable on the line with respect to the measure $\text{dΔ(γ) = ¦ h(γ)¦}{}^2\text{dγ}$, and let G denote the operator of multiplication by a suitably restricted complex valued function g. It is shown that if $\text{(γ}{}^2\text{+ 1)}{}^{\mathrm{?1}}\text{log}\text{¦ h(γ)¦}$ is summable, if $\text{¦ h ¦}{}^{\mathrm{?2}}$ is locally summable, and if $\text{h}\text{h}{}^{\mathrm{\#}}$ belongs to the span in L^∞ of e^?iyTH^∞:T ? 0, in which h is chosen to be an outer function and h^#(γ) agrees with the complex conjugate of h(γ) on the line, then

$\text{lim trace}\text{T↑∞}\text{{(P}{}_{\mathrm{T}}\text{GP}{}_{\mathrm{T}}\text{)}{}^{\mathrm{n}}\text{? P}{}_{\mathrm{T}}\text{G}{}^{\mathrm{n}}\text{P}{}_{\mathrm{T}}\text{}}$

exists and is independent of h for every positive integer n. This extends the range of validity of a formula due to Mark Kac who evaluated this limit in the special case h = 1 using a different formalism. It also extends earlier results of the author which were established under more stringent conditions on h. The conclusions are based in part upon a preliminary study of a more general class of projections.     

Concrete model theory for a class of operators with unitary part

Let m and v_t, 0 ? t ? 2π be measures on T = [0, 2π] with m smooth. Consider the direct integral $\text{H}$ = ⊕L²(v^t) dm(t) and the operator $\text{(L?)(t, λ) = e}{}^{\mathrm{?i\lambda }}\text{?(t, λ) ? 2e}{}^{\mathrm{?i\lambda }}\text{∫}{}_{\mathrm{t}}{}^{\mathrm{2\pi }}\text{∫}{}_{\mathrm{T}}\text{?(s, x) e(s, t) dv}{}_{\mathrm{s}}\text{(x) dm(s)}$ on $\text{H}$, where e(s, t) = exp ∫_s^t ∫_Tdv_λ(θ) dm(λ). Let μ_t be the measure defined by $\text{∫}{}_{\mathrm{T}}\text{?(x) dμ}{}_{\mathrm{t}}\text{(x) = ∫}{}_0{}^{\mathrm{t}}\text{∫}{}_{\mathrm{T}}\text{?(x) dv}{}_{\mathrm{s}}\text{dm(s)}$ for all continuous ?, and let ?_t(z) = exp[?∫ (e^iθ + z)(e^iθ ? z)^?1dμ_t(gq)]. Call {v_t} regular iff for all $\text{t, ¦?}{}_{\mathrm{t}}\text{(e}{}^{\mathrm{i\theta }}\text{)¦ = ¦?}{}_{\mathrm{2\pi }}\text{(e}{}^{\mathrm{i\theta }}\text{)¦}$ for 1 a.e.     

On the probability that k positive integers are relatively prime II

Given a set S of positive integers let $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t)}$ denote the number of k-tuples 〈m₁, …, m_k〉 for which $\text{m}{}_{\mathrm{i}}\text{∈ S ? [1, t]}$ and (m₁, …, m_k) = 1. Also let $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n)}$ denote the probability that k integers, chosen at random from $\text{S ? [1, n]}$, are relatively prime. It is shown that if P = {p₁, …, p_r} is a finite set of primes and S = {m : (m, p₁ … p_r) = 1}, then $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t) = (td(S))}{}^{\mathrm{k}}\text{Π}{}_{\mathrm{\nu ?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) + O(t}{}^{\mathrm{k?1}}\text{)}$ if k ≥ 3 and $\text{Z}{}_2{}^{\mathrm{S}}\text{(t) = (td(S))}{}^2\text{Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^2\text{) + O(t}\text{log}\text{t)}$ where d(S) denotes the natural density of S. From this result it follows immediately that $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) = (ζ(k))}{}^{\mathrm{?1}}\text{Π}{}_{\mathrm{p\in P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{)}{}^{\mathrm{?1}}$ as n → ∞. This result generalizes an earlier result of the author's where $\text{P = ?}$ and S is then the whole set of positive integers. It is also shown that if S = {p₁^x₁ … p_r^x_r : x_i = 0, 1, 2,…}, then $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → 0}$ as n → ∞.     

The asymptotic equivalence of Bayes and maximum likelihood estimation

Let (X, $\text{A}$) be a measurable space, Θ ? $\text{R}$ an open interval and P_Ω ∥ $\text{A}$, Ω ? Θ, a family of probability measures fulfilling certain regularity conditions. Let $\text{Ω}{}_{\mathrm{n}}$ be the maximum likelihood estimate for the sample size n. Let λ be a prior distribution on Θ and let $\text{R}{}_{\mathrm{<mtext>n,</mtext><mtext>x</mtext>}}$ be the posterior distribution for the sample size n given $\text{x}\text{? X}{}^{\mathrm{n}}$. $\text{L:}\text{Θ}\text{× Θ →}\text{R}$ denotes a loss function fulfilling certain regularity conditions and T_n denotes the Bayes estimate relative to λ and L for the sample size n. It is proved that for every compact K ? Θ there exists c_K ≥ 0 such that

This theorem improves results of Bickel and Yahav [3], and Ibragimov and Has'minskii [4], as far as the speed of convergence is concerned.     

Some properties of irreducible coverings by cliques of complete multipartite graphs

In this paper some recursion formulas and asymptotic properties are derived for the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite (labeled) graphs K_p,q. The problem of determining numbers N(p, q) has been raised by I. Tomescu (dans “Logique, Automatique, Informatique,” pp. 269–423, Ed. Acad. R.S.R., Bucharest, 1971). A result concerning the asymptotic behavior of the number of irreducible coverings by cliques of q-partite complete graphs is obtained and it is proved that , $\text{lim}{}_{\mathrm{n\to \infty }}\text{(}\text{log}\text{M(n))}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{= 3}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}$, and $\text{lim}{}_{\mathrm{n\to \infty }}\text{C(n)}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{(}\text{n}\text{ln}\text{n)}\text{=}\text{1}\text{e}$, where I(n) and M(n) are the maximal numbers of irreducible coverings, respectively, coverings by cliques of the vertices of an n-vertex graph, and C(n) is the maximal number of minimal colorings of an n-vertex graph. It is also shown that maximal number of irreducible coverings by n ? 2 cliques of the vertices of an n-vertex graph (n ≥ 4) is equal to 2^n?2 ? 2 and this number of coverings is attained only for K_2,n?2 and the value of $\text{lim}{}_{\mathrm{n\to \infty }}\text{I(n, n ? k)}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}$ is obtained, where I(n, n ? k) denotes the maximal number of irreducible coverings of an n-vertex graph by n ? k cliques.     

Eigenvalues of p-summing and lp-type operators in Banach spaces

This paper is a study of the distribution of eigenvalues of various classes of operators. In Section 1 we prove that the eigenvalues (λ_n(T)) of a p-absolutely summing operator, p ? 2, satisfy

$\text{∑}\text{n∈N}\text{|λ}{}_{\mathrm{n}}\text{(T)|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}\text{?π}{}_{\mathrm{p}}\text{(T).}$

This solves a problem of A. Pietsch. We give applications of this to integral operators in L_p-spaces, weakly singular operators, and matrix inequalities.In Section 2 we introduce the quasinormed ideal Π₂⁽ⁿ⁾, P = (p₁, …, p_n) and show that for T ∈ Π₂⁽ⁿ⁾, 2 = (2, …, 2) ∈ Nⁿ, the eigenvalues of T satisfy

$\text{∑}\text{i∈N}\text{|λ}{}_{\mathrm{i}}\text{(T)|}{}^{\mathrm{<mtext>2</mtext><mtext>n</mtext>}}{}^{\mathrm{<mtext>n</mtext><mtext>2</mtext>}}\text{?π}{}^{\mathrm{n}}{}_2\text{(T).}$

More generally, we show that for T ∈ Π_p⁽ⁿ⁾, P = (p₁, …, p_n), pi ? 2, the eigenvalues are absolutely p-summable,

$\text{1}\text{p}\text{=}\text{∑}\text{i=1}\text{n}\text{1}\text{p}{}_{\mathrm{i}}\text{and}\text{∑}\text{n∈N}\text{|λ}{}_{\mathrm{n}}\text{(T)|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}\text{?C}{}_{\mathrm{p}}\text{π}{}^{\mathrm{n}}{}_{\mathrm{P}}\text{(T).}$

We also consider the distribution of eigenvalues of p-nuclear operators on L_r-spaces.In Section 3 we prove the Banach space analog of the classical Weyl inequality, namely

$\text{∑}\text{n∈N}\text{|λ}{}_{\mathrm{n}}\text{(T)|}{}^{\mathrm{p}}\text{? C}{}_{\mathrm{p}}\text{∑}\text{n∈N}\text{α}{}_{\mathrm{n}}\text{(T)}{}^{\mathrm{p}}$

, 0 < p < ∞, where α_n denotes the Kolmogoroff, Gelfand of approximation numbers of the operator T. This solves a problem of Markus-Macaev.Finally we prove that Hilbert space is (isomorphically) the only Banach space X with the property that nuclear operators on X have absolutely summable eigenvalues. Using this result we show that if the nuclear operators on X are of type l₁ then X must be a Hilbert space.     

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).     

Hermite series estimates of a probability density and its derivatives

The following estimate of the pth derivative of a probability density function is examined: $\text{Σ}{}_{\mathrm{k\; =\; 0}}{}^{\mathrm{N}}\text{a}\text{?}{}_{\mathrm{k}}\text{h}{}_{\mathrm{k}}\text{(x)}$, where h_k is the kth Hermite function and $\text{a}\text{?}{}_{\mathrm{k}}\text{= (}\text{(?1)}{}^{\mathrm{p}}\text{n}\text{)}$Σ_{i = 1}ⁿh_k^(p)(X_i) is calculated from a sequence X₁,…, X_n of independent random variables having the common unknown density. If the density has r derivatives the integrated square error converges to zero in the mean and almost completely as rapidly as O(n^?α) and O(n^?α log n), respectively, where $\text{α =}\text{2(r ? p)}\text{(2r + 1)}$. Rates for the uniform convergence both in the mean square and almost complete are also given. For any finite interval they are O(n^?β) and $\text{O(n}{}^{\mathrm{<mtext>?\beta </mtext><mtext>2</mtext>}}\text{log}\text{n)}$, respectively, where $\text{β =}\text{(2(r ? p) ? 1)}\text{(2r + 1)}$.