• Ingen resultater fundet

APPLICATION OF LOCALIZATION TO THE MULTIVARIATE MOMENT PROBLEM

N/A
N/A
Info
Hent
Protected

Academic year: 2023

Del "APPLICATION OF LOCALIZATION TO THE MULTIVARIATE MOMENT PROBLEM"

Copied!
18
0
0

Indlæser.... (se fuldtekst nu)

Hele teksten

(1)

APPLICATION OF LOCALIZATION TO THE MULTIVARIATE MOMENT PROBLEM

MURRAY MARSHALL

Abstract

It is explained how the localization technique introduced by the author in [19] leads to a useful reformulation of the multivariate moment problem in terms of extension of positive semidefinite linear functionals to positive semidefinite linear functionals on the localization ofR[x] atp = n

i=1(1+xi2)orp=n−1

i=1(1+xi2). It is explained how this reformulation can be exploited to prove new results concerning existence and uniqueness of the measureμand density ofC[x]

inLs(μ)and, at the same time, to give new proofs of old results of Fuglede [11], Nussbaum [21], Petersen [22] and Schmüdgen [27], results which were proved previously using the theory of strongly commuting self-adjoint operators on Hilbert space.

1. Introduction

Forn≥1, we denote the polynomial ringR[x1, . . . , xn] byR[x] for short. For a linear mapL:R[x]→R, we consider the set of positive Borel measuresμ onRnsuch thatL(f )=

f dμfR[x]. Themultivariate moment problem is to understand this set of measures, for a given linear mapL:R[x]→R. In particular, one wants to know:

(i) When is this set non-empty?

(ii) In case it is non-empty, when is it a singleton set?

Forα = 1, . . . , αn)Nn, we denote the monomialx1α1. . . xnαn by xα for short. The positive Borel measures μ that we are interested in have finite moments, i.e.,

xαis a finite real number∀αNn. Ifμis any positive Borel measure onRn having finite moments thenLμ : R[x] →Rdefined by Lμ(f )=

f dμfR[x] is a well-defined linear map. This is clear.

For positive Borel measures μ, νonRn, each having finite moments, we writeμνto indicate thatμandνhave the same moments, i.e.,Lμ =Lν. We sayμisdeterminateifμνμ= νandindeterminateif this is not the case.

This research was funded in part by an NSERC of Canada Discovery Grant, and by the Faculty of Mathematics and Physics, University of Ljubljana.

Received 4 September 2012.

(2)

A linear map L : AR, where A is anR-algebra, is said to be PSD (positive semidefinite) ifL(f2) ≥ 0 ∀fA.

A2denotes the set of all (finite) sums of squares of elements ofA. For a linear mapL: R[x] →R, a necessary condition for the set in (i) to be non-empty is thatLis PSD.

The multivariate moment problem has also been considered in the more general context of semigroup algebras [2], [6]. There is a one-to-one corres- pondence between functionss :NnRand linear mapsL:R[x]→Rgiven byL(xα) = s(α)for allαNn, andLis PSD if and only if s is positive definite in the sense of [2], [6].

In the 1-dimensional case the literature on the moment problem is extensive;

see [1] and [28]. In particular, one has the following result:

Theorem1.1.For a linear mapL:R[x]→R:

(1) There exists a positive Borel measureμonRsuch thatL=LμiffLis PSD.

(2) The measureμin (1)is determinate iff there exists a sequenceQk of polynomials inC[x]such thatQk(i)=1andL(|Qk|2)→0ask → ∞. Proof. See [1, Theorem 2.1.1] and [1, Theorem 2.5.1].

For a positive Borel measure μon a locally compact Hausdorff spaceX and a Borel measurable functionf :XC, definefs,μ :=[

|f|sdμ]1/s, and define

Ls(μ):= {f :XC|f is Borel measurable andfs,μ<∞}. The condition that there exists a sequenceQkof polynomials inC[x] such thatQk(i)=1 and

|Qk|2→0 ask → ∞is equivalent to the assertion thatC[x] is dense inL2((1+x2)μ).1It implies, in particular, thatC[x] is dense inL2(μ). This is well-known. See Corollary 3.4 for a more general result.

For a PSD linear mapL:R[x]→R, theCarleman condition

i=1

1

2i

L(x2i) = ∞

is a well-known sufficient condition for the measureμ satisfying L = Lμ

(which exists by Theorem 1.1(1)) to be unique. In fact the following holds:

Theorem1.2.If the Carleman condition holds thenC[x]is dense inLs(μ) for all reals≥1.

Proof. See [4, Théorème 3].

1denotes the measureνsatisfyingν(E):=

Eg dμ.

(3)

The Carleman condition holds ifμdrops off sufficiently rapidly asx

±∞, e.g., this holds ifμhas compact support or, more generally, if

ea|x|dμ <

∞for some reala >0 [10, p. 80].

For a subsetKofRn, denote by Pos(K)the set of polynomialsfR[x]

such thatf ≥0 onK(i.e.,f (a)≥ 0 for allaK). The following general result is known; see [12] and [13].

Theorem1.3 (Haviland). For a linear mapL : R[x] →Rand a closed subsetKinRn, there exists a positive Borel measureμonKsuch thatL=Lμ iffL(f )≥0holds for allf ∈Pos(K).

Forn= 1,

R[x]2 = Pos(Rn). Forn≥2,

R[x]2is a proper subset of Pos(Rn)[14] and the condition thatL:R[x]→Ris PSD is no longer sufficient for the set in (i) to be non-empty, see [5], [26].

Forn≥2 the theory is not very well developed. See [27, Section 3] for open problems. A variety of partial results are known; see [23] for a survey. Some of these results are about the uniqueness of the measure, e.g., the results of Fuglede [11], Petersen [22] and Putinar and Vasilescu [25]. There are results about the density of C[x] in Ls(μ), 1s < ∞, both in the casen = 1 and in the casen≥ 2 in [3], [4], [11] and [22]. There are also results about the existence of the measure, by Devinatz [8], Eskin [9], Nussbaum [21], Putinar and Schmüdgen [23], and Schmüdgen [27]. All these results, with the exception of [25] and the 1-dimensional results, are proved in the framework of unbounded operators on Hilbert space.

In [25] a different approach is taken which is based on the localization method developed in [24], but the localization method developed in [24] is still essentially a functional-analytic one, since, in the end, it is based on the theory of strongly commuting self-adjoint operators.

In [19] (also see [17] and [18]) the localization method is developed in a purely algebraic setting. First and foremost a Positivstellensatz is developed (see Theorem 2.1 below) which is based on Jacobi’s representation theorem [15]. There is also a refined version of this Positivstellensatz (see Theorem 4.1 below) which is based on a result for cylinders with compact cross-section, established in [17] and [19], which is itself a corollary of Jacobi’s representa- tion theorem. There is very little functional analysis in the approach taken in [19], the one exception being a certain extension of Haviland’s theorem [19, Theorem 3.1] which seems to be useful.

In preparing the present paper, the immediate goal was to exploit the loc- alization method in [19] to give new algebraic proofs of the various partial results referred to above. The proofs were to be simpler than the existing ones.

It was also hoped that this new way of looking at things would allow one to prove new results which were stronger than those that were previously known.

(4)

We leave it to the reader to decide how well these various goals have been accomplished.

We refer the reader to [20] for a more comprehensive treatment of pos- itive polynomials, sums of squares and the moment problem. See [20, The- orem 5.4.4] for a simple proof of Jacobi’s representation theorem. The paper [16] of Krivine, only recently rediscovered, is one of the earliest to bridge the gap between the moment problem and semialgebraic geometry. See [16, Théorème 12] for an early version of Jacobi’s result.

In Section 2, we recall two results from [19] (see Theorems 2.1 and 2.3) and use Theorem 2.3 to give a new formulation of the multivariate moment problem in terms of localizations (see Corollary 2.5). We use Corollary 2.5 to prove a uniqueness result (Corollary 2.7) which extends results of Fuglede [11, Theorem, Section 7] and Petersen [22, Theorem 3]. In Section 3, we prove two results concerning density ofC[x] andC[x]pinLs(μ)(see Theorem 3.1 and Corollary 3.2), results which may be well-known but don’t seem to be explicitly mentioned anywhere. We apply these results to obtain several co- rollaries, including a new proof of [4, Théorème 1] (see Corollary 3.5) and a strengthened version of [22, Proposition] (see Corollary 3.6). In Section 4, we apply the cylinder results from [19, Section 5] to obtain a new strengthened ver- sion of Haviland’s Theorem (see Theorem 4.5). We use Theorem 4.5 to derive some non-trivial corollaries including a new proof of Nussbaum’s multivariate Carleman result [21, Theorem 10] (see Theorem 4.10) and a new proof of a generalization of the Nussbaum result due to Schmüdgen [27, Proposition 1]

(see Theorem 4.11). An interesting question that remains open is whether it is possible to prove the related results of Devinatz [8] and Eskin [9] by the method introduced in Section 4. The author was not able to do this, but, of course, this does not mean that it cannot be done.

The author wishes to thank Jaka Cimpriˇc for his useful comments and suggestions concerning the paper, made during the author’s visit in Ljubljana, in November 2011.

2. Reformulation of the problem

ForAa commutative ring with 1 andpA, we denote byApthe localization ofAatp, i.e.,

Ap := a

pk

aA, k ≥0 .

The ring operations onApare defined in the standard way. IfAis anR-algebra then so isAp. We are interested here in the case A = R[x]. The results in [19] which we use are valid for various choices ofpand various choices of a quadratic module. We restrict our attention here to the quadratic module

(5)

R[x]2ofR[x] and its extension

R[x]p2toR[x]p, and we always take p:=

n i=1

(1+x2i).

We recall the Positivstellensatz from [19].

Theorem2.1.SupposefR[x]p. The following are equivalent:

(1) f ≥0onRn.

(2) ∃k ≥0such thatreal >0f +pk ∈ R[x]p2. Proof. See [19, Corollary 4.3].

Remark2.2. (1) In the proof of Theorem 2.1 given in [19] one considers the subalgebraBofR[x]pconsisting of algebraically bounded elements, i.e.,

B:=

fR[x]pkNsuch thatk±f ∈ R[x]2p

, and the preorderingM :=B

R[x]p2ofB.Mis an archimedean preordering ofB. Let

XM :=

α:BR|αis a (unitary) ring homomorphism, α(M)⊆R0

,

definefˆ, forfB, byf (α)ˆ =α(f ), and giveXMthe weakest topology such that eachfˆ,fB, is continuous. SinceM is archimedean,XM is compact.

Rnis naturally embedded inXM viaaαa whereαa(f ) := f (a).XM\Rn consists of thoseαXM such thatα(p1)=0. In particular,XM\Rnis closed inXM (soRnis open inXM). All this is explained in detail in [19].

(2) FixfR[x]p. Writef in the formf = pgm,gR[x],m ≥ 0. Say g =

gαxα,gαR,α = 1, . . . , αn)Nn. We claimthat the following are equivalent:

(i) fB.

(ii) f is geometrically bounded, i.e.,∃kNsuch that|f (a)| ≤kaRn. (iii) ∀αNn,gα =0⇒αj ≤2m,j =1, . . . , n.

(iv) fR 1

1+xj2,1+xjx2 j

j =1, . . . , n Proof. Sincek ±f

R[x]p2 ⇒ |f (x)| ≤ kxRn, we see that (i)⇒(ii). Suppose now that (iii) fails, i.e., ∃α such thatgα = 0 butαj >

2m for some j. Reindexing, we can assume j = 1. Then g = k i=0aix1i, with k > 2m, aiR[x2, . . . , xn], ak = 0. Fixing x2, . . . , xnR so that

(6)

ak(x2, . . . , xn)=0 and lettingx1→ ∞, we obtain|f (x)| → ∞, so (ii) fails.

This proves (ii)⇒(iii). Suppose now that (iii) holds. Thus

f =

α

hα n j=1

xjαj (1+xj2)m withαj ≤2mfor eachj. Ifαjmwrite

xjαj (1+xj2)m =

xj 1+xj2

αj 1 1+xj2

mαj

. Ifm < αj ≤2mwrite

xjαj (1+xj2)m =

xj 1+xj2

tj

1− 1

1+xj2 uj

,

wheretj+2uj =αj,tj +uj =m. This proves that (iii)⇒(iv). Finally, since 1± 1+1x2

j

and 1± 1+xjx2

j

are sum of squares inR[x]p, 1+1x2 j

and 1+xjx2 j

belong to B, so (iv)⇒(i).

(3) One can also check thatM = B2. Proof. LetfM, say f =

k=1[pgmk]2,gkR[x],k = 1, . . . , . The degree of

k=1g2k in the variablexj is equal to the maximum of the degrees of the gk2 in the variable xj, k = 1, . . . , . Since fB, the implication (i)⇒(iii) in (2) shows the degree of

k=1gk2in xj is≤ 4m. It follows that degxj(gk)≤2m,j =1, . . . , n,k =1, . . . , so, by the implication (iii)⇒(i) in (2), pgkmB.

(4) It is a consequence of (2) and (3) that XM is identified with the real variety consisting of all points(y1, z1, . . . , yn, zn)R2nsatisfying

yj− 1

2 2

+zj2= 1

4, j =1, . . . , n,

(ann-torus),B is identified with the coordinate ring of this variety, and the embeddingRnXMis identified with then-fold stereographic projection

(x1, . . . , xn)→ 1

1+x12, x1

1+x12, . . . , 1

1+xn2, xn 1+xn2

. (5) Analogs of (2), (3) and (4) for the localization ofR[x] atp=1+n

i=1xi2 are established in [19, Example 8.1]. The real variety in this case is the Veronese variety, see [19, Example 8.1] and [24, Section 3].

(7)

(6) The non-trivial implication in the proof of Theorem 2.1 is (1)⇒(2).k is chosen so that pfkB. From (4) one sees thatRn is dense inXM, so pfk is non-negative on all ofXM (not just onRn). Jacobi’s representation theorem [15] implies that for any real > 0, pfk +M. Multiplying bypk yields (2).

Theorem2.3.IfL:R[x]pRis aPSDlinear map there exists a unique positive Borel measureμonRnsuch thatL(f )=

f dμfor allfR[x]p. Proof. See [19, Corollary 4.4]. LetfR[x]p, f ≥ 0 onRn. By The- orem 2.1 ∃ k ≥ 0 such that ∀ real > 0 f + pk

R[x]p2. Thus L(f +pk) ≥ 0. Letting → 0, we see thatL(f ) ≥ 0. By the extension of Haviland’s Theorem proved in [19, Theorem 3.1], there exists a positive Borel measureμonRnsuch thatL(f )=

f dμfor allfR[x]p.2To prove uniqueness ofμ, letφ:RnRbe any continuous function with compact sup- port. We use the notation of Remark 2.2(1). ExtendφtoXMby settingφ=0 on XM\Rn. By the Stone-Weierstrass approximation theorem ∃ a sequence fkB such that| ˆfkφ| ≤ 1k pointwise onXM. This implies, in particular, that|

(fkφ) dμ| ≤ 1kμ(Rn), so

φ dμ= limk→∞L(fk). Uniqueness of μfollows now, by the Riesz representation theorem.

Remark 2.4. The measure μ in Theorem 2.3 has finite moments. Con- versely, ifμis any positive Borel measure onRnhaving finite moments, then L:R[x]pRdefined byL(f )=

f dμfR[x]pis a well-defined map which is linear and PSD. This is clear.

Corollary2.5.For any linear mapL:R[x]→R, the set of positive Borel measuresμonRnsuch thatL=Lμis in natural one-to-one correspondence with the set of PSDlinear mapsL:R[x]pRextendingL.

Proof. If μ is a positive Borel measure on Rn such that L = Lμ, the corresponding extension ofLto a PSD linear mapL:R[x]pRis defined byL(f ) =

f dμ. The correspondenceμLhas the desired properties by Theorem 2.3.

Remark2.6. Corollary 2.5 allows one to reformulate the multivariate mo- ment problem as follows: Themultivariate moment problemis to understand the set of extensions ofLto a PSD linear mapL : R[x]pR, for a given linear mapL:R[x]→R. In particular, one wants to know:

(i) When is this set non-empty?

(ii) In case it is non-empty, when is it a singleton set?

2Alternatively, existence ofμcan be deduced by applying Haviland’s theorem toL:R[x, y] Rdefined byL(f (x, y))=L

f x,p(x)1

andKRn+1defined byK={a,p(a)1 |aRn}.

(8)

Our next result explains how one half of Theorem 1.1(2) is valid for arbitrary n.

Corollary 2.7. Suppose L : R[x] → R is linear and, for each j ∈ {1, . . . , n}, there exists a sequencepj kC[x]such thatL(|1−(xji)pj k|2)→ 0ask → ∞. Then there is at most one positive Borel measureμonRnsuch thatL=Lμ.

Proof. Supposeμandνare positive Borel measures onRnsuch thatL= Lμ=Lν. In view of Theorem 2.3 it suffices to show that

f dμ = f dνfC[x]p, wherep:=n

j=1(1+xj2). Observe that 1+xj2=(xji)(xj+i) so x1

ji, x1

j+i are elements ofC[x]p. The proof is by induction on the number of factors of the formxj ±i appearing in the denominator of f. Suppose xjiappears in the denominator off. By assumption∃pj kC[x] so that L(|Qj k|2)→0 ask → ∞whereQj k :=1−(xji)pj k. By induction,

(xji)pj kf dμ=

(xji)pj kf dν.

Applying the Cauchy-Schwartz inequality,

Qj kf dμ

L(|Qj k|2)1/2

|f|2 1/2

→0 as k → ∞,

so

(xji)pj kf dμ

f dμ as k→ ∞. Similarly,

Qj kf dν

L(|Qj k|2)1/2

|f|2 1/2

→0 as k→ ∞,

so

(xji)pj kf dν

f dν as k → ∞. It follows that

f dμ=

f dν. The case wherexj+iappears in the denom- inator off is dealt with similarly, replacingQj kbyQj k.

Remark2.8. (1) In [22, Theorem 3] Petersen proves that a positive Borel measureμonRn with finite moments is determinate if each of the projection measuresπj(μ),j = 1, . . . , nis determinate. SinceLπj(μ) = Lμ|R[xj], The- orem 1.1(2) implies thatπj(μ)is determinate iff∃a sequencepj kinC[xj] such that

|1−(xji)pj k|2→0 ask → ∞. In this way [22, Theorem 3] can be viewed as a special case of Corollary 2.7.

(9)

(2) In [11, Section 7] Fuglede proves that a positive Borel measureμon Rnwith finite moments is determinate ifC[x] is dense inL2((1+xj2)μ)for eachj = 1, . . . , n. SinceC[x] dense inL2((1+xj2)μ)xj1i belongs to the closure ofC[x] inL2((1+xj2)μ) ⇔ ∃a sequencepj kC[x] such that |1−(xji)pj k)|2→0 ask→ ∞, Fuglede’s result is a special case of Corollary 2.7.

3. Density results

We fix a positive Borel measureμonRnhaving finite moments.

Theorem3.1. For any1≤s <,C[x]pis dense inLs(μ), equivalently, R[x]pis dense in the real part ofLs(μ).

Proof. It suffices to show that the step functionsm

j=1ajχAj,ajC,Aj ⊆ Rna Borel set, belong to the closure ofC[x]p. Using the triangle inequality we are reduced further to the casem = 1,a1 = 1. Let ARn be a Borel set.

ChooseKcompact,U open such thatKAU,μ(U\K) < . We make use of the terminology introduced in Remark 2.2(1). By Urysohn’s lemma there exists a continuous functionφ :XMRsuch that 0≤φ≤1 onXM,φ=1 onK,φ=0 onXM\U. Extendμto a positive Borel measureμonXMdefined byμ(E):=μ(ERn). ThenχAφs,μ1/s. Use the Stone-Weierstrass approximation theorem to getfB such thatφ− ˆf < , where·

denotes the sup-norm. Thenφ − ˆfs,μμ(Rn)1/s. Putting these things together yieldsχAfs,μ = χA− ˆfs,μχAφs,μ+ φ− ˆfs,μ1/s+μ(Rn)1/s.

Corollary3.2.For1≤s <, the following are equivalent:

(1) C[x]is dense inLs(μ).

(2) C[x]is dense inC[x]pin the topology induced by the norm·s,μ. Suppose now thatn=1, soμis a positive Borel measure onRhaving finite moments,C[x]=C[x] andp=1+x2. Observe that 1+x2=(xi)(x+i) so x1i, x+1i are elements ofC[x]1+x2.

Corollary3.3.For1≤s <, the following are equivalent:

(1) C[x]is dense inLs(μ).

(2) ∃a sequenceqkC[x]such thatqkx1i

s,μ→0ask→ ∞. (3) ∃ a sequenceQkC[x]such that Qk(i) = 1andQk

xi

s,μ → 0 as k → ∞.

Proof. Clearly (1)⇒(2) and (2)⇔(3), so it remains to show (2)⇒(1).

In view of Corollary 3.2 it suffices to showC[x] is dense inC[x]1+x2. Denote

(10)

by C[x] the closure of C[x] inC[x]1+x2. By (2), x1iC[x]. Conjugating,

1

x+iC[x]. Using the identities 1

1+x2 = 1 2i

1

xi − 1 x+i

and x

1+x2 = 1 2

1

xi + 1 x+i

, and the division algorithm, we see that 1f (x)+x2C[x], for eachf (x)C[x].

Fixf (x)C[x] and choosegk(x)C[x] so thatgk(x)1f (x)+x2s,μ →0 as k → ∞. Using the fact that 1+x2 ≥ 1 on R, we see that for each ≥ 1, gk(x)

(1+x2)(1+f (x)x2)+1

s,μ → 0 ask → ∞. If follows by induction on that

f (x)

(1+x2)C[x] for all≥1.

Corollary3.4. For1≤s <, consider the conditions:

(1) ∃ a sequence Qk in C[x]such that Qk(i) = 1 andQks,μ → 0 as k → ∞.

(2) C[x]is dense inLs((1+x2)s/2μ).

(3) C[x]is dense inLs(μ).

(4) ∃ a sequenceQk in C[x] such that Qk(i) = 1 and, ∀ 1 ≤ s < s, Qks →0ask → ∞.

Then(1)(2)(3)(4).

Proof. (1)⇔(2): Apply Corollary 3.3 to the measure(1+x2)s/2μ. (2)⇒ (3): Since 1+x2 ≥1 this is clear. (3)⇒(4): By Corollary 3.3∃QkC[x]

such thatQk(i) =1 andQk

xi

s,μ →0 ask → ∞. For 1≤ s < s an easy application of the Hölder inequality yields:

Qks=

|Qk|s 1/s

= Qk

xi s

|xi|s 1/s

Qk

xi

s,μ

· xiss

s−s →0 as k → ∞.

Corollary3.5.

sup{s |C[x]is dense inLs(μ)}

=sup{s | ∃QkC[x]such thatQk(i)=1and lim

k→∞Qks,μ =0}. Proof. Immediate from Corollary 3.4. See [4, Théorème 1] for another proof.

(11)

We remark that a certain weak variant of Corollary 3.3 holds forn≥2. The following result extends [22, Proposition].

Corollary3.6.Suppose1 < s <. Suppose for eachj = 1, . . . , n∃ qj kC[x]such thatqj kxj1i

s,μ →0ask → ∞. ThenC[x]is dense in Ls(μ)for each1≤s < s.

Proof. Arguing as in the proof of Corollary 3.3, we see that C[xj]1+xj2 is contained in the closure ofC[x] with respect to the norm·s,μ, forj = 1, . . . , n. Every element ofC[x]p is expressible as a sum of products of the formf1· · ·fn,fjC[xj]1+x2

j,j = 1, . . . , n. Choosinggj kC[x] so that fjgj ks,μ→0 ask→ ∞, writing

f1· · ·fng1k· · ·gnk =(f1g1k)f2· · ·fn+(f2g2k)g1kf3· · ·fn + · · · +(fngnk)g1k· · ·gn1k,

and applying Hölder’s inequality to each term, we see that f1· · ·fng1k· · ·gnks →0 as k→ ∞, for each 1≤s< s.

We also recall the following result of Fuglede; see [11, Sections 7, 8 and 10]:

Corollary3.7.Consider the following conditions:

(1) C[x]is dense inLs(μ)for some2< s <. (2) C[x]is dense inL2((1+x12+. . .+xn2)μ).

(3) C[x]is dense inL2((1+xj2)μ)forj =1, . . . , n.

(4) μis determinate.

Then(1)(2)(3)(4).

Proof. (1)⇒(2). Let fC[x]p and choose gkC[x] so that fgks,μ→0 ask → ∞. By the Hölder inequality,

fgk2,(1+ xt2=

|fgk|2

1+

xt2

1/2

fgks,μ·

1+

xt2 2s

s−2

→0 ask → ∞.

(2)⇒(3). Follows from the fact that 1+xj2≤1+x12+ · · · +xn2.

(12)

(3)⇒(4). As explained already in Remark 2.8(2), this follows from Corol- lary 2.7.

Remark3.8. Fuglede defines a positive Borel measureμonRnto beul- tradeterminateif condition (2) of Corollary 3.7 holds andstrongly determinate if condition (3) of Corollary 3.7 holds. Examples of Schmüdgen in [27, Sec- tion 1] show that conditions (2), (3) and (4) of Corollary 3.7 are not equivalent ifn≥2. Examples of Berg and Thill in [7] show thatμdeterminate does not implyC[x] is dense inL2(μ)ifn≥2.

4. Extendibility results

In this section we apply the result on cylinders from [19, Section 5]. Let p:=

n1

i=1

(1+xi2).

Note: Ifn = 1 then p = 1. Observe thatR[x]p = R[x]p[xn] (the polyno- mial ring in the single variablexn with coefficients inR[x]p), wherex := (x1, . . . , xn1).

Theorem4.1.SupposefR[x]p. The following are equivalent:

(1) f ≥0onRn.

(2) ∃k, ≥0such thatreal >0f +pk(1+xn2)∈ R[x]2p. Proof. See [19, Corollary 5.3].

Remark4.2. (1) The difference between Theorem 4.1 and Theorem 2.1 is that in Theorem 4.1 we do not need to invert as much:R[x]p is a proper subalgebra ofR[x]p.

(2) In the proof of Theorem 4.1 given in [19] one considers the subalgebra BofR[x]p consisting of algebraically bounded elements, i.e.,

B :=

fR[x]pkNsuch thatk±f ∈ R[x]2p

, and the preorderingN :=B[xn]∩

R[x]2p ofB[xn]. Let

XN := {α:B[xn]→R|αis a ring homomorphism, α(N )⊆R0}, definefˆ, forfB[xn], byf (α)ˆ =α(f ), and giveXN the weakest topology such that each fˆ, fB[xn], is continuous. Since M := NB is an archimedean preordering ofB,XN = XM ×Ris a cylinder with compact

(13)

cross-section.Rnis naturally embedded inXN viaaαawhereαa(f ) := f (a). All this is explained in detail in [19].

(3) Concrete descriptions of B and M are provided by (2) and (3) of Remark 2.2. Using these descriptions, we see thatXN is identified with the real variety consisting of all points(y1, z1, . . . , yn1, zn1, xn)R2n1satisfying

yj− 1

2 2

+zj2= 1

4, j =1, . . . , n−1,

B[xn] is identified with the coordinate ring of this variety and the embedding RnXN is identified with the map

(x1, . . . , xn)→ 1

1+x12, x1

1+x12, . . . , 1

1+xn21, xn1

1+xn21, xn

. (4) The non-trivial implication in the proof of Theorem 4.1 is (1)⇒(2).k is chosen so that pfkB[xn]. From (3) one sees thatRn is dense inXN, so

f

pk is non-negative on all ofXN (not just onRn). By [19, Theorem 5.1] there exists an integer ≥0 such that for any real > 0, f

pk +(1+xn2)N. Multiplying bypk yields (2).

Theorem4.3.IfL:R[x]pRis aPSDlinear map there exists a positive Borel measureμonRnsuch thatL(f )=

f dμfor allfR[x]p.

Proof. Argue as in the proof of Theorem 2.3 but use Theorem 4.1 now instead of Theorem 2.1.

Remark 4.4. (1) There is no claim in Theorem 4.3 that the measure μ (equivalently, the extension of L to a PSD linear map from R[x]p to R) is unique. In fact, it is not unique in general. (2) A sufficient condition for the measureμto be unique is that there exists a sequenceqk in R[x]p such that L(|1−(xni)qk|2)→0 ask → ∞. The proof of this fact is similar to the proof of Corollary 2.7. (3) Ifn=1 this sufficient condition is also necessary, by Theorem 1.1(2).

Theorem4.5.For a linear mapL:R[x]→R, the following are equivalent:

(1) There exists a positive Borel measureμonRnsuch thatL=Lμ. (2) Lextends to aPSDlinear mapL:R[x]pR.

(3) L≥0on

R[x]p2R[x].

(4) For allm≥0,pmf

R[x]2L(f )≥0.

Proof. (1)⇒(2). ExtendL to R[x]p in the obvious way, i.e., L(f ) = f dμfor allfR[x]p.

(14)

(2)⇒(3).L≥0 on

R[x]2p soL≥0 on

R[x]p2R[x].

(3)⇒(4). Suppose thatfR[x], pmf

R[x]2. Thenf = ppmmf = (p1)2m(pm)(pmf )

R[x]p2, soL(f )≥0.

(4)⇒(1). SupposefR[x],f ≥ 0 onRn. By Theorem 4.1, there exist integersk, ≥ 0 such that, for all >0,f +pk(1+xn2)

R[x]p2, so p2m(f +pk(1+xn2))

R[x]2, for some m ≥ 0. By (4) this implies L(f +pk(1+xn2)) ≥ 0. Since this is valid for any > 0, this implies L(f )≥0. Thus (1) follows, by Haviland’s Theorem 1.3.

Remark 4.6. (1) Theorem 4.5 strengthens Haviland’s Theorem. Instead of having to checkf ≥ 0 on RnL(f ) ≥ 0, one only has to check that pmf

R[x]2L(f ) ≥ 0. (2) Observe that ifn = 1 thenp = 1, so Theorem 4.5 coincides with Theorem 1.1(1) in this case. (3) There is also a weak version of Theorem 4.5, obtained by replacingpbyp. The proof is the same except that Theorem 4.1 is replaced now by Theorem 2.1.

We turn our attention to applications of the implication (4)⇒(1) of The- orem 4.5.

Corollary4.7.IfL : R[x] → Ris a linear map which isPSDand, for eachfR[x]and eachj ∈ {1, . . . , n−1},

(4.1) L1(q):=L(q(1+xj2)f )isPSD⇒L2(q):=L(qf )isPSD, thenL=Lμfor some positive Borel measureμonRn.

Proof. We show condition (4) of Theorem 4.5 holds. Suppose pmf ∈ R[x]2. Then L(q) := L(qpmf ) is PSD. Applying (4.1) repeatedly, we deduce thatL(q):=L(qf )is PSD. In particular,L(f )=L(1)≥0.

Corollary4.8.IfL : R[x] → Ris a linear map which isPSDand, for eachgR[x]and eachj ∈ {1, . . . , n−1},

(4.2)pk =pgj kC[x]such thatL(g(1+xj2)pkpkg)→0 ask → ∞, thenL=Lμfor some positive Borel measureμonRn.

Proof. Apply (4.2) withg=hhf to deduce that the hypothesis of Corol- lary 4.7 holds.

Theorem 4.9.Suppose L : R[x] → Ris linear and PSD and, for each j =1, . . . , n−1,

(4.3)pk =pj kC[x]such thatL(|1−(xji)pk|4)→0

(15)

ask→ ∞. Then there exists a positive Borel measureμonRnsuch thatL= Lμ. If condition(4.3)holds also forj =nthen the measure is determinate.

Proof. FixgR[x],j ∈ {1, . . . , n−1}. SetQk =1−(xji)pk, so g(1+xj2)pkpkg =g(1Qk)(1Qk)g =Qkg+Qkg− |Qk|2g.

ExtendingLtoC[x] in the obvious way, and applying the Cauchy-Schwartz inequality to the inner product onC[x] defined by f, g := L(f g), we see that

|L(g(1+xj2)pkpkg)|

≤ |L(Qkg)| + |L(Qkg)| + |L(|Qk|2g)|

≤2[L(|Qk|2)]1/2[L(g2)]1/2+ |L(|Qk|2g)|

≤2[L(|Qk|4)]1/4[L(1)]1/4[L(g2)]1/2+[L(|Qk|4)]1/2[L(g2)]1/2→0 ask → ∞.

The first assertion follows from this, by Corollary 4.8. Since L(|1−(xji)pk|2)≤[L(|1−(xji)pk|4)]1/2[L(1)]1/2→0 ask → ∞, the second assertion is immediate, by Corollary 2.7.

Combining Theorem 4.9 with Theorem 1.2 yields the following result of Nussbaum [21, Theorem 10]:

Theorem4.10.SupposeL:R[x]→Ris linear andPSDand the Carleman condition

(4.4)

i=1

1

2i

L(xj2i)

= ∞

holds forj = 1, . . . , n−1. Then there exists a positive Borel measureμon Rnsuch thatL=Lμ. If condition(4.4)holds also forj =nthen the measure is determinate.

Proof. Letμj be a positive Borel measure onRsuch thatLμj = L|R[xj]. According to Theorem 1.2, condition (4.4) implies thatC[xj] is dense inLsj) for 1 ≤ s <∞. In particular,C[xj] is dense inL4+j)for > 0, which implies, by Corollary 3.4, that∃ pk = pj kC[xj] such that L(|1−(xji)pk|4)→0 ask→ ∞. Now apply Theorem 4.9.

(16)

We conclude by mentioning another result, similar to Theorem 4.9, which, like Theorem 4.9, is of sufficient strength to imply Theorem 4.10. See Schmüd- gen [27, Proposition 1] for a different proof of this result.3

Theorem4.11.Suppose L: R[x] →Ris linear and PSD. Fix a positive Borel measureμj onRsuch that L|R[xj] = Lμj and suppose, for eachj = 1, . . . , n−1,C[xj]is dense inL4j), i.e.,

(4.5)Qk =Qk,jC[xj]such thatQk(i)=1and Qk

xji

4,uj

→0

ask→ ∞. Then there exists a positive Borel measureμonRnsuch thatL= Lμ. If condition(4.5)holds also forj =nthen the measure is determinate.

Proof. By the proof of Theorem 4.9 it suffices to show, for eachgR[x]

and for eachj, that condition (4.5) impliesL(QkQkg)→0 ask → ∞. Let x:=xj,μ:=μj, and define measuresμandμonRby

μ= μ

(1+x2)2, μ=(1+x2)2μ.

Claim 1. For eachqC[x] and each∈ {0,1},

|L(xi)2qg)| ≤C·[L(qq)]1/2 where

C=max

[L(g2)]1/2,[L((x−i)2(x+i)2g2)]1/2 . This is an immediate consequence of the Cauchy-Schwartz inequality.

Claim 2. The measureμis determinate. This follows from

QkQk=

QkQk(1+x2)2=

QkQk

1+x2(1+x2)3

QkQk 1+x2

2

1/2

(1+x2)6 1/2

→0 ask → ∞.

Claim 3.|L(pg)| ≤ C·

|p|21/2

for eachpC[x]. From Claim 2 and Corollary 3.4 it follows that C[x] is dense in L2) so ∃ a sequence

3According to Fuglede [11, p. 62], Theorem 4.11 is an unpublished result of J. P. R. Christensen, 1981.

Referencer

RELATEREDE DOKUMENTER

We rst present the type system (Section 3), and we then prove that the type inference problem is log space equivalent to a constraint problem (Section 4) and a graph problem

We prove in Section 5.2 that random variables with a permutation distribution satisfy the negative association condition, a result already mentioned in [7].. In particular, it

(The full details of the def- initions of the semantics in the spectrum may be found in Appendix A.) We present our algorithm in Section 3, where we also state the main theorem in

Theorem C asserts that in the most interesting case, the stable homotopy equivalence in Theorem A is in fact a homotopy equival- ence.. In Section 3, we recall previous results

In Section 5, we recall the definition of charted 2-vector bundles and define oriented charted 2-vector bundles.. We then describe the obstruction for a 2- vector bundle to be

We wish to prove that this system is not a frame showing that the Zibulski-Zeevi matrix does not have full rank and thus the lower frame bound in Theorem 4.5 is violated.. In

I lighed med præciseringen og konsolideringen af de øvrige MedCom meddelelser gennemføres et tilsvarende arbejde med dokumentation af anvendelsen af MEDREQ til rekvirering af klinisk

I lighed med præciseringen og konsolideringen af de øvrige MedCom meddelelser gennemføres et tilsvarende arbejde med dokumentation af anvendelsen af MEDREQ til rekvirering af klinisk